Final Universes of Processes (1994)

Cached

Download Links

by Peter Aczel
Venue:PROC. MATH. FOUNDATIONS OF PROGRAMMING SEMANTICS. SPRINGER LECT. NOTES COMP. SCI. (802
Citations:19 - 1 self

Documents Related by Co-Citation

55 Initial Algebra and Final Coalgebra Semantics for Concurrency – Jan Rutten, Daniele Turi - 1994
162 A final coalgebra theorem – Peter Aczel, Nax Mendler - 1989
1290 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
46 Non-well-founded sets. Number 14 – P Aczel - 1988
3219 Communication and Concurrency – R Milner - 1990
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
123 A domain equation for bisimulation – S Abramsky - 1991
658 Concurrency and automata on infinite sequences – D Park - 1981
202 Non–Well–Founded Sets – P Aczel - 1988
196 Bisimulation can’t be traced – B Bloom, S Istrail, A R Meyer - 1995
189 Structured Operational Semantics and Bisimulation as a Congruence, Information and Computation 100 – J F Groote, F Vaandrager - 1992
263 Relations in Concurrency – Glynn Winskel
16 Axiomatising finite delay operators – Matthew Hennessy - 1984
7 Non-Well-Founded Sets. CSLI lecture notes – P ACZEL - 1988
133 Terminal coalgebras in well-founded set theory, Theoretical Computer Science 114 – M Barr - 1993
48 On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders – Jan J. M. M. Rutten , Daniele Turi - 1998
86 Algebra of Programming – R Bird, O de Moor - 1997
299 Programming with bananas, lenses, envelopes and barbed wire – Erik Meijer, Maarten Fokkinga, Ross Paterson - 1991
134 Towards a Mathematical Operational Semantics – Daniele Turi, Gordon Plotkin - 1997