16 search results - page 1 / 4 » A call-by-name lambda-calculus machine |
LICS
2012
IEEE
12 years 12 months ago
2012
IEEE
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
TCS
2008
14 years 9 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
67
Voted
CEFP
2007
Springer
15 years 3 months ago
2007
Springer
175
click to vote
POPL
2009
ACM
15 years 10 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...
108
click to vote
ACL
2007
14 years 11 months ago
2007
This paper presents the first empirical results to our knowledge on learning synchronous grammars that generate logical forms. Using statistical machine translation techniques, a...