Specialization of inductively sequential functional logic programs

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 9, 1999, Pages 273-282

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

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

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONAL PROGRAMMING;

DECLARATIVE PROGRAMMING; FUNCTIONAL LOGIC LANGUAGES; FUNCTIONAL LOGIC PROGRAMS; OPERATIONAL PRINCIPLES; OPTIMAL COMPUTATION; PARTIAL EVALUATION; PROGRAM STRUCTURES; SEQUENTIAL PROGRAMS;

LOGIC PROGRAMMING;

EID: 0008911609     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/317765.317910     Document Type: Article

References (51)

1. B. Albert, M. Alpuente, M. Falaschi, P. Julián, and G. Vidal. Improving Control in Functional Logic Program Specialization. In G. Levi, editor, Proc. of Static Analysis Symposium, SAS'98, pages 262-277. Springer LNCS 1503, 1998.
2. E. Albert, M. Alpuente, M. Falaschi, and G. Vidal. INDY User's Manual. Technical Report DSIC-II/12/98, UPV, 1998. Available from URL: http://www.dsic.upv.es/users/elp/papers.html.
3. M. Alpuente, M. Falaschi, P. Julián, and G. Vidal. Specialization of Lazy Functional Logic Programs. In Proc. of PEPM'97, volume 32, 12 of Sigplan Notices, pages 151-162, New York, 1997. ACM Press.
4. M. Alpuente, M. Falaschi, and G. Vidal. 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.
5. M. Alpuente, M. Falaschi, and G. Vidal. Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems, 20(4):768-844, 1998.
6. M. Alpuente, M. Falaschi, and G. Vidal. A Unifying View of Functional and Logic Program Specialization. ACM Computing Surveys, 30(3es):9es, 1998.
7. M. Alpuente, M. Hanus, S. Lucas, and G. Vidal. Specialization of Functional Logic Programs Based on Needed Narrowing. Technical report 99-4, RWTH Aachen, 1999. Available from ftp.informatik.rwth-aachen.de/pub/reports/.
8. S. Antoy. Definitional trees. In Proc. of the 3rd Int'l Conference on Algebraic and Logic Programming, ALP'92, pages 143-157. Springer LNCS 632, 1992.
9. 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.
10. S. Antoy, R. Echahed, and M. Hanus. Parallel evaluation strategies for functional logic languages. In Proc. of the 14th Int'l Conf. on Logic Programming (ICLP'97), pages 138-152. MIT Press, 1997.
11. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
12. F. Bellegarde. ASTRE: Towards a fully automated program transformation system. In Jieh Hsiang, editor, Proc. of RTA'95, pages 403-407. Springer LNCS 914, 1995.
13. A. Bondorf. Towards a Self-Applicable Partial Evaluator for Term Rewriting Systems. 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 27-50. North-Holland, Amsterdam, 1988.
14. R.M. Burstall and J. Darlington. A Transformation System for Developing Recursive Programs. Journal of the ACM, 24(1):44-67, 1977.
15. 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.
16. J. Darlington. Program transformation. In J. Darlington, P. Henderson, and D. A. Turner, editors, Functional Programming and its Applications, pages 193-215. Cambridge University Press, 1982.
17. 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.
18. N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467-494, 1993.
19. I. Durand. Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems. Journal of Symbolic Computation, 18(4):319-352, 1994.
20. A.J. Field and P.G. Harrison. Functional Programming. Addison-Wesley, Wokingham, 1988.
21. J. Gallagher. Tutorial on Specialisation of Logic Programs. In Proc. of PEPM'93, pages 88-98. ACM, New York, 1993.
22. E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel Leaf: A Logic plus Functional Language. Journal of Computer and System Sciences, 42:363-377, 1991.
23. R. Glück and M.H. Sørensen. Partial Deduction and Driving are Equivalent. In Proc. of PLILP'94, pages 165-181. Springer LNCS 844, 1994.
24. R. Glück and M.H. Sørensen. A Roadmap to Metacomputation by Supercompilation. In O. Danvy, R. Glück, and P. Thiemann, editors, Partial Evaluation, Int'l Seminar, Dagstuhl Castle, Germany, pages 137-160. Springer LNCS 1110, February 1996.
25. M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19&20:583-628, 1994.
26. M. Hanus. Efficient translation of lazy functional logic programs into Prolog. In Proc. 5th Int'l Workshop on Logic Program Synthesis and Transformation, pages 252-266. Springer LNCS 1048, 1995.
27. M. Hanus. A unified computation model for functional and logic programming. In Proc. of the 24th ACM Symposium on Principles of Programming Languages (Paris), pages 80-93. ACM, New York, 1997.
28. M. Hanus, S. Lucas, and A. Middeldorp. Strongly sequential and inductively sequential term rewriting systems. Information Processing Letters, 67(1):1-8, 1998.
29. M. Hanus and C. Prehofer. Higher-Order Narrowing with Definitional Trees. Journal of Functional Programming, 9(1):33-75, 1999.
30. M. Hanus (ed.). Curry: An Integrated Functional Logic Language. Version 0.5, Jan. 1999. Available at http://www-i2.informatik.rwth-aachen.de/~hanus/curry.
31. G. Huet and J.J. Lévy. Computations in orthogonal rewriting systems, Part I + II. In J.L. Lassez and G.D. Plotkin, editors, Computational Logic - Essays in Honor of Alan Robinson, pages 395-443, 1992.
32. J.M. Hullot. Canonical Forms and Unification. In Proc of 5th Int'l Conf. on Automated Deduction, pages 318-334. Springer LNCS 87, 1980.
33. N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, NJ, 1993.
34. 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.
35. H. Kuchen, R. Loogen, J.J. Moreno-Navarro, and M. Rodríguez-Artalejo. Lazy Narrowing in a Graph Machine. In Proc. of ALP'90, pages 298-317. Springer LNCS 463, 1990.
36. L. Lafave and J.P. Gallagher. Constraint-based Partial Evaluation of Rewriting-based Functional Logic Programs. In Proc. of LOPSTR'97, pages 168-188. Springer LNCS 1463, 1997.
37. J. Lam and A. Kusalik. A Comparative Analysis of Partial Deductors for Pure Prolog. Technical report, Department of Computational Science, University of Saskatchewan, Canada, May 1991. Revised April 1991.
38. M. Leuschel. The ECCE partial deduction system and the DPPD library of benchmarks. Technical report, Accessible via http://www.cs.kuleuven.ac.be/~lpai, 1998.
39. 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 Int'l Conference and Symposium on Logic Programming, JICSLP'96, pages 319-332. The MIT Press, Cambridge, MA, 1996.
40. J.W. Lloyd and J.C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, 11:217-242, 1991.
41. 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.
42. A. Miniussi and D. J. Sherman: Squeezing Intermediate Construction in Equational Programs. In O. Danvy, R. Glück, and P. Thiemann, editors, Partial Evaluation, Int'l Seminar, Dagstuhl Castle, Germany, pages 284-302. Springer LNCS 1110, February 1996.
43. J.J. Moreno-Navarro and M. Rodríguez-Artalejo. Logic Programming with Functions and Predicates: The language Babel. Journal of Logic Programming, 12(3):191-224, 1992.
44. A. Pettorossi and M. Proietti. A Comparative Revisitation of Some Program Transformation Techniques. In O. Danvy, R. Glück, and P. Thiemann, editors, Partial Evaluation, Int'l Seminar, Dagstuhl Castle, Germany, pages 355-385. Springer LNCS 1110, 1996.
45. S.L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.
46. R. Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison Wesley, 1993.
47. 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.
48. J.R. Slagle. Automated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity. Journal of the ACM, 21(4):622-642, 1974.
49. M.H. Sørensen, R. Glück, and N.D. Jones. A Positive Supercompiler. Journal of Functional Programming, 6(6):811-838, 1996.
50. P.L. Wadler. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science, 73:231-248, 1990.
51. F. Zartmann. Denotational Abstract Interpretation of Functional Logic Programs. In P. Van Hentenryck, editor, Proc. of the 4th Int'l Static Analysis Symposium, SAS'97, pages 141-159. Springer LNCS 1302, 1997.