Imagining
BibTeX
@MISC{Ridoux_imagining,
author = {Clp Olivier Ridoux and Olivier Ridoux and Olivier Ridoux and Projet Lande},
title = {Imagining},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
: 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. Key-words: CLP, -Calculus, Prolog (R'esum'e : tsvp) ridoux@irisa.fr Unite de recherche INRIA Rennes IRISA, Campus universitaire de Beaulieu, 35042 RENNES Cedex (France) Telephone : (33) 99 84 71 00 -- Telecopie : (33) 99 84 71 71 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'axiome j, et le langage de formule...
