194 search results - page 15 / 39 » An Introduction to the Lambda Calculus |
ENTCS
2008
13 years 7 months ago
2008
Normalization for the simply-typed -calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait'...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
extended abstract we report on work in progress carried out within the framework of the NWO project Realising Optimal Sharing. Instead of discussing optimal reduction in the λ-cal...
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
AAAI
2008
13 years 10 months ago
2008
One way to solve the knowledge acquisition bottleneck is to have ways to translate natural language sentences and discourses to a formal knowledge representation language, especia...
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...