CiteSeer.IST Home
Related articles for:
Gordon D. Plotkin. Call-by-name,
call-by-value and the lambda calculus
. Theoretical Computer Science, 1:125-- 159, 1975.
Context
Related documents from co-citation:
31
:
The Lambda Calculus: Its Syntax and Semantics (context)
- Barendregt - 1984
22
:
A call-by-need lambda calculus
- Ariola, Felleisen et al. - 1995
19
:
Information and Computation (context)
- Moggi, computation - 1991
19
:
The Definition of Standard ML (context)
- Milner, Tofte et al. - 1990
15
:
The mechanical evaluation of expressions (context)
- Landin - 1964
13
:
The revised report on the syntactic theories of sequential control and state
- Felleisen, Hieb - 1992
12
:
LCF considered as a programming language (context)
- Plotkin - 1977
12
:
Multi-stage programming with explicit annotations
- Taha, Sheard - 1997
12
:
Semantics of Programming Languages -- Structures and Techniques (context)
- Gunter - 1992
11
:
A partial evaluator for the untyped lambdacalculus
- Gomard, Jones - 1991
11
:
The call-by-need lambda calculus
- Maraist, Odersky et al. - 1994
11
:
Compiling with Continuations (context)
- Appel - 1992
11
:
The lazy lambda calculus
- Abramsky - 1990
11
:
Partial Evaluation and Automatic Program Generation (context)
- Jones, Gomard et al. - 1993
10
:
Multi-Stage Programming: Its Theory and Applications
- Taha - 1999
10
:
A temporal-logic approach to binding-time analysis
- Davies - 1995
10
:
A sound reduction semantics for untyped CBN multi-stage computation
- Taha - 2000
10
:
A theory of type polymorphism in programming (context)
- Milner - 1978
10
:
A modal analysis of staged computation
- Davies, Pfenning - 1996
9
:
Metaml: Multi-stage programming with explicit annotations
- Taha, Sheard
CiteSeer.IST - Copyright
Penn State
and
NEC