Lazy narrowing with simplification

Computer Languages

Volumn 23, Issue 2-4, 1997, Pages 61-85

  Hanus, Michael ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Functional logic programming; Lazy narrowing; Narrowing; Term rewriting; Unification

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC;

FUNCTIONAL LOGIC PROGRAMMING; LAZY NARROWING;

LOGIC PROGRAMMING;

EID: 0031176661     PISSN: 00960551     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-0551(97)00010-6     Document Type: Article

References (44)

1. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming 19 & 20, 583-628 (1994).
2. J. R. Slagle. Automated theorem-proving for theories with simplifiers, commutativity, and associativity. Journal of the ACM 21, 622-642 (1974).
3. Hullot, J.-M., Canonical forms and unification. In Proc. 5th Conference on Automated Deduction, Springer LNCS 87, 1980, pp. 318-334.
4. Fribourg, L., SLOG: A logic programming language interpreter based on clausal superposition and rewriting. In Proc. IEEE International Symposium on Logic Programming, Boston, 1985, pp. 172-184.
5. Echahed, R., On completeness of narrowing strategies. In Proc. CAAP'88, Springer LNCS 299, 1988, pp. 89-101.
6. Reddy, U. S., Narrowing as the operational semantics of functional languages. In Proc. IEEE Internat. Symposium on Logic Programming, Boston, 1985, pp. 138-151.
7. Antoy, S., Echahed, R. and Hanus, M., A needed narrowing strategy. In Proc. 21st ACM Symposium on Principles of Programming Languages, Portland, 1994, pp. 268-279.
8. Hans, W., Loogen, R. and Winkler, S., On the interaction of lazy evaluation and backtracking. In Proc. of the 4th International Symposium on Programming Language Implementation and Logic Programming, Springer LNCS 631, 1992, pp. 355-369.
9. Fay, M. J., First-order unification in an equational theory. In Proc. 4th Workshop on Automated Deduction, Austin, TX, 1979. Academic Press, pp. 161-167.
10. Hölldobler, S., Foundations of Equational Logic Programming. Springer LNCS 353, 1989.
11. W. Nutt, P. Réty and G. Smolka. Basic narrowing revisited. Journal of Symbolic Computation 7, 295-317 (1989).
12. Réty, P., Improving basic narrowing techniques. In Proc. of the Conference on Rewriting Techniques and Applications, Springer LNCS 256, 1987, pp. 228-241.
13. Hanus, M., Improving control of logic programs by using functional logic languages. In Proc. of the 4th International Symposium on Programming Language Implementation and Logic Programming, Springer LNCS 631, 1992, pp. 1-23.
14. Echahed, R., Uniform narrowing strategies. In Proc. of the 3rd International Conference on Algebraic and Logic Programming, Springer LNCS 632, 1992, pp. 259-275.
15. Dershowitz, N., Mitra, S. and Sivakumar, G., Equation solving in conditional AC-theories. In Proc. of the 2nd International Conference on Algebraic and Logic Programming, Springer LNCS 463, 1990, pp. 283-297.
16. Hanus, M., On extra variables in (equational) logic programming. In Proc. International Conference on Logic Programming, MIT Press, 1995, pp. 665-679.
17. Baader, F. and Siekmann, J. H., Unification theory. In Handbook of Logic in Artificial Intelligence and Logic Programming, ed. D. M. Gabbay, C. J. Hogger and J. A. Robinson. Oxford University Press, 1994, pp. 41-125.
18. Darlington, J. and Guo, Y., Narrowing and unification in functional programming - an evaluation mechanism for absolute set abstraction. In Proc. of the Conference on Rewriting Techniques and Applications, Springer LNCS 355, 1989, pp. 92-108.
19. Moreno-Navarro, J. J., Kuchen, H., Loogen, R. and Rodríguez-Artalejo, M., Lazy narrowing in a graph machine. In Proc. Second International Conference on Algebraic and Logic Programming, Springer LNCS 463, 1990, pp. 298-317.
20. 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).
21. E. Giovannetti, G. Levi, C. Moiso and C. Palamidessi. Kernel LEAF: A logic plus functional language. Journal of Computer and System Sciences 42, 139-185 (1991).
22. Hanus, M., Compiling logic programs with equality. In Proc. of the 2nd Int. Workshop on Programming Language Implementation and Logic Programming, Springer LNCS 456, 1990, pp. 387-401.
23. Bert, D. and Echahed, R., Design and implementation of a generic, logic and functional programming language. In Proc. European Symposium on Programming, Springer LNCS 213, 1986, pp. 119-132.
24. Dershowitz, N. and Jouannaud, J.-P., Rewrite systems. In Handbook of Theoretical Computer Science, Vol. B, ed. J. van Leeuwen. Elsevier, 1990, pp. 243-320.
25. Padawitz, P., Computing in Horn Clause Theories, Vol. 16 of EATCS Monographs on Theoretical Computer Science. Springer, 1988.
26. Krischer, S. and Bockmayr, A., Detecting redundant narrowing derivations by the LSE-SL reducibility test. In Proc. RTA'91. Springer LNCS 488, 1991.
27. Martelli, A., Rossi, G. F. and Moiso, C., Lazy unification algorithms for canonical rewrite systems. In Resolution of Equations in Algebraic Structures, Vol. 2, Rewriting Techniques, Chapt. 8, ed. Hassan Aït-Kaci and Maurice Nivat. Academic Press, New York, 1989, pp. 245-274.
28. Prehofer, C., Higher-order narrowing. In Proc. Ninth Annual IEEE Symposium on Logic in Computer Science, 1994, pp. 507-516.
29. A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems 4, 258-282 (1982).
30. J. H. Gallier and W. Snyder. Complete sets of transformations for general E-unification. Theoretical Computer Science 67, 203-260 (1989).
31. J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing 15, 1155-1194 (1986).
32. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation 3, 69-116 (1987).
33. Geser, A. and Hussmann, H., Experiences with the RAP system - a specification interpreter combining term rewriting and resolution. In Proc. of ESOP 86, Springer LNCS 213, 1986, pp. 339-350.
34. Hanus, M., Efficient implementation of narrowing and rewriting. In Proc. Int. Workshop on Processing Declarative Knowledge, Springer LNAI 567, 1991, pp. 344-365.
35. R. Loogen and S. Winkler. Dynamic detection of determinism in functional logic languages. Theoretical Computer Science 142, 59-87 (1995).
36. Antoy, S., Definitional trees. In Proc. of the 3rd International Conference on Algebraic and Logic Programming, Springer LNCS 632, 1992, pp. 143-157.
37. Hanus, M., Efficient translation of lazy functional logic programs into Prolog. In Proc. Fifth International Workshop on Logic Program Synthesis and Transformation, Springer LNCS 1048, 1995, pp. 252-266.
38. Sterling, L. and Shapiro, E., The Art of Prolog. MIT Press, 1986.
39. A. Josephson and N. Dershowitz. An implementation of narrowing. Journal of Logic Programming 6, 57-77 (1989).
40. Dershowitz, N. and Plaisted, D. A., Equational programming. In Machine Intelligence 11, ed. J. E. Hayes, D. Michie and J. Richards. Oxford Press, 1988, pp. 21-56.
41. Loogen, R., Lopez Fraguas, F. and Rodriguez Artalejo, M., A demand driven computation strategy for lazy narrowing. In Proc. of the 5th International Symposium on Programming Language Implementation and Logic Programming, Springer LNCS 714, 1993, pp. 184-200.
42. Moreno-Navarro, J. J., Kuchen, H., Marino-Carballo, J., Winkler, S. and Hans, W., Efficient lazy narrowing using demandedness analysis. In Proc. of the 5th International Symposium on Programming Language Implementation and Logic Programming, Springer LNCS 714, 1993, pp. 167-183.
43. Chakravarty, M. M. T. and Lock, H. C. R., The implementation of lazy narrowing. In Proc. of the 3rd Int. Symposium on Programming Language Implementation and Logic Programming, Springer LNCS 528, 1991, pp. 123-134.
44. R. Loogen. Relating the implementation techniques of functional and functional logic languages. New Generation Computing 11, 179-215 (1993).