Initial Algebra and Final Coalgebra Semantics for Concurrency (1994)

Cached

Download Links

by Jan Rutten , Daniele Turi
Citations:55 - 9 self

Documents Related by Co-Citation

162 A final coalgebra theorem – Peter Aczel, Nax Mendler - 1989
133 Terminal coalgebras in well-founded set theory, Theoretical Computer Science 114 – M Barr - 1993
134 Towards a Mathematical Operational Semantics – Daniele Turi, Gordon Plotkin - 1997
1290 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
658 Concurrency and automata on infinite sequences – D Park - 1981
53 Functorial Operational Semantics and its Denotational Dual – D Turi - 1996
298 Universal coalgebra: a theory of systems – J. J. M. M. Rutten - 2000
169 The category-theoretic solution of recursive domain equations – M B Smyth, G D Plotkin - 1982
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
92 An approach to object semantics based on terminal coalgebras – H Reichel - 1995
46 Non-well-founded sets. Number 14 – P Aczel - 1988
116 Bisimulation from Open Maps – André Joyal, Mogens Nielsen, Mogens Nielsen, Glynn Winskel, Glynn Winskel - 1994
37 A Coinduction Principle for Recursive Data Types Based on Bisimulation – Marcelo P. Fiore - 1996
54 Set theory with free construction principles. Annali della Scuola Normale Superiore di Pisa, Classe di Scienze, 4 e série – Marco Forti, Furio Honsell - 1983
20 Processes as terms: Non-well-founded models for bisimulation – J J M M Rutten - 1992
189 Structured Operational Semantics and Bisimulation as a Congruence, Information and Computation 100 – J F Groote, F Vaandrager - 1992
3219 Communication and Concurrency – R Milner - 1990
75 Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach – E.P. de Vink, J.J.M.M. Rutten - 1998
730 Notions of Computation and Monads – Eugenio Moggi - 1991