Is anybody interested in a PROLOG interpreter written in Turbo Pascal,
plus a couple of typeset articles which outline how it works internally?
When I found it I was wondering whether it could be usefully used to
handle inference rules in a Delphi/FPC/Lazarus program, in the same way
that MS use Prolog for some of their network configuration stuff.
However it turns out that it is coded explicitly for Turbo Pascal with a
garbage collector on top of the normal heap, which I think implies that
porting it to FPC would need either a mark/release facility or multiple
heaps which could be "thrown away" when no longer needed.
I was reminded of this by the discussion elsewhere on refcounted
objects, which would obviously be another way to do it. Timothy Budd's
book on Leda gives an interesting example of using the unification
operation which underpins Prolog to process graph structures.
--
Mark Morgan Lloyd
markMLl .AT. telemetry.co .DOT. uk
[Opinions above are the author's, not those of his employers or colleagues]
_______________________________________________
fpc-other maillist - fpc-other@lists.freepascal.org
http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-other
