Russ Abbott wrote:
I guess that part of my confusion in approaching Oz is not knowing in what order one has to learn things. In this case it seems that it is essential to learn about Computation Spaces and how to program with them / before/ learning about choice.
My intuition is that the source of your problem is that you miss some subtleties in the basic part of the language. The kernel of Oz is *not* a logic language à la Prolog. The logic programming in Oz is an orthogonal extension of the kernel language, that's why the model is slightly different from Prolog. The design of Oz makes it easy to mix logic and functional styles, for instance. In practice we do use this all the time.
As I mentioned earlier, I had seen a brief discussion of Computation Spaces in the Relational Programming part of the tutorial, but I assumed it was telling me how the system used them to implement choice.
You don't need to know details about computation spaces. The principles given in the Finite Domain Constraint Programming tutorial are enough. The key concept is encapsulation of computation.
Cheers, raph _________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
