Improving efficiency of prolog programs by fully automated unfold/fold transformation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4827 LNAI, Issue , 2007, Pages 305-315

  Vyskočil, Jiří ^a   Štěpánek, Petr ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Homeomorphic embedding; Logic programming; Partial deduction; Prolog; Unfold fold transformation

Indexed keywords

COMPUTATIONAL EFFICIENCY; EMBEDDED SYSTEMS; HEURISTIC METHODS; PROLOG (PROGRAMMING LANGUAGE);

HOMEOMORPHIC EMBEDDING; PARTIAL DEDUCTION; UNFOLD/FOLD TRANSFORMATION;

LOGIC PROGRAMMING;

EID: 38149012940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76631-5_29     Document Type: Conference Paper

References (11)

1. Apt, K.R.: From Logic Programming to Prolog. Prentice-Hall, Englewood Cliffs (1996)
2. Dershowitz, N.: Termination in rewriting. Journal of Symbolic Computation 3, 69-116 (1987)
3. De Schreye, D., Glück, R., Jørgensen, J., Leuschel, M., Martens, B., Sørensen, M.H.: Conjunctive partial deduction: foundations, control, algorithms and experiments. The Journal of Logic Programming 41, 231-277 (1999)
4. Kruskal, J.B.: Well-quasi-ordering, the Tree Theorem, and Varsonyi's conjecture. Trans.Amer. Math. Society 95, 210-225 (1960)
5. Leuschel, M.: Improving Homeomorphic Embeddings for On line Termination. In: Flener, P. (ed.) LOPSTR 1998. LNCS, vol. 1559, pp. 199-218. Springer, Heidelberg (1999)
6. Leuschel, M.: Ecce partial deduction system, http ://www.ecs.soton.ac.uk/ ~mal/systems/ecce.html
7. Nash-Williams, C.: On well quasi ordering finite trees. Proc. Camb. Phil. Society 59, 833-835 (1963)
8. Proietti, M., Pettorossi, A.: Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. Theoretical Computer Science 142, 89-124 (1995)
9. Tamaki, H., Sato, T.: Unfold/Fold Transformation of Logic Programs. In: Tärnlund, S. (ed.) ICLP 1984, pp. 127-138, Uppsala University, Sweeden (1984)
10. Turchin, V.F.: Program transformation with metasystems transitions. Journal of Functional Programming 3(3), 283-313 (1993)
11. Vyskočil, J., Štěpánek, P., Halama, M.: Speedup by Fully Automated Unfold/Fold Transformation. Technical Report TR No 2006 /1 Department of KTIML MFF, Charles University in Prague (2006)