Sound and complete equational reasoning over comodels

DOI10.1016/j.entcs.2015.12.019zbMath1351.68078OpenAlexW2202809771WikidataQ113317722 ScholiaQ113317722MaRDI QIDQ5971406

Lutz Schröder, Dirk Pattinson

Publication date: 16 December 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2015.12.019

zbMATH Keywords

completenessequational logicbisimulationcomodels

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Theories (e.g., algebraic theories), structure, and semantics (18C10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Stream processors and comodels ⋮ The costructure–cosemantics adjunction for comodels for computational effects

Uses Software

• CIRC
• Cyclist

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dualizing clones as models of Lawvere theories.
• Circular Coinduction: A Proof Theoretical Foundation
• CIRC: A Behavioral Verification Tool Based on Circular Coinduction
• Mixed Inductive/Coinductive Types and Strong Normalization
• Comodels and Effects in Mathematical Operational Semantics
• A GENERAL DUALITY THEORY FOR CLONES
• Linear usage of state
• Tensors of Comodels and Models for Operational Semantics
• Algebra and Coalgebra in Computer Science

This page was built for publication: Sound and complete equational reasoning over comodels