Specialization of functional logic programs based on needed narrowing

Theory and Practice of Logic Programming

Volumn 5, Issue 3, 2005, Pages 273-303

  Alpuente, María ^a   Lucas, Salvador ^a   Vidal, Germán ^a   Hanus, Michael ^b  

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

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Functional logic programming; Needed narrowing; Partial evaluation

Indexed keywords

COMPUTATION THEORY; EVALUATION; FUNCTIONS; MATHEMATICAL MODELS; PROBLEM SOLVING;

FUNCTIONAL LOGIC PROGRAMMING; MULTI-PARADIGM PROGRAMS; NEEDED NARROWING; PARTIAL EVALUATION;

LOGIC PROGRAMMING;

EID: 20344398430     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068404002303     Document Type: Article

References (60)

1. ABRAMOV, S. AND GLÜCK, R. 2000. The Universal Resolving Algorithm: Inverse Computation in a Functional Language. Proceedings of the 5th International Conference on Mathematics of Program Construction (MPC 2000). Springer LNCS 1837, pp. 187-212.
2. ABRAMOV, S. AND GLÜCK, R. 2002. The Universal Resolving Algorithm and its Correctness: Inverse Computation in a Functional Language. Science of Computer Programming 43, 2-3, 193-229.
3. ALBERT, E. 2001. Partial Evaluation of Multi-Paradigm Declarative Languages: Foundations, Control, Algorithms and Efficiency. PhD thesis, DSIC, Technical University of Valencia. (Available from URL: http://www.dsic.upv.es/ users/elp/papers.html.)
4. ALBERT, E., ALPUENTE, M., FALASCHI, M., JULIÁN, P. AND VIDAL, G. 1998. Improving Control in Functional Logic Program Specialization. Proceedings of the International Static Analysis Symposium (SAS'98). Springer LNCS 1503, pp. 262-277.
5. ALBERT, E., ALPUENTE, M., HANUS, M. AND VIDAL, G. 1999. A Partial Evaluation Framework for Curry Programs. Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR'99). Springer LNCS 1705, pp. 376-395.
6. ALBERT, E., HANUS, M. AND VIDAL, G. 2002. A Practical Partial Evaluation Scheme for Multi-Paradigm Declarative Languages. Journal of Functional and Logic Programming 2002, 1, 1-34.
7. ALBERT, E., HANUS, M. AND VIDAL, G. 2003. A Residualizing Semantics for the Partial Evaluation of Functional Logic Programs. Information Processing Letters 85, 1, 19-25.
8. ALBERT, E. AND VIDAL, G. 2002. The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing 20, 1, 3-26.
9. ALPUENTE, M., FALASCHI, M., JULIÁN, P. AND VIDAL, G. 1997. Specialization of Lazy Functional Logic Programs. Proceedings of the ACM SIGPLAN Conference on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'97). Sigplan Notices 32(12). ACM Press, New York, pp. 151-162.
10. ALPUENTE, M., FALASCHI, M., JULIÁN, P. AND VIDAL, G. 2003. Uniform Lazy Narrowing. Journal of Logic and Computation 13, 2, 287-312.
11. ALPUENTE, M., FALASCHI, M., MORENO, G. AND VIDAL, G. 1999. A Transformation System for Lazy Functional Logic Programs. Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming (FLOPS'99). Springer LNCS 1722, pp. 147-162.
12. ALPUENTE, M., FALASCHI, M., MORENO, G. AND VIDAL, G. 2000. An Automatic Composition Algorithm for Functional Logic Programs. Proceedings of the 27th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2000). Springer LNCS 1963, pp. 289-297.
13. ALPUENTE, M., FALASCHI, M., MORENO, G. AND VIDAL, G. 2004. Rules + Strategies for Transforming Lazy Functional Logic Programs. Theoretical Computer Science 311, 1-3, 479-525.
14. ALPUENTE, M., FALASCHI, M. AND VIDAL, G. 1998a. Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems 20, 4, 768-844.
15. ALPUENTE, M., FALASCHI, M. AND VIDAL, G. 1998b. A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys 30, 3es, 9es.
16. ALPUENTE, M., HANUS, M., LUCAS, S. AND VIDAL, G. 2004. Specialization of functional logic programs based on needed narrowing. Computing Research Repository (CoRR) at http://arXiv.org/abs/cs.PL/0403011.
17. ANTOY, S. 1992. Definitional trees. Proceedings of the 3rd International Conference on Algebraic and Logic Programming (ALP'92). Springer LNCS 632, pp. 143-157.
18. ANTOY, S. 1997. Optimal non-deterministic functional logic computations. Proceedings of the International Conference on Algebraic and Logic Programming (ALP'97). Springer LNCS 1298, pp. 16-30.
19. ANTOY, S., ECHAHED, R. AND HANUS, M. 1997. Parallel Evaluation Strategies for Functional Logic Languages. Proceedings of the 14th International Conference on Logic Programming (ICLP'97). MIT Press, Cambridge, Mass., pp. 138-152.
20. ANTOY, S., ECHAHED, R. AND HANUS, M. 2000. A Needed Narrowing Strategy. Journal of the ACM 47, 4, 776-822.
21. ANTOY, S. AND HANUS, M. 2000. Compiling Multi-Paradigm Declarative Programs into Prolog. Proceedings of the International Workshop on Frontiers of Combining Systems (FroCoS 2000). Springer LNCS 1794, pp. 171-185.
22. ANTOY, S., HANUS, M., MASSEY, B. AND STEINER, F. 2001. An Implementation of Narrowing Strategies. Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'01). ACM Press, pp. 207-217.
23. BELLEGARDE, F. 1995. ASTRE: Towards a Fully Automated Program Transformation System. Proceedings of the International Conference on Rewriting Techniques and Applications (RTA'95). Springer LNCS 914, pp. 403-407.
24. BONDORF, A. 1988. Towards a Self-Applicable Partial Evaluator for Term Rewriting Systems. Proceedings of the International Workshop on Partial Evaluation and Mixed Computation, D. Bjørner, A. Ershov, and N. Jones, Eds. North-Holland, Amsterdam, pp. 27-50.
25. BONDORF, A. 1989. A Self-Applicable Partial Evaluator for Term Rewriting Systems. Proceedings of International Conference on Theory and Practice of Software Development, Barcelona, Spain, J. Diaz and F. Orejas, Eds. Springer LNCS 352, pp. 81-95.
26. CONSEL, C. AND DANVY, O. 1993. Tutorial notes on Partial Evaluation. Proceedings of 20th Annual ACM Symposium on Principles of Programming Languages (POPL'93). ACM, New York, pp. 493-501.
27. DE SCHREYE, D., GLÜCK, R., JØRGENSEN, J., LEUSCHEL, M., MARTENS, B. AND SØRENSEN, M. 1999. Conjunctive Partial Deduction: Foundations, Control, Algorihtms, and Experiments. Journal of Logic Programming 41, 2&3, 231-277.
28. DERSHOWITZ, N. AND JOUANNAUD, J.-P. 1990. Rewrite Systems. In: Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B: Formal Models and Semantics. Elsevier, Amsterdam, pp. 243-320.
29. DERSHOWITZ, N. AND REDDY, U. 1993. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation 15, 467-494.
30. GALLAGHER, J. 1993. Tutorial on Specialisation of Logic Programs. Proceedings of Partial Evaluation and Semantics-Based Program Manipulation (PEPM'93). ACM, New York, pp. 88-98.
31. GIOVANNETTI, E., LEVI, G., MOISO, C. AND PALAMIDESSI, C. 1991. Kernel Leaf: A Logic plus Functional Language. Journal of Computer and System Sciences 42, 363-377.
32. GLÜCK, R. AND KLIMOV, A. 1993. Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. Proceedings of the 3rd International Workshop on Static Analysis (WSA'93). Springer LNCS 724, pp. 112-123.
33. GLÜCK, R. AND SØRENSEN, M. 1994. Partial Deduction and Driving are Equivalent. Proceedings International Symposium on Programming Language Implementation and Logic Programming (PLILP'94). Springer LNCS 844, pp. 165-181.
34. GLÜCK, R. AND SØRENSEN, M. 1996. A Roadmap to Metacomputation by Supercompilation. In: Partial Evaluation, International Seminar, O. Danvy, R. Glück and P. Thiemann, Eds. Springer LNCS 1110, pp. 137-160.
35. HANUS, M. 1994. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming 19&20, 583-628.
36. HANUS, M. 1995. Efficient Translation of Lazy Functional Logic Programs into Prolog. Proceedings of the 5th International Workshop on Logic Program Synthesis and Transformation (LOPSTR'95). Springer LNCS 1048, pp. 252-266.
37. HANUS, M. 1997. A Unified Computation Model for Functional and Logic Programming. Proceedings of the 24th ACM Symposium on Principles of Programming Languages (POPL'97). ACM, New York, pp. 80-93.
38. HANUS, M., LUCAS, S. AND MIDDELDORP, A. 1998. Strongly Sequential and Inductively Sequential Term Rewriting Systems. Information Processing Letters 67, 1, 1-8.
39. HANUS, M. AND PREHOFER, C. 1999. Higher-Order Narrowing with Definitional Trees. Journal of Functional Programming 9, 1, 33-75.
40. HANUS (ED.), M. 2003. Curry: An Integrated Functional Logic Language. (Available at http://www.informatik.uni-kiel.de/~curry/.)
41. HANUS (ED.), M., ANTOY, S., ENGELKE, M., HÖPPNER, K., KOJ, J., NIEDERAU, P., SADRE, R. AND STEINER, F. 2003. PAKCS 1.5.0: The Portland Aachen Kiel Curry System User Manual. Technical report, University of Kiel, Germany.
42. HUET, G. AND LÉVY, J. 1992. Computations in Orthogonal Rewriting Systems, Part I + II. In: Computational Logic - Essays in Honor of Alan Robinson, J. Lassez and G. Plotkin, Eds. MIT Press, Cambridge, MA, pp. 395-443.
43. JONES, N., GOMARD, C. AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, NJ.
44. KUCHEN, H., LOOGEN, R., MORENO-NAVARRO, J. AND RODRÍGUEZ-ARTALEJO, M. 1990. Lazy Narrowing in a Graph Machine. Proceedings of the International Conference on Algebraic and Logic Programming (ALP'90). Springer LNCS 463, pp. 298-317.
45. LAFAVE, L. AND GALLAGHER, J. 1997. Constraint-based Partial Evaluation of Rewriting-based Functional Logic Programs. Proceedings of the International Workshop on Logic-Based Program Synthesis and Transformation (LOPSTR'97). Springer LNCS 1463, pp. 168-188.
46. LEUSCHEL, M. AND BRUYNOOGHE, M. 2002. Logic program specialisation through partial deduction: Control issues. Theory and Practice of Logic Programming 2, 4 & 5, 461-515.
47. LLOYD, J. AND SHEPHERDSON, J. 1991. Partial Evaluation in Logic Programming. Journal of Logic Programming 11, 217-242.
48. LOOGEN, R., LÓPEZ-FRAGUAS, F. AND RODRÍGUEZ-ARTALEJO, M. 1993. A Demand Driven Computation Strategy for Lazy Narrowing. Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming (PLILP'93). Springer LNCS 714, pp. 184-200.
49. LÓPEZ-FRAGUAS, F. AND SÁNCHEZ-HERNÁNDEZ, J. 1999. TOY: A Multiparadigm Declarative System. Proceedings of the International Conference on Rewriting Techniques and Applications (RTA'99). Springer LNCS 1631, pp. 244-247.
50. LUCAS, S. 1998. Root-Neededness and Approximations of Neededness. Information Processing Letters 67, 5, 245-254.
51. MIDDELDORP, A. 1997. Call by Need Computations to Root-Stable Form. Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'97). ACM, New York, pp. 94-105.
52. MORENO-NAVARRO, J. AND RODRÍGUEZ-ARTALEJO, M. 1992. Logic Programming with Functions and Predicates: The language Babel. Journal of Logic Programming 12, 3, 191-224.
53. NEMYTYKH, A., PINCHUK, V. AND TURCHIN, V. 1996. A Self-Applicable Supercompiler. In: Partial Evaluation, Int'l Seminar, Dagstuhl Castle, Germany, O. Danvy, R. Glück, and P. Thiemann, Eds. Springer LNCS 1110, pp. 322-337.
54. OYAMAGUCHI, M. 1993. NV-Sequentiality: a Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems. SIAM Journal of Computation 22, 1, 114-135.
55. PETTOROSSI, A. AND PROIETTI, M. 1996a. A Comparative Revisitation of Some Program Transformation Techniques. In: Partial Evaluation, International Seminar, O. Danvy, R. Glück and P. Thiemann, Eds. Springer LNCS 1110, pp. 355-385.
56. PETTOROSSI, A. AND PROIETTI, M. 1996b. Rules and Strategies for Transforming Functional and Logic Programs. ACM Computing Surveys 28, 2, 360-414.
57. SØRENSEN, M., GLÜCK, R. AND JONES, N. 1996. A Positive Supercompiler. Journal of Functional Programming 6, 6, 811-838.
58. TURCHIN, V. 1986. Program Transformation by Supercompilation. In: Programs as Data Objects, 1985, H. Ganzinger and N. Jones, Eds. Springer LNCS 217, pp. 257-281.
59. WADLER, P. 1990. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science 73, 231-248.
60. ZARTMANN, F. 1997. Denotational Abstract Interpretation of Functional Logic Programs. In: Proceedings of the 4th International Static Analysis Symposium (SAS'97), P. V. Hentenryck, Ed. Springer LNCS 1302, pp. 141-159.