Mircea Marin
ABSTRACT
We show the completeness of the lazy conditional narrowing calculus (LCNC) with leftmost selection for the class of deterministic conditional rewrite systems (CTRSs). Deterministic CTRSs permit extra variables in the right-hand sides and conditions of their rewrite rules. From the completeness proof we obtain several insights to make the calculus more deterministic. Furthermore, and similar to the refinements developed for the unconditional case, we succeeded in removing all nondeterminism due to the choice of the inference rule of LCNC by imposing further syntactic conditions on the participating CTRSs and restricting the set of solutions for which completeness needs to be established.
- S. Antoy. Constructor-based conditional narrowing. In Proc. 3rd PPDP, pages 199--206, 2001. Google Scholar
Digital Library
- S. Antoy, B. Brassel, and M. Hanus. Conditional narrowing without conditions. In Proc. 5th PPDP, pages 20--31, 2003. Google ScholarDigital Library
- S. Antoy, R. Echahed, and M. Hanus. Parallel evaluation strategies for functional logic languages. In Proc. 14th ICLP, pages 138--152, 1997.Google Scholar
- S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. J. ACM, 47(4):776--822, 2000. Google ScholarDigital Library
- F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998. Google ScholarDigital Library
- H. Ganzinger. Order-sorted completion: The many-sorted way. TCS, 89:3--32, November 1991. Google ScholarDigital Library
- J. C. González-Moreno, M. T. Hortalá-González, and M. Rodríguez-Artalejo. Polymorphic types in functional logic programming. JFLP, 2001(1), 2001.Google Scholar
- M. Hanus. A unified computation model for functional and logic programming. In Proc. 24th POPL, pages 80--93, 1997. Google ScholarDigital Library
- M. Marin and F. Piroi. Deduction and presentation in ρLog. In Proc. Mathematical Knowledge Management Symposium, volume 93 of ENTCS, pages 161--182, 2004.Google ScholarCross Ref
- A. Middeldorp and S. Okui. A deterministic lazy narrowing calculus. JSC, 25(6):733--757, 1998. Google ScholarDigital Library
- A. Middeldorp, S. Okui, and T. Ida. Lazy narrowing: Strong completeness and eager variable elimination. TCS, 167(1,2):95--130, 1996. Google ScholarDigital Library
- A. Middeldorp, T. Suzuki, and M. Hamada. Complete selection functions for a lazy conditional narrowing calculus. JFLP, 2002(3), March 2002.Google Scholar
- J. J. Moreno-Navarro and M. Rodriguez-Artalejo. Logic programming with functions and predicates: The language BABEL. JLP, 12(3-4):191--223, 1992. Google ScholarDigital Library
- E. Ohlebusch. Termination of logic programs: Transformational methods revisited. AAECC, 12:73--116, 2001.Google ScholarCross Ref
- E. Ohlebusch. Advanced Topics in Term Rewriting. Springer, 2002. Google ScholarDigital Library
- C. Prehofer. Solving Higher-Order Equations: From Logic to Programming. Progress in Theoretical Computer Science. Birkhäuser, 1998. Google ScholarDigital Library
- T. Suzuki. Standardization theorem revisited. In Proc. 5th ALP, volume 1139 of LNCS, pages 122--134, 1996. Google ScholarDigital Library
- P. Viry. Elimination of conditions. JSC, 28:381--400, 1999. Google ScholarDigital Library
- T. Yamada, J. Avenhaus, C. Loría-Sáenz, and A. Middeldorp. Logicality of conditional rewrite systems. TCS, 236(1,2):209--232, 2000. Google ScholarDigital Library
Index Terms
- New completeness results for lazy conditional narrowing
Recommendations
Conditional narrowing without conditions
PPDP '03: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programmingWe present a new evaluation strategy for functional logic programs described by weakly orthogonal conditional term rewriting systems. Our notion of weakly orthogonal conditional rewrite system extends a notion of Bergstra and Klop and covers a large ...
Evaluation strategies for functional logic programming
Recent advances in the foundations and the implementations of functional logic programming languages originate from far-reaching results on narrowing evaluation strategies. Narrowing is a computation similar to rewriting which yields substitutions in ...
Conditional narrowing modulo a set of equations
Narrowing is a universal unification procedure for equational theories given by a canonical term rewrite system. In this paper we introduce conditional narrowing modulo a set of conditional equations and give a full proof of its correctness and ...
Comments