Specifying interaction categories

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

Volumn 1290, Issue , 1997, Pages 147-158

  Pavlovic D ^a   Abramsky, S ^b  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPLEMENTARY METHODS; PROCESS CALCULI;

ARTIFICIAL INTELLIGENCE;

EID: 21744455844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0026986     Document Type: Conference Paper

References (23)

1. S. Abiamsky, S.J. Gay and R. Nagarajan, Interaction categories and the foundations of the typed concurrent programming. In: Deductive Program Design: Proceedings of the 1994 Marktoberdorf International Summer School, (Springer 1996)
2. S. Abramsky, S.J. Gay and R. Nagarajan, Specification structures and propo-sitions-as-types for concurrency. In: Logics for Concurrency: Structure vs. Automata. Proceedings of the VHIth Banff Workshop, Lecture Notes in Computer Science(Springer 1996)
3. S. Abiamsky and R. Jagadeesan, Games and full completeness for multiplicative linear logic, J Symbolic Logic
4. S. Abramsky, R. Jagadeesan and P. Malacaria, Full abstraction for PCF, submitted (1996)
5. M. Barr, *-Autonomous Categories, Lecture Notes in Mathematics 752 (Springer 1979)
6. M. Barr, *-Autonomous categories and linear logic, Math. Structures Comput. Sci. 1/2(1991), 159-178
7. J. Bènabou, Introduction to bicategories, in: Reports of the Midwest Category Seminar I, Lecture Notes in Mathematics 47 (Springer, 1967) 77
8. J. Bènabou, 2-dimensional limits and colimits of distributors, abstract of a talk given in Oberwolfach (1972)
9. G.M. Bierman, What is a categorical model of intuitionistic linear logic?, in: Proceedings of Conference on Typed Lambda Calculus and Applications, M. Dezani-Ciancaglini and G. Plotkin, eds., Lecture Notes in Computer Science 902 (Springer 1995)
10. V. Danos and L. Regnier, The structure of multiplicatives, Archive form Math. Logic 28(1989) 181-203
11. T. Fox, Coalgebras and cartesian categories, Comm. Algebra, 4/7(1976) 665-667
12. P.J. Freyd and A. Scedrov, Categories, Allegories, North-Holland Mathematical Library 39 (North-Holland, 1990)
13. A. Fleury and C. Retorè, The MIX rule, Unpublished note, 1990
14. J.-Y. Girard et al., Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7 (Cambridge Univ. Press 1989)
15. A. Grothendieck, Categories fibrees et descente, Expose VI, Revetements Etales et Groupe Fondamental (SGA1), Lecture Notes in Mathematics 224 (Springer, 1971) 145-194
16. G.M. Kelly, Basic Concepts of Enriched Category Theory, L.M.S. Lecture Notes 64 (Cambridge Univ. Press 1982)
17. G.M. Kelly and M.L. Laplaza, Coherence for compact closed categories, J. Pure Appl. Algebra 19(1980) 193-213
18. M. Makkai, Avoiding the axiom of choice in general category theory, to appear in J Pure Appl. Algebra
19. D. Pavlović, Categorical logic of concurrency and interaction I. Synchronous processes, in: Theory and Formal Methods of Computing 1994, C.L. Henkin et al., eds. (World Scientific 1995), 105-141
20. D. Pavlović, Convenient categories of processes and simulations I: modulo strong bisimilarity, Category Theory and Computer Science '95, D.H. Pitt et al., eds., Lect. Notes in Comp. Science 953 (Springer, 1995), 3-24
21. D. Pavlović, Maps I: relative to a factorisation system, J. Pure Appl. Algebra, 99(1995), 9-34; Maps II: Chasing diagrams in categorical proof theory, J.of the IGPL 2/4(1996), 159-194
22. R.A.G. Seely, Linear logic, *-autonomous categories and cofree coalgebras, in: J. Gray and A. Scedrov (eds.), Categories in Computer Science and Logic, Con-temp. Math. 92 (Amer. Math. Soc, 1989), 371-382
23. R. Street, Conduchè functors, a hand written note, dated 15 October 1986, 4 pp.