Content deleted Content added
Add section on implementations and programming tools |
m Open access bot: hdl updated in citation with #oabot. |
||
Line 94:
|doi=10.1145/347476.347484
| s2cid=47275506
|hdl=11858/00-001M-0000-0014-B494-9
}}</ref> proved in the 1990s that a particular narrowing strategy, ''needed narrowing'', is optimal in the sense of doing a number of reductions to get to a "normal form" corresponding to a solution that is minimal among sound and complete strategies. Needed narrowing corresponds to a lazy strategy, in contrast to the [[SLD resolution|SLD-resolution]] strategy of [[Prolog]].▼
|hdl-access=free
▲ }}</ref> proved in the 1990s that a particular narrowing strategy, ''needed narrowing'', is optimal in the sense of doing a number of reductions to get to a "normal form" corresponding to a solution that is minimal among sound and complete strategies. Needed narrowing corresponds to a lazy strategy, in contrast to the [[SLD resolution|SLD-resolution]] strategy of [[Prolog]].
===Functional patterns===
| |||