A Coinduction Principle for Recursive Data Types Based on Bisimulation (1996)

Cached

Download Links

by Marcelo P. Fiore
Citations:37 - 3 self

Documents Related by Co-Citation

40 A Co-induction Principle for Recursively Defined Domains – Andrew M. Pitts - 1992
162 A final coalgebra theorem – Peter Aczel, Nax Mendler - 1989
169 The category-theoretic solution of recursive domain equations – M B Smyth, G D Plotkin - 1982
92 Algebraically complete categories – P Freyd - 1990
62 Remarks on algebraically compact categories – P J Freyd - 1991
67 Structural Induction and Coinduction in a Fibrational Setting – Claudio Hermida, Bart Jacobs - 1997
68 Solving reflexive domain equations in a category of complete metric spaces – P America, J J M M Rutten - 1989
48 On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders – Jan J. M. M. Rutten , Daniele Turi - 1998
658 Concurrency and automata on infinite sequences – D Park - 1981
99 Relational Properties of Domains – Andrew M. Pitts - 1996
274 An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types – J A Goguen, J W Thatcher, E G Wagner - 1978
239 The Lazy Lambda Calculus – Samson Abramsky - 1990
20 Parametrized Data Types Do Not Need Highly – M A Arbib, E G Manes - 1982
133 Terminal coalgebras in well-founded set theory, Theoretical Computer Science 114 – M Barr - 1993
37 Algebraic Specification of Data Types: A Synthetic Approach – D J Lehmann, M B Smyth - 1981
461 Domain Theory – Samson Abramsky, Achim Jung - 1994
218 Caotegories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics – S Mac Lane - 1971
123 A domain equation for bisimulation – S Abramsky - 1991
62 Axiomatic Domain Theory in Categories of Partial Maps – M P Fiore - 1994