We develop a compilation scheme and categorical abstract machine for execution of logic programs based on allegories, the categorical version of the calculus of relations. Operational and denotational semantics are developed using the same formalism, and query execution is performed using algebraic reasoning. Our work serves two purposes: achieving a formal model of a logic programming compiler and efficient runtime; building the base for incorporating features typical of functional programming in a declarative way, while maintaining 100% compatibility with existing Prolog programs
We construct Scott domains well suited to use in an abstract implementation of logic programming, an...
This thesis proposes a general framework for equational logic programming, called category-based equ...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...
Abstract. We propose a categorical framework which formalizes and extends the syntax, operational se...
El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarroll...
Logic programming and its variations are widely used for formal reasoning in various areas of Comput...
AbstractWe develop an algebraic framework, Logic Programming Doctrines, for the syntax, proof theory...
AbstractWe propose a new framework for the syntax and semantics of Weak Hereditarily Harrop logic pr...
A novel logic-based framework for representing the syntax–semantics interface of natural language, a...
Logic programming employs logic as a programming language. Thus a logic program consists of a set of...
We define a framework for writing executable declarative specifications which incorporate categorica...
AbstractThe first half is a tutorial on orderings, lattices, Boolean algebras, operators on Boolean ...
This paper presents a compiler from expressive, relational specifications to logic programs. Specifi...
AbstractA simple extension of logic programming consists of introducing a set of basic program compo...
AbstractLDL—Logical Data Language—is a language developed at MCC. The language supports various exte...
We construct Scott domains well suited to use in an abstract implementation of logic programming, an...
This thesis proposes a general framework for equational logic programming, called category-based equ...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...
Abstract. We propose a categorical framework which formalizes and extends the syntax, operational se...
El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarroll...
Logic programming and its variations are widely used for formal reasoning in various areas of Comput...
AbstractWe develop an algebraic framework, Logic Programming Doctrines, for the syntax, proof theory...
AbstractWe propose a new framework for the syntax and semantics of Weak Hereditarily Harrop logic pr...
A novel logic-based framework for representing the syntax–semantics interface of natural language, a...
Logic programming employs logic as a programming language. Thus a logic program consists of a set of...
We define a framework for writing executable declarative specifications which incorporate categorica...
AbstractThe first half is a tutorial on orderings, lattices, Boolean algebras, operators on Boolean ...
This paper presents a compiler from expressive, relational specifications to logic programs. Specifi...
AbstractA simple extension of logic programming consists of introducing a set of basic program compo...
AbstractLDL—Logical Data Language—is a language developed at MCC. The language supports various exte...
We construct Scott domains well suited to use in an abstract implementation of logic programming, an...
This thesis proposes a general framework for equational logic programming, called category-based equ...
AbstractThe Cartesian closed categories have been shown by several authors to provide the right fram...