A Demand-Driven Narrowing Calculus with Overlapping Definitional Trees

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 5, Issue , 2003, Pages 253-263

  Del Vado Vírseda, Rafael ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Call time choice; Definitional trees; Functional Logic Programming Languages; Narrowing; Rewrite Systems

Indexed keywords

ALGORITHMS; AUTOMATIC PROGRAMMING; COMPUTER PROGRAMMING; FORMAL LANGUAGES; FORMAL LOGIC; SEMANTICS; THEOREM PROVING;

CALL-TIME CHOICE; DEFINITIONAL TREES; FUNCTIONAL LOGIC PROGRAMMING LANGUAGES; NARROWING; REWRITE SYSTEMS;

TREES (MATHEMATICS);

EID: 1242332679     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. M. Abengózar-Carneros et al. TOY: a multiparadigm declarative language, version 2.0. Technical report, Dep. SIP, UCM Madrid, January 2001.
2. S. Antoy. Definitional trees. In Proc. Int. Conf. on Algebraic and Logic Programming (ALP'92), volume 632 of Springer LNCS, pages 143-157, 1992.
3. S. Antoy. Optimal non-deterministic functional logic computations. In Proc. of ALP'97, pages 16-30. Springer LNCS 1298, 1997.
4. S. Antoy. Constructor-based conditional narrowing. In Proc. PPDP'01, ACM Press, pp. 199-206, 2001.
5. S. Antoy, R. Echahed, M. Hanus. A needed narrowing strategy. Journal of the ACM, 47(4):776-822, 2000.
6. F. Baader, T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
7. J. C. González-Moreno, F.J.López-Fraguas, M.T. Hortalá-González, M. Rodríguez-Artalejo. An approach to declarative programming based on a rewriting logic. The Journal of Logic Programming, 40:47-87, 1999.
8. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
9. M. Hanus (ed.). Curry: An Integrated Functional Logic Language. Version 0.7.1, June 2000. Available at http://www.informatik.uni-kiel.de/curry/report.html.
10. M. Hanus, C. Prehofer. Higher-Order Narrowing with Definitional Trees. Journal of Functional Programming, 9(1):33-75, 1999.
11. M. Hanus, S. Lucas, A. Middeldorp. Strongly sequential and inductively sequential term rewriting systems. Information Processing Letters (Elsevier), vol. 67, n° 1, pp. 1-8, 1998.
12. G. Huet, J. J. Lévy. Computations in orthogonal term rewriting systems I, II. In J. L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honour of J. Alan Robinson, pages 395-414 and 415-443. The MIT Press, 1991.
13. H. Hussmann. Nondeterministic Algebraic Specification and non confluent term rewriting. Journal of Logic Programming, 12:237-255, 1992.
14. T. Ida, K. Nakahara. Leftmost outside-in narrowing calculi. Journal of Functional Programming, 7(2): 129-161, 1997.
15. R. Loogen, F. J. López-Fraguas, M. Rodríguez-Artalejo. A demand driven computation strategy for lazy narrowing. In Proc. Int. Symp. on Programming Language Implementation and Logic Programming (PLILP'93), volume 714 of Springer LNCS pages 184-200, 1993.
16. F. J. López-Fraguas, J. Sánchez-Hernández. Functional logic programming with failure: A set-oriented view. In Proc. LPAR'01, pages 455-469, Springer LNAI 2250, 2001.
17. A. Middeldorp. Call by Need Computations to Root-Stable Form. In Proc. POPL'1997, ACM Press, 1997.
18. A. Middeldorp, S. Okui. A deterministic lazy narrowing calculus. Journal of Symbolic Computation, 25 (6), pp. 733-757, 1998.
19. R. del Vado Vírseda. Estrategias de Estrechamiento Perezoso. A Master's Thesis Directed by Dr. M. Rodríguez-Artalejo. Dpto. Sistemas Informáticos y Programación. Facultad de CC. Matemáticas, U.C.M. September 2002.
20. R. del Vado Vírseda. A Demand Narrowing with Overlapping Definitional Trees. Technical Report SIP 132/03, UCM Madrid, 2003.