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

Cached

Download Links

by Marcelo P. Fiore
Citations:37 - 3 self

Active Bibliography

45 Presheaf Models for Concurrency – Gian Luca Cattani - 1999
30 On the Foundations of Final Coalgebra Semantics: non-well-founded sets, partial orders, metric spaces – Daniele Turi, Jan Rutten - 1998
99 Relational Properties of Domains – Andrew M. Pitts - 1996
7 A Structural Co-Induction Theorem – J. J. M. M. Rutten - 1993
23 Correspondence between Operational and Denotational Semantics – C. -h. L. Ong - 1995
47 On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders – Jan J. M. M. Rutten , Daniele Turi - 1998
40 A Co-induction Principle for Recursively Defined Domains – Andrew M. Pitts - 1992
297 Universal coalgebra: a theory of systems – J. J. M. M. Rutten - 2000
5 Themes in Final Semantics – Marina Lenisa - 1998
4 Coinduction for recursive data types: partial orders, metric spaces and Omega-categories – James Worrell - 2000
10 Topology, Domain Theory and Theoretical Computer Science – Michael W. Mislove - 1997
Axioms for Asynchronous Processes – Eleftherios Matsikoudis, Eleftherios Matsikoudis, Eleftherios Matsikoudis, Eleftherios Matsikoudis
23 A Theory of Recursive Domains with Applications to Concurrency – Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel - 1997
29 Domains and Denotational Semantics: History, Accomplishments and Open Problems – Marcelo Fiore, Achim Jung, Eugenio Moggi, Peter O'Hearn, Jon Riecke, Giuseppe Rosolini, Ian Stark - 1996
15 From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems – Marina Lenisa - 1999
18 Higher Order Logic – Daniel Leivant - 1994
2 Final Coalgebras as Greatest Fixed Points in ZF Set Theory – Lawrence C. Paulson, L. C. Paulson - 1999
37 Recursive Subtyping Revealed – Vladimir Gapeyev, Michael Levin, Benjamin Pierce - 2000
2 A Fully Abstract Denotational Model for Observational Congruence – Anna Ingólfsdóttir, Andrea Schalk - 1995