Linear Logic, Coherence, and Dinaturality

A general coherence theorem for monoidal closed structures is obtained by modifying the logical approach to coherence questions, due to Lambek [1969, 1990] by making use of linear logic. Linear logic, introduced by Girard, has many advantages which are of use in studying coherence. Most notably, its resource-sensitive nature makes it ideal for studying monoidal closed structures. The logical approach is also modified by using natural deduction rather than sequent calculus. The natural deduction system in question is proof nets, also introduced by Girard. Proof nets have several important properties which are exploited to prove the coherence theorem. In particular, the cut elimination procedure is confluent and strongly normalizing. The approach to coherence is to define a general structure, the autonomous deductive system, for defining many theories of monoidal closed categories. An autonomous deductive system is a deductive system with several added features, which are suggested by the properties of proof nets. It is then possible to give a straightforward criterion for whether a given theory of monoidal closed categories, specified by an autonomous deductive system, is coherent. Finally, a relationship is established between coherence and the composition problem for dinatural transformations. Thus, the dinatural approach to modelling polymorphic types, due to Bainbridge et al. [1990], can be extended to linear polymorphism.

[1]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[2]  J. Roger Hindley,et al.  Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[3]  S. Lane.  Categories for the Working Mathematician , 1971 .

[4]  Giorgio Ghelli,et al.  Coherence of Subsumption , 1990, CAAP.

[5]  Christian Retoré,et al.  The mix rule , 1994, Mathematical Structures in Computer Science.

[6]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[7]  J. Girard,et al.  Proofs and types , 1989 .

[8]  Carl A. Gunter,et al.  Normal process representatives , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

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

[10]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[11]  José Meseguer,et al.  From Petri Nets to Linear Logic , 1989, Category Theory and Computer Science.

[12]  Richard Blute.  Proof Nets and Coherence Theorems , 1991, Category Theory and Computer Science.

[13]  S. V. Soloviev.  On natural transformations of distinguished functors and their superpositions in certain closed categories , 1987 .

[14]  G. M. Kelly.  An abstract approach to coherence , 1972 .

[15]  John C. Reynolds,et al.  Types, Abstraction and Parametric Polymorphism , 1983, IFIP Congress.

[16]  Yves Lafont,et al.  Interaction nets , 1989, POPL '90.

[17]  C. Barry Jay,et al.  Languages for monoidal categories , 1989 .

[18]  Vincent Danos.  La Logique Linéaire appliquée à l'étude de divers processus de normalisation (principalement du Lambda-calcul) , 1990 .

[19]  Jean-Yves Girard,et al.  Towards a geometry of interaction , 1989 .

[20]  C. Barry Jay.  The structure of free closed categories , 1990 .

[21]  Andre Scedrov,et al.  Normal Forms and Cut-Free Proofs as Natural Transformations , 1992 .

[22]  Jean-Yves Girard,et al.  Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.

[23]  J. Girard.  Proof Theory and Logical Complexity , 1989 .

[24]  G. M. Kelly,et al.  A generalization of the functorial calculus , 1966 .

[25]  Jean-Yves Girard,et al.  The system f of variable types, 15 years later , 1990 .

[26]  Vincent Danos,et al.  The structure of multiplicatives , 1989, Arch. Math. Log..

[27]  A. Joyal,et al.  The geometry of tensor calculus, I , 1991 .

[28]  G. Mints,et al.  Closed categories and the theory of proofs , 1981 .

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

[30]  G. M. Kelly,et al.  Coherence for compact closed categories , 1980 .

[31]  Thierry Coquand,et al.  Inheritance and explicit coercion , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[32]  Andre Scedrov,et al.  Functorial Polymorphism , 1990, Theor. Comput. Sci..

[33]  John C. Reynolds,et al.  The Coherence of Languages with Intersection Types , 1991, TACS.