Affiliation:
1. Università di Torino, Italy
2. Université Paris Diderot, Paris, France
3. National Institute of Informatics, Tokyo, Japan
Abstract
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, isomorphism is not a congruence and types that are equal in the standard models of intersection types may be nonisomorphic.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Retractions in Intersection Types;Electronic Proceedings in Theoretical Computer Science;2017-02-07
2. Isomorphism of intersection and union types;Mathematical Structures in Computer Science;2015-08-07
3. On Isomorphism of "Functional" Intersection and Union Types;Electronic Proceedings in Theoretical Computer Science;2015-03-17
4. Session Type Isomorphisms;Electronic Proceedings in Theoretical Computer Science;2014-06-12
5. Toward Isomorphism of Intersection and Union types;Electronic Proceedings in Theoretical Computer Science;2013-07-30