Narrowing the narrowing space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1292, Issue , 1997, Pages 1-15

  Antoy, Sergio ^a   Ariola, Zena M ^b  

^a PORTLAND STATE UNIVERSITY   (United States)

^b UNIVERSITY OF OREGON   (United States)

Author keywords

Computed expression; Finite representation; Functional logic programming; Narrowing; Narrowing space; Regular computed expression

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING;

COMPUTED EXPRESSION; FINITE REPRESENTATION; FUNCTIONAL LOGIC PROGRAMMING; NARROWING; NARROWING SPACE; REGULAR COMPUTED EXPRESSION;

FUNCTIONAL PROGRAMMING;

EID: 84922960766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0033833     Document Type: Conference Paper

References (27)

1. D. Angluin and C. Smith. Inductive inference: Theory and methods. Computing Surveys, 15(3):237-269, 1983.
2. S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Proc. 21st ACM Symposium on Principles of Programming Languages, pages 268-279, Portland, 1994. URL www. cs.pdx.edu/~antoy/publications.html.
3. S. Antoy, R. Echahed, and M. Hanus. A parallel narrowing strategy. In 14th Int’l Conference on Logic Programming, Leuven, Belgium, July 1997. (to appear) URL www.cs. pdx.edu/~antoy/publications.html.
4. A. Bockmayr, S. Krischer, and A. Werner. An optimal narrowing strategy for general canonical systems. In Proc. of the 3rd Intern. Workshop on Conditional Term Rewriting Systems, pages 483-497. Springer LNCS 656,1992.
5. R.S. Boyer and J.S. Moore. Proving theorems about LISP functions. JACM, 22(1):129-144, Jan. 1975.
6. J. Darlington and Y. Guo. Narrowing and unification in functional programming - an evaluation mechanism for absolute set abstraction. In Proc. of the Conference on Rewriting Techniques and Applications, pages 92-108. Springer LNCS 355, 1989.
7. N. Dershowitz and J. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science B: Formal Methods and Semantics, chapter 6, pages 243-320. North Holland, Amsterdam, 1990.
8. R. Echahed. On completeness of narrowing strategies. In Proc. CAAP'88, pages 89-101. Springer LNCS 299, 1988.
9. R. Echahed. Uniform narrowing strategies. In Proceedings of the Third International Conference on Algebraic and Logic Programming, pages 259-275, Volterra, Italy, September 1992.
10. M. J. Fay. First-order unification in an equational theory. In Proc. 4th Workshop on Automated Deduction, pages 161-167, Austin (Texas), 1979. Academic Press.
11. 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.
12. S.J. Garland and J.V. Guttag. Inductive methods for reasoning about abstract data types. In A CM SIGA CT-SIGPLAN Symposium of Principles of Programming Languages, pages 219-228, 1988.
13. E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel LEAF: a logic plus functional language. The Journal of Computer and System Sciences, 42:139-185, 1991.
14. W. Hans, R. Loogen, and S. Winkler. On the interaction of lazy evaluation and backtracking. In Proc. of the 4th International Symposium on Programming Language Implementation and Logic Programming, pages 355-369. Springer LNCS 631, 1992.
15. M. Hanus. Lazy narrowing with simplification. Computer Languages (to appear), 1997.
16. A. Herold. Narrowing techniques applied to idempotent unification. Technical Report SR-86-16, SEKI, 1986.
17. S. Hölldobler. Foundations of Equational Logic Programming. Springer LNCS 353, 1989.
18. G. Huet and J.-M. Hullot. Proofs by induction in equational theories with constructors. JCSS, 25:239-266, 1982.
19. J. W. Klop. Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibanm, editors, Handbook of Logic in Computer Science, VoI. II, pages 1-112. Oxford University Press, 1992.
20. S. Krischer and A. Bockmayr. Detecting redundant narrowing derivations by the LSE-SL reducibility test. In Proc. RTA '9l. Springer LNCS 488, 1991.
21. A. Middeldorp and E. Hamoen. Counterexamples to completeness resutts for basic narrowing (extended abstract). In Proceedings of the Third International Conference on Algebraic and Logic Programming, pages 244-258, Volterra, Italy, September 1992.
22. J. J. Moreno-Navarro, H. Kuchen, R. Loogen, and M. Rodrlguez-Artalejo. Lazy narrowing in a graph machine. In Proc. Second International Conference on Algebraic and Logic Programming, pages 298-317. Springer LNCS 463, 1990.
23. 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.
24. W. Nutt, P. Réty, and G. Smolka. Basic narrowing revisited. Journal of Symbolic Computation, 7:295-317, 1989.
25. S. L. Peyton Jones. The implementation of Functional Programming Languages. Prentice-Hall International, Englewood Cliffs, N.J., 1987.
26. U. S. Reddy. Narrowing as the operational semantics of functional languages. In Proc. IEEE Internat. Symposium on Logic Programming, pages 138-151, Boston, 1985.
27. J.-H. You. Unification modulo an equality theory for equational logic programming. The Journal of Computer and System Sciences, 42(1):54-75, 1991.