skip to main content
article
Free Access

A unifying view of functional and logic program specialization

Published:01 September 1998Publication History
First page image

References

  1. M. Alpuente, M. Falaschi, P. Juli~n, and G. Vidal. Specialization of Lazy Functional Logic Programs. In Proc. PEPM'97, pages 151-162. ACM, New York, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Alpuente, M. Falaschi, and G. Vidal. Narrowing-driven Partial Evaluation of Functional Logic Programs. In Proc. ESOP'96, pages 45-61. Springer LNCS 1058, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Caballero-Rold~n, F.J. Ldpez-Fraguas, and J. S~nchez-Hern~ndez. User's manual for Toy. Technical report SIP-5797, UCM, Madrid (Spain), April 1997.Google ScholarGoogle Scholar
  5. C. Consel and O. Danvy. Tutorial notes on Partial Evaluation. In Proc. o} 20th Annual A CM Symp. on Principles o} Programming Languages, pages 493-501. ACM, New York, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Darlington and H. Pull. A Program Development Methodology Based on a Unified Approach to Execution and Transformation. In Proc. o} the Int'l Workshop on Partial Evaluation and Mixed Computation, pages 117-131. North-Holland, Amsterdam, 1988.Google ScholarGoogle Scholar
  7. J. Gallagher. Tutorial on Specialisation of Logic Programs. In Proc. o} Partial Evaluation and Semantics-Based Program Manipulation, pages 88-98. ACM, New York, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Gliick and A.V. Klimov. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In Proc. o} WSA'93, pages 112-123. Springer LNCS 724, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Gliick and M.H. S0rensen. Partial Deduction and Driving are Equivalent. In Proc. PLILP'94, pages 165-181. Springer LNCS 844, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19&20:583-628, 1994.Google ScholarGoogle Scholar
  11. N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, N J, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  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.Google ScholarGoogle Scholar
  14. J.W. Lloyd and J.C. Shepherdson. Partial Evaluation in Logic Programming. Journal o} Logic Programming, 11:217-242, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. Martens and J. Gallagher. Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance. In Proc. ICLP'95, pages 597-611. MIT Press, 1995.Google ScholarGoogle Scholar
  16. A. Pettorossi and M. Proietti. A Comparative Revisitation of Some Program Transformation Techniques. In Partial Evaluation, Int'l Seminar, pages 355-385. LNCS 1110, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M.H. S0rensen and R. Gliick. An Algorithm of Generalization in Positive Supercompilation. In Proc. ILPS'95, pages 465-479. The MIT Press, Cambridge, MA, 1995.Google ScholarGoogle Scholar
  18. M.H. S0rensen, R. Gliick, and N.D. Jones. A Positive Supercompiler. Journal o} Functional Programming, 6(6):811-838, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  19. V.F. Turchin. The Concept of a Supercompiler. ACM Transactions on Programming Languages and Systems, 8(3):292-325, July 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A unifying view of functional and logic program specialization

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image ACM Computing Surveys
                ACM Computing Surveys  Volume 30, Issue 3es
                Special issue: electronic supplement to the September 1998 issue
                Sept. 1998
                141 pages
                ISSN:0360-0300
                EISSN:1557-7341
                DOI:10.1145/289121
                Issue’s Table of Contents

                Copyright © 1998 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 September 1998
                Published in csur Volume 30, Issue 3es

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader