We present a compiled implementation of Prolog that uses the abstract memory MALI for representing the execution state. Prolog is a logic programming language allowing a more general clause form than Standard Prolog 's (namely hereditary Harrop formulas instead of Horn formulas) and using simply typed -terms as a term domain instead of first order terms. The augmented clause form causes the program (a set of clauses) and the signature (a set of constants) to be changeable in a very disciplined way. The new term domain has a semi-decidable and infinitary unification theory, and it introduces the need for a fi-reduction operation at run-time. MALI is an abstract memory that is suitable for storing the search-state of depth-first search processes. Its main feature is its efficient memory management. We have used an original Prolog-to-C translation along which predicates are transformed into functions operating on continuations for handling failure and success in unifications, and change...

This paper describes a general method of compiler implementation using higher order abstract syntax and logic programming. A working compiler written in Prolog is used to demonstrate this method.

Optical Music Recognition is a particular form of document analysis in which there is much knowledge about document structure. Indeed there exists an important set of rules for musical notation, but current systems do not fully use them. We propose a new solution using a grammar to guide the segmentation of the graphical objects and their recognition. The grammar is essentially a description of the relations (relative position and size, adjacency, etc) between the graphical objects. Inspired by Definite Clause Grammar techniques, the grammar can be directly implemented in Prolog, a higher-order dialect of Prolog. Moreover, the translation from the grammar into Prolog code can be done automatically. Our approach is justified by the first encouraging results obtained with a prototype for music score recognition. Keywords: Document analysis, Optical Music Recognition, DCG, Grammar Translation 1 Introduction In structured document analysis, one open problem is to separate knowledge from...

We present a new transformation of Prolog programs preserving operational equivalence. Our transformation --- EBC (equality based continuation) transformation --- relies on the introduction of equations between terms. These equations are used to introduce alternative and more e#- cient representations of terms. When applied to binary Prolog programs, EBC is able to perform the following optimizations by mere source to source transformations: removal of existential variables in programs using di#erence lists and accumulators, reduction of the number of occurchecks, interprocedural register allocation when executed on the WAM, linearization of recursions, optimization of continuation-like user data structures.

. 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 first-order terms, considered as a procedure for s...

: 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...

: 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 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...

We describe in this paper an original solution for structured document analysis. The idea is to use a grammar to guide the segmentation of the graphical objects and their recognition. The grammar is essentially a description of the relations (relative position and size, adjacency, etc) between the graphical objects.

Abstract not found