A Linear Logical View of Linear Type Isomorphisms

The notion of isomorphisms oft types has many theoretical as well as practical consequences, and isomorphisms of types have been investigated at length over the past years. Isomorphisms in weak system (like linear lambda calculus) have recently been investigated due to their practical interest in library search. In this paper we give a remarkably simple and elegant characterization of linear isomorphisms in the setting of Multiplicative Linear Logic (MLL), by making an essential use of the correctness criterion for Proof Nets due to Girard.

[1]  Roberto Di Cosmo.  Review of Isomorphisms of Types:: from λ-calculus to information retrieval and language design , 1997 .

[2]  G. M. Kelly,et al.  Coherence in closed categories , 1971 .

[3]  Roberto Di Cosmo,et al.  Type Isomorphisms for Module Signatures , 1996, PLILP.

[4]  Yiannis N. Moschovakis.  Logic from Computer Science , 1992 .

[5]  Christopher League.  Review of Isomorphisms of Types:: from λ-calculus to information retrieval and language design by Roberto Di Cosmo (Birkhauser, 1995) , 1997, SIGA.

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

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

[8]  K O S T A D O ˇ S E N,et al.  Isomorphic objects in symmetric monoidal closed categories , 2022 .

[9]  Roberto Di Cosmo,et al.  Provable isomorphisms of types , 1992, Mathematical Structures in Computer Science.

[10]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

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

[12]  Andrew W. Appel,et al.  Special Issue on ML , 1992 .

[13]  Roberto Di Cosmo,et al.  Type isomorphisms in a type-assignment framework , 1992, POPL '92.

[14]  Andrew M. Pitts,et al.  Category Theory and Computer Science , 1987, Lecture Notes in Computer Science.

[15]  Roberto Di Cosmo,et al.  Isomorphisms of Types , 1995, Progress in Theoretical Computer Science.

[16]  Sergei Soloviev.  A Complete Axiom System for Isomorphism of Types in Closed Categories , 1993, LPAR.

[17]  Colin Runciman,et al.  Retrieving re-usable software components by polymorphic type , 1989, Journal of Functional Programming.

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

[19]  David Delahaye,et al.  Recherche dans une bibliothèque de preuves Coq en utilisant le type et modulo isomorphismes , 1997 .

[20]  Gerard Berry,et al.  Theory and practice of sequential algorithms: the kernel of the applicative language CDS , 1986 .

[21]  Sergei Soloviev,et al.  A Deciding Algorithm for Linear Isomorphism of Types with Complexity O (n log2(n)) , 1997, Category Theory and Computer Science.

[22]  Roberto Di Cosmo,et al.  Deciding type isomorphisms in a type-assignment framework , 1993, Journal of Functional Programming.

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

[24]  Colin Runciman,et al.  Retrieving Reusable Software Components by Polymorphic Type , 1991, J. Funct. Program..