A categorical model for the geometry of interaction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 708-720

  Haghverdi, Esfandiar ^a   Scott, Philip ^b  

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CATEGORICAL MODEL; GEOMETRY OF INTERACTION; LINEAR LOGIC; OPERATOR ALGEBRAS; UNIQUE DECOMPOSITION CATEGORIES;

SEMANTICS;

EID: 34547538715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_60     Document Type: Article

References (20)

1. Abramsky, S. (1996), Retracing Some Paths in Process Algebra. In CONCUR 96, Springer LNCS 1119, 1-17.
2. Abramsky, S. (1997), Interaction, Combinators and Complexity. Lecture Notes, Siena, Italy.
3. Abramsky, S., Haghverdi, E. and Scott, P.J. (2002), Geometry of Interaction and Linear Combinatory Algebras. MSCS, vol. 12(5), 2002, 625-665, CUP.
4. Abramsky, S. and Jagadeesan, R. (1994), New Foundations for the Geometry of Interaction. Information and Computation 111 (1), 53-119.
5. Abramsky, S. and Lenisa, M. (2000), A Fully-complete PER Model for ML Polymorphic Types, CSL'2000 Springer LNCS 1862, 140-155.
6. Barr, M. (1992), Algebraically Compact Functors. JPAA, vol. 82, 211-231.
7. Danos, V. (1990), La logique linéaire appliquée à l'étude de divers processus de normalisation et principalement du λ-calcul PhD thesis, Université Paris VII.
8. Danos, V. and Regnier, L. (1995), Proof-nets and the Hilbert Space. In: Advances in Linear Logic, London Math. Soc. Notes, 222, CUP, 307-328.
9. Girard, J.-Y. (1988), Geometry of Interaction II: Deadlock-free Algorithms. In Proc. of COLOG'88, LNCS 417, Springer, 76-93.
10. Girard, J.-Y. (1989a) Geometry of Interaction I: Interpretation of System F. In Proc. Logic Colloquium 88, North Holland, 221-260.
11. Girard, J.-Y. (1995), Geometry of Interaction III: Accommodating the Additives. In: Advances in Linear Logic, LNS 222,CUP, 329-389,
12. Haghverdi, E. A Categorical Approach to Linear Logic, Geometry of Proofs and Full Completeness, PhD Thesis, University of Ottawa, Canada 2000.
13. Haghverdi, E. Unique Decomposition Categories, Geometry of Interaction and combinatory logic, Math. Struct. in Comp. Science, vol. 10, 2000, 205-231.
14. Hasegawa, M. (1997), Recursion from Cyclic Sharing : Traced Monoidal Categories and Models of Cyclic Lambda Calculus, Springer LNCS 1210, 196-213.
15. Hildebrandt, T. , Panangaden, P., Winskel, G, A Relational Model of Nondeterministic Dataflow, to appear in Math. Struct. in Comp. Science, 2004.
16. Hines, P. A categorical framework for finite state machines Math. Struct. in Comp. Science, vol. 13, 2003, 451-480.
17. Joyal, A., Street, R. and Verity, D. (1996), Traced Monoidal Categories. Math. Proc. Camb. Phil. Soc. 119, 447-468.
18. Manes, E.G. and Arbib, M.A. (1986), Algebraic Approaches to Program Semantics. Springer-Verlag.
19. Selinger, P. (1999), Categorical Structure of Asynchrony. Electronic Notes in Theoretical Computer Science, 20. Elsevier Science B.V.
20. Stefanescu, G. Network Algebra, Springer-Verlag, 2000.