Coinduction for preordered algebra

DOI10.1016/j.ic.2010.11.001zbMath1206.68197OpenAlexW2042019683MaRDI QIDQ627121

Răzvan Diaconescu

Publication date: 21 February 2011

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

Full work available at URL: https://doi.org/10.1016/j.ic.2010.11.001

zbMATH Keywords

coinductionrewriting logichidden algebraCafeOBJheterogeneous specificationbehavioural specificationbehavioural transitionpreordered algebra

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items

Behavioral equivalence of hidden \(k\)-logics: an abstract algebraic approach ⋮ A short overview of Hidden Logic ⋮ Foundations for structuring behavioural specifications ⋮ CafeOBJ Traces ⋮ Encoding hybridized institutions into first-order logic

Uses Software

• CafeOBJ
• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Conditional rewriting logic as a unified model of concurrency
• A hidden agenda
• Logical foundations of CafeOBJ
• Constructor-based observational logic
• Institution-independent model theory

This page was built for publication: Coinduction for preordered algebra