## Category-based Semantics for Equational and Constraint Logic Programming (1994)

Citations: | 24 - 10 self |

### BibTeX

@TECHREPORT{Diaconescu94category-basedsemantics,

author = {Razvan Diaconescu},

title = {Category-based Semantics for Equational and Constraint Logic Programming},

institution = {},

year = {1994}

}

### Years of Citing Articles

### OpenURL

### Abstract

This thesis proposes a general framework for equational logic programming, called categorybased equational logic by placing the general principles underlying the design of the programming language Eqlog and formulated by Goguen and Meseguer into an abstract form. This framework generalises equational deduction to an arbitrary category satisfying certain natural conditions; completeness is proved under a hypothesis of quantifier projectivity, using a semantic treatment that regards quantifiers as models rather than variables, and regards valuations as model morphisms rather than functions. This is used as a basis for a model theoretic category-based approach to a paramodulation-based operational semantics for equational logic programming languages. Category-based equational logic in conjunction with the theory of institutions is used to give mathematical foundations for modularisation in equational logic programming. We study the soundness and completeness problem for module imports i...