A deterministic lazy narrowing calculus

Journal of Symbolic Computation

Volumn 25, Issue 6, 1998, Pages 733-757

  Middeldorp, Aart ^a   Okui, Satoshi ^b  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b MIE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032090791     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1997.0197     Document Type: Article

References (25)

1. Antoy, S., Echahed, R., Hanus, M. (1994). A needed narrowing strategy. In Proc. 21st ACM Symp. on Principles of Programming Languages, pp. 268-279. ACM Press, New York.
2. Antoy, S., Echahed, R., Hanus, M. (1997). Parallel evaluation strategies for functional logic languages. In Proc. 14th Int. Conf. on Logic Programming, pp. 138-152. MIT Press, Cambridge, MA.
3. Bockmayr, A., Krischer, S., Werner, A. (1995). Narrowing strategies for arbitrary canonical systems. Fundamenta Informaticae, 24, 125-155.
4. Boudol, G. (1985). Computational semantics of term rewriting systems. In Nivat, M., Reynolds, J., eds, Algebraic Methods in Semantics, pp. 169-236. Cambridge University Press, Cambridge.
5. Dershowitz, N., Jouannaud, J.-P. (1990). Rewrite systems. In van Leeuwen, J., ed., Handbook of Theoretical Computer Science, volume B, pp. 243-320. Amsterdam, Elsevier.
6. Giovannetti, E., Levi, G., Moiso, C., Palamidessi, C. (1991). Kernel-leaf: A logic plus functional language. J. Comput. Syst. Sci. 42, 139-185.
7. González-Moreno, J., Hortalá-González, M., López-Fraguas, F., Rodríguez-Artalejo, M. (1996). A rewriting logic for declarative programming. In Proc. 6th Euro. Symp. on Programming, LNCS, 1058, pp. 156-172. Berlin, Springer.
8. Hamada, M., Middeldorp, A. (1997). Strong completeness of a lazy conditional narrowing calculus. In Proc. 2nd Fuji Int. Workshop on Functional and Logic Programming, pp. 14-32, Singapore, World Scientific.
9. Hanus, M. (1994a). The integration of functions into logic programming: from theory to practice. J. Logic Programming, 19 & 20, 583-628.
10. Hanus, M. (1994b). Lazy unification with simplification. In Proc. 5th Euro. Symp. on Programming, LNCS, 788, pp. 272-286, Berlin, Springer.
11. Hölldobler, S. (1987). A unification algorithm for confluent theories. In Proc. 14th Int. Coll. on Automata, Languages and Programming, LNCS, 267, pp. 31-41, Berlin, Springer.
12. Hölldobler, S. (1989). Foundations of Equational Logic Programming, LNAI, 353, Berlin, Springer.
13. Huet, G., Lévy, J.-J. (1991). Computations in orthogonal rewriting systems, I and II. In Lassez, J.-L., Plotkin, G., (eds), Computational Logic, Essays in Honor of Alan Robinson, pp. 396-443. The MIT Press, Cambridge, MA.
14. Hullot, J.-M. (1980). Canonical forms and unification. In Proc. 5th Conf. on Automated Deduction, LNCS, 87, pp. 318-334, Berlin, Springer.
15. Ida, T., Nakahara, K. (1997). Leftmost outside-in narrowing calculi. J. Functional Programming, 7(2), 129-161.
16. Klop, J. (1992). Term rewriting systems. In Abramsky, S., Gabbay, D., Maibaum, T., eds, Handbook of Logic in Computer Science, Vol. 2, pp. 1-116. Oxford, Oxford University Press.
17. Loogen, R., López-Fraguas, F., Rodríguez-Artalejo, M. (1993). A demand driven computation strategy for lazy narrowing. In Proc. 5th Int. Symp. on Programming Language Implementation and Logic Programming, LNCS, 714, pp. 184-200, Berlin, Springer.
18. Loogen, R., Winkler, S. (1995). Dynamic detection of determinism in functional logic languages. Theoret. Comput. Sci., 142, 59-87.
19. Martelli, A., Moiso, C., Rossi, G. (1989). Lazy unification algorithms for canonical rewrite systems. In Aït-Kaci, H., Nivat, M., eds, Resolution of Equations in Algebraic Structures, Vol. II, Rewriting Techniques, pp. 245-274. New York, Academic Press.
20. Martelli, A., Rossi, G., Moiso, C. (1986). An algorithm for unification in equational theories. In Proc. 1986 Symp. on Logic Programming, pp. 180-186. IEEE Computer Society Press, Washington, DC.
21. Middeldorp, A., Hamoen, E. (1994). Completeness results for basic narrowing. Applicable Algebra in Engineering, Communication and Computing, 5, 213-253.
22. Middeldorp, A., Okui, S., Ida, T. (1996). Lazy narrowing: strong completeness and eager variable elimination. Theoret. Comput. Sci., 167, 95-130.
23. Moreno-Navarro, J., Rodríguez-Artalejo, M. (1992). Logic programming with functions and predicates: The language babel. J. Logic Programming, 12, 191-223.
24. Snyder, W. (1991). A Proof Theory for General Unification. Boston, Birkhäuser.
25. Suzuki, T. (1996). Standardization theorem revisited. In Proc. 5th Int. Conf. on Algebraic and Logic Programming, LNCS, 1139, pp. 122-134, Berlin, Springer.