38 search results - page 4 / 8 » Soundness of the simply typed lambda calculus in ACL2 |
CORR
2011
Springer
13 years 6 days ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
FPCA
1989
13 years 9 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
ENTCS
2006
13 years 5 months ago
2006
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
SAS
1997
Springer
13 years 9 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
FOSSACS
2009
Springer
14 years 6 hour ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...