Efficient Self-Interpretation in Lambda Calculus (1994)

Cached

Download Links

by Torben Æ. Mogensen , Torben Ae. Mogensen
Venue:Journal of Functional Programming
Citations:23 - 1 self

Documents Related by Co-Citation

303 Higher-order abstract syntax – F Pfenning, C Elliott - 1988
207 Type-directed partial evaluation – Olivier Danvy - 1996
93 A Partial Evaluator for the Untyped Lambda Calculus – Carsten K. Gomard, Neil D. Jones - 1991
19 The Theory of Fexprs is Trivial – Mitchell Wand - 1998
117 Automatic Autoprojection of Recursive Equations with Global Variables and Abstract Data Types – Anders Bondorf, Olivier Danvy - 1990
302 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
287 The Lambda Calculus. Its Syntax and Semantics, volume 103 – Hendrik P Barendregt - 1984
51 Lambda definability and recursiveness – S C Kleene - 1936
49 Partial type inference for untyped functional programs (extended abstract – C Gomard - 1990
37 Specifying the correctness of binding-time analysis – Michell Wand - 1993
1119 The Lambda Calculus: Its Syntax and Semantics – H P BARENDREGT - 1984
184 Introduction to Lambda Calculus – Henk Barendregt, Erik Barendsen - 1994
32 The essence of eta-expansion in partial evaluation – Olivier Danvy, Karoline Malmkjaer, Jens Palsberg - 1995
642 Partial Evaluation and Automatic Program Generation – N D Jones, C K Gomard, P Sestoft - 1993
149 Hygienic macro expansion – Eugene Kohlbecker, Daniel Friedman, Matthias Felleisen, Bruce Duba
130 Representing Monads – Andrzej Filinski - 1994
537 The Implementation of Functional Programming Languages – S L Peyton Jones - 1987
940 A theory of type polymorphism in programming – Robin Milner - 1978
191 Reflection and semantics in LISP – B Smith - 1984