in reply to How implement AMB in perl?
...we perform a depth-first search of the amb choice tree, and whenever we brush against failure, we backtrack to the most recent node of the tree that offers a further choice
In Perl, the function of the "choice tree" can be thought of as the function of the OP tree. That means, whenever amb would be called, it should investigate the caller and traverse the OP tree. The closest module I know that does similar things is Want module, which travels up the caller's OP tree. It would be really interesting to see if this approach works for amb.
Update: as to continuations, check out Coro.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: How implement AMB in perl?
by Enlil (Parson) on Apr 29, 2007 at 09:30 UTC | |
by dk (Chaplain) on Apr 29, 2007 at 09:40 UTC | |
by halley (Prior) on Apr 30, 2007 at 12:52 UTC |