A coinduction principle for recursive data types based on bisimulation

DOI10.1006/inco.1996.0058zbMath0868.68054OpenAlexW2156829867MaRDI QIDQ1923102

Marcelo P. Fiore

Publication date: 17 August 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.0058

zbMATH Keywords

bisimulationbisimulationsconcurrency theory

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (6)

Bialgebraic Semantics and Recursion ⋮ Simulations in coalgebra ⋮ Induction and recursion on the partial real line with applications to Real PCF ⋮ Structural induction and coinduction in a fibrational setting ⋮ Universal coalgebra: A theory of systems ⋮ A coinductive completeness proof for the equivalence of recursive types

This page was built for publication: A coinduction principle for recursive data types based on bisimulation