Coinduction for preordered algebra
From MaRDI portal
Publication:627121
DOI10.1016/J.IC.2010.11.001zbMATH Open1206.68197OpenAlexW2042019683MaRDI QIDQ627121FDOQ627121
Authors: 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
Recommendations
coinductionhidden algebrarewriting logicCafeOBJheterogeneous specificationbehavioural specificationbehavioural transitionpreordered algebra
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Institution-independent model theory
- A hidden agenda
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional rewriting logic as a unified model of concurrency
- Title not available (Why is that?)
- Logical foundations of CafeOBJ
- Constructor-based observational logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
- Foundations for structuring behavioural specifications
- CafeOBJ Traces
- Title not available (Why is that?)
- Behavioral equivalence of hidden \(k\)-logics: an abstract algebraic approach
- A short overview of hidden logic
- Encoding hybridized institutions into first-order logic
- Coinductive formulas and a many-sorted interpolation theorem
Uses Software
This page was built for publication: Coinduction for preordered algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627121)
