|
269
|
Higher-order abstract syntax
– Frank Pfenning, Conal Elliott
- 1988
|
|
195
|
Type-directed partial evaluation
– Olivier Danvy
- 1996
|
|
18
|
The Theory of Fexprs is Trivial
– Mitchell Wand
- 1998
|
|
90
|
A Partial Evaluator for the Untyped Lambda Calculus
– Carsten K. Gomard, Neil D. Jones
- 1991
|
|
114
|
Automatic Autoprojection of Recursive Equations with Global Variables and Abstract Data Types
– Anders Bondorf, Olivier Danvy
- 1990
|
|
263
|
Definitional interpreters for higher-order programming languages
– John C. Reynolds
- 1972
|
|
46
|
Partial type inference for untyped functional programs
– Carsten K Gomard
- 1990
|
|
36
|
Specifying the Correctness of Binding-time Analysis
– M Wand
- 1993
|
|
997
|
The Lambda Calculus: its Syntax and Semantics
– H P Barendregt
- 1984
|
|
163
|
Introduction to Lambda Calculus
– Henk Barendregt, Erik Barendsen
- 1994
|
|
593
|
Partial Evaluation and Automatic Program Generation
– N D Jones, C K Gomard, P Sestoft
- 1993
|
|
32
|
The essence of eta-expansion in partial evaluation
– Olivier Danvy, Karoline Malmkjaer, Jens Palsberg
- 1995
|
|
116
|
Representing Monads
– Andrzej Filinski
- 1994
|
|
133
|
Hygienic Macro Expansion
– Eugene Kohlbecker, Daniel P Friedman, Matthias Felleisen, Bruce Duba
- 1986
|
|
515
|
D.: Implementation of Functional Programming Languages
– Peyton Jones, S Lester
- 1987
|
|
874
|
A theory of type polymorphism in programming
– Robin Milner
- 1978
|
|
183
|
Reflection and semantics in Lisp
– Brian Cantwell Smith
- 1984
|
|
13
|
Self-applicable Partial Evaluation for Pure Lambda Calculus
– Torben Æ Mogensen, Torben Ae. Mogensen
- 1992
|
|
17
|
Correctness of Binding-time Analysis
– Jens Palsberg
- 1993
|
