🚀 go-pugleaf

Newsgroups: comp.lang.prolog
Subject: Updates to Edinburgh Tools
Reply-To: popx@vax.ox.ac.uk (Jocelyn Paine)
Distribution: comp.lang.prolog
Organization: Experimental Psychology, Oxford University, UK.


Has anybody got improvements to the public domain Edinburgh Tools
library that they'd like to send me?

My immediate interest is in the GRAPHS and MAP modules. I received my
copy of the tools in mid-1989. My copy of GRAPHS lacks some comments;
for example, top_sort is present, but not commented, so I have to infer
its action from the code (and from Richard O'Keefe's book). I'd also
like to know whether anyone has built other general-purpose graph
routines on those in the original version of GRAPHS. Going to MAP, my
copy of MAP implements a map_value predicate that's O(N), but it's
commented saying that O(lg N) is possible using the trees implemented in
ASSOC, and that eventually ASSOC and MAP should be merged.

Perhaps someone has made the improvements suggested above. If so, I'd
like to have copies. But more generally, I'd like to add any
improvements to my library so that I can redistribute them. I'm too busy
with student projects right now to make a new version of the library (I
have some programs waiting to be put in), but I hope I can bring out a
new version in March.

How about it? I know the Quintus Prolog library is based on the
Edinburgh Tools, though much rewritten; perhaps (if anyone from Quintus
is listening), you'd be willing to cancel a debt to the public domain
by letting me redistribute some of your improvements?

                                                        Jocelyn Paine