Naive Reverse can be Linear

Naive Reverse can be Linear (1991)

Cached

Download Links

[www.recherche.enac.fr]

Other Repositories/Bibliography

DBLP

by Pascal Brisset , Olivier Ridoux

Venue:	8th Int. Conf. Logic Programming
Citations:	18 - 5 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Naive Reverse can be Linear	user correction - Legacy Corrections
AUTHOR NAME	Pascal Brisset	SVM HeaderParse 0.1
AUTHOR AFFIL	IRISA	SVM HeaderParse 0.2
AUTHOR ADDR	Campus Universitaire de Beaulieu,; 35042 RENNES Cedex, FRANCE	SVM HeaderParse 0.1
AUTHOR NAME	Olivier Ridoux	SVM HeaderParse 0.1
AUTHOR AFFIL	IRISA	SVM HeaderParse 0.2
AUTHOR ADDR	Campus Universitaire de Beaulieu,; 35042 RENNES Cedex, FRANCE	SVM HeaderParse 0.1
ABSTRACT	We propose a new implementation of logic programming with higher-order 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 side-effect, we show that higher-order unification is a good tool for manipulating the function-lists. It appears that the efficiency of the program thus obtained relies critically upon the implementation of higher-order operations (unification and reduction). In particular, we show that a good choice for data-structures and reduction strategy yields a linear naive reverse. 1 Introduction The extension of Prolog to higher-order 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 ...	user correction - Legacy Corrections
YEAR	1991	INFERENCE
VENUE	8th Int. Conf. Logic Programming	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	857--870	INFERENCE
CITATIONS	10 found	ParsCit 1.0