Skip to main content
×
Home

Isomorphism of intersection and union types

  • MARIO COPPO (a1), MARIANGIOLA DEZANI-CIANCAGLINI (a1), INES MARGARIA (a1) and MADDALENA ZACCHI (a1)
Abstract

This paper gives a complete characterisation of type isomorphism definable by terms of a λ-calculus with intersection and union types. Unfortunately, when union is considered the Subject Reduction property does not hold in general. However, it is well known that in the λ-calculus, independently of the considered type system, the isomorphism between two types can be realised only by invertible terms. Notably, all invertible terms are linear terms. In this paper, the isomorphism of intersection and union types is investigated using a relevant type system for linear terms enjoying the Subject Reduction property. To characterise type isomorphism, a similarity between types and a type reduction are introduced. Types have a unique normal form with respect to the reduction rules and two types are isomorphic if and only if their normal forms are similar.

Copyright
Footnotes
Hide All

Dedicated to Corrado Böhm on the occasion of his 90th Birthday.

Footnotes
References
Hide All
Barbanera F., Dezani-Ciancaglini M. and de'Liguoro U. (1995). Intersection and union types: Syntax and semantics. Information and Computation 119 202230.
Bruce K., Di Cosmo R. and Longo G. (1992). Provable isomorphisms of types. Mathematical Structures in Computer Science 2 (2) 231247.
Bruce K. and Longo G. (1985). Provable isomorphisms and domain equations in models of typed languages. In: Sedgewick R. (eds.) STOC'85, ACM Press 263272.
Coppo M., Dezani-Ciancaglini M., Margaria I. and Zacchi M. (2013). Towards isomorphism of intersection and union types. In: Graham-Lengrand S. and Paolini L. (eds.) ITRS'12. Electronic Proceedings in Theoretical Computer Science 121 5880.
Coppo M., Dezani-Ciancaglini M., Margaria I. and Zacchi M. (2014a). Isomorphism of ‘functional’ intersection types. In: Matthes R. and Schubert A. (eds.) Types'13. LIPIcs 26 129149.
Coppo M., Dezani-Ciancaglini M., Margaria I. and Zacchi M. (2014b). Isomorphism of ‘functional’ intersection and union types. In: Reholf J. (ed.) ITRS'14. Electronic Proceedings in Theoretical Computer Science. 177 5364.
Dezani-Ciancaglini M. (1976). Characterization of normal forms possessing an inverse in the λβη-calculus. Theoretical Computer Science 2 (3) 323337.
Dezani-Ciancaglini M., Cosmo R. D., Giovannetti E. and Tatsuta M. (2010). On isomorphisms of intersection types. ACM Transactions on Computational Logic 11 (4) 122.
Di Cosmo R. (1995). Second order isomorphic types. A proof theoretic study on second order λ-calculus with surjective pairing and terminal object. Information and Computation 119 (2) 176201.
Di Cosmo R. (2005). A short survey of isomorphisms of types. Mathematical Structures in Computer Science 15 825838.
Díaz-Caro A. and Dowek G. (2015). Simply typed lambda-calculus modulo type isomorphisms. Theoretical Computer Science. To appear.
Dunfield J. (2014). Elaborating intersection and union types. Journal of Functional Programming 24 (2–3) 133165.
Fiore M., Di Cosmo R. and Balat V. (2006). Remarks on isomorphisms in typed lambda calculi with empty and sum types. Annals of Pure and Applied Logic 141 (1–2) 3550.
MacQueen D., Plotkin G. and Sethi R. (1986). An ideal model for recursive polymorphic types. Information and Control 71 (1–2) 95130.
Mitchell N. (2008). Hoogle overview. The Monad.Reader 12 2735.
Mitchell N. (2011). Hoogle: Finding functions from types. Invited Presentation from TFP 2011.
Prawitz D. (1965). Natural Deduction, Almqvist & Wiksell.
Ronchi Della Rocca S. (1988). Principal type scheme and unification for intersection type discipline. Theoretical Computer Science 59 (1–2) 129.
Routley R. and Meyer R. K. (1972). The semantics of entailment III. Journal of Philosophical Logic 1 192208.
Soloviev S. (1983). The category of finite sets and cartesian closed categories. Journal of Soviet Mathematics 22 (3) 13871400. (English translation of the original paper in russian published in Zapiski Nauchyn Seminarov LOMI, v.105, 1981.)
Soloviev S. (1993). A complete axiom system for isomorphism of types in closed categories. In: Voronkov A. (ed.) LPAR'93. Springer-Verlag Lecture Notes in Computer Science 698 360371.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 27 *
Loading metrics...

Abstract views

Total abstract views: 135 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 25th November 2017. This data will be updated every 24 hours.