Bisimulation proof methods in a path-based specification language for polynomial coalgebras
From MaRDI portal
Publication:5740639
DOI10.1017/S0960129513000030zbMath1361.68156MaRDI QIDQ5740639
Haiyan Qiao, Wenjun Li, Xiaocong Zhou, Yong-Ji Li, Zhongmei Shu
Publication date: 27 July 2016
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Cites Work
- Coalgebras in functional programming and type theory
- Coalgebraic semantics of modal logics: an overview
- Simulations in coalgebra
- Coalgebraic logic
- Observational ultraproducts of polynomial coalgebras.
- Universal coalgebra: A theory of systems
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- A modal proof theory for final polynomial coalgebras
- Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study
- Bisimulations Generated from Corecursive Equations
- On the bisimulation proof method
- Generalised coinduction
- A Relationship between Equilogical Spaces and Type Two Effectivity
- Specifying coalgebras with modal logic
- From modal logic to terminal coalgebras
This page was built for publication: Bisimulation proof methods in a path-based specification language for polynomial coalgebras
