Constructor-based conditional narrowing

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

Volumn , Issue , 2001, Pages 199-206

  Antoy, Sergio ^a  

^a NONE

Author keywords

Call By Need; Functional Logic Programming Languages; Narrowing Strategies; Rewrite Systems

Indexed keywords

ALGORITHMS; AUTOMATIC PROGRAMMING; FORMAL LOGIC;

REWRITE SYSTEMS;

LOGIC PROGRAMMING;

EID: 0035790276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773184.773205     Document Type: Conference Paper

References (22)

1. S. Antoy. Non-determinism and lazy evaluation in logic programming. In T. P. Clement and K.-K. Lau, editors, Logic Programming Synthesis and Transformation (LOPSTR'91), pages 318-331, Manchester, UK, July 1991. Springer-Verlag.
2. S. Antoy. Definitional trees. In Proc. of the 3rd International Conference on Algebraic and Logic Programming (ALP'92), pages 143-157. Springer LNCS 632, 1992.
3. S. Antoy. Optimal non-deterministic functional logic computations. In Proc. International Conference on Algebraic and Logic Programming (ALP'97), pages 16-30. Springer LNCS 1298, 1997.
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, July 2000.
6. S. Antoy, M. Hanus, B. Massey, and E Steiner. An implementation of narrowing. In Principles and Practice of Declarative Programming (PPDP'01), Sept. 2001. (In this volume).
7. S. Antoy and A. Middeldorp. A sequential strategy. Theoretical Computer Science, 165:75-95, 1996.
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. G. Boudol. Computational semantics of term rewriting systems. In M. Nivat and J. C. Reynolds, editors, Algebraic methods in semantics, chapter 5. Cambridge University Press, Cambridge, UK, 1985.
10. 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.
11. J. C. González Moreno, F. J. López Fraguas, M. T. Hortalá González, and M. Rodríguez Artalejo. An approach to declarative programming based on a rewriting logic. The Journal of Logic Programming, 40:47-87, 1999.
12. M. Hanus. On extra variables in (equational) logic programming. In Proc. Twelfth International Conference on Logic Programming, pages 665-679. MIT Press, 1995.
13. M. Hanus. A unified computation model for functional and logic programming. In Proc. of the 24th ACM Symposium on Principles of Programming Languages (Paris), pages 80-93, 1997.
14. M. Hanus, S. Lucas, and A. Middeldorp. Strongly sequential and inductively sequential term rewriting systems. Information Processing Letters, 67(1): 1-8, 1998.
15. G. Huet and J.-J. Lévy. Computations in orthogonal term rewriting systems. In J.-L. Lassez and G. Plotkin, editors, Computational logic: essays in honour of Alan Robinson. MIT Press, Cambridge, MA, 1991.
16. T. Ida and K. Nakahara. Leftmost outside-in narrowing calculi. Journal of Functional Programming, 7(2):129-161, 1997.
17. R. Loogen, F. López Fraguas, and M. Rodríguez Artalejo. A demand driven computation strategy for lazy narrowing. In Proc. 5th International Symposium on Programming Language Implementation and Logic Programming (PLILP'93), pages 184-200. Springer LNCS 714, 1993.
18. M. Marchiori. Unravelings and ultra-properties. In Proceedings of the Fifth International Conference on Algebraic and Logic Programming (ALP'96), pages 107-121. Springer LNCS 1139, 1996.
19. A. Middeldorp and S. Okui. A deterministic lazy narrowing calculus. Journal of Symbolic Computation, 25(6):733-757, 1998.
20. A. Middeldorp, S. Okui, and T. Ida. Lazy narrowing: Strong completeness and eager variable elimination. Theoretical Computer Science, 167(1,2):95-130, 1996.
21. M. J. O'Donnell. Computing in Systems Described by Equations. Springer LNCS 58, 1977.
22. R. C. Sekar and I. V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. Information and Computation, 104(1):78-109, May 1993.