Profunctors, open maps and bisimulation (2000)

Cached

Download Links

by Gian Luca Cattani , Glynn Winskel
Venue:Mathematical Structures in Computer Science, To appear. Available from the Glynn Winskel’s web
Citations:12 - 4 self

Active Bibliography

45 Presheaf Models for Concurrency – Gian Luca Cattani - 1999
3 Linearity and nonlinearity in distributed computation – Glynn Winskel
6 Categorical Models for Concurrency: Independence, Fairness and Dataflow – Thomas Troels Hildebrandt - 2000
18 A Categorical Axiomatics for Bisimulation – John Power, Glynn Winskel, Gian Luca Cattani, Gian Luca Cattani - 1998
Towards a Categorical Axiomatics of Bisimulation – Gian Luca Cattani, A. John Power, Glynn Winskel - 1999
8 Presheaf Models for CCS-like Languages – Glynn Winskel, Gian Luca Cattani - 1999
23 Domain theory for concurrency – Mikkel Nygaard - 2003
11 A Linear Metalanguage for Concurrency – Glynn Winskel, Glynn Winskel - 1998
13 Linearity in Process Languages – Mikkel Nygaard, et al.
Presheaf semantics for HOPLA – Mikkel Nygaard - 2002
23 A Theory of Recursive Domains with Applications to Concurrency – Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel - 1997
4 Weak Bisimulation and Open Maps (Extended Abstract) – Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel - 1999
33 A Presheaf Semantics of Value-Passing Processes – Glynn Winskel, Glynn Winskel - 1996
2 Categorical and Graphical Models of Programming Languages – Ralf Schweimeier - 2001
55 Initial Algebra and Final Coalgebra Semantics for Concurrency – Jan Rutten, Daniele Turi - 1994
Basic Research in Computer Science – Profunctors Open Maps, Gian Luca Cattani, Glynn Winskel, Copyright C, Gian Luca Cattani, Glynn Winskel, Gian Luca Cattani, Glynn Winskel - 2004
12 Relational Semantics of Non-Deterministic Dataflow – Thomas Troels Hildebrandt, Prakash Panangaden, Glynn Winskel - 1997
298 Universal coalgebra: a theory of systems – J. J. M. M. Rutten - 2000
263 Relations in Concurrency – Glynn Winskel