Sciweavers

135 search results - page 8 / 27
» A typed lambda calculus with intersection types
Sort
View
LFCS
1994
Springer
13 years 11 months ago
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
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...
Philippe de Groote
ACL2
2006
ACM
14 years 1 months ago
Soundness of the simply typed lambda calculus in ACL2
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 ...
Sol Swords, William R. Cook
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
Normalization for the Simply-Typed Lambda-Calculus in Twelf
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'...
Andreas Abel
TIC
1998
Springer
107views System Software» more  TIC 1998»
13 years 11 months ago
Compiling Java to a Typed Lambda-Calculus: A Preliminary Report
Andrew K. Wright, Suresh Jagannathan, Cristian Ung...
POPL
1994
ACM
13 years 11 months ago
The Typed Polymorphic Label-Selective lambda-Calculus
Jacques Garrigue, Hassan Aït-Kaci