category: logic programming languages

Description:
languages designed to manipulate logic predicates. Often used to build expert systems
Language:
Scheme, Prolog
Package:
"Paradigms of AI Programming"
Version:
?
Parts:
book with interpreters and compilers in Common Lisp
Author:
Peter Norvig
Location:
bookstore, and ftp://unix.sri.com/pub/norvig/*
Description:
?
Updated:
?
Language:
Prolog
Package:
? Prolog package from the University of Calgary ?
Version:
?
Parts:
?
Author:
?
Location:
ftp://cpsc.ucalgary.ca/pub/prolog1.1/prolog11.tar.Z
Description:
  • delayed goals
  • interval arithmetic
Requires:
Scheme
Portability:
relies on continuations
Contact:
?
Updated:
?
Language:
Prolog
Package:
? slog ?
Version:
?
Parts:
translator(Prolog->Scheme)
Author:
dorai@cs.rice.edu
Location:
ftp://titan.rice.edu/public/slog.sh
Description:
macros expand syntax for clauses, elations etc, into Scheme
Ports:
Chez Scheme
Portability:
reliese on continuations
Updated:
?
Language:
Prolog
Package:
?; ? (two systems)
Version:
?; ?
Parts:
?; ?
Author:
?
Location:
ftp://aisun1.ai.uga.edu/ai.prolog/Contents
Description:
?; ?
Ports:
MSDOS, Macintosh; MSDOS
Contact:
Michael Covington <mcovingt@uga.cc.uga.edu>
Updated:
?; ?
Language:
Prolog (variant)
Package:
Aditi
Version:
Beta Release
Parts:
interpreter, database
Author:
Machine Intelligence Project, Univ. of Melbourne, Australia
Location:
send email to aditi@cs.mu.oz.au
Description:
The Aditi Deductive Database System is a multi-user deductive database system. It supports base relations defined by facts (relations in the sense of relational databases) and derived relations defined by rules that specify how to compute new information from old information. Both base relations and the rules defining derived relations are stored on disk and are accessed as required during query evaluation. The rules defining derived relations are expressed in a Prolog-like language, which is also used for expressing queries. Aditi supports the full structured data capability of Prolog. Base relations can store arbitrarily nested terms, for example arbitrary length lists, and rules can directly manipulate such terms. Base relations can be indexed with B-trees or multi-level signature files. Users can access the system through a Motif-based query and database administration tool, or through a command line interface. There is also in interface that allows NU-Prolog programs to access Aditi in a transparent manner. Proper transaction processing is not supported in this release.
Ports:
Sparc/SunOS4.1.2 Mips/Irix4.0
Contact:
<aditi@cs.mu.oz.au>
Updated:
December 17th, 1992
Language:
ALF [prolog variant]
Package:
alf (Algebraic Logic Functional programming language)
Version:
?
Parts:
runtime, compiler(Warren Abstract Machine)
Author:
Rudolf Opalla <opalla@julien.informatik.uni-dortmund.de>
Location:
ftp://ftp.germany.eu.netpub/programming/languages/LogicFunctional
Description:
ALF is a language which combines functional and logic programming techniques. The foundation of ALF is Horn clause logic with equality which consists of predicates and Horn clauses for logic programming, and functions and equations for functional programming. Since ALF is an integration of both programming paradigms, any functional expression can be used in a goal literal and arbitrary predicates can occur in conditions of equations.
Updated:
October 8th, 1992
Language:
Prolog
Package:
Amzi! Logic Explorer
Version:
3.3
Parts:
interpreter
Author:
Amzi! inc.
Location:
http://www.amzi.com/share.htm
Description:
Full tutorial and interpreted development environment
Restriction:
shareware for non-personal use
Ports:
Windows
Contact:
Amzi! inc. info@amzi.com
Updated:
June 1st, 1996
Language:
BABYLON
Package:
BABYLON
Version:
2.3
Parts:
ai workbench (expert system development environment)
Author:
members of GMD, FIT-KI
Location:
ftp://ftp.gmd.de/gmd/ai-research/Software/Babylon/* or in WWW from http://www.gmd.de/
Description:
BABYLON is a development environment for expert systems. It includes frames, rules, constraints, a prolog-like logic formalism, and a description language for diagnostic applications (texi).
Reference:
Christaller, T., Di Primio, F., Voss, A. (Hrsg.). Die KI-Werkbank Babylon. Eine offene und portable Entwicklungsumgebung fuer Expertensysteme. Addison-Wesley, 1989, ISBN 3-89319-155-0

Christaller, T., Di Primio, F., Voss, A. (eds). The AI-Workbench BABYLON. An open and portable development environment for expert systems. Academic Press, London, 1992, ISBN 0-12-174235-0;

Guesgen, H.-W., CONSAT: A system for constraint satisfaction. Research Notes in Artificial Intelligence, Morgan Kaufman, San Mateo, 1989.

Requires:
Common Lisp, works under: Macintosh Common Lisp, Franz Allegro, CLisp, CMU, AKCL etc.
Contact:
juergen.walther@gmd.de
Updated:
June 22nd, 1994
Language:
Prolog
Package:
Beta-Prolog
Version:
1.5
Parts:
interpreter(?), libraries, debugger
Author:
Neng-Fa Zhou <zhou@mse.kyutech.ac.jp> form "Real Name <email@address>". Surface mail addresses are not used unless there is no email address.
Location:
ftp://ftp.kyutech.ac.jp/pub/Language/prolog/*
Description:
?
Conformance:
Incorporates most built-in predicates in ISO-Prolog.
Updated:
April 5th, 1995
Language:
Prolog
Package:
BinProlog
Version:
1.71
Parts:
interpreter?, documentation
Author:
?
Location:
ftp://clement.info.umoncton.ca/BinProlog/*
Description:
BinProlog 1.71 is at this time probably the fastest freely available C-emulated Prolog.
Ports:
IBM-PC/386, Sun-4, Sun-3, NeXT
Contact:
Paul Tarau <tarau@info.umoncton.ca>
Updated:
April 3rd, 1993
Language:
Prolog + constraints over Finite Domains and Booleans
Package:
clp(FD)
Version:
2.2
Parts:
compiler clp(FD)->C, FD solver, runtime, debugger.
Author:
Daniel Diaz - INRIA Rocquencourt - FRANCE
Location:
ftp://ftp.inria.fr/INRIA/Projects/ChLoE/LOGIC_PROGRAMMING/clp_fd
Description:
clp(FD) is a constraint logic programming language over Finite Domains. clp(FD) is based on the wamcc Prolog compiler which translates Prolog to C.

clp(FD) provides several constraints "a la CHIP" on Finite Domains and Booleans and some facilities to build new constraints. clp(FD) is 4 times faster than CHIP v3.2 on average.

Restriction:
free (see COPYRIGHT notice)
Requires:
GNU C (gcc) version 2.4.5 or higher
Ports:
Sparc workstations, PC under linux, sony mews, dec ultrix
Portability:
Generally to 32-bit machines with gcc.
Contact:
Daniel Diaz <Daniel.Diaz@inria.fr>
Status:
no longer maintained - see GNU Prolog by the same author.
Updated:
August 1st, 1994
Language:
CLP (Constraint Logic Programming language) [Prolog variant]
Package:
CLP(R)
Version:
1.2
Parts:
runtime, compiler(byte-code), contstraint solver
Author:
IBM
Location:
mail to Joxan Jaffar <joxan@watson.ibm.com>
Description:
CLP(R) is a constraint logic programming language with real-arithmetic constraints. The implementation contains a built-in constraint solver which deals with linear arithmetic and contains a mechanism for delaying nonlinear constraints until they become linear. Since CLP(R) subsumes PROLOG, the system is also usable as a general-purpose logic programming language. There are also powerful facilities for meta programming with constraints. Significant CLP(R) applications have been published in diverse areas such as molecular biology, finance, physical modelling, etc. We are distributing CLP(R) in order to help widen the use of constraint programming, and to solicit feedback on the system
Restriction:
free for academic and research purposes only
Ports:
unix, msdos, OS/2
Contact:
Roland Yap <roland@bruce.cs.monash.edu.au>, Joxan Jaffar
Updated:
October 14th, 1992
Language:
Prolog (variant)
Package:
Coral
Version:
1.5.2
Parts:
interpreter, interface(C++), documentation
Author:
Raghu Ramakrishnan, et.al.
Location:
http://www.cs.wisc.edu/coral/
Description:
The CORAL deductive database/logic programming system was developed at the University of Wisconsin-Madison. The CORAL declarative language is based on Horn-clause rules with extensions like SQL's group-by and aggregation operators, and uses a Prolog-like syntax. * Many evaluation techniques are supported, including bottom-up fixpoint evaluation and top-down backtracking. * A module mechanism is available. Modules are separately compiled; different evaluation methods can be used in different modules within a single program. * Disk-resident data is supported via an interface to the Exodus storage manager. * There is an on-line help facility
Requires:
g++
Contact:
Shaun Flisakowski <flisakow@cs.wisc.edu>
Ports:
Sun4, Sun Solaris, Hpux, Linux
Status:
Frozen - bug fixes only.
Updated:
January 29th, 1993
Language:
Prolog
Package:
Frolic
Version:
?
Parts:
?
Author:
?
Location:
ftp://cs.utah.edu/pub/frolic.tar.Z
Description:
?
Requires:
Common Lisp
Contact:
?
Updated:
November 23rd, 1991
Language:
ISO Prolog + constraint solving over finite domains (FD)
Package:
GNU Prolog
Version:
1.0.0
Parts:
native compiler, interpreter, library.
Author:
Daniel Diaz <Daniel.Diaz@inria.fr>
Location:
ftp://ftp.inria.fr/INRIA/Projects/loco/gnu-prolog/ or from any GNU site (in /gnu/prolog/)
Description:
A native compiler for ISO Prolog with constraint solving over finite domains. GNU Prolog accepts a Prolog+constraint program and produces a native binary which is stand-alone. GNU Prolog also offers a classical interactive interpreter. The Prolog part conforms to the ISO standard for Prolog with many extensions: global variables, OS interface, sockets,... GNU Prolog also includes a very efficient constraint solver over Finite Domains (FD).
Discussion:
users-prolog@gnu.org (mailing list)
Bugs:
bug-prolog@gnu.org
Updated:
April 19th, 1999
Language:
Goedel
Package:
Goedel
Version:
1.4
Parts:
book, compiler, user manual, system modules, example programs
Author:
Jiwei Wang <jiwei@lapu.bristol.ac.uk>
Location:
ftp://ftp.cs.kuleuven.ac.be/pub/logic-prgm/goedel/README ftp://ftp.cs.bris.ac.uk/goedel/README both contain further pointers.
Description:
An implementation of a significant subset of Goedel. Goedel is a declarative, general-purpose strongly-typed logic programming language. The type system is based on many-sorted logic with parametric polymorphism. Modularity is supported, as well as infinite precision arithmetic, limited constraint satisfaction, and finite sets.
Reference:
The Goedel Programming Language, P.M. Hill & J.W. Lloyd, MIT Press, 1994, ISBN 0-262-08229-2.
Requires:
SICStus Prolog version 2.1 #6 (or later). Run time system for SPARCstation provided, though.
Status:
underging continuing development
Contact:
goedel@compsci.bristol.ac.uk
Updated:
May 16th, 1994
Language:
Isabelle
Package:
Isabelle2009-2
Version:
2009-2
Author:
Written by Lawrence C Paulson, Tobias Nipkow, and Makarius Wenzel
Location:
http://isabelle.in.tum.de/
Description:
Isabelle is a generic proof assistant. It allows mathematical formulas to be expressed in a formal language and provides tools for proving those formulas in a logical calculus. Isabelle is developed at University of Cambridge (Larry Paulson), Technische Universität München (Tobias Nipkow) and Université Paris-Sud (Makarius Wenzel). Notable changes:
  • Explicit proof terms for type class reasoning.
  • Robust treatment of concrete syntax for different logical entities; mixfix syntax in local proof context.
  • Type declarations and notation within local theory context.
  • HOL: package for quotient types.
  • HOL code generation: simple concept for abstract datatypes obeying invariants (e.g. red-black trees).
  • HOL: new development of the Reals using Cauchy Sequences.
  • HOL: reorganization of abstract algebra type class hierarchy.
  • HOL: substantial reorganization of main library and related tools.
  • HOLCF: reorganization of 'domain' package.
Ports:
Linux, Mac OS X (Leopard or Snow Leopard), and Windows (via Cygwin).
Requires:
Proof General - http://proofgeneral.inf.ed.ac.uk/ , XEmacs - http://www.xemacs.org
Contact:
http://isabelle.in.tum.de/overview.html
Updated:
2010/06/22
Language:
Prolog
Package:
ISO draft standard
Version:
? (What year??)
Parts:
language definition
Author:
?
Location:
ftp://ftp.th-darmstadt.de ?
Description:
?
Updated:
July 6th, 1992
Language:
Janus
Package:
jc
Version:
1.50 alpha
Parts:
compiler(->C)
Author:
David Gudeman <gudeman@cs.arizona.edu>
Location:
ftp://cs.arizona.edu/janus/jc/*
Description:
jc is a janus-to-C compiler (considerably faster than qdjanus). jc is a _sequential_ implementation of a _concurrent_ language.
Bugs:
jc-bugs@cs.arizona.edu
Ports:
sun-4, sun-3, Sequent Symmetry
Status:
jc is an experimental system, undergoing rapid development. It is in alpha release currently.
Discussion:
janusinterest-request@parc.xerox.com
Updated:
June 9th, 1992
Language:
Prolog
Package:
LM-PROLOG
Version:
?
Parts:
?
Author:
Ken Kahn and Mats Carlsson
Location:
ftp://sics.se/archives/lm-prolog.tar.Z
Description:
?
Requires:
ZetaLisp
Contact:
?
Updated:
?
Language:
Lolli (logic programming)
Package:
Lolli
Version:
?
Parts:
?
Author:
? Josh Hodas <hodas@saul.cis.upenn.edu> ?
Location:
ftp://ftp.cis.upenn.edu/pub/Lolli/Lolli-07.tar.Z.
Description:
Lolli is an interpreter for logic programming based on linear logic principles.

Lolli can be viewed as a refinement of the the Hereditary Harrop formulas of Lambda-Prolog. All the operators (though not the higher order unification) of Lambda-Prolog are supported, but with the addition of linear variations. Thus a Lolli program distinguishes between clauses which can be used as many, or as few, times as desired, and those that must be used exactly once.

Requires:
ML
Updated:
November 8th, 1992
Language:
mercury
Package:
mercury
Version:
0.9.1
Parts:
compiler(->C), library, run-time, profiler, documentation, GUI interface (tcl/tk + openGL), examples
Description:
The Mercury programming language.

Mercury is a new logic/functional programming language, which combines the clarity and expressiveness of declarative programming with advanced static analysis and error detection features. Its highly optimized execution algorithm delivers efficiency far in excess of existing logic programming systems, and close to conventional programming systems. Mercury addresses the problems of large-scale program development, allowing modularity, separate compilation, and numerous optimization/time trade-offs.

Keywords:
mercury, programming language, logic, functional, declarative
Author:
mercury@cs.mu.oz.au (The Mercury Team)
Location:
sunsite.unc.edu /pub/linux/devel/lang/mercury 1415 mercury-compiler.lsm 8.0MB mercury-compiler-0.9.1.tar.gz ftp.mercury.cs.mu.oz.au /pub/mercury 8.0MB mercury-compiler-0.9.1.tar.gz
Ports:
i386, PPC, Sparc, Alpha (others possible but untested with Linux), gcc 2.6.3 or higher, GNU make 3.69 or higher
Restriction:
GPL+LGPL
Updated:
2000/01/21
Language:
Prolog
Package:
Modular SB-Prolog
Version:
?
Parts:
interpreter
Author:
?
Location:
ftp://ftp.dcs.ed.ac.uk/pub/dts/mod-prolog.tar.Z
Description:
SB-Prolog version 3.1 plus modules
Restriction:
GNU General Public License
Ports:
Sparc
Contact:
Brian Paxton <mprolog@dcs.ed.ac.uk>
Updated:
?
Language:
Prolog
Package:
Open Prolog
Version:
1.0.3d22
Parts:
interpreter, examples
Author:
Michael Brady <beady@cs.tcd.ie>
Location:
ftp://ftp.cs.tcd.ie/pub/languages/open-prolog/*
Description:
Text-oriented Prolog system for the Macintosh (Edimburgh syntax), with a MPW-like worksheet as the main user interface.
Features:
including Definite Clause Grammars
+ supports most the features of DEC Prolog or C-Prolog
if-then-else according to the draft ISO Prolog standard
+ support disjunctive calls, negation, if-then and
handling conforming to the ISO Draft
+ supports program-originated catch-and-throw exception
are not supported.
- Real-number arithmetic and internal database predicates
+ built-in predicates to manage Macintosh dialogs
Ports:
Macintosh
Contributions:
send a postcard
Contact:
Michael Brady <brady@cs.tcd.ie>
Updated:
June 19th, 1995
Language:
OPS5
Package:
PD OPS5
Version:
?
Parts:
interpreter
Author:
Written by Charles L. Forgy and ported to Common Lisp by George Wood and Jim Kowalski.
Location:
ftp://ftp.cs.cmu.edu/afs/cs.cmu.edu/user/mkant/Public/Lisp/ops5*
Description:
Public domain implementation of an OPS5 interpreter. OPS5 is a programming language for rule-based production systems. A rule consists of pre-condition(s) and the resulting action. The system as a whole acts first checking the status of system in its working memory and matches the rules to see if there are rules that are satisfied, and then the action in one selected satisfied rule is executed.

There is a commercial version available called OPS83. Please contact the author for information.

Requires:
Common Lisp
Contact:
? Mark Kantrowitz <mkant+@cs.cmu.edu> ?
Updated:
October 17th, 1992
Language:
Prolog
Package:
PI
Version:
?
Parts:
library
Author:
?
Location:
ftp://ftp.ncc.up.pt/pub/prolog/ytoolkit.tar.Z
Description:
PI is a interface between Prolog applications and XWindows that aims to be independent from the Prolog engine, provided that it has a Quintus foreign function interface (such as SICStus, YAP). It is mostly written in Prolog and is divided in two libraries: Edipo - the lower level interface to the Xlib functions; and Ytoolkit - the higher level user interface toolkit
Contact:
Ze' Paulo Leal <zp@ncc.up.pt>
Updated:
March 2nd, 1993
Language:
Lambda-Prolog
Package:
Prolog/Mali (PM)
Version:
? 6/23/92 ?
Parts:
compiler(->C), linker, libraries, runtime, documentation
Author:
Pascal Brisset <brisset@irisa.fr>
Location:
ftp://ftp.irisa.fr/pm/*
Description:
Lambda-Prolog, a logic programming language defined by Miller, is an extension of Prolog where terms are simply typed $\lambda$terms and clauses are higher order hereditary Harrop formulas. The main novelties are universal quantification on goals and implication.
Reference:
Miller D.A. and Nadathur G. "Higher-order logic programming", 3rd International Conference on Logic Programming, pp 448-462, London 1986.

Nadathur G. "A Higher-Order Logic as a Basis for Logic Programming", Thesis, University of Pennsylvania, 1987.

Requires:
MALI-V06 abstract memory. MALI is available by anonymous ftp from ftp.irisa.fr
Ports:
unix
Discussion:
prolog-mali-request@irisa.fr
Contact:
pm@irisa.fr
Updated:
July 6th, 1992
Language:
Janus
Package:
qdjanus
Version:
1.3
Parts:
translator(prolog)
Author:
Saumya Debray <debray@cs.arizona.edu>
Location:
ftp://cs.arizona.edu/janus/qdjanus/*
Description:
janus is a janus-to-prolog compiler meant to be used with Sicstus Prolog
Conformance:
mostly compliant with "Programming in Janus" by Saraswat, Kahn, and Levy.
Updated:
May 18th, 1992
Language:
Prolog
Package:
SB-Prolog
Version:
3.1 ?
Parts:
?
Author:
interpreter
Location:
ftp://sbcs.sunysb.edu/pub/sbprolog
Description:
?
Restriction:
GNU General Public License
Contact:
? warren@sbcs.sunysb.edu ?
Updated:
?
Language:
Parlog
Package:
SPM System (Sequential Parlog Machine)
Version:
?
Parts:
?, documenation
Author:
?
Location:
? ftp://nuri.inria.fr/lang/Parlog.tar.Z
Description:
a logic programming language ?
Reference:
Steve Gregory, "Parallel Logic Programming in PARLOG", Addison-Wesely, UK, 1987
Restriction:
? no source code ?
Ports:
Sun-3 ?
Updated:
??
Language:
Prolog
Package:
Strawberry Prolog Light
Version:
3.0 beta (2.92 stable)
Author:
Dimiter Dimitrov Dobrev <dobrev@2-box.com>
Location:
http://www.dobrev.com/
Description:
Strawberry Prolog is specially designed for education.
Features:
Compiler, Proof Tree tool, example programs
Ports:
Windows Vista/XP and Unix/Linux
Contact:
Dimiter Dimitrov Dobrev <dobrev@2-box.com>
Updated:
December 2008
Language:
Prolog
Package:
SWI-Prolog
Version:
1.7.2
Parts:
?
Author:
Jan Wielemaker <jan@swi.psy.uva.nl>
Location:
ftp://swi.psy.uva.nl/pub/SWI-Prolog
os/2:
ftp://mpii02999.ag2.mpi-sb.mpg.de/pub/toolw/SWI/*
Description:
?
Conformance:
superset
Features:
"very nice Ed. style prolog, best free one I've seen"
Restriction:
GNU General Public License
Ports:
Sun-4, Sun-3 (complete); Linux, DEC MIPS (done but incomplete, support needed); RS6000, PS2/AIX, Atari ST, Gould PN, NeXT, VAX, HP-UX (known problems, support needed); MSDOS (status unknown), OS/2
Status:
activly developed
Discussion:
prolog-request@swi.psy.uva.nl
Contact:
(OS/2) Andreas Toenne <atoenne@mpi-sb.mpg.de>
Updated:
July 23rd, 1993
Language:
Pascal, Lisp, APL, Scheme, SASL, CLU, Smalltalk, Prolog
Package:
Tim Budd's C++ implementation of Kamin's interpreters
Version:
?
Parts:
interpretors, documentation
Author:
Tim Budd <budd@cs.orst.edu>
Location:
? ftp://cs.orst.edu/pub/budd/kamin/*.shar
Description:
a set of interpretors written as subclasses based on "Programming Languages, An Interpreter-Based Approach", by Samuel Kamin.
Requires:
C++
Status:
?
Contact:
Tim Budd <budd@fog.cs.orst.edu>
Updated:
September 12th, 1991
Language:
Prolog
Package:
UPMAIL Tricia Prolog
Version:
?
Parts:
?
Author:
?
Location:
ftp://ftp.csd.uu.se/pub/Tricia/README
Description:
?
Contact:
<tricia-request@csd.uu.se>
Updated:
?
Language:
Prolog
Package:
wamcc
Version:
2.2
Parts:
compiler Prolog->C, runtime, Prolog debugger, WAM debugger.
Author:
Daniel Diaz - INRIA Rocquencourt - FRANCE
Location:
ftp://ftp.inria.fr/INRIA/Projects/ChLoE/LOGIC_PROGRAMMING/wamcc
Description:
wamcc is a Prolog Compiler which translates Prolog to C via the WAM. wamcc has a syntax very close to the future ansi standard. wamcc offers the most usual built-in predicates, a top-level, a Prolog debugger and a WAM debugger. wamcc is designed to be easily extended (e.g. see clp(FD)).

From an efficiency point of view, wamcc is between SICStus "emulated" and SICStus "native code" on Sparc machines (1.5 times faster than SICStus emulated, 1.5 times slower than SICStus "native code").

Restriction:
free (see COPYRIGHT notice)
Requires:
GNU C (gcc) version 2.4.5 or higher
Ports:
Sparc workstations, PC under linux, sony mews, dec ultrix
Portability:
Generally to 32-bit machines with gcc.
Contact:
Daniel Diaz <Daniel.Diaz@inria.fr>
Status:
no longer maintained - see GNU Prolog by the same author.
Updated:
August 1st, 1994
Language:
LIFE (Logic, Inheritance, Functions, and Equations)
Package:
Wild_LIFE
Version:
first-release
Parts:
interpreter, manual, tests, libraries, examples
Author:
Paradise Project, DEC Paris Research Laboratory.
Location:
ftp://gatekeeper.dec.com/pub/plan/Life.tar.Z
Description:
LIFE is an experimental programming language with a powerful facility for structured type inheritance. It reconciles styles from functional programming, logic programming, and object-oriented programming. LIFE implements a constraint logic programming language with equality (unification) and entailment (matching) constraints over order-sorted feature terms. The Wild_LIFE interpreter has a comfortable user interface with incremental query extension ability. It contains an extensive set of built-in operations as well as an X Windows interface.
Conformance:
semantic superset of LOGIN and LeFun. Syntax is similar to prolog.
Bugs:
life-bugs@prl.dec.com
Ports:
MIPS-Ultrix
Portability:
good in theory
Discussion:
life-request@prl.dec.com
Contact:
Peter Van Roy <vanroy@prl.dec.com>
Updated:
December 14th, 1992
Language:
Prolog
Package:
XSB
Version:
1.2
Parts:
interpreter, preprocessor(HiLog), documentation
Author:
XSB research group / SUNY at Stony Brook
Location:
ftp://sbcs.sunysb.edu/pub/XSB/XSB.tar.Z
Description:
XSB extends the standard functionality of Prolog (being a descendant of PSB- and SB-Prolog) to include implementations of OLDT (tabling) and HiLog terms. OLDT resolution is extremely useful for recursive query computation, allowing programs to terminate correctly in many cases where Prolog does not. HiLog supports a type of higher-order programming in which predicate symbols can be variable or structured. This allows unification to be performed on the predicate symbols themselves in addition to the arguments of the predicates. Of course, Tabling and HiLog can be used together.
Ports:
Sun, Solaris, NeXT, Linux, 386 BSD, IRIX, HP-UX
Portability:
Generally to 32-bit machines.
Contact:
xsb-contact@cs.sunysb.edu
Updated:
July 28th, 1993
Language:
Prolog
Package:
XWIP (X Window Interface for Prolog)
Version:
0.6
Parts:
library
Author:
?
Location:
ftp://export.lcs.mit.edu/contrib/xwip-0.6.tar.Z
Description:
It is a package for Prologs following the Quintus foreign function interface (such as SICStus). It provides a (low-level) Xlib style interface to X. The current version was developed and tested on SICStus 0.7 and MIT X11 R5 under SunOS 4.1.1.
Portability:
It is adaptable to many other Unix configurations.
Contact:
xwip@cs.ucla.edu
Updated:
Febuary 25th, 1993
This site is supported by David Sharnoff and Bryan Miller with some help from Google Adwords.

Please send updates to free-compilers@sharnoff.org

The HTML is maintained by David Muir Sharnoff and the entries themselves are currently maintained by Bryan Miller.

Copyright (c) 1992-1998 David Muir Sharnoff, All Rights Reserved
Copyright (c) 1994-1996, Steven Allen Robenalt, All Rights Reserved
Copyright (c) 1999-2010 David Muir Sharnoff, Bryan Miller, All Rights Reserved