53 search results - page 3 / 11 » Partial Evaluation for the Lambda Calculus |
216
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
109
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
for an informal presentation at CIE 2007 [2] is a typed -calculus that pursues the reuse of the term constructions both at the level of types and at the level of contexts, while en...
103
click to vote
PPDP
2005
Springer
15 years 7 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
119
Voted
ENTCS
2006
15 years 1 months ago
2006
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
102
click to vote
ESOP
2012
Springer
13 years 9 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...