A Unifying View of Functional and Logic Program Specialization

ACM Computing Surveys

Volumn 30, Issue 3, 1998, Pages 1-5

  Alpuente, María ^a   Falaschi, Moreno ^a   Vidal, Germán ^b  

^a UNIVERSITY OF UDINE   (Italy)

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346200793     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/289121.289130     Document Type: Article

References (19)

1. M. Alpuente, M. Falaschi, P. Julian, and G. Vidal. Specialization of Lazy Functional Logic Programs. In Proc. PEPM’97, pages 151-162. ACM, New York, 1997.
2. M. Alpuente, M. Falaschi, G. Moreno, and G. Vidal. Safe Folding/Unfolding with Conditional Narrowing. In Proc. ALP’97, pages 1-15. Springer LNCS 1298, 1997.
3. M. Alpuente, M. Falaschi, and G. Vidal. Narrowing-driven Partial Evaluation of Functional Logic Programs. In Proc. ES OP’96, pages 45-61. Springer LNCS 1058, 1996.
4. R. Caballero-Roldân, F. J. Lopez-Fraguas, and J. Sanchez-Hernandez. User's manual for Toy. Technical report SIP-5797, UCM, Madrid (Spain), April 1997.
5. C. Consel and O. Danvy. Tutorial notes on Partial Evaluation. In Proc. of 20th Annual ACM Symp. on Principles of Programming Languages, pages 493-501. ACM, New York, 1993.
6. J. Darlington and H. Pull. A Program Development Methodology Based on a Unified Approach to Execution and Transformation. In Proc. of the Int’l Workshop on Partial Evaluation and Mixed Computation, pages 117-131. North-Holland, Amsterdam, 1988.
7. J. Gallagher. Tutorial on Specialisation of Logic Programs. In Proc. of Partial Evaluation and Semantics-Based Program Manipulation, pages 88-98. ACM, New York, 1993.
8. R. Glück and A. V. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In Proc. of WSA’93, pages 112-123. Springer LNCS 724, 1993.
9. R. Glück and M. H. Sprensen. Partial Deduction and Driving are Equivalent. In Proc. PLILP’94, pages 165-181. Springer LNCS 844, 1994.
10. M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19-20:583-628, 1994.
11. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, NJ, 1993.
12. L. Lafave and J. P. Gallagher. Partial Evaluation of Functional Logic Programs in Rewritingbased Languages. Tech. Report CSTR-97-001, U. Bristol, England, March 1997.
13. M. Leuschel, D. De Schreye, and A. de Waal. A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration. In Proc. JICSLP’96, pages 319-332. The MIT Press, Cambridge, MA, 1996.
14. J. W. Lloyd and J. C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, 11:217-242, 1991.
15. B. Martens and J. Gallagher. Ensuring Global Termination of Partial Deduction while Al lowing Flexible Polyvariance. In Proc. ICLP’95, pages 597-611. MIT Press, 1995.
16. A. Pettorossi and M. Proietti. A Comparative Revisitation of Some Program Transformation Techniques. In Partial Evaluation, Int7 Seminar, pages 355-385. LNCS 1110, 1996.
17. M. H. Sprensen and R. Glück. An Algorithm of Generalization in Positive Supercompilation. In Proc. ILPS’95, pages 465-479. The MIT Press, Cambridge, MA, 1995.
18. M. H. Sprensen, R. Glück, and N. D. Jones. A Positive Supercompiler. Journal of Functional Programming, 6(6):811-838, 1996.
19. V. F. Turchin. The Concept of a Supercompiler. ACM Transactions on Programming Languages and Systems, 8(3):292-325, July 1986.