Russ Abbott wrote:
In discussing the simple model of Oz CLP computation mentioned below, a student asked what happens if the number of threads keeps growing. I said that Oz supports lazy evaluation, but I didn't know if SearchAll took advantage of it. It didn't occur to me at the time to test it on the spot. But here's a simple test.
(...)
When I run this, Mozart seems to get into such a tight loop that it virtually locks up my computer. This suggests that SearchAll doesn't use lazy evaluation. Is there a version that does?
SearchAll does not use lazy evaluation. But SolveAll does, and it is strictly equivalent to SearchAll. The code is given in CTM chapter 12 I think.
Cheers, raph _________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
