Presheaf models for the π-Calculus

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

Volumn 1290, Issue , 1997, Pages 106-126

  Cattani, Gian Luca ^a   Stark, Ian ^a   Winskel, Glynn ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BISIMILARITY; BISIMULATIONS; COMMUNICATION TOPOLOGIES; DENOTATIONAL SEMANTICS; GENERAL MODEL; MOBILE PROCESS; OPERATIONAL SEMANTICS; PI CALCULUS;

CALCULATIONS;

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

References (21)

1. Francis Borceux. Handbook of Categorical Algebra, rot. 1, volume 50 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1994.
2. Gérard Boudol. Asynchrony and the π calculus. Rapport de recherche 1702, INRIA, Sophia Antipolis, 1992.
3. Gian Luca Cattani and Glynn Winskel. Presheaf models for concurrency. In Computer Science Logic 1996, To appear in Lecture Notes in Computer Science. Springer-Verlag, 1997. A preliminary version appeared as BRICS Report RS-96-35.
4. Brian J. Day. On closed categories of functors. In Reports of the Midwest Category Seminar IV, Lecture Notes in Mathematics 137, pages 38. Springer-Verlag, 1970.
5. Marcelo Fiore, Eugenio Moggi, and Davide Sangiorgi. A fully-abstract model for the π -calculus. In LICS 1996.
6. Matthew Hennessy. A fully abstract denotational semantics for the π calculus. Technical Report 96:04, School of Cognitive and Computing Sciences, University of Sussex, 1996.
7. Matthew Hennessy and Gordon Plotkin. Fhll abstraction for a simple parallel programming language. In Mathematical Foundations of Computer Science: Proceedings of the 8th International Symposium, Lecture Notes in Computer Science 74, pages 108-120. Springer-Verlag, 1979.
8. André Joyal and Ieke Moerdijk. A completeness theorem for open maps. Annals of Pure and Applied Logic, 70:51-86, 1994.
9. André Joyal and Ieke Moerdijk. Algebraic Set Theory, volume 220 of London Mathematical Society Lecture Note Series. Cambridge University Press, 1995.
10. André Joyal, Mogens Nielsen, and Glynn Winskel. Bisimulation from open maps. Information and Computation, 127(2):164-185, 1996.
11. LICS 1996. Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, July 27-30, 1996. IEEE Computer Society Press, 1996.
12. Robin Milner. The polyadic π calculus -- a tutorial. Technical Report ECSLFCS-91-180, Laboratory for Foundations of Computer Science, University of Edinburgh, 1991.
13. Robin Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119-141, 1992.
14. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, part I. Information and Computation, 100:1-40, 1992a.
15. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, part II. Information and Computation, 100:41-77, 1992b.
16. Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD Thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992.
17. Davide Sangiorgi. π -calculus, internal mobility, and agent-passing calculi. Rapport de recherche 2539, INRIA, Sophia Antipolis, 1995.
18. Ian Stark. A fully abstract domain model for the π -calculus. In LICS 1996, pages 36-42.
19. Bent Thomsen. Plain CHOCS. Acta Informatica, 30:59, 1993.
20. Glynn Winskel. A presheaf semantics of value-passing processes. In CONCUR '96: Proceedings of the 7th International Conference on Concurrency Theory, Lecture Notes in Computer Science 1119, pages 98-114. Springer-Verlag, 1996. An extended version appears as BRICS Report RS-96-44.
21. Glynn Winskel and Mogens Nielsen. Models for concurrency. In Handbook of Logic in Computer Science, volume 4. Oxford University Press, 1995.