- ...BinProlog
- BinProlog Copyright 1#1 Paul Tarau 1992-96 All rights reserved
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...them
- Take care if you use your own binary clauses to keep always
the continuation as a last argument of the last embedded continuation `predicate'. Look at the asm/0 tracer how
BinProlog itself does this.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...interface
- Is/2 now
accepts execution of any predicate of arity n+1 as a function
of arity n.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- .../usr/local/BinProlog
- This is usually better to
be left to a system person who also can ensure that users
inherit the BP_PATH environment variable. An individual user
can also put something like setenv BP_PATH /usr/local/BinProlog
his or her .cshrc or .login file, to access the shared
BinProlog programs.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...files
- This overcomes the limitation of previous versions of
having only one top-level file.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...Interactors
- available at http://clement.info.umoncton/BinProlog/LindaInteractor.tar.gz
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...daemon
- Alternatively,
BinProlog can be embedded as a server side include in an
Apache server (written in C) while the equivalent Java code
is easily embeddable in the Java based Jigsaw HTTP server.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...way
- A further ambiguity in some
implementations of setarg/3 comes from the fact
that it is not clear if the location itself or its
dereferenced contents should be mutated
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...languages
- Funny enough, this reminds me the story about the
Emperor's Clothes (basically, he did not have them!).
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...BinProlog
- Use
"make remake or make again" if BinProlog is the only Prolog around.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.