135 search results - page 8 / 27 » A typed lambda calculus with intersection types |
133
Voted
LFCS
1994
Springer
15 years 6 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
168
Voted
ACL2
2006
ACM
15 years 8 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 ...
136
Voted
ENTCS
2008
15 years 2 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'...
81
Voted
TIC
1998
Springer
15 years 7 months ago
1998
Springer
94
Voted
POPL
1994
ACM
15 years 6 months ago
1994
ACM