1683 search results - page 4 / 337 » A Needed Narrowing Strategy |
106
click to vote
WRLA
2010
15 years 4 days ago
2010
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
124
Voted
PLILP
1993
Springer
15 years 5 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
107
click to vote
FLOPS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
114
Voted
JFLP
2002
15 years 1 months ago
2002
In this paper we extend the lazy narrowing calculus lnc of Middeldorp, Okui, and Ida [26] to conditional rewrite systems. The resulting lazy conditional narrowing calculus lcnc is...
132
click to vote
ENTCS
2007
15 years 1 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...