Skip to main content
SpringerLink
Log in

Specifying interaction categories

  • Conference paper
  • First Online:
Category Theory and Computer Science (CTCS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1290))

Included in the following conference series:

Abstract

We analyse two complementary methods for obtaining models of typed process calculi, in the form of interaction categories. These two methods allow adding new features to previously captured notions of process and of type, respectively. By combining them, all familiar examples of interaction categories, as well as some new ones, can be built starting from some familiar categories.

Using the presented constructions, interaction categories can be analysed without fixing a set of axioms, merely in terms of the way in which they are specified —just like algebras are analysed in terms of equations and relations, independently on abstract characterisations of their varieties.

This work was partially supported under ONR grant N00014-92-J-1974.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky, 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)

    Google Scholar 

  2. S. Abramsky, S.J. Gay and R. Nagarajan, Specification structures and propositions-as-types for concurrency. In: Logics for Concurrency: Structure vs. Automata. Proceedings of the VIIIth Banff Workshop, Lecture Notes in Computer Science(Springer 1996)

    Google Scholar 

  3. S. Abramsky and R. Jagadeesan, Games and full completeness for multiplicative linear logic, J. Symbolic Logic

    Google Scholar 

  4. S. Abramsky, R. Jagadeesan and P. Malacaria, Full abstraction for PCF, submitted (1996)

    Google Scholar 

  5. M. Barr, ⋆-Autonomous Categories, Lecture Notes in Mathematics 752 (Springer 1979)

    Google Scholar 

  6. M. Barr, ⋆-Autonomous categories and linear logic, Math. Structures Comput. Sci. 1/2 (1991), 159–178

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Bénabou, Introduction to bicategories, in: Reports of the Midwest Category Seminar I, Lecture Notes in Mathematics 47 (Springer, 1967) 1–77

    Google Scholar 

  8. J. Bénabou, 2-dimensional limits and colimits of distributors, abstract of a talk given in Oberwolfach (1972)

    Google Scholar 

  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)

    Google Scholar 

  10. V. Danos and L. Regnier, The structure of multiplicatives, Archive form Math. Logic 28 (1989) 181–203

    Article  MATH  MathSciNet  Google Scholar 

  11. T. Fox, Coalgebras and cartesian categories, Comm. Algebra, 4/7 (1976) 665–667

    MATH  MathSciNet  Google Scholar 

  12. P.J. Freyd and A. Scedrov, Categories, Allegories, North-Holland Mathematical Library 39 (North-Holland, 1990)

    Google Scholar 

  13. A. Fleury and C. Retoré, The MIX rule, Unpublished note, 1990

    Google Scholar 

  14. J.-Y. Girard et al., Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7 (Cambridge Univ. Press 1989)

    Google Scholar 

  15. A. Grothendieck, Catégories fibrées et descente, Exposé VI, Revêtements Etales et Groupe Fondamental (SGAI), Lecture Notes in Mathematics 224 (Springer, 1971) 145–194

    Google Scholar 

  16. G.M. Kelly, Basic Concepts of Enriched Category Theory, L.M.S. Lecture Notes 64 (Cambridge Univ. Press 1982)

    Google Scholar 

  17. G.M. Kelly and M.L. Laplaza, Coherence for compact closed categories, J. Pure Appl. Algebra 19 (1980) 193–213

    Article  MATH  MathSciNet  Google Scholar 

  18. M. Makkai, Avoiding the axiom of choice in general category theory, to appear in J. Pure Appl. Algebra

    Google Scholar 

  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

    Google Scholar 

  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

    Google Scholar 

  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

    Article  MathSciNet  Google Scholar 

  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, Contemp. Math. 92 (Amer. Math. Soc., 1989), 371–382

    Google Scholar 

  23. R. Street, Conduché functors, a hand written note, dated 15 October 1986, 4 pp. *** DIRECT SUPPORT *** A0008C33 00004

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. COGS, University of Sussex, BN1 9QH, Brighton

    D. Pavlović

  2. Department of Computer Science, University of Edinburgh, EH9 3JZ, Edinburgh

    S. Abramsky

Authors
  1. D. Pavlović
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Abramsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eugenio Moggi Giuseppe Rosolini

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pavlović, D., Abramsky, S. (1997). Specifying interaction categories. In: Moggi, E., Rosolini, G. (eds) Category Theory and Computer Science. CTCS 1997. Lecture Notes in Computer Science, vol 1290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026986

Download citation

  • DOI: https://doi.org/10.1007/BFb0026986

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63455-3

  • Online ISBN: 978-3-540-69552-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation