NEW: Java based Kernel Prolog (Open Source Reference Implementation)

Paul Tarau <>
18 Nov 1999 02:52:32 -0500

          From comp.compilers

Related articles
NEW: Java based Kernel Prolog (Open Source Reference Implementation) (Paul Tarau) (1999-11-18)
| List of all articles for this month |

From: Paul Tarau <>
Newsgroups: comp.compilers
Date: 18 Nov 1999 02:52:32 -0500
Organization: Compilers Central
Keywords: Java, prolog, available

We are glad to announce BinNet Corporation's latest Open Source
project, Kernel Prolog.

While providing a compact Java based reference implementation which
runs Horn Clause code as any conventional Prolog, the Kernel Prolog
project establishes an Open Source forum for experimenting with a
radical departure from Prolog's two decades old built-ins (90% of a
Prolog system's implementation effort:-) ) hoping that an improved
logic programming language, usable as a mainstream software
development tool, will eventually emerge as a result.

Kernel Prolog's redesigned set of built-ins is based on Fluents,
stateful objects (organized in a Java class tree), which provide
control over the underlying interpeter and uniform interoperation
patterns with external object oriented and procedural languages.

Fluents include Answer Sources (first-class Interpreters) and a number
of other built-in Sources and Sinks which cover everything from I/O
operations to lazy, composable data structures.

You are invited to download the Kernel Prolog sources,
join the project and interact with developers and users through
Kernel Prolog's Web site, at:

The download area is also mirrored at:

The code is designed to be extensible, easy to modify and adapt,
and it is known to run on virtually any JDK 1.1 or 1.2 compatible Java.

A set of GUI building predicates and a simple IDE are provided as
a proof of concept of Kernel Prolog's smooth interoperation with the
underlying Java system.

Paul Tarau
BinNet Corp.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.