Add to ORKGThe lambda-bar-mu-mu-tilde-calculus, introduced by Curien and Herbelin, is a calculus isomorphic to (a variant of) the classical sequent calculus LK of Gentzen. As a proof format it has very remarkable properties that we plan to study in future works. In this paper we embed it with a rendering semantics that provides explanations in pseudo-natural language of its proof terms, in the spirit of the work of Yann Coscoy for the lambda-calculus. The rendering semantics unveils the richness of the calculus that allows to preserve several proof structures that are identified when encoded in the lambda-calculus
Abstract. We introduce a natural deduction formulation for the Logic of Proofs, a refinement of moda...
In the context of intuitionistic sequent calculus, “naturality” means permutation-freeness (the term...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
The lambda-bar-mu-mu-tilde-calculus, introduced by Curien and Herbelin, is a calculus isomorphic to ...
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Aut...
In the context of intuitionistic implicational logic, we achieve a perfect correspondence (technical...
We consider an extension of OMDoc proofs with alternative sub-proofs and proofs at different level o...
Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on λ̄µµ̃, a calculus introduced by Curien and He...
This thesis offers a study of the Curry-Howard correspondence for a certain fragment (the canonical ...
The λ-calculus is fundamental in the study of logic and computation. Partly this is because it is a ...
We present a typed calculus LambdaXi isomorphic to the implicational fragment of the classical seque...
It is well-known that there is a good correspondence between natural deduction derivations and typed...
http://www.acm.orgInternational audienceWe present the lambda-bar-mu-mu-tilde-calculus, a syntax for...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
abstract: Natural Language Processing is a subject that combines computer science and linguistics, a...
Abstract. We introduce a natural deduction formulation for the Logic of Proofs, a refinement of moda...
In the context of intuitionistic sequent calculus, “naturality” means permutation-freeness (the term...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...
The lambda-bar-mu-mu-tilde-calculus, introduced by Curien and Herbelin, is a calculus isomorphic to ...
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Aut...
In the context of intuitionistic implicational logic, we achieve a perfect correspondence (technical...
We consider an extension of OMDoc proofs with alternative sub-proofs and proofs at different level o...
Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on λ̄µµ̃, a calculus introduced by Curien and He...
This thesis offers a study of the Curry-Howard correspondence for a certain fragment (the canonical ...
The λ-calculus is fundamental in the study of logic and computation. Partly this is because it is a ...
We present a typed calculus LambdaXi isomorphic to the implicational fragment of the classical seque...
It is well-known that there is a good correspondence between natural deduction derivations and typed...
http://www.acm.orgInternational audienceWe present the lambda-bar-mu-mu-tilde-calculus, a syntax for...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
abstract: Natural Language Processing is a subject that combines computer science and linguistics, a...
Abstract. We introduce a natural deduction formulation for the Logic of Proofs, a refinement of moda...
In the context of intuitionistic sequent calculus, “naturality” means permutation-freeness (the term...
untyped lambda calculus was introduced around 1930 by Church [11] as part of an investigation in the...