Conditional Narrowing without Conditions

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

Volumn 5, Issue , 2003, Pages 20-31

  Antoy, Sergio ^a   Brassel, Bernd ^b   Hanus, Michael ^b  

^a Department of Electrical and Computer Engineering   (United States)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Conditional Rewriting; Evaluation Strategies; Functional Logic Programming; Narrowing

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL TRANSFORMATIONS; PARALLEL PROCESSING SYSTEMS; SET THEORY; THEOREM PROVING;

CONDITIONAL REWRITING; FUNCTIONAL LOGIC PROGRAMMING; NARROWING SYSTEMS;

LOGIC PROGRAMMING;

EID: 1242310203     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/888251.888255     Document Type: Conference Paper

References (36)

1. S. Antoy. Definitional trees. In Proc. of the 3rd International Conference on Algebraic and Logic Programming, pages 143-157. Springer LNCS 632, 1992.
2. S. Antoy. Constructor-based conditional narrowing. In Proc. of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2001), pages 199-206. ACM Press, 2001.
3. S. Antoy, R. Echahed, and M. Hanus. A parallel narrowing strategy. Technical report tr 96-1, Portland State University, 1996.
4. S. Antoy, R. Echahed, and M. Hanus. Parallel evaluation strategies for functional logic languages. In Proc. of the Fourteenth International Conference on Logic Programming (ICLP'97), pages 138-152. MIT Press, 1997.
5. S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. Journal of the ACM, 47(4):776-822, 2000.
6. S. Antoy, M. Hanus, B. Massey, and F. Steiner. An implementation of narrowing strategies. In Proc. of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP 2001), pages 207-217. ACM Press, 2001.
7. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
8. J.A. Bergstra and J.W. Klop. Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences, 32(3):323-362, 1986.
9. J.A. Bergstra and J.V. Tucker. Algebraic specifications of computable and semicomputable data types. Theoretical Computer Science, 75:111-138, 1987.
10. D. Bert and R. Echahed. Design and implementation of a generic, logic and functional programming language. In Proc. European Symposium on Programming, pages 119-132. Springer LNCS 213, 1986.
11. B. Brassel. Conditional narrowing with lazy evaluation (in german). Master's thesis, RWTH Aachen, 1999.
12. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pages 243-320. Elsevier, 1990.
13. N. Dershowitz and M. Okada. A rationale for conditional equational programming. Theoretical Computer Science, 75:111-138, 1990.
14. L. Fribourg. SLOG: A logic programming language interpreter based on clausal superposition and rewriting. In Proc. IEEE Internat. Symposium on Logic Programming, pages 172-184, Boston, 1985.
15. E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel LEAF: A logic plus functional language. Journal of Computer and System Sciences, 42(2): 139-185, 1991.
16. E. Giovannetti and C. Moiso. Notes on the elimination of conditions. In Proc. CTRS'87, pages 91-97. Springer LNCS 308, 1987.
17. M. Hanus. Compiling logic programs with equality. In Proc. of the 2nd Int. Workshop on Programming Language Implementation and Logic Programming, pages 387-401. Springer LNCS 456, 1990.
18. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
19. M. Hanus. Reduction strategies for declarative programming. In B. Gramlich and S. Lucas, editors, Electronic Notes in Theoretical Computer Science, volume 57. Elsevier Science Publishers, 2001.
20. M. Hanus, S. Lucas, and A. Middeldorp. Strongly sequential and inductively sequential term rewriting systems. Information Processing Letters, 67(1):1-8, 1998.
21. M. Hanus (ed.). Curry: An integrated functional logic language (vers. 0.8). Available at http://www.informatik.uni-kiel.de/̃curry, 2003.
22. C. Hintermeier. How to transform canonical decreasing CTRSs into equivalent canonical TRSs. In Proc. of the 4th International Workshop on Conditional and Typed Rewriting Systems (CTRS'94), pages 186-205. Springer LNCS 968, 1994.
23. G. Huet and J.-J. Lévy. Computations in orthogonal rewriting systems. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 395-443. MIT Press, 1991.
24. T. Johnsson. Lambda lifting: Transforming programs to recursive functions. In Functional Programming Languages and Computer Architecture, pages 190-203. Springer LNCS 201, 1985.
25. J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume II. Oxford University Press, 1992.
26. J. Lloyd. Programming in an integrated functional and logic language. Journal of Functional and Logic Programming, (3): 1-49, 1999.
27. R. Loogen, F. Lopez Fraguas, and M. Rodríguez Artalejo. A demand driven computation strategy for lazy narrowing. In Proc. of the 5th International Symposium on Programming Language Implementation and Logic Programming, pages 184-200. Springer LNCS 714, 1993.
28. F. López-Fraguas and J. Sánchez-Hernández. TOY: A Multiparadigm Declarative System. In Proc. of RTA'99, pages 244-247. Springer LNCS 1631, 1999.
29. M. Marchiori. Unravelings and ultra-properties. In 5th International Conference on Algebraic and Logic Programming (ALP'96), pages 107-121. Springer LNCS 1139, 1996.
30. J.J. Moreno-Navarro, H. Kuchen, R. Loogen, and M. Rodríguez-Artalejo. Lazy narrowing in a graph machine. In Proc. Second International Conference on Algebraic and Logic Programming, pages 298-317. Springer LNCS 463, 1990.
31. J.J. Moreno-Navarro and M. Rodríguez-Artalejo. Logic programming with functions and predicates: The language BABEL. Journal of Logic Programming, 12:191-223, 1992.
32. M.J. O'Donnell. Equational Logic as a Programming Language. MIT Press, 1985.
33. E. Ohlebusch. Transforming conditional rewrite system with extra variables into unconditional systems. In Proc. of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR'99), pages 111-130. Springer LNCS 1705, 1999.
34. G. Smolka. The Oz programming model. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, pages 324-343. Springer LNCS 1000, 1995.
35. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1-3): 17-64, 1996.
36. P. Viry. Elimination of conditions. Journal of Symbolic Computation, 28:381-400, 1999.