Coinduction for recursive data types: partial orders, metric spaces and Ω-categories.
Open Access
- 31 December 2000
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 33, 337-356
- https://doi.org/10.1016/s1571-0661(05)80356-1
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A final coalgebra theoremPublished by Springer Nature ,2005
- Hidden coinduction: behavioural correctness proofs for objectsMathematical Structures in Computer Science, 1999
- Relators and Metric Bisimulations: (Extended Abstract)Electronic Notes in Theoretical Computer Science, 1998
- On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spacesMathematical Structures in Computer Science, 1998
- Liminf convergence in Ω-categoriesTheoretical Computer Science, 1997
- Elements of generalized ultrametric domain theoryTheoretical Computer Science, 1996
- A Coinduction Principle for Recursive Data Types Based on BisimulationInformation and Computation, 1996
- A co-induction principle for recursively defined domainsTheoretical Computer Science, 1994
- Bisimulation through probabilistic testingInformation and Computation, 1991
- An axiomatics for bicategories of modulesJournal of Pure and Applied Algebra, 1987