From Geometry of Interaction to Denotational Semantics

We analyze the categorical foundations of Girard's Geometry of Interaction Program for Linear Logic. The motivation for the work comes from the importance of viewing GoI as a new kind of semantics and thus trying to relate it to extant semantics. In an earlier paper we showed that a special case of Abramsky's GoI situations--ones based on Unique Decomposition Categories (UDC's)--exactly captures Girard's functional analytic models in his first GoI paper, including Girard's original Execution formula in Hilbert spaces, his notions of orthogonality, types, datum, algorithm, etc. Here we associate to a UDC-based GoI Situation a denotational model (a *- autonomous category (without units) with additional exponential structure). We then relate this model to some of the standard GoI models via a fully-faithful embedding into a double-gluing category, thus connecting up GoI with earlier Full Completeness Theorems.

[1]  Jean-Yves Girard,et al.  Geometry of Interaction 1: Interpretation of System F , 1989 .

[2]  Laurent Regnier,et al.  Lambda-calcul et reseaux , 1992 .

[3]  Michael Barr,et al.  Algebraically compact functors , 1992 .

[4]  Vincent Danos,et al.  Proof-nets and the Hilbert space , 1995 .

[5]  Ross Street,et al.  Traced monoidal categories , 1996 .

[6]  Jean-Yves Girard,et al.  Geometry of interaction 2: deadlock-free algorithms , 1990, Conference on Computer Logic.

[7]  Esfandiar Haghverdi,et al.  Unique decomposition categories, Geometry of Interaction and combinatory logic , 2000, Mathematical Structures in Computer Science.

[8]  Glynn Winskel,et al.  A relational model of non-deterministic dataflow , 1998, Mathematical Structures in Computer Science.

[9]  Philip J. Scott,et al.  A categorical model for the geometry of interaction , 2006, Theor. Comput. Sci..

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

[11]  Samson Abramsky,et al.  Retracing some paths in Process Algebra , 1996, CONCUR.

[12]  J. Girard.  Geometry of interaction III: accommodating the additives , 1995 .

[13]  Samson Abramsky,et al.  Geometry of Interaction and linear combinatory algebras , 2002, Mathematical Structures in Computer Science.

[14]  Martin Hyland,et al.  Glueing and orthogonality for models of linear logic , 2003, Theor. Comput. Sci..

[15]  Esfandiar Haghverdi.  Partially Additive Categories and Fully Complete Models of Linear Logic , 2001, TLCA.

[16]  Radha Jagadeesan,et al.  New foundations for the geometry of interaction , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[17]  Peter Hines.  A Categorical Framework For Finite State Machines , 2003, Math. Struct. Comput. Sci..

[18]  Esfandiar Haghverdi,et al.  A categorical approach to linear logic, geometry of proofs and full completeness. , 2000 .

[19]  Masahito Hasegawa,et al.  Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi , 1997, TLCA.

[20]  Peter Selinger.  Categorical Structure of Asynchrony , 1999, MFPS.

[21]  Cristian S. Calude,et al.  Discrete Mathematics and Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[22]  Michael A. Arbib,et al.  Algebraic Approaches to Program Semantics , 1986, Texts and Monographs in Computer Science.