A categorical unification algorithm
Proceedings of a tutorial and workshop on Category theory and computer programming
Category theory for computing science
Category theory for computing science
Handbook of theoretical computer science (vol. B)
An algebraic semantics for structured transition systems and its application to logic programs
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Abstract interpretation and application to logic programs
Journal of Logic Programming
A general framework for semantics-based bottom-up abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A compositional semantics for logic programs
FGCS'921 Selected papers of the conference on Fifth generation computer systems
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Theory of observables for logic programs
Information and Computation
Encapsulating Data in Logic Programming via Categorial Constraints
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
A Fibrational Semantics for Logic Programs
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Logic Programming in Tau Categories
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
A Categorial Model for Logic Programs: Indexed Monoidal Categories
Proceedings of the REX Workshop on Sematics: Foundations and Applications
A Hyperdoctrinal View of Concurrent Constraint Programming
Proceedings of the REX Workshop on Sematics: Foundations and Applications
A new framework for declarative programming
Theoretical Computer Science
| Hi-index | 0.00 |
We propose a categorical framework which formalizes and extends the syntax, operational semantics and declarative model theory of a broad range of logic programming languages. A program is interpreted in an indexed category in such a way that the base category contains all the possible states which can occur during the execution of the program (such as global constraints or type information), while each fiber encodes the logic at each state. We define appropriate notions of categorical resolution and models, and we prove the related correctness and completeness properties.