A Taxonomy of Functional Language Implementations Part II: Call-by-Name, Call-by-Need and Graph Reduction (1996)

by Rémi Douence , Pascal Fradet
Citations:9 - 3 self

Documents Related by Co-Citation

43 Tim: a simple, lazy abstract machine to execute supercombinators – J Fairbairn, S Wray - 1987
620 Compiling with Continuations – Andrew W Appel - 1992
331 The mechanical evaluation of expressions – P J Landin - 1964
92 The Zinc experiment: an economical implementation of the ML language. INRIA – X Leroy - 1990
123 The categorical abstract machine – G Cousineau, P-L Curien, M Mauny - 1987
184 Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine - Version 2.5 – Simon L Peyton Jones - 1992
64 Deriving a Lazy Abstract Machine – Peter Sestoft - 1997
53 Implementing functional languages, a tutorial – S L Peyton Jones, D Lester - 1992
59 From operational semantics to abstract machines – John Hannan, Dale Miller - 1992
9 A categorical understanding of environment machines – A Asperti
180 A Natural Semantics for Lazy Evaluation – John Launchbury - 1993
65 Compiling a Functional Language – Luca Cardelli - 1984
61 An abstract framework for environment machines – P-L Curien - 1991
7 Categorical Multi-Combinators – R D Lins - 1987
389 Explicit substitutions – M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy - 1996
62 Compiling Lazy Functional Languages – T Johnsson - 1987
35 Compilation of functional languages by program transformation – P Fradet, D Le Métayer - 1991
189 A new implementation technique for applicative languages – D A Turner - 1979
16 Machines à environnement pour la réduction symbolique et l’évaluation partielle. Thèse de l’université de Paris VII – P Crégut - 1991