Specialization of Lazy Functional Logic Programs

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 32, Issue 12, 1997, Pages 151-162

  Alpuente, M ^a   Falaschi, M ^b   Julian P ^c   Vidal, G ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b UNIVERSITY OF UDINE   (Italy)

^c Dep de Informática   (Spain)

Author keywords

Integration of functional and logic programming; Lazy narrowing; Partial evaluation; Post processing renaming; Term rewriting systems

Indexed keywords

EID: 0346675716     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/258994.259015     Document Type: Article

References (47)

1. M. Alpuente, M. Falaschi, P. Julián, and G. Vidai. Call-by-Name Partial Evaluation of Functional Logic Programs. TR DSIC-II/34/96, U.P. Valencia, 1996.
2. M. Alpuente, M. Falaschi, and G. Vidai. Narrowing-driven Partial Evaluation of Functional Logic Programs. In H. Riis Nielson, editor, Proc. of the 6th European Symp. on Programming, ESOP'96, pages 45-61. Springer LNCS 1058, 1996.
3. M. Alpuente, M. Falaschi, and G. Vidai. Narrowing-driven Specialization of Functional Logic Programs. TR DSIC-II/33/96, U.P. Valencia. Extended and revised version of [2]. Available from URL http://www.dsic.upv.es/users/elp/papers.html, 1996.
4. S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In Proc. 21st ACM Symp. on Principles of Programming Languages, Portland, pages 268-279, 1994.
5. K. Benkerimi and P.M. Hill. Supporting Transformations for the Partial Evaluation of Logic Programs. Journal of Logic and Computation, 3(5):469-486, 1993.
6. J.A. Bergstra and J.W. Klop. Conditional Rewrite Rules: confluence and termination. Journal of Computer and System Sciences, 32:323-362, 1986.
7. D. Bert and R. Echahed. Design and implementation of a generic, logic and functional programming language. In Proc. of First European Symp. on Programming, ESOP'86, pages 119-132. Springer LNCS 213, 1986.
8. R.M. Burstall and J. Darlington. A Transformation System for Developing Recursive Programs. Journal of the ACM, 24(1):44-67, 1977.
9. W. Chin. Towards an Automated Tupling Strategy. In Proc. of Partial Evaluation and Semantics-Based Program Manipulation, Copenhagen, Denmark, June 1993, pages 119-132. ACM, New York, 1993.
10. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 243-320. Elsevier, Amsterdam, 1990.
11. L. Fribourg. SLOG: a logic programming language interpreter based on clausal superposition and rewriting. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 172-185. IEEE, New York, 1985.
12. J. Gallagher. Tutorial on Specialisation of Logic Programs. In Proc. of Partial Evaluation and Semantics-Based Program Manipulation, Copenhagen, Denmark, June 1993, pages 88-98. ACM, New York, 1993.
13. J. Gallagher and M. Bruynooghe. Some Low-Level Source Transformations for Logic Programs. In M. Bruynooghe, editor, Proc. of 2nd Workshop on Meta-Programming in Logic, pages 229-246. Department of Computer Science, KU Leuven, Belgium, 1990.
14. E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel Leaf: A Logic plus Functional Language. Journal of Computer and System Sciences, 42, 1991.
15. R. Glück and M.H. Sørensen. Partial Deduction and Driving are Equivalent. In Proc. Int'l Symp. on Programming Language Implementation and Logic Programming, PLILP'94, pages 165-181. Springer LNCS 844, 1994.
16. M. Hanus. Compiling Logic Programs with Equality. In Proc. of 2nd Int'l Workshop on Programming Language Implementation and Logic Programming, pages 387-401. Springer LNCS 456, 1990.
17. M. Hanus. Combining Lazy Narrowing with Simplification. In Proc. of 6th Int'l Symp. on Programming Language Implementation and Logic Programming, pages 370-384. Springer LNCS 844, 1994.
18. M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19&20:583-628, 1994.
19. M. Hanus. On Extra Variables in (Equational) Logic Programming. In Proc. of 20th Int'l Conf., on Logic Programming, pages 665-678. The MIT Press, Cambridge, MA, 1995.
20. M. Hanus, H. Kuchen, and J.J. Moreno-Navarro. Curry: A Truly Functional Logic Language. In Proc. ILPS'95 Workshop on Visions for the Future of Logic Programming, pages 95-107, 1995.
21. S. Hölldobler. Foundations of Equational Logic Programming. Springer LNAI 353, 1989.
22. J.M. Hullot. Canonical Forms and Unification. In Proc of 5th Int'l Conf. on Automated Deduction, pages 318-334. Springer LNCS 87, 1980.
23. H. Hussman. Unification in Conditional-Equational Theories. In Proc. European Conf. on Computer Algebra EUROCAL'85, pages 543-553. Springer LNCS 204, 1985.
24. N.D. Jones. The Essence of Program Transformation by Partial Evaluation and Driving. In N.D. Jones, M. Hagiya, and M. Sato, editors, Logic, Language and Computation, pages 206-224. Springer LNCS 792, 1994.
25. N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, NJ, 1993.
26. J.W. Klop. Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume I, pages 1-112. Oxford University Press, 1992.
27. D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast Pattern Matching in Strings. SIAM Journal of Computation, 6(2):323-350, 1977.
28. J. B. Kruskal. The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept. Journal of Combinatorial Theory, A(13):297-305, 1972.
29. H. Kuchen, R. Loogen, J.J. Moreno-Navarro, and M. Rodríguez-Artalejo. Lazy Narrowing in a Graph Machine. In Proc. of the Int'l Conf. on Algebraic and Logic Programming, volume 463 of Lecture Notes in Computer Science, pages 298-317, 1990.
30. J.-L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587-625. Morgan Kaufmann, Los Altos, Ca., 1988.
31. M. Leuschel and B. Martens. Global Control for Partial Deduction through Characteristic Atoms and Global Trees. Technical Report CW-220, Department of Computer Science, K.U. Leuven, Belgium, December 1995.
32. M. Leuschel, D. De Schreye, and A. de Waal. A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. In M. Maher, editor, Proc. of the Joint International Conference and Symposium on Logic Programming JICSLP'96, pages 319-332. The MIT Press, Cambridge, MA, 1996.
33. M. Leuschel and M.H. Sørensen. Redundant Argument Filtering of Logic Programs. In Proc. of Int'l Workshop on Logic Programming Synthesis and Transformation, LOPSTR'96. To appear in Springer LNCS, 1996.
34. J.W. Lloyd and J.C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, 11:217-242, 1991.
35. R. Loogen, F. López-Fraguas, and M. Rodríguez-Artalejo. A Demand Driven Computation Strategy for Lazy Narrowing. In J. Penjam and M. Bruynooghe, editors, Proc. of PLILP'93, Tallinn (Estonia), pages 184-200. Springer LNCS 714, 1993.
36. B. Martens and J. Gallagher. Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance. In L. Sterling, editor, Proc. of ICLP'95, pages 597-611. MIT Press, 1995.
37. A. Middeldorp and E. Hamoen. Completeness Results for Basic Narrowing. Applicable Algebra in Engineering, Communication and Computing, 5:213-253, 1994.
38. A. Middeldorp and S. Okui. A Deterministic Lazy Narrowing Calculus. In Proc. of the Fuji Int'l Workshop on Functional and Logic Programming, pages 104-118. World Scientific, 1995.
39. J.J. Moreno-Navarro and M. Rodriguez-Artalejo. Logic Programming with Functions and Predicates: The language Babel. Journal of Logic Programming, 12(3):191-224, 1992.
40. U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. of Second IEEE Int'l Symp. on Logic Programming, pages 138-151. IEEE, New York, 1985.
41. P. Réty. Improving basic narrowing techniques. In Proc. of the Conf. on Rewriting Techniques and Applications, pages 228-241. Springer LNCS 256, 1987.
42. M.H. Sørensen. Turchin's Supercompiler Revisited: An Operational Theory of Positive Information Propagation. Technical Report 94/7, Master's Thesis, DIKU, University of Copenhagen, Denmark, 1994.
43. M.H. Sørensen and R. Glück. An Algorithm of Generalization in Positive Supercompilation. In J.W. Lloyd, editor, Proc. of ILPS'95, pages 465-479. The MIT Press, Cambridge, MA, 1995.
44. M.H. Sørensen, R. Glück, and N.D. Jones. A Positive Supercompiler. Journal of Functional Programming, 1996. To appear.
45. V.F. Turchin. Program Transformation by Supercompilation. In H. Ganzinger and N.D. Jones, editors, Programs as Data Objects, 1985, pages 257-281. Springer LNCS 217, 1986.
46. V.F. Turchin. The Algorithm of Generalization in the Supercompiler. In D. Bjørner, A.P. Ershov, and N.D. Jones, editors, Proc. of the Int'l Workshop on Partial Evaluation and Mixed Computation, pages 531-549. North-Holland, Amsterdam, 1988.
47. P.L. Wadler. Deforestation: transforming programs to eliminate trees. In Proc of the European Symp. on Programming, ESOP'88, pages 344-358. Springer LNCS 300, 1988.