A complete coinductive logical system for bisimulation equivalence on circular objects

DOI10.1007/3-540-49019-1_17MaRDI QIDQ4260710zbMATH OpenFDO

Authors Marina Lenisa

Publication date 22 November 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49019-1_17

zbMATH Keywords

bisimulation equivalencescategory of non-wellfounded setscircular non-wellfounded regular objectscircular objectscoalgebracoinductive logical systemcoinductive typesendofunctorfixed point semantics

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Recommendations

• Circular coinduction in Coq using bisimulation-up-to techniques
• Circular coinduction: a proof theoretical foundation
• Algebra and Coalgebra in Computer Science
• A duality in proof systems for recursive type equality and for bisimulation equivalence on cyclic term graphs
• Introduction to bisimulation and coinduction

Cited in

(1)

• Circular coinduction in Coq using bisimulation-up-to techniques

This page was built for publication: A complete coinductive logical system for bisimulation equivalence on circular objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4260710)