Category-based modularisation for equational logic programming
From MaRDI portal
Publication:1901708
DOI10.1007/s002360050054zbMath0849.68012OpenAlexW2043675079MaRDI QIDQ1901708
Publication date: 19 November 1995
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050054
completenesssoundnessmodularisationcompiler correctnesslogic-based programmingcategory-based equational logiccategory-based semantics
Theory of compilers and interpreters (68N20) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17) Theories (e.g., algebraic theories), structure, and semantics (18C10)
Related Items (2)
An introduction to category-based equational logic ⋮ Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the existence of free models in abstract algebraic institutions
- On observational equivalence and algebraic specification
- Quasi-varieties in abstract algebraic institutions
- Specifications in an arbitrary institution
- A simple algebraic proof of the equational interpolation theorem
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- The formal theory of monads
- Computing with rewrite systems
- Axioms for abstract model theory
- Institutions: abstract model theory for specification and programming
- An Oxford survey of order sorted algebra
- Completeness of category-based equational deduction
- Proving and rewriting
This page was built for publication: Category-based modularisation for equational logic programming
