AbstractNormalization 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 syntactical proof is adapted and formalized instead. In this case study, some boundaries of Twelf current capabilities are touched and discussed
We present normalization for intuitionistic combinatorial proofs (ICPs) and relate it to the simply-...
Abstract. This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-c...
We present the definition of the logical framework TF, the Type Framework. TF is a lambda-free logi...
Normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh...
Andreas Abel Department of Computer Science, Chalmers University of Technology R\u7fannv\u7fagen 6...
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...
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...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
We present a typed calculus LambdaXi isomorphic to the implicational fragment of the classical seque...
Explicit substitutions have been introduced as a refinment of the lambda-calculus - the usual formal...
We present normalization for intuitionistic combinatorial proofs (ICPs) and relate it to the simply-...
Abstract. This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-c...
We present the definition of the logical framework TF, the Type Framework. TF is a lambda-free logi...
Normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh...
Andreas Abel Department of Computer Science, Chalmers University of Technology R\u7fannv\u7fagen 6...
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...
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...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
We present a typed calculus LambdaXi isomorphic to the implicational fragment of the classical seque...
Explicit substitutions have been introduced as a refinment of the lambda-calculus - the usual formal...
We present normalization for intuitionistic combinatorial proofs (ICPs) and relate it to the simply-...
Abstract. This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-c...
We present the definition of the logical framework TF, the Type Framework. TF is a lambda-free logi...
DOI
Add to ORKG