Improving Efficiency of Prolog Programs by Fully Automated Unfold/Fold Transformation
暂无分享,去创建一个
[1] M. Sørensen,et al. Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments , 1999, J. Log. Program..
[2] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .
[3] Alberto Pettorossi,et al. Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs , 1995, Theor. Comput. Sci..
[4] Nachum Dershowitz,et al. Termination of Rewriting , 1987, J. Symb. Comput..
[5] Michael Leuschel,et al. Improving Homeomorphic Embedding for Online Termination , 1998, LOPSTR.
[6] Krzysztof R. Apt,et al. From logic programming to Prolog , 1996, Prentice Hall International series in computer science.
[7] Hisao Tamaki,et al. Unfold/Fold Transformation of Logic Programs , 1984, ICLP.
[8] Valentin F. Turchin,et al. Program transformation with metasystem transitions , 1993, Journal of Functional Programming.
[9] C. Nash-Williams. On well-quasi-ordering infinite trees , 1963, Mathematical Proceedings of the Cambridge Philosophical Society.