On Isomorphisms of Intersection Types
The study of type isomorphisms for different λ-calculi started over twenty years ago, and a very wide body of knowledge has been established, both in terms of results and in terms of techniques. A notable missing piece of the puzzle was the characterization of type isomorphisms in the presence of intersection types. While at first thought this may seem to be a simple exercise, it turns out that not only finding the right characterization is not simple, but that the very notion of isomorphism in intersection types is an unexpectedly original element in the previously known landscape, breaking most of the known properties of isomorphisms of the typed λ-calculus. In particular, types that are equal in the standard models of intersection types may be non-isomorphic.
Unable to display preview. Download preview PDF.
- 8.Di Cosmo, R.: Second order isomorphic types. A proof theoretic study on second order λ-calculus with surjective pairing and terminal object. Information and Computation, pp. 176–201 (1995)Google Scholar
- 13.Martin, C.F.: Axiomatic bases for equational theories of natural numbers. Notices of the American Mathematical Society 19(7), 778 (1972)Google Scholar
- 15.Soloviev, S.: A complete axiom system for isomorphism of types in closed categories. In: Voronkov, A. (ed.) LPAR 1993. LNCS, vol. 698, pp. 360–371. Springer, Heidelberg (1993)Google Scholar