Add to ORKGIn this paper, we prove the strong normalisation for Martin- Lof's Logical Framework, and suggest that ''correct arity'', a condition weaker than well-typedness, will also guarantee the strong normalisation
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
AbstractNormalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the E...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
International audienceU. Berger, significantly simplified Tait's normalisation proof for bar recursi...
International audienceIn 1961, Spector presented an extension of Gödel's system T by a new schema of...
AbstractMLF is a type system extending ML with first-class polymorphism as in system F. The main goa...
MLF is a type system extending ML with first-class polymorphism as in system F. The main goal of the...
International audienceIn [gallier], general results (due to Coppo, Dezani and Veneri) relating prope...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
We give a proof that all terms that type-check in the theory of contructions are strongly normalizin...
AbstractWe present an algorithm for computing normal terms and types in Martin-Löf type theory with ...
International audiencePure Pattern Type Systems (P 2 T S ) combine in a unified setting the framewor...
In this paper we prove that any subexpression of a correct judgement in Martin-Löf's Type Theory is ...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
AbstractNormalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the E...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
International audienceU. Berger, significantly simplified Tait's normalisation proof for bar recursi...
International audienceIn 1961, Spector presented an extension of Gödel's system T by a new schema of...
AbstractMLF is a type system extending ML with first-class polymorphism as in system F. The main goa...
MLF is a type system extending ML with first-class polymorphism as in system F. The main goal of the...
International audienceIn [gallier], general results (due to Coppo, Dezani and Veneri) relating prope...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
We give a proof that all terms that type-check in the theory of contructions are strongly normalizin...
AbstractWe present an algorithm for computing normal terms and types in Martin-Löf type theory with ...
International audiencePure Pattern Type Systems (P 2 T S ) combine in a unified setting the framewor...
In this paper we prove that any subexpression of a correct judgement in Martin-Löf's Type Theory is ...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
AbstractNormalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the E...