Second order isomorphic types: A proof theoretic study on second order -calculus with surjective pairing and terminal object

DOI10.1006/INCO.1995.1085MaRDI QIDQ1893735zbMATH OpenOpenAlexFDO

Authors Roberto Di Cosmo

Publication date 2 August 1995

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1995.1085

zbMATH Keywords

Curry-Howard correspondencesecond order lambda calculus

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1722662
• Two -extensions of the theory of homogeneous simple types as a second-order logic
• Second-order type isomorphisms through game semantics
• Transfinite type theory and provability of second order formulas
• Inductive types and type constraints in the second-order lambda calculus
• A general method for proving the normalization theorem for first and second order typed λ-calculi
• Type reconstruction in finite rank fragments of the second-order -calculus
• scientific article; zbMATH DE number 733666
• scientific article; zbMATH DE number 1086666
• Remarks on isomorphisms in typed lambda calculi with empty and sum types

Cited in

(6)

• Second-order type isomorphisms through game semantics
• Remarks on isomorphisms in typed lambda calculi with empty and sum types
• On Isomorphisms of Intersection Types
• Provable isomorphisms of types
• Isomorphism of intersection and union types
• scientific article; zbMATH DE number 7809762 (Why is no real title available?)

This page was built for publication: Second order isomorphic types: A proof theoretic study on second order \(\lambda\)-calculus with surjective pairing and terminal object

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893735)