Can Logic Programming Execute as Fast as Imperative Programming?

@inproceedings{Roy1990CanLP,
  title={Can Logic Programming Execute as Fast as Imperative Programming?},
  author={Peter Van Roy},
  year={1990}
}
The purpose of this dissertation is to provide constructive proof that the logic programming language Prolog can be implemented an order of magnitude more efficiently than the best previous systems, so that its speed approaches imperative languages such as C for a significant class of problems. The driving force in the design is to encode each occurrence of a general feature of Prolog as simply as possible. The resulting system, Aquarius Prolog, is about five times faster than Quintus Prolog, a… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
100 Citations
5 References
Similar Papers

Citations

Publications citing this paper.

References

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

Practical Prolog for Real Programmers,’

  • R. A. O’Keefe
  • Tutorial 8, Fifth International Conference…
  • 1988
1 Excerpt

Extraposition Grammars,’

  • F. Pereira
  • American Journal of Computational Linguistics,
  • 1981
2 Excerpts

Similar Papers

Loading similar papers…