|
158
|
The category-theoretic solution of recursive domain equations
– M B Smyth, G D Plotkin
- 1982
|
|
37
|
A Coinduction Principle for Recursive Data Types Based on Bisimulation
– Marcelo P. Fiore
- 1996
|
|
156
|
N.: A Final Coalgebra Theorem
– P Aczel, Mendler
- 1989
|
|
60
|
Remarks on algebraically compact categories
– P Freyd
- 1991
|
|
597
|
Concurrency and automata on infinite sequences
– D M R Park
- 1981
|
|
115
|
A domain equation for bisimulation
– S Abramsky
- 1991
|
|
47
|
On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders
– Jan J. M. M. Rutten , Daniele Turi
- 1998
|
|
218
|
The Lazy Lambda Calculus
– Samson Abramsky
- 1990
|
|
73
|
Co-induction in relational semantics
– Robin Milner, Mads Tofte
- 1991
|
|
2970
|
Communication and Concurrency
– R Milner
- 1989
|
|
65
|
Recursive types reduced to inductive types
– P Freyd
- 1990
|
|
63
|
Solving reflexive domain equations in a category of complete metric spaces
– P America, J J M M Rutten
- 1989
|
|
102
|
Parametricity and Local Variables
– P. W. O'hearn, R. D. Tennent
- 1995
|
|
182
|
Categories for the working mathematician, volume 5 of Graduate Texts
– S Mac Lane
|
|
89
|
Algebraically complete categories
– P Freyd
- 1991
|
|
38
|
Non-well-founded Sets. Number 14
– Peter Aczel
- 1988
|
|
18
|
Parametrized data types do not need highly constrained parameters
– M A Arbib, E G Manes
- 1982
|
|
1497
|
The Definition of Standard ML
– R Milner, M Tofte, R Harper
- 1990
|
|
33
|
Algebraic specification of data types: A synthetic approach
– D Lehmann, M Smyth
- 1981
|
