Results 11 
18 of
18
Imagining CLP(. . .
, 1994
"... We study under which conditions the domain of terms () and the equality theory of the calculus (j fffi ) form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom j, and the formula language must depart from Horn clauses ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study under which conditions the domain of terms () and the equality theory of the calculus (j fffi ) form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom j, and the formula language must depart from Horn clauses and accept universal quantifications and implications in goals. In short, CLP(, j fffi ) must be close to Prolog.
The Metalanguage Prolog and Its Implementation
"... Stimulated by concerns of software certi cation especially as it relates to mobile code, formal structures such as speci cations and proofs are beginning to play an explicit role in computing. In representing and manipulating such structures, an approach is needed that pays attention to the bi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Stimulated by concerns of software certi cation especially as it relates to mobile code, formal structures such as speci cations and proofs are beginning to play an explicit role in computing. In representing and manipulating such structures, an approach is needed that pays attention to the binding operation that is present in them. The language Prolog provides programming support for a higherorder treatment of abstract syntax that is especially suited to this task. This support is realized by enhancing the traditional strength of logic programming in the metalanguage realm with an ability for dealing directly with binding structure. This paper identi es the features of Prolog that endow it with such a capability, illustrates their use and and describes methods for their implementation. Also discussed is a new realization of Prolog called Teyjus that incorporates the implementation ideas presented.
An Explicit Substitution Notation in a λProlog Implementation
 DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF CHICAGO
, 1998
"... This abstract has a pragmatic intent: it explains the use of an explicit substitution notation in an implementation of the higherorder logic programming language λProlog. The particular aspects of this language that are of interest here are its provision of typed lambda terms as a means ..."
Abstract
 Add to MetaCart
This abstract has a pragmatic intent: it explains the use of an explicit substitution notation in an implementation of the higherorder logic programming language &lambda;Prolog. The particular aspects of this language that are of interest here are its provision of typed lambda terms as a means for representing objects and of higherorder unification as a tool for probing the structures of these objects. There are many uses for these facilities originating from the fact that they lead to direct and declarative support for a higherorder abstract syntax view of objects such as formulas and programs [MN87, PE88]. Detailed discussions of applications can be found in the literature, e.g. see [Fel93, HM92, NM94, Per91, Pfe88]. Success encountered in these various experiments has driven an effort on our part towards developing a good implementation of the language. An important ingredient of such an implementation is, of course, a sensible treatment of lambda terms. The use that is made of...
I R I S a
, 1994
"... : We study under which conditions the domain of terms () and the equality theory of the calculus (j fffi ) form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom j, and the formula language must depart from Horn clause ..."
Abstract
 Add to MetaCart
: We study under which conditions the domain of terms () and the equality theory of the calculus (j fffi ) form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom j, and the formula language must depart from Horn clauses and accept universal quantifications and implications in goals. In short, CLP(, j fffi ) must be close to Prolog. Keywords: CLP, Calculus, Prolog (R'esum'e : tsvp) ridoux@irisa.fr Centre National de la Recherche Scientifique Institut National de Recherche en Informatique (URA 227) Universite de Rennes 1  Insa de Rennes et en Automatique  unite de recherche de Rennes Imaginons CLP(,j fffi ) R'esum'e : Nous 'etudions sous quelles conditions le domaine des termes () et la th'eorie de l"egalit'e du calcul (j fffi ) forment une base utilisable pour un langage de programmation logique par contrainte (CLP). Les conditions sont que la th'eorie de l"egalit'e doit aussi contenir l'axio...
Logic Programming with Monads and Comprehensions
"... We give a logical reconstruction of allsolution predicates in terms of list comprehensions in Prolog's and we describe a variety of logic programming constructs in terms of monads and monad morphisms. Novel monad structures are described for lazy function lists, clause unfoldings and a mon ..."
Abstract
 Add to MetaCart
We give a logical reconstruction of allsolution predicates in terms of list comprehensions in Prolog's and we describe a variety of logic programming constructs in terms of monads and monad morphisms. Novel monad structures are described for lazy function lists, clause unfoldings and a monad morphism based embedding of Prolog in Prolog is given. Keywords: computing paradigms, logic programming, monads, list comprehensions, all solution predicates, Prolog, higherorder unification, lazy function lists. 1 Introduction Monads and comprehensions, have been successfully used in functional programming as a convenient generalization of various structurally similar programming constructs starting with simple ones like list processing and ending with intricate ones like CPS transformations and state transformers. We refer to the work of Philip Wadler [16, 17] for a long list of powerful examples and to Moggi [10] for the categorist sources of the concept of monad. Allsolution predic...
Imagining CLP(Λ,≡αβ)
, 1995
"... . We study under which conditions the domain of terms () and the equality theory of the calculus (j fffi ) form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom j, and the formula language must depart from Horn clause ..."
Abstract
 Add to MetaCart
. We study under which conditions the domain of terms () and the equality theory of the calculus (j fffi ) form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom j, and the formula language must depart from Horn clauses and accept universal quantifications and implications in goals. In short, CLP(, j fffi ) must be close to Prolog. 1 Introduction Logic programming is a programming paradigm in which programs are logical formulas, and executing them amounts to search for a proof. The most famous practical incarnation of logic programming is Prolog, which is based on Horn formulas [31]. The formalism of Horn programs is computationally complete [1, 49], but one has often tried to augment it to gain more flexibility and expressivity. One of these attempts is the paradigm of constraint logic programming [11, 27, 10, 50]. It amounts to replacing unification of firstorder terms, considered as a procedure for s...
Die andere Methode, gleichheitsbasierte Transformation von ‘Continuations ’ (‘Equalitybased
, 1992
"... Prologprogrammen vorgestellt und mit den bisherigen Techniken verglichen. ..."
Abstract
 Add to MetaCart
(Show Context)
Prologprogrammen vorgestellt und mit den bisherigen Techniken verglichen.
Abstract Collection Analysis for Horn Clause Programs
"... We consider approximating data structures with collections of the items that they contain. For examples, lists, binary trees, tuples, etc, can be approximated by sets or multisets of the items within them. Such approximations can be used to provide partial correctness properties of logic programs. F ..."
Abstract
 Add to MetaCart
(Show Context)
We consider approximating data structures with collections of the items that they contain. For examples, lists, binary trees, tuples, etc, can be approximated by sets or multisets of the items within them. Such approximations can be used to provide partial correctness properties of logic programs. For example, one might wish to specify than whenever the atom sort(t, s) is proved then the two lists t and s contain the same multiset of items (that is, s is a permutation of t). If sorting removes duplicates, then one would like to infer that the sets of items underlying t and s are the same. Such results could be useful to have if they can be determined statically and automatically. We present a scheme by which such collection analysis can be structured and automated. Central to this scheme is the use of linear logic as a computational logic underlying the logic of Horn clauses.