🚀 go-pugleaf

Ted Dunning writes:
"
[all sorts of bad stuff about PDC Prolog]
a bunch of things he wants to do in prolog, but can't in PDC Prolog, thus:

1) a standard findall.
...
2) a variation on the standard dcg expansion which allows me to write in
...
3) a weakening of the above where instead of adding to the standard
...
4) a rewrite of the following predicate:
...
forall(G, P) :- \+ (G, \+ P).
...
that does not include an entire interpreter for prolog.
...
5) a simple program that takes as an argument a goal written in a
...
1) woops... you can't declare a type for a general term.  nor can you
   call a variable.
...
2) oh, golly, term expansion is built in and can't be changed.
...
3) darn, i have to write a new version of read which will read
...
4) darn, no passing goals as arguments
...
5) woops... can't declare the type for the argument, nor can i call
...

"

And I have to reply that I really don't care what Ted cannot do 
in PDC Prolog.  Besides, as long as a language is Turing equivalent,
you _CAN_ do anything in one that you can in another: same ends,
different means.  Loosen up, eh?

Duncan

***--------------------------------------------------------------***
* DISCLAIMER:                                                      *
* ==========:                                                      *
*    The opinions expressed are solely of the author and do not    *
*    necessarily reflect the opinions of Canadian Marconi Company. *
***--------------------------------------------------------------***