Reducing nondeterminism while specializing logic programs

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Conference Record of the Annual ACM Symposium on Principles of Programming Languages, Issue , 1997, Pages 414-427

  Pettorossi, Alberto ^a   Proietti, Maurizio ^a   Renault, Sophie ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; FORMAL LANGUAGES; LOGIC PROGRAMMING;

PROGRAM SPECIALIZATION; UNFOLD FOLD TRANSFORMATION RULES;

KNOWLEDGE BASED SYSTEMS;

EID: 0030679951     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/263699.263759     Document Type: Conference Paper

References (19)

1. A. Bossi, N. Cocco. Preserving universal termination through unfold/fold. Proc. ALP '94, LNCS 850, pp. 269-286. Springer Verlag, 1994.
2. R.M. Burstall, J. Darlington. A transformation system for developing recursive programs. JACM, 24(1):44-67, 1977.
3. S.K. Debray, D.S. Warren. Automatic mode inference for logic programs. J. Logic Programming, 5:207-229, 1988.
4. S.K. Debray, D.S. Warren. Functional computations in logic programs. ACM TOPLAS, 11(3):451-481, 1989.
5. J.P. Gallagher. Tutorial on specialization of logic programs. Proc. PEPM '93, Copenhagen, Denmark, pp. 88-98. ACM Press, 1993.
6. M. Gergatsoulis, M. Katzouraki. Unfold/fold transformations for definite clause programs. Proc. PLILP '94, LNCS 844, pp. 340-354. Springer Verlag, 1994
7. R. Gluck, A.V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. Proc. WSA '93, Padova, Italy, LNCS 724, 112-123. Springer Verlag, 1993.
8. N.D. Jones, C.K. Gomard, P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
9. M. Leuschel, D. De Schreye, A. de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. Proc. JICSLP '96, Bonn, Germany, pp. 319-332. MIT Press, 1996
10. M. Leuschel, B. Martens. Global control for partial deduction through characteristic atoms and global trees. Report CW 220, K.U. Leuven, Belgium, 1995.
11. J.W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987. 2nd Edition.
12. J.W. Lloyd, J. C. Shepherdson. Partial evaluation in logic programming. J. Logic Programming, 11:217-242, 1991.
13. A. Pettorossi. Transformation of programs and use of tupling strategy. Proc. Informatica '77, Bled, Yugoslavia, pp. 1-6, 1977.
14. A. Pettorossi, M. Proietti, S. Renault. Enhancing partial deduction via unfold/fold rules. Proc. LoPSTr '96, Stockholm, Sweden. Springer Verlag, 1996. (To appear).
15. M. Proietti, A. Pettorossi. Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. Theo. Comp. Sc., 142(1):89-124, 1995.
16. D. Sahlin. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12:7-51, 1993.
17. D.A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. Proc. PEPM '91, New Haven, CT, USA, SIGPLAN Notices, 26, 9, pp. 62-71. ACM Press, 1991.
18. H. Tamaki, T. Sato. Unfold/fold transformation of logic programs. Proc. ICLP '84, Uppsala, Sweden, pp. 127-138. 1984.
19. V.F. Turchin. The concept of a supercompiler. ACM TOPLAS, 8(3):292-325, 1986.