Hi,
Gremlin Scheme has stubs now for the server side library bootstrapping,
using parsing of files and the symbols API (which will allow integration
of Gremlin Scheme into other languages or clients.)
The theorem prover inside now parses preconditions of the form A,B into
A ^ B and A | B. Then the followers dictionary gets updated that way.
( A follower is A,B |- thus A ^ B |- and A | B |- )
The integration is as Guile's Scheme file bootstrapping, a listener as described above. The whole thing is dictionary and hash based for good
measure. The parser (e.g. for GameBoy assembler/microcode) still needs a
full write.
The system compiles, but remains untested.
You can find the latest 0.3.x version files at :
https://sourceforge.net/projects/gremlin-scheme/files/
HAND,
holly
--
(__)
oo )
|_/\
My Software & Art company :
https://ko-fi.com/brandywine9
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)