|
156
|
N.: A Final Coalgebra Theorem
– P Aczel, Mendler
- 1989
|
|
52
|
Initial Algebra and Final Coalgebra Semantics for Concurrency
– Jan Rutten, Daniele Turi
- 1994
|
|
2970
|
Communication and Concurrency
– R Milner
- 1989
|
|
1182
|
A Structural Approach to Operational Semantics
– G. D. Plotkin
- 1981
|
|
115
|
A domain equation for bisimulation
– S Abramsky
- 1991
|
|
38
|
Non-well-founded Sets. Number 14
– Peter Aczel
- 1988
|
|
597
|
Concurrency and automata on infinite sequences
– D M R Park
- 1981
|
|
186
|
Non-well-founded sets
– P ACZEL
- 1988
|
|
242
|
Relations in Concurrency
– Glynn Winskel
|
|
117
|
Terminal coalgebras in well-founded set theory
– M Barr
- 1993
|
|
47
|
On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders
– Jan J. M. M. Rutten , Daniele Turi
- 1998
|
|
74
|
Algebra of Programming
– R BIRD, O DE MOOR
- 1997
|
|
275
|
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
– Erik Meijer, Maarten Fokkinga, Ross Paterson
- 1991
|
|
183
|
Structured operational semantics and bisimulation as a congruence
– J F Groote, F W Vaandrager
- 1992
|
|
19
|
A finite delay operator in synchronous CCS
– Robin Milner
- 1982
|
|
57
|
On the semantics of fair parallelism
– D Park
- 1980
|
|
15
|
Axiomatising Finite Delay Operators
– M Hennessy
- 1984
|
|
6
|
Non-well-founded Sets. CSLI lecture notes
– P Aczel
- 1988
|
|
53
|
Set-theory with free construction principles
– M Forti, F Honsell
- 1983
|
