265 search results - page 15 / 53 » Lambda calculus with patterns |
107
click to vote
CCA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Stone Duality is a revolutionary theory that works directly with computable continuous functions, without using set theory, infinitary lattice theory or a prior theory o...
ENTCS
2008
14 years 9 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'...
113
click to vote
ACL2
2006
ACM
15 years 3 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 ...
87
Voted
AAAI
2008
14 years 11 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...
76
Voted
ESOP
2012
Springer
13 years 5 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...