Unique decomposition categories, Geometry of Interaction and combinatory logic

In another paper (Abramsky et al. 1999), we have developed Abramsky's analysis of Girard's Geometry of Interaction programme in detail. In this paper, our goal is to study the data ow based computational aspects of that analysis. We introduce unique decomposition categories that provide a suitable categorical framework for such computational analysis. The current study also serves to establish connections with the work on proof nets and paths by Girard and Danos and Regnier in this categorical setting. The latter goal is partially achieved here by the presentation of categorical models for dynamic algebras.

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

[2]  Ian Craig Mackie.  The geometry of implementation , 1994 .

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

[4]  Pasquale Malacaria,et al.  Some results on the interpretation of lambda -calculus in operator algebras , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

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

[6]  Vincent Danos,et al.  Local and asynchronous beta-reduction (an analysis of Girard's execution formula) , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[7]  D. B. Benson,et al.  The inverse semigroup of a sum-ordered semiring , 1985 .

[8]  R. Kadison,et al.  Fundamentals of the Theory of Operator Algebras , 1983 .

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

[10]  Martín Abadi,et al.  The geometry of optimal lambda reduction , 1992, POPL '92.

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

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

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

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

[15]  Radha Jagadeesan,et al.  New Foundations for the Geometry of Interaction , 1994, Inf. Comput..

[16]  Cosimo Laneve,et al.  Paths in the lambda-calculus. Three years of communications without understanding , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[17]  Harry G. Mairson,et al.  Parallel beta reduction is not elementary recursive , 1998, POPL '98.

[18]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

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