Quasi-Boolean encodings and conditionals in algebraic specification

DOI10.1016/j.jlap.2009.09.001zbMath1187.68322OpenAlexW2010121058MaRDI QIDQ844886

Răzvan Diaconescu

Publication date: 5 February 2010

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2009.09.001

zbMATH Keywords

Boolean algebraalgebraic specificationencodingsinstitution theoryCafeOBJOBJ

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items

Behavioral equivalence of hidden \(k\)-logics: an abstract algebraic approach ⋮ Introducing \(H\), an institution-based formal specification and verification language ⋮ Encoding hybridized institutions into first-order logic

Uses Software

• CASL
• OBJ3
• CafeOBJ
• Hets

Cites Work

• Institution morphisms
• On the existence of free models in abstract algebraic institutions
• Quasi-varieties in abstract algebraic institutions
• Specifications in an arbitrary institution
• Conditional rewriting logic as a unified model of concurrency
• Logical foundations of CafeOBJ
• Relating CASL with other specification languages: the institution level.
• Constructor-based observational logic
• Institution-independent model theory
• Institutions: abstract model theory for specification and programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item