Proving semantical equivalence of data specifications

DOI10.1016/S0022-4049(96)00168-5zbMath0867.68080MaRDI QIDQ678825

Frank Piessens, Eric Steegmans

Publication date: 16 July 1997

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

zbMATH Keywords

equivalence problemcategories of finite modelsdata specificationessentially algebraic specificationsketchesview integration problem

Mathematics Subject Classification ID

Database theory (68P15) Abstract data types; algebraic specification (68Q65) Theories (e.g., algebraic theories), structure, and semantics (18C10) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Partial algebras (08A55) Functor categories, comma categories (18A25)

Related Items

Relaxed models for rewriting logic ⋮ A Diagrammatic Logic for Object-Oriented Visual Modeling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• Generalized sketches as a framework for completeness theorems. I-III
• A completion procedure for conditional equations
• A generalization of the concept of sketch
• Conditional rewrite rules
• Left exact logic
• Completeness results for intuitionistic and modal logic in a categorical setting
• Aspects of topoi