Generalised coinduction

DOI10.1017/S0960129502003900zbMath1025.18002OpenAlexW4296395898MaRDI QIDQ4408808

Falk Bartels

Publication date: 27 November 2003

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129502003900

zbMATH Keywords

coalgebrabisimulationcoinductioncomputer system modelsproof schemata

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Related Items (17)

Unnamed Item ⋮ A coalgebraic approach to the semantics of the ambient calculus ⋮ A coinductive calculus for asynchronous side-effecting processes ⋮ Unifying structured recursion schemes ⋮ Unguarded recursion on coinductive resumptions ⋮ Concrete stream calculus: An extended study ⋮ A general account of coinduction up-to ⋮ The Recursion Scheme from the Cofree Recursive Comonad ⋮ \(p\)-adic physics, non-well-founded reality and unconventional computing ⋮ Bisimulation proof methods in a path-based specification language for polynomial coalgebras ⋮ Recursive coalgebras from comonads ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Steps and traces ⋮ A Coinductive Calculus for Asynchronous Side-Effecting Processes ⋮ Generalizing Substitution ⋮ GSOS for probabilistic transition systems ⋮ Corecursion up-to via causal transformations

This page was built for publication: Generalised coinduction