A unifying view of functional and logic program specialization
Open Access
- 1 September 1998
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 30 (3es)
Abstract
Ing with credit is permitted To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee Permissions may be requested from Publications Dept, ACM Inc , 1515 Broadway, New York, NY 10036 USA, fax +1 (212) 869 - 0481, or permissions@acm orgKeywords
This publication has 10 references indexed in Scilit:
- Specialization of lazy functional logic programs1997
- Safe folding/unfolding with conditional narrowingLecture Notes in Computer Science, 1997
- A comparative revisitation of some program transformation techniques1996
- A positive supercompilerJournal of Functional Programming, 1996
- Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance1995
- The integration of functions into logic programming: From theory to practiceThe Journal of Logic Programming, 1994
- Tutorial on specialisation of logic programs1993
- Tutorial notes on partial evaluation1993
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- The concept of a supercompilerACM Transactions on Programming Languages and Systems, 1986