Add to ORKGWe consider an extension of OMDoc proofs with alternative sub-proofs and proofs at different level of detail, and an affine non-deterministic fragment of the lambda-bar-mu-mu-tilde-calculus seen as a proof format. We provide explanations in pseudo-natural language of proofs in both formats, and a formal correspondence between the two by means of two mutually inverse encodings of one format in the other one
Thanks to the Curry-Howard isomorphism, typed lambda-calculi provide a convenient logical framework ...
AbstractThe work in Bunder (Theoret. Comput. Sci. 169 (1996) 3–21) shows that for each one of many i...
The present article aims at establishing formal connections between correspondence phenomena, well k...
We consider an extension of OMDoc proofs with alternative sub-proofs and proofs at different level o...
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...
Abstract. We introduce a natural deduction formulation for the Logic of Proofs, a refinement of moda...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
This thesis offers a study of the Curry-Howard correspondence for a certain fragment (the canonical ...
(eng) We present a confluent rewriting system wich extends a previous calculus for the Lambda-Calcul...
In this paper we investigate the Curry-Howard correspondence for constructive modal logic in light o...
Inspired by a recent graphical formalism for lambda-calculus based on linearlogic technology, we int...
Thanks to the Curry-Howard isomorphism, typed lambda-calculi provide a convenient logical framework ...
AbstractThe work in Bunder (Theoret. Comput. Sci. 169 (1996) 3–21) shows that for each one of many i...
The present article aims at establishing formal connections between correspondence phenomena, well k...
We consider an extension of OMDoc proofs with alternative sub-proofs and proofs at different level o...
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...
Abstract. We introduce a natural deduction formulation for the Logic of Proofs, a refinement of moda...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
This thesis offers a study of the Curry-Howard correspondence for a certain fragment (the canonical ...
(eng) We present a confluent rewriting system wich extends a previous calculus for the Lambda-Calcul...
In this paper we investigate the Curry-Howard correspondence for constructive modal logic in light o...
Inspired by a recent graphical formalism for lambda-calculus based on linearlogic technology, we int...
Thanks to the Curry-Howard isomorphism, typed lambda-calculi provide a convenient logical framework ...
AbstractThe work in Bunder (Theoret. Comput. Sci. 169 (1996) 3–21) shows that for each one of many i...
The present article aims at establishing formal connections between correspondence phenomena, well k...