Quantifiers ...

[Michael David WINIKOFF]

Hi guys!

Can someone point me at an example of a Mercury program containing "all"?

Is it the case that "all [X] p(X)" can never be compiled?
[It's defined to be "not (some [X] (not p(X)))" and p(X) can't bind X since
 it's in a negation]

Cheers,

Michael

-- 
Michael Winikoff	winikoff at acm.org	http://www.cs.mu.oz.au/~winikoff
Computer science research fellow. University of Melbourne, Australia. 	
"Computer Science is no more about computers than astronomy is about 
		telescopes." -- E. W. Dijkstra