Short Proofs of Normalization for the simply-typed -calculus, permutative conversions and Godel's T (original) (raw)
Related papers
Softwaretechnik-trends, 1999
Archive for Mathematical Logic, 2003
2009
Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-�-Calculus
Tlca, 2005
On the Correspondence Between Proofs and lambda-Terms
Technical Reports (CIS), 1993
Continuous normalization for the lambda-calculus and Gödel’s
Annals of Pure and Applied Logic, 2005
Normalization by Evaluation for Typed Weak lambda-Reduction
2018
Notes on generalization of proof normalization
Strong Normalization of the Typed λ ws -Calculus
Lecture Notes in Computer Science, 2003
Weak normalization for the simply-typed lambda-calculus in Twelf
2004
Analytic proof systems for lambda-calculus: the elimination of transitivity, and why it matters
Archive for Mathematical Logic, 2007
A Strong Normalisation Condition for Pure Type Systems
2015
Normalization in the simply typed λμμ ρθε-calculus
Mathematical Structures in Computer Science, 2023
2009
On Generalized Theorems for Normalization of Proofs
Partial inductive definitions as type-systems for λ-terms
BIT, 1992
Strong normalization and equi-(co) inductive types
2007
Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi
Fundamenta Informaticae, 2007
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Ω-Rule
2016
Typing untyped λ-terms, or reducibility strikes again!
Annals of Pure and Applied Logic, 1998
A general method for proving the normalization theorem for first and second order typed λ-calculi
Mathematical Structures in Computer Science, 1999
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae, 2007
Mechanical procedure for proof construction via closed terms in typed λ calculus
Journal of Automated Reasoning, 1988
Strong normalization results by translation
Annals of Pure and Applied Logic, 2010
Normalization properties of symmetric logical calculi
2007
Normalization by evaluation for typed lambda calculus with coproducts
Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 2001
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Electronic Notes in Theoretical Computer Science, 2008
A Formalized Proof of Strong Normalization for Guarded Recursive Types
Lecture Notes in Computer Science, 2014
Arithmetical Proofs of Strong Normalization Results for Symmetric [lambda]-calculi
Annales Societatis Mathematicae Polonae Series 4 Fundamenta Informaticae, 2007
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric λμ-calculus
Electronic Notes in Theoretical Computer Science, 2005
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule
Proceedings of FSCD'16, 2016
The λ Calculus and the Unity of Structural Proof Theory
Theory of Computing Systems / Mathematical Systems Theory, 2009
Type-Checking and Normalisation By Evaluation for Dependent Type Systems
Mechanical Procedure for Proof Construction via Closed Terms in Typed lambda Calculus
Jar, 1988