A polymorphic type system for PROLOG.
Artificial Intelligence
Introduction to higher order categorical logic
Introduction to higher order categorical logic
Proceedings of a tutorial and workshop on Category theory and computer programming
Proceedings of a tutorial and workshop on Category theory and computer programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proofs and types
A logical analysis of modules in logic programming
Journal of Logic Programming
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Constraint logic programming languages
Communications of the ACM
A functional theory of exceptions
Science of Computer Programming
Category theory for computing science
Category theory for computing science
Journal of the ACM (JACM)
On functors expressible in the polymorphic lambda calculus
Logical foundations of functional programming
Notions of computation and monads
Information and Computation
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
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
Abstract interpretation and application to logic programs
Journal of Logic Programming
Types in logic programming
A general framework for semantics-based bottom-up abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A model-theoretic reconstruction of the operational semantics of logic programs
Information and Computation
Categories, relations and dynamic programming
Categories, relations and dynamic programming
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
A compositional semantics for logic programs
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Abstraction interpretation and partial evaluation in functional and logic programming
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Negation and constraint logic programming
Information and Computation
Proof theoretic approach to specification languages
Proof theoretic approach to specification languages
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
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 Categorical Unification Algorithm
Proceedings of the Tutorial and Workshop on Category Theory and Computer Programming
Indexed Categories and Bottom-Up Semantics of Logic Programs
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Providing declarative semantics for HH extended constraint logic programs
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
On the algebraic structure of declarative programming languages
Theoretical Computer Science
Testing concurrent systems: an interpretation of intuitionistic logic
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 5.23 |
We propose a new framework for the syntax and semantics of Weak Hereditarily Harrop logic programming with constraints, based on resolution over τ-categories: finite product categories with canonical structure.Constraint information is directly built-in to the notion of signature via categorical syntax. Many-sorted equational are a special case of the formalism which combines features of uniform logic programming languages (moduels and hypothetical implication) with those of constraint logic programming. Using the cannoical structure supplied by τ-categories, we define a diagrammatic generalization of formulas, goals, programs and resolution proofs up to equality (rather than just up to isomorphism).We extend the Kowalski-van Emden fixed point interpretation, a cornerstone of declarative semantics, to an operational, non-ground, categorical semantics based on indexing over sorts and programs.We also introduce a topos-theoretic declarative semantics and show soundness and completeness of resolution proofs and of a sequent calculus over the categorical signature. We conclude with a discussion of semantic perspectives on uniform logic programming.