Naïve Reverse Can be Linear

@inproceedings{Brisset1991NaveRC,
  title={Na{\"i}ve Reverse Can be Linear},
  author={Pascal Brisset and Olivier Ridoux},
  booktitle={ICLP},
  year={1991}
}
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-eeect, we show that higher-order uniication is a good tool for manipulating the function-lists. It appears that the eeciency of the program thus obtained relies critically upon the implementation of higher-order operations (uniication and reduction). In particular, we… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
18 Extracted Citations
10 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 10 references

A Higher-Order Logic as the Basis for Logic Program- ming

  • G. Nadathur
  • Ph.D. Thesis, University of Pennsylvania,
  • 1987
Highly Influential
9 Excerpts

The Lambda Calculus: Its Syntax and Semantics. Vol- ume 103 of Studies in logic and the foundations of mathematics

  • H. Barendregt
  • 1981
Highly Influential
3 Excerpts

The Implementation of Functional Programming Languages

  • S. L. Peyton Jones
  • Int. Series in Computer Science, Prentice-Hall,
  • 1986
1 Excerpt

Similar Papers

Loading similar papers…