next up previous
Next: 3.1 Contents of the Up: BinProlog 5.75 User Previous: 2 Obtaining BinProlog

3 Introduction to BinProlog

BinProlog has been developed by Paul Tarau mostly at the University of Moncton, Canada, and is based on his BinWAM abstract machine, a specialization of the WAM for the efficient execution of binary logic programs.

BinProlog is a fast and compact Prolog compiler, based on the transformation of Prolog to binary clauses. The compilation technique is similar to the Continuation Passing Style transformation used in some ML implementations. BinProlog 5.75 is also probably the first Prolog system featuring dynamic recompilation of asserted predicates (a technique similar to the one used in some object oriented languages like SELF 4.0), and a very efficient segment preserving copying heap garbage collector.

Although it (used to) incorporate some last minute research experiments, which might look adventurous at the first sight, BinProlog is a fairly robust and complete Prolog implementation featuring both C-emulated execution and generation of standalone applications by compilation to C.

New features added in version 5.75 include:

.

New features added in version 5.25 include:

For owners of academic and industrial source licenses:

New features added in version 4.00:

New features in added in version 3.30:

Some other BinProlog features are:





next up previous
Next: 3.1 Contents of the Up: BinProlog 5.75 User Previous: 2 Obtaining BinProlog



Paul Tarau
Thu Apr 3 10:26:39 AST 1997