Abstract
Outermost-needed rewriting/narrowing
Work partially supported by MCyT under grants TIC2001-2705-C03-01, HA2001-0059 and HU2001-0019.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alpuente, M., Escobar, S., Gramlich, B., Lucas, S.: Improving on-demand strategy annotations. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol. 2514, pp. 1–18. Springer, Heidelberg (2002)
Alpuente, M., Falaschi, M., Julián, P., Vidal, G.: Specialization of lazy functional logic programs. In: Proc. of the ACM SIGPLAN Conf. on Partial Evaluation and Semantics-Based Program Manipulation, PEPM 1997, ACM Sigplan Notices, vol. 32(12), pp. 151–162. ACM Press, New York (1997)
Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632, pp. 143–157. Springer, Heidelberg (1992)
Antoy, S., Echahed, R., Hanus, M.: Parallel evaluation strategies for functional logic languages. In: Proc. of the Fourteenth Int’l Conf. on Logic Programming (ICLP 1997), pp. 138–152. MIT Press, Cambridge (1997)
Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. Journal of the ACM 47(4), 776–822 (2000)
Antoy, S., Hanus, M.: Compiling multi-paradigm declarative programs into prolog. In: Kirchner, H. (ed.) FroCos 2000. LNCS, vol. 1794, pp. 171–185. Springer, Heidelberg (2000)
Antoy, S., Lucas, S.: Demandness in rewriting and narrowing. In: Comini, M., Falaschi, M. (eds.) Proc. of the 11th Int’l Workshop on Functional and (Constraint) Logic Programming WFLP 2002. ENTCS, vol. 76. Elsevier, Amsterdam (2002)
Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical report, AIB-2001-09, RWTH Aachen, Germany (2001)
Escobar, S.: Refining weakly outermost-needed rewriting and narrowing. In: Miller, D. (ed.) Proc. of the 5th Int’l ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming, PPDP 2003, pp. 113–123. ACM Press, New York (2003)
Hanus, M.: The integration of functions into logic programming: From theory to practice. Journal of Logic Programming 19&20, 583–628 (1994)
Hanus, M., Antoy, S., Engelke, M., Höppner, K., Koj, J., Niederau, P., Sadre, R., Steiner, F.: PAKCS 1.5.0: The Portland Aachen Kiel Curry System User Manual. Technical report, University of Kiel, Germany (2003)
Hanus, M., Antoy, S., Kuchen, H., López-Fraguas, F., Lux, W., Moreno Navarro, J., Steiner, F.: Curry: An Integrated Functional Logic Language (version 0.8) (2003), Available at http://www.informatik.uni-kiel.de/~curry
Huet, G., Lévy, J.-J.: Computations in orthogonal term rewriting systems, Part I + II. In: Computational logic: Essays in honour of J. Alan Robinson, pp. 395–414, 415–443. The MIT Press, Cambridge (1992)
Moreno-Navarro, J., Rodríguez-Artalejo, M.: Logic programming with functions and predicates: The language Babel. Journal of Logic Programming 12(3), 191–224 (1992)
Sekar, R., Ramakrishnan, I.: Programming in equational logic: Beyond strong sequentiality. Information and Computation 104(1), 78–109 (1993)
TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Escobar, S. (2004). Implementing Natural Rewriting and Narrowing Efficiently. In: Kameyama, Y., Stuckey, P.J. (eds) Functional and Logic Programming. FLOPS 2004. Lecture Notes in Computer Science, vol 2998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24754-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-24754-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21402-1
Online ISBN: 978-3-540-24754-8
eBook Packages: Springer Book Archive