Add to ORKGAndreas Abel Department of Computer Science, Chalmers University of Technology R\u7fannv\u7fagen 6, SWE-41296 G\u7foteborg, Sweden Abstract. Weak 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's computability method does not seem to be directly usable, a combinatorical proof is adapted and formalized instead
This paper presents a new lambda-calculus with singleton types, called λ βδ The main novelty of λ βδ...
AbstractThis paper presents a new lambda-calculus with singleton types, called λ≤{}βδ. The main nove...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
Normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh...
AbstractNormalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the E...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
AbstractWe identify a restricted class of terms of the lambda calculus, here called weak linear, tha...
Abstract. A general version of the fundamental theorem for System F is presented which can be instan...
Abstract. We identify a restricted class of terms of the lambda calculus, here called weak linear, t...
AbstractWe formalize two proofs of weak head normalization for the simply typed lambda-calculus in f...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
Abstract. The atomic lambda-calculus is a typed lambda-calculus with explicit sharing, which origina...
We formalize two proofs of weak head normalization for the simply typed lambda-calculus in first-ord...
This paper presents a new lambda-calculus with singleton types, called λ βδ The main novelty of λ βδ...
AbstractThis paper presents a new lambda-calculus with singleton types, called λ≤{}βδ. The main nove...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
Normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh...
AbstractNormalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the E...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
AbstractWe identify a restricted class of terms of the lambda calculus, here called weak linear, tha...
Abstract. A general version of the fundamental theorem for System F is presented which can be instan...
Abstract. We identify a restricted class of terms of the lambda calculus, here called weak linear, t...
AbstractWe formalize two proofs of weak head normalization for the simply typed lambda-calculus in f...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
Abstract. The atomic lambda-calculus is a typed lambda-calculus with explicit sharing, which origina...
We formalize two proofs of weak head normalization for the simply typed lambda-calculus in first-ord...
This paper presents a new lambda-calculus with singleton types, called λ βδ The main novelty of λ βδ...
AbstractThis paper presents a new lambda-calculus with singleton types, called λ≤{}βδ. The main nove...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...