Logical foundations of CafeOBJ

DOI10.1016/S0304-3975(01)00361-9zbMath1001.68079MaRDI QIDQ1608919

Răzvan Diaconescu, Kokichi Futatsugi

Publication date: 13 August 2002

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

zbMATH Keywords

institutionsalgebraic specificationCafeOBJbehavioural specification

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (24)

Foundations of logic programming in hybrid logics with user-defined sharing ⋮ Rewriting logic: Roadmap and bibliography ⋮ Constructor-Based Institutions ⋮ Interpolation in Grothendieck institutions ⋮ Quasi-Boolean encodings and conditionals in algebraic specification ⋮ Herbrand theorems in arbitrary institutions ⋮ Principles of proof scores in CafeOBJ ⋮ Birkhoff style calculi for hybrid logics ⋮ Foundations for structuring behavioural specifications ⋮ Coinduction for preordered algebra ⋮ How to prove decidability of equational theories with second-order computation analyser SOL ⋮ From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories ⋮ Grothendieck inclusion systems ⋮ CafeOBJ Traces ⋮ Parchments for CafeOBJ Logics ⋮ On Automation of OTS/CafeOBJ Method ⋮ Strategies, model checking and branching-time properties in Maude ⋮ Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally ⋮ Model-Driven Engineering in the Heterogeneous Tool Set ⋮ A semantic approach to interpolation ⋮ Hybrid Specification of Reactive Systems: An Institutional Approach ⋮ Foundations of the rule-based system ρLog ⋮ Comparing Meseguer's Rewriting Logic with the Logic CRWL ⋮ Behavioural specification for hierarchical object composition

Uses Software

• OBJ3
• CafeOBJ
• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some fundamental algebraic tools for the semantics of computation. III: Indexed categories
• Conditional rewriting logic as a unified model of concurrency
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Indexed categories and their applications
• Extra theory morphisms for institutions: Logical semantics for multi-paradigm languages
• A hidden agenda
• Constructor-based observational logic
• Institutions: abstract model theory for specification and programming
• An Oxford survey of order sorted algebra
• Weak inclusion systems
• Category-based constraint logic
• Completeness of category-based equational deduction
• Equality, types, modules, and (why not?) generics for logic programming

This page was built for publication: Logical foundations of CafeOBJ