424 search results - page 16 / 85 » A Lambda Calculus with Forms |
ESOP
2012
Springer
12 years 3 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...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
WOLLIC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
CEFP
2007
Springer
14 years 1 months ago
2007
Springer