Archive-name: lisp-faq/part6
Last-Modified: Fri Mar 12 16:18:08 1993 by Mark Kantrowitz
Version: 1.30
;;; ****************************************************************
;;; FTP Archives and Other Resources *******************************
;;; ****************************************************************
;;; Written by Mark Kantrowitz and Barry Margolin
;;; lisp-faq-6.text -- 54654 bytes
This post contains Part 6 of the Lisp FAQ.
If you think of questions that are appropriate for this FAQ, or would
like to improve an answer, please send email to us at ········@think.com.
Topics Covered (Part 6):
[6-0] General information about FTP Resources for Lisp
[6-1] Repositories of Lisp Software
[6-3] Publicly Redistributable Lisp Software
[6-5] How can I use the X Window System or other GUIs from Lisp?
[6-6] Formatting code in LaTeX
[6-7] Where can I get an implementation of Prolog in Lisp?
Search for \[#\] to get to question number # quickly.
----------------------------------------------------------------
Subject: [6-0] General information about FTP Resources for Lisp
Remember, when ftping compressed or compacted files (.Z, .arc, .fit,
etc.) to use binary mode for retrieving the files.
FTP sites for Lisp and Scheme interpreters and compilers are discussed
in the answer to questions [4-0] and [4-2] and in the Scheme FAQ. See
the entry on Macintosh Common Lisp in question [4-1] for information
on the CD-ROM of Lisp code that Apple distributes with MCL 2.0.
----------------------------------------------------------------
Subject: [6-1] Repositories of Lisp Software
There are several repositories of publicly redistributable and
public domain Lisp code.
The Lisp Utilities collection is accessible by anonymous ftp
to any CMU CS machine (e.g., ftp.cs.cmu.edu [128.2.206.173])
or through AFS in the directory
/afs/cs.cmu.edu/user/mkant/Public/Lisp-Utilities/
If accessing this directory through anonymous ftp, it is
important to "cd" to the directory using one atomic operation, as
some of the superior directories on the path are protected from
access by an anonymous ftp.
Files included in the repository include:
extensions.lisp A collection of extensions to Common Lisp.
initializations.lisp Brad Miller's initializations packaged
for Allegro CL 4.0.
xref.lisp Portable cross referencing tool for Lisp.
Similar to the Symbolics Who-Calls and
the Xerox MasterScope programs.
defsystem.lisp Portable system definition facility (a
"Make" for lisp). More featureful than
other defsystem implementations.
logical-pathnames.lisp Portable implementation of the X3J13
June 1989 specification for logical pathnames.
metering.lisp Portable code time/space profiling tool.
source-compare.lisp A portable "diff" utility for Lisp.
user-manual.lisp Program which helps with documenting Lisp code.
psgraph.lisp Joe Bates' PostScript DAG grapher.
matcher.lisp A regexp-like matcher for Lisp.
framework.lisp A portable generic frame system.
date-formatter.lisp Simple code for formatting a date.
infix.lisp Infix reader macro for Lisp.
save-object.lisp Kerry Koitzsch's package to save ASCII
representations of Lisp objects to a file.
defpackage.lisp Stephen Nicoud's semi-portable
CLtL2 version of defpackage.
johnson-yacc.lisp Mark Johnson's lisp YACC parser generator.
ops5.tar.Z Public domain Common Lisp implementation
of the OPS5 production system interpreter.
"Expert System Shell".
Written by Charles Forgy and ported by
George Wood and Jim Kowalski.
cmu-loop.lisp Implements the CLtL2 Loop Macro.
mit-loop.lisp Implements the CLtL1 Loop Macro.
sloop.lisp William Schelter's loop macro, not CLtL1/2.
yloop.lisp Frank Ritter and Jim Panagos' implementation
of the Yale loop macro described in
McDermont, Charniak and Riesbeck's
AI programming book. Not CLtL1/2.
ew/ Express Windows distribution.
iterate/ The Iterate Macro.
series/ Waters' Series Macro package.
xp.tar.Z Waters' XP Lisp Pretty Printer
simplex.lisp Bruno Haible's implementation of the Simplex
algorithm.
mapforms.tar.Z Moon's code walker.
resources.lisp Brad Miller's resources package.
nregex.lisp Lawrence Freil's regular expression matching code
The Lisp Utilities repository is maintained by Mark Kantrowitz,
····················@cs.cmu.edu.
The CLOS code repository is available by anonymous ftp to
nervous.cis.ohio-state.edu [128.146.61.200] in the directory
pub/lispusers/clos/. If you've got code you'd like to add to the
repository, send mail to Arun Welch, ···················@cis.ohio-state.edu.
The CLOS code repository includes dag.lisp.Z and 3DGeometry.lisp.
The Macintosh Common Lisp repository contains Lisp code for
MCL contributed by MCL users. It is available by anonymous ftp from
cambridge.apple.com:pub/MCL2/CONTRIB/ [134.149.2.3]
and also contains the Info-MCL mailing list archives.
The CLIM Library (a library of CLIM code) is available on
cambridge.apple.com:/pub/clim. For more information, contact
Vincent Keunen, ······@nrb.be.
MIT AI Lab -- ftp.ai.mit.edu:pub/
loop-macro.tar [LOOP from CLtL1]
series/ [SERIES from CLtL2; older version]
Iterate/ [Alternative to series and loop.]
clmath.tar [Numeric math 1984]
ontic/ [ONTIC Knowledge Rep. for Mathematics]
clmath is a Lisp library of mathematical functions that calculate
hyperbolic and inverse hyperbolic functions, Bessel functions,
elliptic integrals, the gamma and beta functions, and the incomplete
gamma and beta functions. There are probability density functions,
cumulative distributions, and random number generators for the normal,
Poisson, chi-square, Student's T, and Snedecor's F functions. Discrete
Fourier Transforms. Multiple linear regression, Fletcher-Powell
unconstrained minimization, numerical integration, root finding,
and convergence. Code to factor numbers and to do the
Solovay-Strassen probabilistic prime test is included.
A technical report describing CLMath is available as MIT AI Lab
Memo 774, Gerald Roylance, "Some Scientific Subroutines in LISP",
September 1984.
The LispUsers Archives, a collection of programs for Medley, can be
found on nervous.cis.ohio-state.edu:pub/lispusers/medley. The files
include a plotting module, addressbook, chat program, clock,
call-grapher, grep implementation, Tower of Hanoi, Life, lisp dialect
translator, and fonts. Also on nervous.cis.ohio-state.edu is GTT, an
implementation of Chandrasekaran's Generic Tasks Toolset, in directory
pub/lispusers/toolset.
There's a repository of Amiga LISP implementations (and other Lisp-like
language implementations) on gatekeeper.pa.dec.com:pub/micro/amiga/lisp/.
Common Lisp versions of the mini programs from "Inside Computer
Understanding" by Schank and Riesbeck, 1981, are available by
anonymous ftp from cs.umd.edu in the directory pub/schank/icu. This
includes the SAM and ELI miniatures. It will eventually include copies
of the miniature versions of PAM, POLITICS, and Tale-Spin. The FOR
macro is also available in this directory, as are a set of functions
for manipulating and matching lisp representations of Conceptual
Dependency formulas. Contact Bill Andersen <·······@cs.umd.edu> for
more information. The directory pub/schank/icbr contains the complete
code for "Inside Case-Based Reasoning" by Riesbeck and Schank, 1989.
This includes code for an instructional version of CHEF by Kristian
Hammond.
Norvig:
The software from Peter Norvig's book "Paradigms of AI Programming" is
available by anonymous ftp from unix.sri.com:pub/norvig and on disk in
Macintosh or DOS format from the publisher, Morgan Kaufmann.
|
Software includes Common Lisp implementations of:
Eliza and pattern matchers, Emycin, Othello, Parsers,
Scheme interpreters and compilers, Unification and a prolog
interpreter and compiler, Waltz line-labelling,
implementation of GPS, macsyma, and random number generators.
|
For more information, contact:
Morgan Kaufmann, Dept. P1, 2929 Campus Drive, Suite 260
San Mateo CA 94403, (800) 745-7323; FAX: (415) 578-0672
Mac ISBN 1-55860-227-5
DOS 3.5" ISBN 1-55860-228-3
DOS 5.25" ISBN 1-55860-229-1
A catalog of free and commercial natural language software is
available from the Natural Language Software Registry, by anonymous
ftp from ftp.dfki.uni-sb.de in the directory /registry, or by email to
········@dfki.uni-sb.de.
TI Explorer Lisp Code -- sumex-aim.stanford.edu:pub/exp/
The Knowledge Systems Lab's set of Explorer patches and tools. It
includes in the jwz subdirectory a set of tools written and collected
by Jamie Zawinski. Send questions to ·····@sumex-aim.stanford.edu.
Dick Waters/MERL: XP, Series
Dick Waters' XP Lisp Pretty Printer is available by anonymous ftp
from merl.com:/pub/xp/ as the files xp-code.lisp, xp-doc.txt, and
xp-test.lisp.
The Series Macro is also available from this site in the directory
/pub/series/ as the files s-code.lisp, s-test.lisp, and s-doc.txt. The
Series macro package is described fully in Waters, R.C., "Automatic
Transformation of Series Expressions into Loops", ACM Transactions on
Programming Languages and Systems, 13(1):52--98, January 1991,
MIT/AIM-1082 and MIT/AIM-1083.
Both programs are also available from the Lisp Utilities Repository
described above.
For further information, contact Dick Waters, <····@merl.com> or
<····@ai.mit.edu>. An improved version of Series is in the works.
----------------------------------------------------------------
Subject: [6-3] Publicly Redistributable Lisp Software
AI Algorithms and Tools:
PAIL (Portable AI Lab) is a computing environment containing a
collection of state-of-the-art AI tools, examples, and documentation.
It is aimed at those involved in teaching AI courses at university
level or equivalent. The system has enough built-in functionality to
enable its users to get practical experience with a broad range of AI
problems without having to build all the supporting tools from
scratch. It is implemented in Common Lisp and uses CLOS and Allegro
Common Windows (i.e., in Allegro CL 4.1). It is available by anonymous
ftp from pobox.cscs.ch (148.187.10.13) in the directory /pub/ai/pail-2.1/.
Written by Mike Rosner and Dean Allemang {dean,·····@idsia.ch.
AI_ATTIC is an anonymous ftp collection of classic AI programs and
other information maintained by the University of Texas at Austin. It
includes Parry, Adventure, Shrdlu, Doctor, Eliza, Animals, Trek, Zork,
Babbler, Jive, and some AI-related programming languages. This
archive is available by anonymous ftp from ftp.cc.utexas.edu
(bongo.cc.utexas.edu, 128.83.186.13) in the directory /pub/AI_ATTIC.
For more information, contact ···········@bongo.cc.utexas.edu.
The Automatic Memoization Facility adds a practical memoization
facility to Common Lisp. Automatic memoization is a technique by which
an existing function can be transformed into one that "remembers"
previous arguments and their associated results, yielding large
performance gains for certain types of applications. This facility
extends the ideas from Norvig's book into what is needed for a
practical tool for us in large programs. It adds facilities for
bookkeeping and timing, and lets you evaluate of the timing advantages
of memoization, and save hash tables to disk for automatic reuse in
later sessions. The code is available by anonymous ftp from
archive.cs.umbc.edu:/pub/Memoization [130.85.100.53]. Contact Marty Hall
<····@aplcenmp.apl.jhu.edu> for more information. The code includes an
overview of memoization and its applications.
Benchmarks:
Gabriel Lisp Benchmarks are available by anonymous ftp as
ai.toronto.edu:/pub/gabriel-lisp-benchmarks.tar.Z.
Lucid CL contains a set of benchmarks in its goodies/ directory,
including Bob Boyer's logic programming benchmark, a benchmark to
create and browse through an AI-like database of units, a CLOS speed
test, a compilation speed test, TAKR (the 100 function version of TAK
that tries to defeat cache memory effects), CTAK (A version of the
TAKeuchi function that uses the CATCH/THROW facility), STAK (A version
of the TAKeuchi function with special variables instead of parameter
passing), DERIV and DDERIV (Symbolic derivative benchmarks written by
Vaughn Pratt), DESTRU (a destructive operation benchmark), DIV2 (a
benchmark which divides by 2 using lists of n ()'s), the FFT benchmark
written by Harry Barrow, FPRINT (a benchmark to print to a file),
FRPOLY (a Franz Lisp benchmark by Fateman based on polynomial
arithmentic), Forest Baskett's PUZZLE benchmark (originally written in
Pascal), the TPRINT benchmark to read and print to the terminal, a
benchmark that creates and traverses a tree structure, and TRIANG
(board game benchmark). Some of the benchmarks may work only in Lucid.
Blackboard Architectures:
The UMass GBB system (V1.2) is available by anonymous ftp from
dime.cs.umass.edu:/gbb. The commercial GBB product is not.
Work on the UMass GBB project (and funding) ended over 2 years ago.
Many researchers using it have opted for the commercial
release. The UMass research system remains available, but the
two should not be confused as the commercial system is
substantially improved and extended. The commercial system is available
from Blackboard Technology Group, PO Box 44, 401 Main Street,
Amherst, Massachusetts 01002, 413-256-4240.
Case-based Reasoning:
CL-Protos is a Common Lisp implementation of the case-based
reasoning system developed by E. Ray Bareiss and Bruce W.
Porter of the University of Texas/Austin AI Lab. It runs
on Sun3, TI Explorer, HP 9000, and Symbolics, and gobbles a
huge amount of memory. Common Lisp implementation by
Rita Duran, Dan Dvorak, Jim Kroger, Hilel Swerdlin, and Ben Tso.
For more information, bug reports, or comments, contact
either Dan Dvorak <······@cs.utexas.edu> or Ray Bareiss
<·······@ils.nwu.edu> or Erik Eilerts <·······@cs.utexas.edu>
Available by anonymous ftp from cs.utexas.edu:/pub/porter
CLOS Software:
See question [5-6].
Databases:
Postgres is an object-oriented database, and is available
from postgres.berkeley.edu:/pub/postgres*
It runs on DecStation 3100s, Sun3 (SunOs), Sun4 (Sparc),
and Sequent Symmetry.
Eliza and Similar Programs:
See Peter Norvig's book and AI_ATTIC (question [6-1] above).
The doctor.el is an implementation of Eliza for
GNU-Emacs emacs-lisp. Invoke it with "Meta-X doctor"
muLISP-87 (a MSDOS Lisp sold by Soft Warehouse) includes
a Lisp implementation of Eliza.
Implementations of ELIZA for other languages are mentioned in the AI FAQ.
The original Parry (in MLISP for a PDP-10) is available in
labrea.stanford.edu:/pub/parry.tar.Z.
RACTER is *not* public domain. According to A.K. Dewdney's book,
"The Armchair Universe", Racter is available from John Owens,
INRAC, Inc., 12 Schubert St., Staten Island, NY 10305. It was
published in 1984, and written in compiled BASIC.
Expert Systems:
FOCL is an expert system shell and machine learning program written in
Common Lisp. The machine learning program extends Quinlan's FOIL
program by containing a compatible explanation-based learning
component. FOCL learns Horn Clause programs from examples and
(optionally) background knowledge. The expert system includes a
backward-chaining rule interpreter and a graphical interface to the
rule and fact base. For details on FOCL, see: Pazzani, M. and Kibler,
D., "The role of prior knowledge in inductive learning", Machine
Learning 9:54-97, 1992. It is available by anonymous ftp from
ics.uci.edu as a (binhexed, compacted) Macintosh application,
pub/SaranWrap/KR-FOCL-ES.cpt.hqx, or as Common Lisp source code (see
pub/SaranWrap/README for details). If you use a copy of FOCL, or have
any comments or questions, send mail to ·······@ics.uci.edu.
BABYLON is a development environment for expert systems. It
includes frames, constraints, a prolog-like logic formalism, and a
description language for diagnostic applications. It is implemented in
Common Lisp and has been ported to a wide range of hardware platforms.
Available by anonymous ftp from gmdzi.gmd.de:gmd/ai-research/Software/
(129.26.8.90) as a BinHexed stuffit archive, on the Apple CD-ROM, or
with the book "The AI Workbench BABYLON", which contains *full source
code* of BABYLON and the stand-alone version for the Mac. The book
describes the use of BABYLON in detail.
OPS5 -- See Lisp Utilities Repository in question [6-1].
Frame Languages:
FrameWork is available in the Lisp Utilities Repository described above.
THEO (learning frame system) is available free from CMU, after
signing a license agreement. Send mail to ············@cs.cmu.edu.
FrameKit is available free from CMU, after signing a
license agreement. Send mail to ···········@cs.cmu.edu
KR. Send mail to ··········@cs.cmu.edu for more info.
PARKA. Frames for the CM. Contact ·······@cs.umd.edu.
PARMENIDES (Frulekit) is available free, after signing
a license agreement. Send mail to ···········@cs.cmu.edu
FROBS is available free by anonymous ftp from
cs.utah.edu:/pub/frobs.tar.Z
Contact Robert Kessler <·······@cs.utah.edu> for more info.
PFC is a simple frame system written by Tim Finin
available free by anonymous ftp from linc.cis.upenn.edu.
YAK is a hybrid knowledge-representation system of the
KL-ONE family. Includes an optional graphical interface
depending on the Lisp. Available free after signing a license
agreement. Contact Enrico Franconi <········@irst.it>.
Genetic Algorithms:
GECO (Genetic Evolution through Combination of Objects) is a
genetic algorithm shell written by George Williams,
<······@hsvaic.boeing.com>. It is available by anonymous ftp
from cambridge.apple.com:/pub/mcl2/contrib/ as the following
files:
GECO-v1.0.cpt.hqx binhex'd Compact Pro archive
GECO-v1.0.tar.Z compressed tar file for Unix machines (no MCL
fonts)
GECO.abstract a brief description
It runs in MCL 2.0, but should be portable among CLtL2 compliant
Common Lisps.
GAL is a genetic algorithm suite written by Bill Spears of NRL. The
MCL2.0 port was done by Howard Oakley <······@quercus.demon.co.uk> and
is available from cambridge.apple.com:/pub/MCL2/contrib as
GAL.sea.hqx. Improvements and adaptations should be sent to Bill
Spears, but questions on the MCL port should be directed to Howard Oakley.
Other genetic algorithms code is available
ftp.aic.nrl.navy.mil:/pub/galist
including Genesis (source-code/ga-source/genesis.tar.Z) and the archives
of the GA-List mailing list. A survey of free and commercial
genetic algorithms implementations is available in
information/ga-software-survey.txt.
Knowledge Representation:
KNOWBEL is an implementation of Telos (a sorted/temporal logic
system) by Bryan M. Kramer, <······@ai.toronto.edu>. It is
available by anonymous ftp from ai.toronto.edu:/pub/kr/ as the
files knowbel.tar.Z and manual.txt.tar.Z
Runs in Allegro CL on Sparcstations and Silicon Graphics 4d
and in MCL on Apple Macintoshes.
SNePS is a semantic net implementation, available free after
signing a license agreement. Contact ·······@cs.buffalo.edu
for more information.
COLAB (COmpilation LABoratory) is a hybrid knowledge representation
system emphasizing the horizontal and vertical compilation of
knowledge bases. It is comprised of cooperating subsystems -- CONTAX,
FORWARD, RELFUN and TAXON -- which deal with different knowledge
representation and reasoning formalisms. Each subsystem can also be
used as stand-alone system. CONTAX deals with constraint nets and
constraint-propagation techniques. Relational knowledge in the form of
Horn rules is processed by forward (FORWARD) and backward (RELFUN)
chaining. Taxonomic knowledge is represented by intensional concept
definitions which are automatically arranged in a subsumption
hierarchy (TAXON). The COLAB software was developed at DFKI and the
University of Kaiserslautern and runs in Common Lisp. (The subsystems
have been tested in AKCL and Lucid CL, and possibly also Allegro CL
and Symbolics CL.) All the subsystems are available free of charge for
research purposes.
o RELFUN is a logic-programming language with call-by-value (eager),
non-deterministic, non-ground functions, and higher-order operations.
It accepts freely interchangeable LISP-style and PROLOG-style syntaxes.
For sources to RELFUN and copies of relevant papers, contact
Dr. Harold Boley, DFKI, Postfach 2080, W-6750 Kaiserslautern, Germany,
call +49-631-205-3459, fax +49-631-205-3210, or send email to
·····@informatik.uni-kl.de.
o TAXON is a terminological knowledge representation system extended by
concrete domains. For sources to TAXON and copies of relevant papers,
contact Philipp Hanschke, DFKI, Postfach 2080, W-6750 Kaiserslautern,
Germany, call +49-631-205-3460, fax +49-631-205-3210, or send email to
········@dfki.uni-kl.de.
o CONTAX is a constraint system for weighted constraints over
hierarchically structured finite domains. CONTAX uses CLOS in addition
to Common Lisp. For sources to CONTAX and copies of relevant papers,
contact Manfred Meyer, DFKI, Postfach 2080, W-6750 Kaiserslautern,
Germany, call +49-631-205-3468, fax +49-631-205-3210, or send email to
·····@dfki.uni-kl.de.
o FORWARD is a logic programming language with bottom-up and top-down
evaluation of Horn clauses. For sources to FORWARD and copies of
relevant papers, contact Knut Hinkelmann, DFKI, Postfach 2080, W-6750
Kaiserslautern, Germany, call +49-631-205-3467, fax +49-631-205-3210,
or send email to ········@dfki.uni-kl.de.
Languages and Alternate Syntaxes:
Generalized Lisp (or Glisp for short) is a coordinated set of high
level syntaxes for Common Lisp. Initially GLisp consists of three
dialects: Mlisp, Plisp and ordinary Lisp, together with an extensible
framework for adding others. Mlisp (Meta-Lisp) is an Algol-like
syntax for people who don't like writing parentheses. For example,
one can write print("abc", stream) instead of (print "abc" stream).
Plisp (Pattern Lisp) is a pattern matching rewrite-rule language.
Plisp is a compiler-compiler; its rules are optimized for writing
language translators. All dialects may be freely intermixed in a
file. The translators for all dialects are written in Plisp, as is
the Glisp translator framework itself. Support routines for the
translators are written in Mlisp and/or Lisp. All dialects are
translated to Common Lisp and execute in the standard Common Lisp
environment. Glisp is available by anonymous ftp from apple.com or
ftp.apple.com:dts/mac/lisp/glisp.tar.Z
GLISP runs in MCL and has to be modified for other Common Lisp
implementations.
CGOL is algol-like language that is translated into Lisp before
execution. It was developed originally by Vaughn Pratt. A Common Lisp
implementation of CGOL is available by anonymous ftp from
peoplesparc.berkeley.edu:pub/cgol.1.tar.Z [128.32.131.14]
(The number "1" may increase if newer versions are posted.) It was
written by a UC Berkeley graduate student, Tom Phelps, as a term
project, so there may still be some rough edges. There is a lot of
documentation in the distribution, including the "original" CGOL memo
(pratt.memo). For more information, contact Richard Fateman
<·······@peoplesparc.berkeley.edu>.
StarLisp Simulator -- think.com:/cm/starlisp/starsim-f19-sharfile
Simulates *Lisp, one of the programming langauges used to program
the Connection Machine. Runs under Symbolics, Lucid, Allegro, and Franz.
InterLisp->Common-Lisp Translator -- ai.sri.com:pub/pkarp/lisp/ilisp/
Other InterLisp to Common Lisp translators may be found in the LispUsers
archive listed above.
The Yale Haskell system runs in CMU Common Lisp, Lucid CL, and AKCL.
It is available by anonymous ftp from
Chalmers animal.cs.chalmers.se 129.16.225.66
Glasgow ftp.dcs.glasgow.ac.uk 130.209.240.50
Yale nebula.cs.yale.edu 128.36.13.1
in the directory pub/haskell/yale as the files
haskell-beta-2-source.tar.Z -- full sources
haskell-beta-2-sparc.tar.Z -- sparc executable
Machine Learning:
ID3: A Lisp implementation of ID3 and other machine learning
algorithms are available by anonymous ftp from the machine learning
group at the University of Texas as cs.utexas.edu:pub/mooney
COBWEB/3 is a concept formation system available free after
signing a license agreement. Contact ······@ptolemy.arc.nasa.gov
for more information.
RWM (Refinement With Macros) is a Common Lisp program for learning
problem solving strategies. RWM takes a high level description of a
problem as input and successively refines it into a sequence of
"easier" subproblems, which collectively constitute a strategy for
solving the given problem. RWM also learns macro moves which are
useful for efficiently solving the problem. A short documentation and
some example problems/strategies are included. To get a copy of this
description, send mail to the Bilkent University Archieve Server
·······@trbilun.bitnet with "send RWM.tar.Z" in the body of the
message. For further information, contact H. Altay Guvenir
<·······@trbilun.bitnet>.
Mathematics:
LMath -- peoplesparc.berkeley.edu:pub/mma.tar.Z [128.32.131.14]
A Mathematica-style parser written in Common Lisp. Written by Richard
Fateman; ·······@renoir.Berkeley.EDU. Runs in any valid Common Lisp.
Tested in Allegro, KCL and Lucid.
rascal.ics.utexas.edu:/pub/ 128.83.138.20
Maxima for Common Lisp (License required from National
Energy Software Center at Argonne.) Ported by Bill Schelter.
Medical Reasoning:
TMYCIN -- sumex-aix.stanford.edu:/tmycin The TMYCIN rule based system.
Natural Language Generation:
FUF is a natural language generation system based on Functional
Unification Grammars implemented in Common Lisp. It includes a
unifier, a large grammar of English (surge), a user manual and many
examples. FUF is available by anonymous ftp from
cs.columbia.edu:/pub/fuf/
black.bgu.ac.il:/pub/fuf/
as the files fuf5.2.tar.Z and surge.tar.Z. For further information,
contact the author, Michael Elhadad <·······@bengus.bgu.ac.il>.
Neural Networks:
ANSIL -- nervous.cis.ohio-state.edu:pub/lispusers/ansil/
"Advanced Network Simulator in Lisp"
email: ·····@cis.ohio-state.edu
Object-Oriented Programming:
PCL -- parcftp.xerox.com:pcl/ [13.1.64.94]
Portable Common Loops (PCL) is a portable implementation of
the Common Lisp Object System (CLOS). A miniature CLOS
implementation called Closette is available pcl/mop/closette.lisp.
CLOS-on-KEE -- zaphod.lanl.gov:/pub/
A subset of CLOS that is implemented on top of KEE. Contact
·············@LANL.GOV (Skip Egdorf) for more info.
MCS (Meta Class System) -- ftp.gmd.de:/lang/lisp/mcs/ [129.26.8.90]
Portable object-oriented extension to Common Lisp. Integrates the
functionality of CLOS (the Common Lisp Object System), and TELOS, (the
object system of LeLisp Version 16 and EuLisp). MCS provides a metaobject
protocol which the user can specialize. Runs in any valid Common Lisp.
Contact: Harry Bretthauer and Juergen Kopp, German National Research
Center for Computer Science (GMD), AI Research Division,
P.O. Box 1316, D-5205 Sankt Augustin 1, FRG, email: ············@gmd.de
CommonORBIT (also called CORBIT) is an object-oriented extension of
Common Lisp. It uses a prototype (classless) model of OOP, is easy to
use and yet has many sophisticated features found also in KL-ONE type
languages. CommonORBIT is a Common Lisp reimplementation of ORBIT,
which was originally conceived by Luc Steels around 1981-1983.
Because of its delegation-based rather than class-based inheritance,
CommonORBIT offers extreme flexibility to define and change
practically anything at run-time. Because of the generic functions,
it fits well into regular Lisp code. It can co-exist with CLOS but
remains completely separate. The source code of CommonORBIT is in the
public domain and available by anonymous ftp from the Lisp
Utilities Repository,
ftp.cs.cmu.edu:/afs/cs.cmu.edu/user/mkant/Public/Lisp/
in the corbit/ subdirectory as the file corbit.tar.Z.
Documentation is available as the files corbit.msword.hqx, corbit.ps
or corbit.text. A stripped-down version of CORBIT, known as BOOPS
(Beginner's Object-Oriented Programming System), is also available
from the repository as boops.tar.Z. For further information,
contact the author, Koenraad de Smedt <·······@ruls40.LeidenUniv.nl>.
Parser Generators:
Mark Johnson <··@cs.brown.edu> has written a LALR parser generator
for Common Lisp. It is fairly small (about 500 lines of code) and
can be found in the Lisp Utilities Repository above.
IPG (Incremental Parser Generator) is available by email from
Jan Rekers <······@cwi.nl>. It is an appendix to his thesis. It is
written in LeLisp, but should be portable to other Lisp dialects.
Zebu 2.2 is a parser generator for Common Lisp by Joachim H. Laubsch
<·······@hplabs.hpl.hp.com>. It is an extention written in Common
Lisp of the Scheme version. It generates a LALR(1) parsing table. To
parse a string with a grammar, only this table and a driver need to be
loaded. The present version of Zebu contains the ability to define
several grammars and parsers simultaneously, a declarative framework
for specifying the semantics, as well as efficiency related
improvements. The current version compiles a grammar with 300
productions (including dumping of the tables to disk) in approx 2
minutes and 30 seconds on a HP 9000/370. This implimentation has been
tested in Lucid CL, Allegro CL, and MCL 2.0b. A copy may be found on
cambridge.apple.com:/pub/mcl2/contrib/zebu-2.2.tar.Z.
Probabilistic Reasoning and Statistics:
BELIEF is a Common Lisp implementation of the Dempster and Kong fusion
and propagation algorithm for Graphical Belief Function Models and the
Lauritzen and Spiegelhalter algorithm for Graphical Probabilistic
Models. It includes code for manipulating graphical belief models such
as Bayes Nets and Relevance Diagrams (a subset of Influence Diagrams)
using both belief functions and probabilities as basic representations
of uncertainty. It is available by anonymous ftp from
ftp.stat.washington.edu (128.95.17.34), and by email from the author,
Russell Almond <······@stat.washington.edu>. Contact the author at
······@statsci.com for information about a commercial version
GRAPHICAL-BELIEF currently in the prototype stages.
XSTAT is a statistics package which runs in XLISP. It has recently been
ported to Common Lisp, and is available as
umnstat.stat.umn.edu:/pub/xlispstat/CL/CLS1.0A1.tar.Z
The CL port does not yet include the lisp-stat dynamic graphics
package, only the numerics. The XLisp version is available from
the above site and several mirror sites, such as mac.archive.umich.edu.
Planning:
NONLIN -- cs.umd.edu:/pub/nonlin (128.8.128.8)
Common Lisp implementation of the NONLIN planning system originally
designed and implemented by Austin Tate. Bugs can be reported to
···········@cs.umd.edu. User's group is ············@cs.umd.edu.
The authors request that anybody ftping the code send a message to
····················@cs.umd.edu, letting them know you have a copy
and also letting them know if you wish to subscribe to the users group.
More information can also be obtained from Jim Hendler, ·······@cs.umd.edu.
ABTWEAK is a Common Lisp implementation of ABTWEAK, a hierarchical
nonlinear planner extending David Chapman's (MIT) TWEAK, may be obtained by
anonymous ftp from jupiter.drev.dnd.ca in the directory pub/steve/Abtweak.
A user's manual is included in the planner distribution, and a copy of the
associated masters thesis by Steven Woods, and other related papers are
also contained in that directory. Send mail to ·····@drev.dnd.ca for more
information.
RHETORICAL is a planning and knowledge tool available by
anonymous ftp from cs.rochester.edu:/pub/knowledge-tools
in the files rhet-19-40.tar.Z and cl-lib-3-11.tar.Z. The files
tempos-3-6.tar.Z and timelogic-5-0.tar.Z add James Allen's
interval logic to Rhet. It runs on Symbolics Genera and
Allegro Common Lisp. Written by Brad Miller <······@cs.rochester.edu>.
PRODIGY is an integrated planning and learning system,
available free after signing a license agreement. Contact
·······@cs.cmu.edu for more information.
SOAR is an integrated intelligent agent architecture currently
being developed at Carnegie Mellon University, the University of
Michigan, and the Information Sciences Institute of the University of
Southern California. SOAR, and its companion systems, CParaOPS5 and
TAQL, have been placed in the public domain. The system may be
retrieved by anonymous ftp to ftp.cs.cmu.edu (or any other CMU CS
machine) in the directory /afs/cs.cmu.edu/project/soar/5.2/2/public/.
[Note: You must cd to this directory in one atomic operation, as
superior directories may be protected during an anonymous ftp.] For
more information, send email to ············@cs.cmu.edu or write to
The Soar Group, School of Computer Science, Carnegie Mellon
University, Pittsburgh, PA 15213. Finally, though the software is in
the public domain, the manual remains under copyright. To obtain one
(at no charge) send a request (including your physical mail address)
to ········@cs.cmu.edu or to the physical address above.
SNLP is a domain independent systematic nonlinear planner,
available by anonymous ftp from cs.washington.edu:/pub/snlp.tar.Z
Contact ····@cs.washington.edu for more information.
IDM is a Common Lisp implementation of both a classical and extended
version of the STRIPS planner. It is available by anonymous ftp from
sauquoit.gsfc.nasa.gov (128.183.101.29). Questions, comments and bug
reports may be sent to ·········@chelmsford.gsfc.nasa.gov.
Planning Testbeds:
TILEWORLD is a planning testbed/simulator developed at SRI
International by Martha Pollack, Michael Frank and Marc
Ringuette. TILEWORLD originally ran under Lucid CL, but was
later extended and ported to Allegro CL by Badr H. Al-Badr
and Steve Hanks. The new tileworld is available by anonymous
ftp from cs.washington.edu as the file new-tileworld.tar.Z
It includes an X interface. Contact ·······@cs.pitt.edu for more
information.
TRUCKWORLD is a simulated world intended to provide a
testbed for AI planning programs, where the planning agent
is a truck that roams around the simulated world. It is
available by anonymous ftp from cs.washington.edu in the
file simulator.tar.Z. It includes an X interface. Contact
Steve Hanks <·····@cs.washington.edu> for more information.
ARS MAGNA is a simulated world intended for use as a testbed for
planning and mapping programs. The simulated agent is a robot in an
indoors environment. High-level sensing and action are provided,
realistically modelled on current vision and robotics research. It is
written in Nisp, a macro package running on top of Common Lisp. It is
available by anonymous ftp from dept.cs.yale.edu in pub/nisp as file
ars-magna.tar.Z. It includes an X display. Contact Sean Engelson
<········@cs.yale.edu> for more information.
Qualitative Reasoning:
QSIM is a qualitative reasoning system implemented in Common
Lisp. It is available by anonymous ftp from cs.utexas.edu:/pub/qsim
Contact Ben Kuipers <·······@cs.utexas.edu> for more information.
Theorem Proving:
MVL (Multi-Valued Logic) is a theorem proving system written in Common
Lisp. MVL is a bilattice-based reasoning system. By changing the
bilattice, you can use MVL to do truth maintenance, nonmonotonic
reasoning, first-order reasoning, and a variety of other reasoning
strategies. MVL is available by anonymous ftp from t.stanford.edu in
/mvl/mvl.tar.Z. A user's manual may be found in /mvl/manual.tex. For
more information, contact Matthew L. Ginsberg, <········@t.stanford.edu>
or <········@cs.stanford.edu>. Matthew asks that you send him an email
message if you retrieve the system by anonymous ftp.
Boyer-Moore
cli.com:pub/nqthm/nqthm.tar.Z Contact: ·······@cli.com
rascal.ics.utexas.edu:/pub/ 128.83.138.20
nqthm/ Boyer and Moore's theorem prover.
Also available from cli.com:/pub/nqthm.
proof-checker/ Matt Kaufmann's proof checking
enhancements to nqthm.
The mailing list ···················@cli.com is for users of the
Boyer-Moore theorem-prover, NQTHM.
Virtual Reality:
VEOS (Virtual Environment Operating Shell) is an extendible environment
for prototyping distributed applications for Unix. The programmer's
interface uses XLISP 2.1. Although intended for distributed
Virtual Reality applications at The Human Interface Technology Lab
in Seattle, it should be appropriate for other applications. VEOS
uses heavyweight sequential processes, corresponding roughly to
unix processes. VEOS runs on DEC/5000, Sun4, and Silicon Graphics
VGX and Indigo. VEOS is available by anonymous ftp from
milton.u.washington.edu (128.95.136.1) in the directory ~ftp/public/veos
as veos.tar.Z. If you use the software, the authors ask that you send
them mail to ············@hitl.washington.edu.
Vision:
OBVIUS -- whitechapel.media.mit.edu:/obvius/ [18.85.0.125]
Object-Based Vision and Image Understanding System (OBVIUS), is a Common
Lisp image processing package. Provides a library of image processing
routines (e.g., convolutions, fourier transforms, statistical
computations, etc.) on gray or binary images and image-sequences (no
color support yet), an X windows display interface, postscript printer
output, etc. It uses a homebrew interface to X11 (i.e., it does not use
clx or clue). However, they eventually hope to port Obvius to a clx/clue
platform. Written by David Heeger <······@white.stanford.edu> and Eero
Simoncelli <····@whitechapel.media.mit.edu>. Runs in Lucid-4.0. Includes
LaTeX documentation and User's Guide.
Miscellaneous:
ftp.csrl.aoyama.ac.jp:
YY/ YY window toolkit sources
Lisp/ several common lisp sources, including MIT's FRL.
RRL (Rewrite Rule Laboratory) -- herky.cs.uiowa.edu:public/rrl
[128.255.28.100]
PLisp - A Common Lisp front end to Postscript. This translates many
Common Lisp functions to postscript as well as manage the environment
and many lispisms (&optional and &rest arguments, multiple values,
macros, ...). Available via anonymous ftp in pub/plisp/plisp.tar.Z on
nebula.cs.yale.edu (128.36.13.1). Written by John Peterson,
·············@cs.yale.edu.
RegExp is an extension to Allegro Common Lisp which adds
regular expression string matching, using the foreign
function interface. Available by anonymous ftp from
ai.sri.com:/pub/pkarp/regexp/. Contact ·····@ai.sri.com
for more information.
ifi.informatik.uni-stuttgart.de:/pub/xit/cl-utilities/ contains
three small utilities:
completion.lisp A simple filename completion program.
cl-utilities.lisp Some macros for dealing with points,
regions, and some miscellaneous macros.
copy-objects.lisp Code for copying instances.
think.com:think/lisp contains some useful lisp code (most of it
Symbolics dependent) including:
lisp-lint.lisp A set of compiler style checkers that
warn when a function call does not
conform to Common Lisp.
----------------------------------------------------------------
Subject: [6-5] How can I use the X Window System or other GUIs from Lisp?
There are several GUI's and Lisp interfaces to the X Window System. Mailing
lists for these systems are listed in the answer to question [4-7].
Various vendors also offer their own interface-building packages.
CLX provides basic Common Lisp/X functionality. It is a de facto standard
low-level interface to X, providing equivalent functionality to XLib, but
in Lisp. It is also a good source for comparing the foreign function calls
in various Lisps. Does *not* depend on CLOS. Available free as part of the
X release in the contrib directory. Also available form
export.lcs.mit.edu:/contrib as the files CLX.Manual.tar.Z and
CLX.R5.02.tar.Z. Primary Interface Author: Robert W. Scheifler
<···@zermatt.lcs.mit.edu> Send bug reports to ·······@expo.lcs.mit.edu.
CLIM (Common Lisp Interface Manager) is a portable, graphical user
interface toolkit originally developed by Symbolics and International
Lisp Associates, and now under joint development by several Lisp
vendors, including Symbolics, Franz, Lucid, Illudium, and Harlequin. It
is intended to be a portable successor of Symbolics UIMS (Dynamic
Windows, Presentations Types). CLIM 2.0 also supports more traditional
toolkit-style programming. It runs on Symbolics Lisp Machines; Allegro
and Lucid on several Unix platforms; Symbolics CLOE on 386/486 IBM PCs
running Windows; and MCL on Apple Macintoshes. It is *not* free, and
with the exception of Macintoshes, if it is available it can be
purchased from the vendor of the Lisp system you are using. For the
Macintosh version write to Illudium:
Contact: Dennis Doughty - ·······@ileaf.com
or contact: Bill York - ····@lucid.com
The CLIM 2.0 SPECIFICATION is available by anonymous ftp from
ftp.uu.net:vendor/franz/clim/clim.ps.Z.
To be added to the mailing list send mail to ············@bbn.com.
CLUE (Common Lisp User-Interface Environment) is from TI, and extends CLX
to provide a simple, object-oriented toolkit (like Xt) library that uses
CLOS. Provides basic window classes, some stream I/O facilities, and a few
other utilities. Still pretty low level (it's a toolkit, not widget
library). Available free by anonymous ftp from csc.ti.com:pub/clue.tar.Z
Written by Kerry Kimbrough. Send bug reports to ·········@dsg.csc.ti.com.
CLIO (Common Lisp Interactive Objects) is a GUI from the people who created
CLUE. It provides a set of CLOS classes that represent the standard
components of an object-oriented user interface -- such as text, menus,
buttons, scroller, and dialogs. It is included as part of the CLUE
distribution, along with some packages that use it, both sample and real.
Allegro Common Windows provides a front end to CLX. Uses CLOS.
It is *not* free. Contact ····@franz.com for more information.
[Intellicorp's KEE4.0 comes with Common Windows also. They've
implemented the CW spec to run on Lucid 4.0 on Sparcs, HP300/400s,
HP700/800s, and IBM RS6000s. Contact ····@intellicorp.com for more
information.]
The LispWorks Toolkit is an extensible CLOS-based widget set that uses
CLX and CLUE. The LispWorks programming environment has been written
using the toolkit and includes: an Emacs-like editor, listener,
debugger, profiler, and operating system shell; browsers/graphers for
classes, generic functions, processes, windows, files, compilation
errors, source code systems, and setting LispWorks parameters; and an
interactive interface builder and complete online hypertext
documentation. Contact: ·················@harlqn.co.uk
CLM (Common Lisp Motif) and GINA (Generic Interactive Application) and
IB (Interface Builder). CLM runs Motif widgets in a separate C
process, with minimal work on the Lisp side and communicates between C
and Lisp using TCP sockets. Runs in Allegro CL, Sun CL, CMU CL, Lucid
CL, and Symbolics Genera. GINA uses CLOS. Available free in the X
contrib directory or by anonymous ftp from either
export.lcs.mit.edu:/contrib or
ftp.gmd.de:/gmd/gina [129.26.8.90]
as the files CLM+GINA.README, CLM2.2.tar.Z and GINA2.2.tar.Z. CLM was
written by Andreas Baecker <·······@gmdzi.gmd.de>, GINA by Mike Spenke
<······@gmdzi.gmd.de>, and IB by Thomas Berlage <·······@gmdzi.gmd.de>.
Contact Mike Spenke for more info. To be added to the mailing list,
send a message to ··················@gmdzi.gmd.de.
EW (Express Windows) is intended to mimic Symbolics' Dynamic Windows user
and programmer interfaces. It is available free in the ew/ subdirectory of
the Lisp Utilities repository. It is no longer under active development.
Runs on Sun/Lucid, Franz Allegro, and Symbolics. Should port easily to
other Lisps with CLX.
Written by Andrew L. Ressler <········@oiscola.columbia.ncr.com>.
Garnet is a large and flexible GUI. Lots of high-level features. Does
*not* depend on CLOS, but does depend on CLX. Garnet (version 2.0 and
after) is now in the public domain, and has no licensing restrictions,
so it is available to all foreign sites and for commercial uses.
Detailed instructions for obtaining it by anonymous ftp are available
by anonymous ftp from a.gp.cs.cmu.edu [128.2.242.7] as the file
/usr/garnet/garnet/README. Garnet includes the Lapidiary interactive
design tool, C32 constraint editor, spreadsheet object, Gilt
Interface Builder, automatic display management, two
widget sets (Motif look-and-feel and Garnet look-and-feel), support for
gesture recognition, and automatic constraint maintenance, application
data layout and PostScript generation. Runs in virtually any Common
Lisp environment, including Allegro, Lucid, CMU, and Harlequin Common
Lisps on Sun, DEC, HP, Apollo, IBM 6000, and many other machines.
Garnet helps implement highly-interactive, graphical, direct
manipulation programs for X/11 in Common Lisp. Typical applications
include: drawing programs similar to Macintosh MacDraw, user interfaces
for expert systems and other AI applications, box and arrow diagram
editors, graphical programming languages, game user interfaces,
simulation and process monitoring programs, user interface construction
tools, CAD/CAM programs, etc. Contact Brad Myers (···@a.gp.cs.cmu.edu)
for more information. Bug reports and administrative questions:
······@cs.cmu.edu. Garnet is discussed on the newsgroup comp.windows.garnet.
LispView is a GUI written at Sun that does not use CLX. Instead it
converts Xlib.h directly into Lucid foreign function calls. It is intended
to be fast and tight. Uses CLOS. Available for anonymous ftp from
export.lcs.mit.edu:contrib/lispview1.1 and
xview.ucdavis.edu:pub/XView/LispView1.1
Includes a general-purpose 2D grapher library.
Written by Hans Muller (·······@sun.com). Runs in Sun CL and Lucid CL.
Direct questions about the source provision to ········@Eng.Sun.Com.
WINTERP (Widget INTERPreter) was developed at HP and uses the Xtoolkit and
Motif widget set. It is based on David Betz's XLISP interpreter, which is a
small subset of Common Lisp that runs on IBM PCs. Runs on DecStation 3100,
HP9000s, Sun3, Sparcs. It is a free-standing Lisp-based tool for setting
up window applications. Available free in X contrib directory, or by
anonymous ftp from export.lcs.mit.edu:contrib/winterp-???.tar.Z where ???
is the version number. If you do not have Internet access you may request
the source code to be mailed to you by sending a message to
·····················@hplabs.hp.com or hplabs!hplnpm!winterp-source.
Contact Niels Mayer ·····@hplabs.hp.com for more information.
ftp.csrl.aoyama.ac.jp:YY/ YY window toolkit sources
YYonX is a port of the YY system to X windows. Runs in Lucid CL, Allegro
CL, and Symbolics Genera. Supports kanjii. Developed at Aoyama Gakuin
University. Available free by anonymous ftp from ftp.csrl.aoyama.ac.jp:YY/
Written by Masayuki Ida <···@cc.aoyama.ac.jp>
Picasso is a CLOS based GUI, and is available from
postgres.berkeley.edu:/pub/Picasso-2.0 It runs on DecStation 3100s, Sun3
(SunOs), Sun4 (Sparc), and Sequent Symmetry in Allegro CL. The file
pub/xcl.tar.Z contains X-Common Lisp interface routines. Send mail to
·······@postgres.berkeley.edu for more information.
XIT (X User Interface Toolkit) is an object-oriented user interface
toolkit for the X Window System based on Common Lisp, CLOS, CLX, and
CLUE. It has been developed by the Research Group DRUID at the
Department of Computer Science of the University of Stuttgart as a
framework for Common Lisp/CLOS applications with graphical user
interfaces for the X Window System. The work is based on the USIT
system developed by the Research Group INFORM at the University of
Stuttgart. Although the system kernel is quite stable, XIT is still
under active development. XIT can be obtained free by anonymous ftp
from ifi.informatik.uni-stuttgart.de (129.69.211.1) in the directory
/pub/xit/.
----------------------------------------------------------------
Subject: [6-6] Formatting code in LaTeX
SLaTeX is a R4RS-compliant Scheme program that allows you to write
program code "as is" in your LaTeX or TeX source. It is particularly
geared to the programming languages Scheme and Common Lisp, and has
been tested in Chez Scheme, Common Lisp, MIT C Scheme, Elk, Scheme->C,
SCM and UMB Scheme on Unix; and MIT C Scheme and SCM on MSDOS. The
formatting of the code includes assigning appropriate fonts to the
various tokens in the code (keywords, variables, constants, data), at
the same time retaining the proper indentation when going to the
non-monospace (non-typewriter) provided by TeX. SLaTeX comes with two
databases that recognize the standard keywords/variables/constants of
Scheme and Common Lisp respectively. These can be modified by the
user using easy TeX commands. In addition, the user can inform SLaTeX
to typeset arbitrary identifiers as specially suited TeX expressions
(i.e., beyond just fonting them). The code-typesetting program SLaTeX
is available by anonymous ftp from cs.rice.edu as the file
public/dorai/slatex.tar.Z. Send bug reports to ·····@cs.rice.edu.
SchemeWEB is a Unix filter that translates SchemeWEB source into LaTeX
source or Scheme source. Originally developed for the Scheme dialect
of Lisp, it can easily be used with most other dialects.
Posted to comp.sources.unix, Volume 26, Issue 82, by John D.
Ramsdell <········@linus.mitre.org>, under archive name schemeweb/part01.
----------------------------------------------------------------
Subject: [6-7] Where can I get an implementation of Prolog in Lisp?
Implementations of Prolog in Lisp:
The Frolic package from the University of Utah is written in Common Lisp
and available by anonymous ftp from cs.utah.edu:pub/frolic.tar.Z
LM-PROLOG by Ken Kahn and Mats Carlsson is written in ZetaLisp and not
easily portable to Common Lisp. It is available by anonymous ftp from
sics.se:archives/lm-prolog.tar.Z.
Peter Norvig's book "Paradigms of AI Programming" includes Common Lisp
implementations of a prolog interpreter and compiler. The software is
available by anonymous ftp from unix.sri.com:pub/norvig and on disk in
Macintosh or DOS format from the publisher, Morgan Kaufmann. For more
information, contact: Morgan Kaufmann, Dept. P1, 2929 Campus Drive, Suite
260, San Mateo CA 94403, (800) 745-7323; FAX: (415) 578-0672
Harlequin's LispWorks comes with Common Prolog -- a fast
Edinburgh-compatible Prolog integrated with Common Lisp. Write to:
Harlequin Limited, Barrington Hall, Barrington, Cambridge, CB2 5RG, call
0223 872522 (or 44223 872522 outside UK), telex 818440 harlqn g, fax 0223
872519, or send email to ··@uk.co.harlqn (or ··@harlqn.co.uk for US people).
See the Scheme FAQ for information on implementations of Prolog in Scheme.
----------------------------------------------------------------
;;; *EOF*