Unification in Oz is actually like unification in Prolog, with one important difference -- unification and search are independent in Oz. That way, you can use unification in deterministic programs where it will only add as much information to the store as can be added without search. For example, if you do
X = [hi _ _] Y = [_ there _] X = Y
then X and Y are unified to [hi there _], and the last variable is left undetermined.
If you combined unification and search, then you have the programming model of Prolog, as detailed in chapter 9 of CTM.
Best Torsten
Thanks for answer. But what does CTM mean? It's documentation abbreviature? But on mozart-oz.org and in mozart windows distribution no documentation under this name. I read about 'dis' in chapter 12 of Language Tutorial about logic programming.
_________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
