|
122
|
Towards a Mathematical Operational Semantics
– Daniele Turi, Gordon Plotkin
- 1997
|
|
169
|
Bisimulation Can’t Be Traced
– B Bloom, S Istrael, A Meyer
- 1995
|
|
156
|
N.: A Final Coalgebra Theorem
– P Aczel, Mendler
- 1989
|
|
1182
|
A Structural Approach to Operational Semantics
– G. D. Plotkin
- 1981
|
|
52
|
Initial Algebra and Final Coalgebra Semantics for Concurrency
– Jan Rutten, Daniele Turi
- 1994
|
|
38
|
Non-well-founded Sets. Number 14
– Peter Aczel
- 1988
|
|
117
|
Terminal coalgebras in well-founded set theory
– M Barr
- 1993
|
|
261
|
An initial algebra approach to the specification, correctness, and implementation of abstract data types
– J A Goguen, J W Thatcher, E G Wagner
- 1978
|
|
32
|
Bisimulation and Open Maps
– André Joyal, Mogens Nielsen, Glynn Winskel
- 1993
|
|
87
|
Full Abstraction for a Simple Parallel Programming Language
– M. C. B. Hennessy, G. D. Plotkin
- 1979
|
|
651
|
Notions of Computation and Monads
– Eugenio Moggi
- 1991
|
|
183
|
Structured operational semantics and bisimulation as a congruence
– J F Groote, F W Vaandrager
- 1992
|
|
56
|
Distributive laws
– J Beck
- 1969
|
|
54
|
Ntyft/ntyxt rules reduce to ntree rules
– Wan Fokkink, Rob Van Glabbeek
- 1996
|
|
62
|
Axiomatic Domain Theory in Categories of Partial Maps
– M P Fiore
- 1996
|
|
89
|
Algebraically complete categories
– P Freyd
- 1991
|
|
159
|
The Category-theoretic Solution of Recursive Domain Equations
– M Smyth, G D Plotkin
- 1982
|
|
53
|
Functorial Operational Semantics and its Denotational Dual
– D Turi
- 1996
|
|
69
|
Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach
– E.P. de Vink, J.J.M.M. Rutten
- 1998
|
