Add to ORKGA generalization of the Curry-Howard-Lambek isomorphism for carte-sian closed categories and typed lambda calculi is given for the LP cate-gories with weak natural numbers object, which correspond to the positive conjunction fragment of the intuitionistic Logic of Proofs LP of Artemov, and LP-typed lambda calculi with natural numbers type.
The Curry-Howard Isomorphism is the correspondence between the intuitionistic frag-ment of classical...
The Curry-Howard isomorphism is the idea that proofs in natural deduction can be put in corresponden...
ABSTRACT. We show a kind of separability under the theory $\beta\etaarrow $ of simply typed A-calcul...
International audienceA constructive characterization is given of the isomorphisms which must hold i...
A constructive characterization is given of the isomorphisms which must hold in all models of the ty...
The Curry-Howard isomorphism 1 is the basis of typed functional programming. By means of this isomor...
AbstractMitchell, J.C. and E. Moggi, Kripke-style models for typed lambda calculus, Annals of Pure a...
We prove a completeness result for the equivalence of proofs in the positive fragment (T, $ Lambda, ...
AbstractWe show that every free cartesian closed category can be faithfully mapped to the category o...
We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type ...
This paper discusses a relation between two categorical models of typed $ lambda $-calculus which ar...
In (van Benthem 1986) it was observed that the Curry-Howard correspon-dence between proofs and -term...
AbstractWhen Gödel developed his functional interpretation, also known as the Dialectica interpretat...
A logic is developed in which function symbols are allowed to represent partial functions. It has th...
AbstractA logic is developed in which function symbols are allowed to represent partial functions. I...
The Curry-Howard Isomorphism is the correspondence between the intuitionistic frag-ment of classical...
The Curry-Howard isomorphism is the idea that proofs in natural deduction can be put in corresponden...
ABSTRACT. We show a kind of separability under the theory $\beta\etaarrow $ of simply typed A-calcul...
International audienceA constructive characterization is given of the isomorphisms which must hold i...
A constructive characterization is given of the isomorphisms which must hold in all models of the ty...
The Curry-Howard isomorphism 1 is the basis of typed functional programming. By means of this isomor...
AbstractMitchell, J.C. and E. Moggi, Kripke-style models for typed lambda calculus, Annals of Pure a...
We prove a completeness result for the equivalence of proofs in the positive fragment (T, $ Lambda, ...
AbstractWe show that every free cartesian closed category can be faithfully mapped to the category o...
We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type ...
This paper discusses a relation between two categorical models of typed $ lambda $-calculus which ar...
In (van Benthem 1986) it was observed that the Curry-Howard correspon-dence between proofs and -term...
AbstractWhen Gödel developed his functional interpretation, also known as the Dialectica interpretat...
A logic is developed in which function symbols are allowed to represent partial functions. It has th...
AbstractA logic is developed in which function symbols are allowed to represent partial functions. I...
The Curry-Howard Isomorphism is the correspondence between the intuitionistic frag-ment of classical...
The Curry-Howard isomorphism is the idea that proofs in natural deduction can be put in corresponden...
ABSTRACT. We show a kind of separability under the theory $\beta\etaarrow $ of simply typed A-calcul...