Provable isomorphisms of types

A constructive characterization is given of the isomorphisms which must hold in all models of the typed lambda calculus with surjective pairing. By the close relation between closed Cartesian categories and models of these calculi, we also produce a characterization of those isomorphisms which hold in all CCC’s. By the correspondence between these calculi and proofs in intuitionistic positive propositional logic, we thus provide a characterization of equivalent formulae of this logic, where the definition of equivalence of terms depends on having “invertible” proofs between the two terms. Rittri (1989), on types as search keys in program libraries, provides an interesting example of use of these characterizations.

[1]  Garrel Pottinger.  The Church-Rosser theorem for the typed λ-calculus with surjective pairing , 1981, Notre Dame J. Formal Log..

[2]  Roberto Di Cosmo,et al.  Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transformations , 1992 .

[3]  Fabio Alessi,et al.  Strong Conjunction and Intersection Types , 1991, MFCS.

[4]  Mikael Rittri,et al.  Using types as search keys in function libraries , 1989, Journal of Functional Programming.

[5]  John C. Reynolds,et al.  Polymorphism is not Set-Theoretic , 1984, Semantics of Data Types.

[6]  Richard Statman,et al.  λ-definable functionals andβη conversion , 1983, Arch. Math. Log..

[7]  Richard Statman,et al.  On the unification problem for Cartesian closed categories , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[8]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[9]  E. G. K. Lopez-Escobar,et al.  Proof functional connectives , 1985 .

[10]  Mariangiola Dezani-Ciancaglini,et al.  Combinatorial Problems, Combinator Equations and Normal Forms , 1974, ICALP.

[11]  Mikael Rittri,et al.  Retrieving Library Identifiers via Equational Matching of Types , 1990, CADE.

[12]  S. Solov′ev.  The category of finite sets and Cartesian closed categories , 1983 .

[13]  Kim B. Bruce,et al.  Provable isomorphisms and domain equations in models of typed languages , 1985, STOC '85.

[14]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[15]  Roberto Di Cosmo,et al.  A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object , 1991, ICALP.

[16]  Giuseppe Longo,et al.  Categories, types and structures - an introduction to category theory for the working computer scientist , 1991, Foundations of computing.

[17]  A. A. Babaev,et al.  A coherence theorem for canonical morphisms in cartesian closed categories , 1982 .

[18]  Mariangiola Dezani-Ciancaglini,et al.  Characterization of Normal Forms Possessing Inverse in the lambda-beta-eta-Calculus , 1976, Theor. Comput. Sci..