Higher-order narrowing with definitional trees

Journal of Functional Programming

Volumn 9, Issue 1, 1999, Pages 33-75

  Hanus, Michael ^a   Prehofer, Christian ^b,c  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b SIEMENS AG   (Germany)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033449591     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003330     Document Type: Article

References (42)

1. Antoy, S. (1992) Definitional trees. Proc. 3rd International Conference on Algebraic and Logic Programming: Lecture Notes in Computer Science 632, pp. 143-157. Springer-Verlag.
2. Antoy, S. (1996) Needed narrowing in Prolog. Proc. 8th International Symposium on Programming Languages. Implementations, Logics and Programs (PLILP'96): Lecture Notes in Computer Science 1140, pp. 473-474. Springer-Verlag.
3. Antoy, S., Echahed, R. and Hanus, M. (1994). A needed narrowing strategy. Proc. 21st ACM Symposium on Principles of Programming Languages, pp. 268-279.
4. Asperti, A. and Laneve, C. (1994) Interaction systems I: The theory of optimal reductions. Mathematical Structures in Computer Science, 4, 457-504.
5. Avenhaus, J. and Loría-Sáenz, C. A. (1994) Higher-order conditional rewriting and narrowing. In: Jouannaud, J.-P. (ed), 1st International Conference on Constraints in Computational Logics: Lecture Notes in Computer Science 845. Springer-Verlag.
6. Baader, F. and Nipkow, T. (1998) Term Rewriting and All That. Cambridge University Press.
7. Barendregt, H. P. (1984) The Lambda Calculus, its syntax and semantics (2nd ed.). North Holland.
8. Dershowitz, N. and Jouannaud, J.-P. (1990) Rewrite systems. In: Leeuwen, J. V. (ed.), Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pp. 243-320. Elsevier.
9. Giovannetti, E., Levi, G., Moiso, C. and Palamidessi, C. (1991) Kernel LEAF: A logic plus functional language. J. Computer and System Sciences, 42(2), 139-185.
10. González-Moreno, J. C., Hortalá-González, M. T. and Rodriguez-Artalejo, M. (1992) On the completeness of narrowing as the operational semantics of functional logic programming. Proc. Computer Science Logic '92: Lecture Notes in Computer Science 702, pp. 216-230. Springer-Verlag.
11. Hanus, M. (1994) The integration of functions into logic programming: From theory to practice. J. Logic Programming, 19-20, 583-628.
12. Hanus, M. (1995) Efficient translation of lazy functional logic programs into Prolog. Proc. 5th International Workshop on Logic Program Synthesis and Transformation: Lecture Notes in Computer Science 1048, pp. 252-266. Springer-Verlag.
13. Hanus, M. (1997). A unified computation model for functional and logic programming. Proc. 24th ACM Symposium on Principles of Programming Languages, pp. 80-93. Paris, France.
14. Hindley, J. R. and Seldin, J. P. (1986) Introduction to Combinators and λ-calculus. Cambridge University Press.
15. Hölldobler, S. (1989) Foundations of equational logic programming: Lecture Notes in Computer Science 353. Springer-Verlag.
16. Hudak, P., Peyton Jones, S. and Wadler, P. (1992) Report on the programming language Haskell: A non-strict, purely functional language. ACM SIGPLAN Notices, 27(5). (Version 1.2.)
17. Huet, G. and Lévy, J.-J. (1991) Computations in orthogonal rewriting systems, I. In: Lassez, J.-L. and Plotkin, G. (eds.), Computational Logic: Essays in Honor of Alan Robinson, pp. 395-414. MIT Press.
18. Hullot, J.-M. (1980) Canonical forms and unification. Proc. 5th Conference on Automated Deduction: Lecture Notes in Computer Science 87, pp. 318-334. Springer-Verlag.
19. Ida, T. and Nakahara, K. (1997) Leftmost outside-in narrowing calculi. J. Functional Programming, 7(2), 129-161.
20. Klop, J. W. (1980) Combinatory reduction systems. Mathematical Centre Tracts 127. Mathematisch Centrum, Amsterdam.
21. Lloyd, J. W. (1994) Combining functional and logic programming languages. Proc. 1994 International Logic Programming Symposium (ILPS'94).
22. Loogen, R., Fraguas, F. L. and Artalejo, M. R. (1993) A demand driven computation strategy for lazy narrowing. Proc. 5th International Symposium on Programming Language Implementation and Logic Programming: Lecture Notes in Computer Science 714, pp. 184-200. Springer-Verlag.
23. Loría-Sáenz, C. A. (1993) A theoretical framework for reasoning about program construction based on extensions of rewrite systems. PhD thesis, University of Kaiserslautern.
24. Martelli, A. and Montanari, U. (1982). An efficient unification algorithm. ACM Trans. Programming Languages and Systems, 4(2), 258-282.
25. Martelli, A., Rossi, G. F. and Moiso, C. (1989) Lazy unification algorithms for canonical rewrite systems. In: Aït-Kaci, H. and Nivat, M. (eds.), Resolution of Equations in Algebraic Structures, Volume 2, Rewriting Techniques, pp. 245-274. Academic Press.
26. Middeldorp, A. (1997) Call by need computations to root-stable form. Proc. 24th ACM Symposium on Principles of Programming Languages, pp. 94-105.
27. Middeldorp, A., Okui, S. and Ida, T. (1996) Lazy narrowing: Strong completeness and eager variable elimination. Theor. Comput. Sci., 167(1, 2), 95-130.
28. Miller, D. (1991) A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation, 1, 497-536.
29. Moreno-Navarro, J. J. and Rodriguez-Artalejo, M. (1992) Logic programming with functions and predicates: The language BABEL. J. Logic Programming, 12, 191-223.
30. Nadathur, G. and Miller, D. (1988) An overview of λProlog. Proc. 5th Conference on Logic Programming & 5th Symposium on Logic Programming (Seattle), pp. 810-827. MIT Press.
31. Nakahara, K., Middeldorp, A. and Ida, T. (1995) A complete narrowing calculus for higher-order functional logic programming. Proc. 7th International Symposium on Programming Languages, Implementations, Logics and Programs (PULP'95): Lecture Notes in Computer Science 982, pp. 97-114. Springer-Verlag.
32. Nipkow, T. (1991) Higher-order critical pairs. Proc. 6th IEEE Symp. Logic in Computer Science, pp. 342-349.
33. Oostrom, V. (1994) Confluence for abstract and higher-order rewriting. PhD thesis, Vrije Universiteit. Amsterdam.
34. Oostrom, V. (1996) Higher-order families. In: Ganzinger, H. (ed.), Proc. 7th International Conference on Rewriting Techniques and Applications (RTA'96): Lecture Notes in Computer Science 1103. Springer-Verlag.
35. Peyton Jones, S. L. (1987) The Implementation of Functional Programming Languages. Prentice Hall.
36. Prehofer, C. (1994) Higher-order narrowing. Proc. 9th Annual IEEE Symposium on Logic in Computer Science, pp. 507-516. IEEE Press.
37. Prehofer, C. (1995a) A Call-by-Need Strategy for Higher-Order Functional-Logic Programming. In: Lloyd, J. (ed.), Proc. of the 1995 International Symposium on Logic Programming, pp. 147-161. MIT Press.
38. Prehofer, C. (1995b) Higher-order narrowing with convergent systems. 4th Int. Conf. Algebraic Methodology and Software Technology. AMAST '95: Lecture Notes in Computer Science 936. Springer-Verlag.
39. Prehofer, C. (1996) Some applications of functional logic programming. Proc. JICSLP'96 Workshop on Multi-Paradigm Logic Programming. TU Berlin, Technical Report No. 96-28, pp. 35-45.
40. Prehofer, C. (1997) Solving Higher-order Equations: From logic to programming. Birkhäuser PCTS Series.
41. Slagle, J. R. (1974) Automated theorem-proving for theories with simplifiera, commutativity, and associativity. J. ACM, 21(4), 622-642.
42. Snyder, W. and Gallier, J. (1989) Higher-order unification revisited: Complete sets of transformations. J. Symbolic Computation, 8, 101-140.