TLCA
1993
Springer
13 years 11 months ago
1993
Springer
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
TLCA
1993
Springer
13 years 11 months ago
1993
Springer
TLCA
1993
Springer
13 years 11 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
TLCA
1993
Springer
13 years 11 months ago
1993
Springer
TLCA
1993
Springer
13 years 11 months ago
1993
Springer
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...
TLCA
1993
Springer
13 years 11 months ago
1993
Springer
TLCA
1993
Springer
13 years 11 months ago
1993
Springer
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
TLCA
1993
Springer
13 years 11 months ago
1993
Springer
TLCA
1993
Springer
13 years 11 months ago
1993
Springer