On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders

On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders (1998)

by Jan J. M. M. Rutten , Daniele Turi

Venue:	PROCEEDINGS OF THE REX WORKSHOP ON SEMANTICS: FOUNDATIONS AND APPLICATIONS, VOLUME 666 OF LECTURE NOTES IN COMPUTER SCIENCE
Citations:	47 - 10 self

156	N.: A Final Coalgebra Theorem – P Aczel, Mendler - 1989
117	Terminal coalgebras in well-founded set theory – M Barr - 1993
279	Universal coalgebra: a theory of systems – J. J. M. M. Rutten - 2000
597	Concurrency and automata on infinite sequences – D M R Park - 1981
18	Parametrized data types do not need highly constrained parameters – M A Arbib, E G Manes - 1982
39	A Co-induction Principle for Recursively Defined Domains – Andrew Pitts
186	Non-well-founded sets – P ACZEL - 1988
53	Functorial Operational Semantics and its Denotational Dual – D Turi - 1996
2970	Communication and Concurrency – R Milner - 1989
90	An approach to object semantics based on terminal co-algebras – H Reichel - 1995
38	Non-well-founded Sets. Number 14 – Peter Aczel - 1988
158	The category-theoretic solution of recursive domain equations – M B Smyth, G D Plotkin - 1982
63	Solving reflexive domain equations in a category of complete metric spaces – P America, J J M M Rutten - 1989
37	A Coinduction Principle for Recursive Data Types Based on Bisimulation – Marcelo P. Fiore - 1996
122	Towards a Mathematical Operational Semantics – Daniele Turi, Gordon Plotkin - 1997
182	Categories for the working mathematician, volume 5 of Graduate Texts – S Mac Lane
52	Initial Algebra and Final Coalgebra Semantics for Concurrency – Jan Rutten, Daniele Turi - 1994
33	The category theoretic solution of recursive domain equations – M Smyth, G Plotkin - 1982
1224	A calculus of communicating systems – R Milner - 1980