A Co-induction Principle for Recursively Defined Domains (0)

Cached

Download Links

by Andrew Pitts
Venue:Theoretical Computer Science
Citations:40 - 3 self

Documents Related by Co-Citation

169 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
162 A final coalgebra theorem – Peter Aczel, Nax Mendler - 1989
658 Concurrency and automata on infinite sequences – D Park - 1981
62 Remarks on algebraically compact categories – P J Freyd - 1991
123 A domain equation for bisimulation – S Abramsky - 1991
48 On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders – Jan J. M. M. Rutten , Daniele Turi - 1998
239 The Lazy Lambda Calculus – Samson Abramsky - 1990
77 Co-induction in relational semantics – R Milner, M Tofte - 1991
3219 Communication and Concurrency – R Milner - 1990
68 Recursive Types Reduced to Inductive Types – P Freyd - 1990
68 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
218 Caotegories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics – S Mac Lane - 1971
92 Algebraically complete categories – P Freyd - 1990
46 Non-well-founded sets. Number 14 – P Aczel - 1988
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
20 Parametrized Data Types Do Not Need Highly – M A Arbib, E G Manes - 1982
37 Algebraic Specification of Data Types: A Synthetic Approach – D J Lehmann, M B Smyth - 1981