Notes on Prolog program transformations, Prolog style, and efficient compilation to the Warren abstract machine
Autor: | Rasiah Loganantharaj, Ralph Butler, Robert Olsen |
---|---|
Rok vydání: | 2005 |
Předmět: | |
Zdroj: | 9th International Conference on Automated Deduction ISBN: 354019343X CADE |
DOI: | 10.1007/bfb0012840 |
Popis: | Most of the efficient implementations of Prolog are based on Warren's abstract machine [1,4]. Evan Tick [3] has argued that a substantial percentage of execution time in such implementations is directly related to the creation and the use of choice points. In this paper, we discuss how the overhead of choice point creation and processing can be avoided without sacrificing the declarative meaning of Prolog programs. |
Databáze: | OpenAIRE |
Externí odkaz: |