Implementing Natural Rewriting and Narrowing Efficiently

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2998, Issue , 2004, Pages 147-162

  Escobar, Santiago ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; FUNCTIONAL PROGRAMMING;

DEMAND-DRIVEN STRATEGY; DEMANDEDNESS; NATURAL REWRITING; SOUND AND COMPLETE;

LOGIC PROGRAMMING;

EID: 35048820404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24754-8_12     Document Type: Article

References (16)

1. M. Alpuente, S. Escobar, B. Gramlich, and S. Lucas. Improving on-demand strategy annotations. In M. Baaz and A. Voronkov, editors, Proc. of the 9th Int'l Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'02), Springer LNCS 2514, pages 1-18, 2002.
2. M. Alpuente, M. Falaschi, P. Julián, and G. Vidai. Specialization of lazy functional logic programs. In Proc. of the ACM SIGPLAN Conf. on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'97, ACM Sigplan Notices, 32(12):151-162, ACM Press, New York, 1997.
3. S. Antoy. Definitional trees. In Proc. of the 3rd Int'l Conf. on Algebraic and Logic Programming ALP'92, Springer LNCS 632, pages 143-157, 1992.
4. S. Antoy, R. Echahed, and M. Hanus. Parallel evaluation strategies for functional logic languages. In Proc. of the Fourteenth Int'l Conf. on Logic Programming (ICLP'97), pages 138-152. MIT Press, 1997.
5. S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Journal of the ACM, 47(4):776-822, 2000.
6. S. Antoy and M. Hanus. Compiling multi-paradigm declarative programs into prolog. In Proc. of the 3rd Int'l Workshop on Frontiers of Combining Systems (FroCoS 2000), Springer LNCS 1794, pages 171-185, 2000.
7. S. Antoy and S. Lucas. Demandness in rewriting and narrowing. In M. Comini and M. Falaschi, editors, Proc. of the 11th Int'l Workshop on Functional and (Constraint) Logic Programming WFLP'02, Elsevier ENTCS 76, 2002.
8. T. Arts and J. Giesl. A collection of examples for termination of term rewriting using dependency pairs. Technical report, AIB-2001-09, RWTH Aachen, Germany, 2001.
9. S. Escobar. Refining weakly outermost-needed rewriting and narrowing. In D. Miller, editor, Proc. of the 5th Int'l ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming, PPDP'03, pages 113-123. ACM Press, New York, 2003.
10. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
11. M. Hanus, S. Antoy, M. Engelke, K. Höppner, J. Koj, P. Niederau, R. Sadre, and F. Steiner. PAKCS 1.5.0: The Portland Aachen Kiel Curry System User Manual. Technical report, University of Kiel, Germany, 2003.
12. M. Hanus, S. Antoy, H. Kuchen, F. López-Fraguas, W. Lux, J. Moreno Navarro, and F. Steiner. Curry: An Integrated Functional Logic Language (version 0.8). Available at: http://www.informatik.uni-kiel.de/̃;curry, 2003.
13. G. Huet and J.-J. Levy. Computations in orthogonal term rewriting systems, Part I + II. In Computational logic: Essays in honour of J. Alan Robinson, pages 395-414 and 415-443. The MIT Press, Cambridge, MA, 1992.
14. 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.
15. R. Sekar and I. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. Information and Computation, 104(1):78-109, 1993.
16. TeReSe, editor. Term Rewriting Systems. Cambridge University Press, Cambridge, 2003.