59 search results - page 2 / 12 » A Natural Counting of Lambda Terms |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
JAR
2006
13 years 4 months ago
2006
Otter-lambda is Otter modified by adding code to implement an algorithm for lambda unification. Otter is a resolution-based, clause-language first-order prover that accumulates de...
ESOP
2012
Springer
12 years 16 days 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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
ESOP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...