Bisimulation and Open Maps (1993)

Cached

Download Links

by André Joyal , Mogens Nielsen , Glynn Winskel
Venue:In Proc. LICS'93, Eighth Annual Symposium on Logic in Computer Science
Citations:36 - 7 self

Documents Related by Co-Citation

3219 Communication and Concurrency – R Milner - 1990
133 Terminal coalgebras in well-founded set theory, Theoretical Computer Science 114 – M Barr - 1993
1290 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
658 Concurrency and automata on infinite sequences – D Park - 1981
196 Bisimulation can’t be traced – B Bloom, S Istrail, A R Meyer - 1995
55 Initial Algebra and Final Coalgebra Semantics for Concurrency – Jan Rutten, Daniele Turi - 1994
263 Relations in Concurrency – Glynn Winskel
274 An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types – J A Goguen, J W Thatcher, E G Wagner - 1978
162 A final coalgebra theorem – Peter Aczel, Nax Mendler - 1989
1330 A Calculus of Communicating Systems – R Milner - 1980
90 Categories of asynchronous systems – M A Bednarczyk - 1988
202 Non–Well–Founded Sets – P Aczel - 1988
20 Interaction categories (extended abstract – S Abramsky - 1993
78 Cartesian bicategories I – A Carboni, R F C Walters - 1987
42 A completeness theorem for open maps – A Joyal, I Moerdijk - 1994
7 SProc Categorically – J.R.B. Cockett, D. A. Spooner - 1994
18 Lifting theorems for Kleisli categories – Philip S Mulry - 1993
210 Games and Full Completeness for Multiplicative Linear Logic – Samson Abramsky, Radha Jagadeesan - 1994
312 Calculi for synchrony and asynchrony – R Milner - 1983