Results 1 
2 of
2
Naive Reverse can be Linear
 8th Int. Conf. Logic Programming
, 1991
"... We propose a new implementation of logic programming with higherorder terms. In order to illustrate the properties of our implementation, we apply the coding of lists as functions to the context of logic programming. As a sideeffect, we show that higherorder unification is a good tool for manipul ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
We propose a new implementation of logic programming with higherorder terms. In order to illustrate the properties of our implementation, we apply the coding of lists as functions to the context of logic programming. As a sideeffect, we show that higherorder unification is a good tool for manipulating the functionlists. It appears that the efficiency of the program thus obtained relies critically upon the implementation of higherorder operations (unification and reduction). In particular, we show that a good choice for datastructures and reduction strategy yields a linear naive reverse. 1 Introduction The extension of Prolog to higherorder terms has been proposed by Miller and Nadathur[6]. The prototypal system is Prolog, of which we know two implementations: a Prolog based implementation and a Lisp based one. The first one was intended for experimental use and is very inefficient. We shall only refer to the Lisp based implementation. We propose another implementation in which ...
Compositional Logic Programming
 In Proceedings of the JICSLP'96 postconference workshop: Multiparadigm logic programming, Report 9628. Technische Universitat
, 2000
"... Relational program derivation has gathered momentum over the last decade with the development of many specification logics. However, before such relational specifications can be executed in existing programming languages, they must be carefully phrased to respect the evaluation order of the langu ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Relational program derivation has gathered momentum over the last decade with the development of many specification logics. However, before such relational specifications can be executed in existing programming languages, they must be carefully phrased to respect the evaluation order of the language. In turn, this requirement inhibits the rapid prototyping of specifications in a relational notation. The aim of this thesis is to bridge the gap between the methodology and practice of relational program derivation by realising a compositional style of logic programming that permits specifications to be phrased naturally and executed declaratively.