Profunctors, open maps and bisimulation

Mathematical Structures in Computer Science

Volumn 15, Issue 3, 2005, Pages 553-614

  Cattani, Gian Luca ^a   Winskel, Glynn ^b  

^a DS Data Systems SpA   (Italy)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750718490     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129505004718     Document Type: Conference Paper

References (57)

1. Abramsky, S. (1983) On semantic foundations for applicative multiprogramming. In: ICALP '83, Tenth Colloquium on Automata, Languages and Programming. Springer-Verlag Lecture Notes in Computer Science 154 1-14.
2. Adámek, J. and Rosický, J. (1994) Locally Presentable and Accessible Categories. London Mathematical Society Lecture Notes Series 189, Cambridge University Press.
3. Barr, M. (1979) *-autonomous categories. Springer-Verlag Lecture Notes in Computer Science 752 (with an appendix by Po Hsiang Chu).
4. Bénabou, J. (1973) Les distributeurs. Rapport no 33. Seminaires de Mathématiques Pure, Institut de Mathématiques, Université Catholique de Louvain.
5. Borceux, F. (1994) Handbook of categorical algebra I. Encyclopedia of Mathematics and its Applications 50, Cambridge University Press.
6. Caccamo, M. and Winskel, G. (2000) Lecture notes in category theory. Notes for a course given by Glynn Winskel based on Martin Hyland's Cambridge Part III lectures 1995. Available at http://www.brics.dk/~mcaccamo/.
7. Caccamo, M. and Winskel, G. (2001) A higher-order calculus for categories. In: Proceedings of TPHOLs 2001. Springer-Verlag Lecture Notes in Computer Science 2152.
8. Caccamo, M. and Winskel, G. (2004) Limit preservation from naturality. In: Proceedings of the International Conference on Category Theory and Computer Science, CTCS'04. Electronic Notes in Theoretical Computer Science, Elsevier.
9. Carboni, A. (1995) Some free constructions in realizability and proof theory. Journal of Pure and Applied Algebra 103 (2).
10. Cattani, G. L. (1999) Presheqf Models for Concurrency, Ph.D. thesis, University of Aarhus.
11. Cattani, G. L., Fiore, M. P. and Winskel, G. (1998) A theory of recursive domains with applications to concurrency. In: LICS '98, Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press 214-225.
12. Cattani, G. L., Stark, I. and Winskel, G. (1997) Presheaf models for the π-calculus. In: Proceedings of the 7th International Conference on Category Theory and Computer Science, CTCS '97. Springer-Verlag Lecture Notes in Computer Science 1290 106-126.
13. Cattani, G. L. and Winskel, G. (1997) Presheaf models for concurrency. In: van Dalen, D. and Bezem, M. (eds.) Computer Science Logic. 10th International Workshop, CSL '96, Annual Conference of the European Association for Computer Science Logic. Selected Papers. Springer-Verlag Lecture Notes in Computer Science 1258 58-75.
14. Cattani, G. L. and Winskel, G. (2003) Presheaf models for CCS-like languages. Theoretical Computer Science 300 (1-3) 47-89.
15. Cheng, E., Hyland, M. and Power, J. (2003) Pseudo-distributive laws. In: Mathematical Foundations of Program Semantics, MFPS 19. Electronic Notes in Theoretical Computer Science 83, Elsevier.
16. Fiore, M. P., Cattani, G. L. and Winskel, G. (1999) Weak bisimulation and open maps (extended abstract). In: LICS '99, Proceedings of the Fourteenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press 67-76.
17. Girard, J.-Y. (1987) Linear logic. Theoretical Computer Science 50 (1) 101.
18. Glabbeek, R. v. and Goltz, U. (1989) Equivalence notions for concurrent systems and refinement of actions. In: Mathematical Foundations of Computer Science 1989. Springer-Verlag Lecture Notes in Computer Science 379 237-248.
19. Hennessy, M. (1994) A fully abstract denotational model for higher-order processes. Information and Computation 112 (1).
20. Hennessy, M. and Plotkin, G. D. (1979) Full abstraction for a simple parallel programming language. In: Bečvář, J. (ed.) Mathematical Foundations of Computer Science (MFCS) 1979. Springer-Verlag Lecture Notes in Computer Science 74 108-120.
21. Hildebrandt, T. T. (1999) A fully abstract presheaf semantics for SCCS with finite delay. In: Proceedings of the 8th International Conference on Category Theory and Computer Science, CTCS '99. Electronic Notes in Theoretical Computer Science, Elsevier (to appear).
22. Hildebrandt, T. T. (2000) Categorical Models for Concurrency: Independence, Fairness and Dataflow, Ph.D. thesis, University of Aarhus.
23. Hildebrandt, T. T., Panangaden, P. and Winskel, G. (1998) A relational model of non-deterministic dataflow. In: Sangiorgi, D. and de Simone, R. (eds.) Proceedings of the 9th International Conference on Concurrency Theory, CONCUR '98. Springer-Verlag Lecture Notes in Computer Science 1466 613-628.
24. Jacobs, B. (1994) Semantics of weakening and contracion. Annals of Pure and Applied Logic 69 73-106.
25. Jacobs, B. and Rutten, J. (1997) A tutorial on (co)algebras and (co)induction. EATCS Bulletin 62 222-259.
26. Joyal, A. (1985) Foncteurs analytiques et espaces de structures. In: Proceedings of a Colloquium on Enumerative Combinatorics. Springer-Verlag Lecture Notes in Computer Science 1234.
27. Joyal, A. and Moerdijk, I. (1994) A completeness theorem for open maps. Annals of Pure and Applied Logic 70 (1) 51-86.
28. Joyal, A., Nielsen, M. and Winskel, G. (1996) Bisimulation from open maps. Information and Computation 127 (2) 164-185.
29. Kelly, G. M. (1982) Basic Concepts of Enriched Category Theory. London Mathematical Society Lecture Notes Series 64, Cambridge University Press.
30. Kelly, G. M. and Laplaza, M. L. (1980) Coherence for compact closed categories. Journal of Pure and Applied Algebra 19 193-213.
31. Lawvere, F. W. (1973) Metric spaces, generalized logic and closed categories. Rend. Sem. Mat. Fis. Milano 43 135-166.
32. Lehmann, D. J. (1976) Categories for fixpoint semantics. In: Foundations of Computer Science 17.
33. Mac Lane, S. (1971) Categories for the Working Mathematician, Graduate Texts in Mathematics 5, Springer-Verlag.
34. Mac Lane, S. and Moerdijk, I. (1992) Sheaves in Geometry and Logic: A First Introduction to Topos Theory, Springer-Verlag.
35. Makkai, M. and Paré, R. (1989) Accessible Categories: The Foundations of Categorical Model Theory. Contemporary Mathematics 104.
36. Merro, M. and Nardelli, F. Z. (2003) Bisimulation Proof Methods for Mobile Ambients. In: ICALP'03, Int. Colloquium on Automata Languages and Programming. Springer-Verlag Lecture Notes in Computer Science 2719 584-598.
37. Milner, R. (1989) Communication and Concurrency, International Series in Computer Science, Prentice Hall.
38. Nygaard, M. (2001) Towards an operational understanding of presheaf models, Ph.D. progress report, BRICS, University of Aarhus.
39. Nygaard, M. and Winskel, G. (2002) Linearity in process languages. In: LICS '02, Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press.
40. Nygaard, M. and Winskel, G. (2004) Domain theory for concurrency. Theoretical Computer Science 316 (1) 153-190.
41. Paré, R. (1990) Simply connected limits. Canadian Journal of Mathematics XLII (4) 731-746.
42. Park, D. M. R. (1981) Concurrency and automata on infinite sequences. In: Theoretical Computer Science, 5th GL-conference. Springer-Verlag Lecture Noten in Computer Science 104.
43. Plotkin, G. D. (1976) A powerdomain construction. SIAM Journal of Computation 5 (3) 456-487.
44. Plotkin, G. D. (1983) Domains. Technical report, Department of Computer Science, University of Edinburgh. Includes the 'Pisa notes'.
45. Power, J. (1998) 2-Categories, BRICS Lecture Notes, University of Aarhus.
46. Power, J. and Tanaka, M. (2004) Pseudo-distributive laws and axiomatics for variable binding. (Submitted for publication.)
47. Seely, R. A. G. (1989) Linear logic, *-autonomous categories and cofree algebras. In: Gray, J. and Scedrov, A. (eds.) Categories in computer science and logic. Contemporary Mathematics 92 371-382.
48. Street, R. (1980) Fibrations in bicategories. Cahiers de Topologie et Géométrie Différentielle Catégoriques XXI (2) 111-160.
49. Tanaka, M. (2004) Pseudo-Distributive Laws and a Unified Framework for Variable Binding, Ph.D. thesis, University of Edinburgh. (Forthcoming.)
50. Tarski, A. (1955) A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5.
51. Winskel, G. (1996) A presheaf semantics of value-passing processes (extended abstract). In: Montanari, U. and Sassone, V. (eds.) CONCUR'96, Proceedings of the 7th International Conference on Concurrency Theory. Lecture Notes in Computer Science 1119 98-114.
52. Winskel, G. (1999) A linear metalanguage for concurrency. In: Proceedings of AMAST '98. Springer-Verlag Lecture Notes in Computer Science 1548. (Invited lecture.)
53. Winskel, G. (2004) Linearity and nonlinearity in distributed computation. In: Book on Linear Logic, Cambridge University Press (to appear.)
54. Winskel, G. and Nielsen, M. (1995) Models for concurrency. In: Handbook of logic in computer science 4, Oxford University Press 1-148.
55. Winskel, G. and Nielsen, M. (1997a) Models for concurrency. In: Pitts, A. M. and Dybjer, P. (eds.) Semantics and Logics of Computation, Cambridge University Press.
56. Winskel, G. and Nielsen, M. (1997b) Presheaves as transition systems. In: Peled, D., Pratt, V. and Holzmann, G. (eds.) Partial Order Methods in Verification. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 29 129-140.
57. Winskel, G. and Zappa Nardelli, F. (2004) New-hopla - a higher order process language with name generation. In: Proceedings TCS@2004, Third IFIP International Conference on Theoretical Computer Science, Kluwer.