A couple of questions

[Denys Duchier]

gabor.szokoli at vanderbilt.edu (Gabor Szokoli) writes:

> This allows me to tie the upper bound of FS variable M to FD variable
> D:
> {FS.card M 1} {FS.include D M}
> Are the two domain-variable-like-things unified or is there a
> propagator doing the work?

No, because (internally) the cardinality of a set is not explicitly
represented by a FD variable, but simply by its bounds.  FS.card posts
a propagator between a FS variable and a FD variable that maintains
the correspondance of bounds.

I could not decipher question 2, sorry :-)

> I have managed to compile the whole Mozart system on w2k, except for
> the Investigator (its Reflection package).

what's the problem? if you give me some data, I'll see if I can hazard
a guess :-)

> Is there any optimised term matching support available via the CPI?
> Something like clause selection in prolog, or 'case' matching in oz?

No. What for?  If you need to do pattern matching on terms, you really
should do it in Oz.

Cheers,

-- 
Dr. Denys Duchier			Denys.Duchier at ps.uni-sb.de
Forschungsbereich Programmiersysteme	(Programming Systems Lab)
Universitaet des Saarlandes, Geb. 45	http://www.ps.uni-sb.de/~duchier
Postfach 15 11 50			Phone: +49 681 302 5618
66041 Saarbruecken, Germany		Fax:   +49 681 302 5615
-
Please send submissions to users at mozart-oz.org
and administriva mail to users-request at mozart-oz.org.
The Mozart Oz web site is at http://www.mozart-oz.org/.