===========================================================================
Topic: (/)
Summary: This is the top level directory of the disc.
Description:
This directory contains three annotation files and several directories:
/
0.all concatenation of the release's 0.doc files
0.ask abbreviated version of 0.all
0.doc top-level documentation (this file)
a2z administrative sub-directory
sub-directory for
...
The a2z directory contains administrative files which should be inspected
before any attempt is made to use the disc. In addition, the book should
be read for hints on using the disc. a2z is laid out as follows:
a2z/
0.doc documentation file for directory a2z
bin scripts for using the disc
doc assorted reference text files
lists lists of packages, etc.
origins information on package origins
We do not supply a browser, because we don't yet know how to do one in a
convenient and portable fashion. For the present, we suggest that you use
your favorite text editor on the 0.all or 0.ask file.
The remaining directories are the tops of topical directory trees. These
are (typically) structured as follows:
a/
0.doc documentation file for topic a
aa/
0.doc documentation file for topic aa
aaa/
0.doc documentation file for package aaa
0.iso ISO-9660 file name correspondence table
0.lst summary listing file for package aaa
aaa.lzv verbose listing of aaa.zip
aaa.zip Info-zipped archive
ab/
...
There are some definite flaws with the current hierarchy, principally
stemming from limitations in the ISO-9660 file system and differences
between CD-ROM and FTP archive structuring priorities. We expect to
rearrange things in future releases, so let us know your preferences...
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!! !!
!! All ancillary material produced by PTF (e.g., the book, this !!
!! file, etc.) is Copyright (C) 1994 Prime Time Freeware. All !!
!! rights reserved. See a2z/docs/legal.txt or the Legalities !!
!! section of the book for information on usage restrictions. !!
!! !!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Contains:
a2z A Administrative directory for the disc
areas T AI Software Packages
lang T AI Programming Languages
pubs T AI Publications
util T Compression/Archiving Software
See Also:
"Quick Start" or "Tutorial Introduction", in the accompanying book
===========================================================================
Admin: a2z
Description: Administrative directory for the disc
Notes:
This directory contains administrative files which should be inspected
before any attempt is made to use the disc. Some files, particularly those
in the docs directory, should probably be printed out for easy reference.
Contains:
bin shell scripts to assist in using the disc
doc text files documenting the disc as a whole
lists lists of packages, etc.
origins package origin information
See Also: ?
===========================================================================
Admin: a2z/bin/
Summary: Shell scripts to assist in using the disc
Description:
These scripts are intended to help you find and install packages, and
otherwise work with the disc. Feel free to adapt them to your own needs,
if they do not currently do what you wish. Let us know about any bugs or
other opportunities for improvement: ptf-bugs@cfcl.com
Much of the complexity in these scripts results from the fact that there
are four distinct decisions a UNIX vendor can make in presenting ISO-9660
file names to the user. The decisions are whether or not to:
hide version numbers
map alphabetic characters to lower case
hide trailing periods when no extension exists
A given ISO-9660 file (e.g., "FOO.;1") may thus be displayed by your UNIX
system in any of eight possible ways:
foo foo. foo;1 foo.;1
FOO FOO. FOO;1 FOO.;1
Because ISO-9660 files have no permission bits, vendors also get to chose
among some 4096 (2^12) possible mode combinations. Worse, some vendors do
not allow direct execution of scripts, even when the mode allows it. We
have therefore decided to assume mode 444 (r--r--r--).
We have attempted to make our scripts work in all cases. We try to handle
all case, mode, and version number variations. By ensuring that all our
file names have extensions, we eliminate the trailing period problem. We
may have failed in some respect, however, or your vendor may have created
yet another case. If so, please let us know (ptf-bugs@cfcl.com).
Contains:
i.csh Initialize csh variables (source a2z/bin/i.csh)
i.ksh Initialize ksh variables ( . a2z/bin/i.ksh)
i.sh Initialize sh variables ( . a2z/bin/i.sh)
all.sh Ask all about a topic or package (look at the 0.doc file)
ask.sh Ask about a topic or package (take a shorter look...)
aget.sh Get (unzip, untar) an archive
get.sh Get (unzip, untar) a topic or package
key.sh Look up matching packages, given a keyword
keys.sh Look up matching packages, given a set of keywords
(Note: the above keywords are actually grep-style regular expressions.)
See Also:
"Quick Start"
"Troubleshooting"
"Tutorial Introduction"
===========================================================================
Admin: a2z/docs
Description: Documentation files relating to the disc as a whole
Notes:
These files contain text files that relate to the disc as a whole. There
are two major categories, at present:
GNU General Public License
The GPL has had a very large effect on the way UNIX-related freeware
is distributed. Even folks who do not agree with the GPL have had to
examine their thinking in the light of it. If you haven't read the
GPL, please print it out and do so.
PTF order forms
In case you (or your friends) want copies of this or other PTF
products.
Contains:
order.ps PTF order forms (PostScript)
order.txt PTF order forms (ASCII text)
*gpl*.txt GNU General Public License, in assorted versions
See Also: ?
===========================================================================
Admin: a2z/lists
Description: Lists of packages, etc.
Notes:
These lists centralize key data about packages found on this disc. You can
use them (generally by means of the "key" command) to help locate desired
packages.
Contains:
ki.txt Keyword Index
pl.txt Package List
See Also:
0.all concatenation of the release's 0.doc files
0.ask abbreviated version of 0.all
0.doc Overview of directory (e.g., this file)
*.lcv Full listings of cpio archives (in Package directories)
0.lst Top-level package summary (in Package directories)
*.ltv Full listings of tar archives (in Package directories)
_etc_.tgz Ancillary files (in Package directories)
the book The book contains both a Package List and a Keyword Index.
===========================================================================
Admin: a2z/origins
Description: Origins for packages found on the disc
Notes:
The files in this directory contain extended information on certain major
originators and maintainers of freeware. In general, however, you will
find most of the origin information you need in the 0.doc file for the
package itself.
Contains: ?
See Also:
0.doc file for each package
===========================================================================
Topic: areas/
Summary: AI Software Packages
Description:
This directory contains AI-related software and other materials of
interest to AI researchers, educators, students, and practitioners.
The subdirectories are organized by topic or field.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Software Packages
Contains:
agents/ Agent Architectures
alife/ Artificial Life and Complex Adaptive Systems
anneal/ Simulated Annealing
blackbrd/ Blackboard Architectures
bookcode/ Machine readable parts of various AI textbooks.
ca/ Cellular Automata
classics/ Classical AI Programs
constrnt/ Constraint Processing
dai/ Distributed AI
discover/ Machine Discovery and Data-Mining
doc/ Documentation and other AI-related notes.
edu/ Educational Tools
expert/ Expert Systems and Production Systems
faq/ AI FAQs: Frequently Asked Questions (FAQ) postings for comp.ai
fuzzy/ Fuzzy Logic
games/ Game Playing
genetic/ Genetic Algorithms and Genetic Programming
icot/ IFS: ICOT Free Software
kr/ Knowledge Representation
learning/ Machine Learning
misc/ Miscellaneous Unclassified AI Packages
music/ Music
neural/ Neural Networks, Connectionist Systems, and Neural Systems
nlp/ Natural Language Processing (NLU, NLG, Parsing, Morphology,
Machine Translation ...)
planning/ Planning and Plan Recognition
reasonng/ Reasoning (Analogical Reasoning, Case Based Reasoning,
Defeasible Reasoning, Legal Reasoning, Medical Reasoning,
Probabilistic Reasoning, Qualitative Reasoning,
Temporal Reasoning, Theorem Proving/Automated Reasoning,
Truth Maintenance)
robotics/ Robotics
search/ Search
speech/ Speech Recognition and Synthesis
testbeds/ Testbeds, Simulators, and Micro-Worlds for Planning, Agents,
and Robotics
vision/ Computer Vision
See Also: ?
===========================================================================
Topic: areas/agents/
Summary: Agent Architectures
Description:
This directory contains software and materials concerning agent
architectures, integrated AI architectures, and related topics.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Agent Architectures, Software Packages
Contains:
animals/ ANIMALS: Computer simulations of animal behavior (Toby Tyrrell)
aop/ AGENT0 Interpreter: Agent-Oriented Programming
viewgen/ ViewGen: Viewpoint Generator
See Also:
areas/planning/systems/soar/
areas/planning/systems/prodigy/
areas/blackbrd/
===========================================================================
Package: areas/agents/animals/
Name: ANIMALS
Summary: Computer simulations of animal behavior (Toby Tyrrell)
Version:
Description:
ANIMALS is a simulation system written by Toby Tyrrell for his PhD
thesis. The thesis examines the problem of action selection when
dealing with realistic, animal-like situations: how to choose, at each
moment in time, the most appropriate out of a repertoire of possible
actions. It includes a description is given of a simulated
environment which is an extensive and detailed simulation of the
problem of action selection for animals. This simulated environment
is used to investigate the adequacy of several theories of action
selection (from both ethology and artificial intelligence) such as the
drive model, Lorenz's psycho-hydraulic model and Maes' spreading
activation network, and outlines deficiencies in each mechanism.
Finally, it proposes a new approach to action selection is developed
which determines the most appropriate action in a principled way, and
which does not suffer from the inherent shortcomings found in other
methods. The thesis includes a review and bibliography of existing
work on action selection.
The action selection problem modeled by the simulated environment
comprises 15 different `sub-problems' (getting food, reproducing,
not getting lost, being vigilant for predators, etc.), many internal
and external stimuli, and 35 different low-level actions to select
between.
===========================================================================
Package: areas/agents/aop/
Name: AGENT0 Interpreter
Summary: Agent-Oriented Programming
Version: 25-OCT-91
Description:
This directory contains an implementation of AOP, an interpreter for
programs written in AGENT0. AGENT0 is a programming language based on
Yoav Shoham's Agent-Oriented Programming Paradigm. AOP includes a nice
GUI based on MCT (Mark's CLX Toolkit). A demo of an airplane agent is
included.
===========================================================================
Package: areas/agents/viewgen/
Name: ViewGen
Summary: Viewpoint Generator
Version:
Description:
ViewGen (Viewpoint Generator) is a Prolog program that implements a
"Belief Ascription Algorithm" as described in Ballim and Wilks (see
References). This can be seen as a form of agent modeling tool,
which allows for the generation of arbitrarily deep nested belief
spaces based on the system's own beliefs, and on beliefs that are
typically held by groups of agents.
The theory of belief ascription upon which ViewGen is based is
described in detail in Ballim and Wilks, and a general
framework for attributing and maintaining nested propositional
attitudes is described in Afzal Ballim's dissertation. See the
readme.txt file for an abstract.
===========================================================================
Topic: areas/alife/
Summary: Artificial Life and Complex Adaptive Systems
Description:
This directory contains software and materials concerning
artificial life, complex adaptive systems, and
related topics.
Origin: FTP repositories for artificial life include
ftp.cognet.ucla.edu:/pub/alife/
alife.santafe.edu:/pub/
life.anu.edu.au:/pub/complex_systems/alife/
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Artificial Life, Complex Adaptive Systems,
Software Packages
Contains:
doc/ Documentation about Artificial Life
mail/ Mail archives for the ALIFE Digest
systems/ Artificial Life Packages
See Also:
areas/genetic/
areas/ca/
===========================================================================
Topic: areas/alife/doc/
Summary: Documentation about Artificial Life
Description:
This directory contains documents such as bibliographies,
introductions, and notes about artificial life and complex
adaptive systems.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Artificial Life!Documents
Contains:
bib/ Artificial Life Bibliography
edu/ Syllabi and Bibliographies for Artificial Life courses
notes/ Artificial Life Notes
See Also: ?
===========================================================================
Package: areas/alife/doc/bib/
Name:
Summary: Artificial Life Bibliography
Version:
Description:
This directory contains bibliographies of work on artificial life,
genetic algorithms, and related fields.
===========================================================================
Package: areas/alife/doc/edu/
Name:
Summary: Syllabi and Bibliographies for Artificial Life courses
Version:
Description:
This directory contains syllabi and bibliographies for several
artificial life courses.
===========================================================================
Package: areas/alife/doc/notes/
Name:
Summary: Artificial Life Notes
Version:
Description:
This directory contains notes about artificial life, genetic
algorithms, complex adaptive systems, and related fields.
===========================================================================
Topic: areas/alife/mail/
Summary: Mail archives for the ALIFE Digest
Version: Issues 0-109
Description:
This directory contains the mail archives for the UCLA Artificial
Life Digest mailing list.
Origin: ftp.cognet.ucla.edu:/pub/alife/archives/ [128.97.8.19]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: Send submissions to
alife@cognet.ucla.edu
To join the list, send mail to
alife-request@cognet.ucla.edu
Author(s): The list is maintained by Liane Gabora and Rob Collins
of the UCLA Computer Science Department.
Keywords:
Artificial Life!Mail Archives
Contains: ?
See Also: ?
===========================================================================
Topic: areas/alife/systems/
Summary: Artificial Life Packages
Description:
This directory contains artificial life software packages.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Artificial Life
Contains:
3dlife/ 3d Life: Three-Dimensional Cellular Automata
autogen/ Autogen: Simulation of self-organizing molecules.
biomrf/ BIOMURFFS: Simulated evolution system.
biosim/ BIOSIM: Biologically-Oriented Neural Network Simulator
bugs/ BUGS: Better to Use Genetic Systems
bugs_dos/ BUGS: Critters hunt bacteria.
bugworld/ BUGWORLD: Bug ecology, with predators.
darwin/ Darwin: An Evolutionary System.
echo/ Echo: Model of agent interactions
evo/ Evo: Human Evolution Demonstration Program
evolutn4/ Evolution: Simulation of adaptation.
genesis/ GENESIS: GEneral NEural SImulation System
lee/ LEE: Latent Energy Environments
life/ Implementations of Conway's Game of Life
lsys/ Lsys: Grow lifelike plants using simple rules.
nugs/ Nugs: Graphic simulation of Darwinian evolution.
pfg/ PFG: Plant and Fractal Generator
polywrld/ Polyworld: Artificial Life Ecological Simulator
psoup/ PSOUP: Primordial Soup
tierra/ Tierra: Evolution of digital organisms
vamv/ VAMV: Video Alpha Mosaic Virus
xantfarm/ An X Windows ant farm.
See Also: ?
===========================================================================
Package: areas/alife/systems/3dlife/
Name: 3d Life
Summary: Three-Dimensional Cellular Automata
Version: 1.0 (1-MAY-93)
Description:
This system allows visual examination of 3-dimensional cellular
automata. The automata are displayed using cubes or wireframe
graphics. The system allows a variety of rules. The simulated
universe measures 128x128x64 and wraps around at the edges.
===========================================================================
Package: areas/alife/systems/autogen/
Name: Autogen
Summary: Simulation of self-organizing molecules.
Version: 0.1 (24-SEP-93)
Description:
Autogen simulates the self-organizing behavior of a random catalytic
chemical network of abstract molecules, starting from homogeneous initial
conditions. See the readme.txt file for details.
===========================================================================
Package: areas/alife/systems/biomrf/
Name: BIOMURFFS
Summary: Simulated evolution system.
Version: 12-MAY-88
Description:
This program illustrates Richard Dawkins' principle of cumulative
small change as a mechanism for Darwinian evolution. In essence,
the principle posits that a succession of small changes can yield a
significant and radical cumulative effect. This program is similar
to Dawkins' Blind Watchmaker program.
===========================================================================
Package: areas/alife/systems/biosim/
Name: BIOSIM
Summary: Biologically-Oriented Neural Network Simulator
Version: 8-DEC-93
Description:
BIOSIM is a biologically-oriented neural network simulator. It
implements four neuron models: a simple model only switching ion
channels on and off, the original Hodgkin-Huxley model, the SWIM model
(a modified HH model) and the Golowasch-Buchholz model (the most
enhanced model). Dendrites consist of a chain of segments without
bifurcation. BIOSIM includes a graphical user interface and was
designed for research and teaching.
NOTE: This is *not* the BIOSIM program of Per Hammarlund (Sweden).
===========================================================================
Package: areas/alife/systems/bugs/
Name: BUGS
Summary: Better to Use Genetic Systems
Version: 17-SEP-92
Description:
BUGS is a simple interactive genetic algorithms program. The system
displays critters on the screen (graphs of Fourier Series) and lets
the user select fit ones with the mouse. It is written in the spirit
of Richard Dawkins' celebrated Blind Watchmaker software. Breeding is
by the genetic operators of selection, crossover, and mutation.
Illustrates genetic drift and premature convergence.
===========================================================================
Package: areas/alife/systems/bugs_dos/
Name: BUGS
Summary: Critters hunt bacteria.
Version: 0.6 (2-MAY-89)
Description:
This directory contains a graphic simulation of Darwinian evolution
in which "bugs" learn to hunt "bacteria". It is based on an idea
from A.K. Dewdney's Scientific American article.
===========================================================================
Package: areas/alife/systems/bugworld/
Name: BUGWORLD
Summary: Bug ecology, with predators.
Version: 9-AUG-93
Description:
This system simulates a bug ecology, complete with predators. As in
Tierra, the bugs are virtual computers. The bugs have to eat food
(litter) in a 2d toroidal world, while avoiding predators.
===========================================================================
Package: areas/alife/systems/darwin/
Name: Darwin
Summary: An Evolutionary System.
Version: 10-JUN-87
Description:
Darwin is an evolutionary system written in Lisp.
===========================================================================
Package: areas/alife/systems/echo/
Name: Echo
Summary: Model of agent interactions
Version: 1.0 (23-MAR-94)
Description:
Echo is a model of complex adaptive systems proposed by John Holland,
in which virtually all of the physical details of real systems have
been abstracted away. Instead, it concentrates on a small set of
primitive agent-agent and agent-environment interactions. The goal of
Echo is to study how simple interactions among simple agents lead to
emergent high-level complex phenomena such as the flow of resources in
a system or cooperation and competition in networks of agents (e.g.,
communities, trading networks, or arms races).
See the readme.txt file and the how-to.ps file for an extended description.
===========================================================================
Package: areas/alife/systems/evo/
Name: Evo
Summary: Human Evolution Demonstration Program
Version: August 1987
Description:
===========================================================================
Package: areas/alife/systems/evolutn4/
Name: Evolution
Summary: Simulation of adaptation.
Version: 4.0 (29-JUL-89)
Description:
Bugs eating bacteria.
===========================================================================
Package: areas/alife/systems/genesis/
Name: GENESIS
Summary: GEneral NEural SImulation System
Version: GENESIS 1.4.1 (August 1993); RALLPACKS 1.1 (July 1992)
Description:
GENESIS (GEneral NEural SImulation System) is a general purpose
simulation platform which supports the simulation of neural systems
ranging from complex models of single neurons to simulations of large
networks made up of more abstract neuronal components. Most current
GENESIS applications involve realistic simulations of biological
neural systems. Although the software can also model more abstract
networks, other simulators are more suitable for backpropagation and
similar connectionist modeling. XODUS is a graphical front end for
GENESIS.
The distribution includes full source code and documentation for both
GENESIS and XODUS as well as fourteen demonstration and tutorial
simulations. Documentation for these simulations is included, along
with three papers that describe the general organization of the
simulator.
Also included is a set of "Rallpacks" benchmarks for speed
and accuracy of the simulation. The three sets of benchmarks model a
linear passive cable with many compartments, a highly branched cable, and
a linear axon containing Hodgkin-Huxley channels. The simulator results
may be compared to the exact analytic solutions (for the first two cases)
and to the results given by GENESIS and by NEURON, another popular neural
simulator. (The results for these two simulators show nearly identical
speed and accuracy.)
The GENESIS Users Group, BABEL, provides some informal support to
GENESIS users. BABEL members have access to an email list, a repository
of contributions by GENESIS users and developers, new simulations,
libraries of cells and channels, additional simulator components, new
documentation and tutorials, and bug reports and fixes. Membership
requires a one-time $200 registration fee made payable to the California
Institute of Technology and sent to Jim Bower, Computational Neural
Systems Program, 216-76, Caltech, Pasadena, CA, 91125. Please provide
name, institution, mailing address, phone number, an email address for
the mailing list, and an account name for use on the BABEL computer.
===========================================================================
Package: areas/alife/systems/lee/
Name: LEE
Summary: Latent Energy Environments
Version: 1.1 (23-FEB-94)
Description:
LEE (Latent Energy Environments) is an artificial life simulator which
can be used to evolve populations of neural networks adapting to
environments of increasing complexity.
===========================================================================
Topic: areas/alife/systems/life/
Summary: Implementations of Conway's Game of Life
Description:
This directory contains a large collection of implementations of
Conway's Game of Life for Unix, IBM PC, Amiga, and other systems.
Cellular Automata, of which Life is an example, were suggested by
Stanislaw Ulam in the 1940s, and first formalized by von Neumann.
Conway's "Game of Life" was popularized in Martin Gardner's
mathematical games column in the October 1970 and February 1971 issues
of Scientific American. (Shorter notes on life are also given in the
column in each month from October 1970 to April 1971, and well as
November 1971, January 1972, and December 1972.) There's also quite a
bit on the game in "The Recursive Universe", by William Poundstone,
Oxford University Press, 1987, 252 pages.
The rules for the game of life are quite simple. The game board is a
rectangular cell array, with each cell either empty or filled. At each
tick of the clock, we generate the next generation by the following rules:
if a cell is empty, fill it if 3 of its neighbors are filled
(otherwise leave it empty)
if a cell is filled, it
dies of loneliness if it has 1 or fewer neighbors
continues to live if it has 2 or 3 neighbors
dies of overcrowding if it has more than 3 neighbors
Neighbors include the cells on the diagonals. Some implementations use
a torus-based array (edges joined top-to-bottom and left-to-right) for
computing neighbors.
For example, a row of 3 filled cells will become a column of 3 filled
cells in the next generation. The R pentomino is an interesting
pattern:
xx
xx
x
Try it with other patterns of 5 cells initially occupied. If you
record the ages of cells, and map the ages to colors, you can get a
variety of beautiful images.
When implementing Life, be sure to maintain separate arrays for the
old and new generation. Updating the array in place will not work
correctly. Another optimization to to maintain a list of the cells
that changed.
Conway has demonstrated that it is possible to construct the basic
building blocks of a computer from Life using modified glider guns.
See the last chapter of
Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy, "Winning
Ways", Academic Press, New York, 1982, ISBN 0-120911-507.
for details.
Some interesting patterns to use include:
*
* * ** * *
** * ** * * * *
** *** * * ****
* **** *** *** * *
* ** *
Clock Glider Block Spaceship * * *
* ****
*
Traffic Light Cheshire Cat
Origin: life.anu.edu.au:/pub/complex_systems/alife/life/
(Only some of the files come from the above site.)
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Artificial Life, Conway's Game of Life, Life!Implementations
Contains:
aaalife/ AAALife: Fast implementation of Conway's Game of Life for PCs.
dionne/ Life in VMS Fortran for VT100 terminals.
dr_life/ DR Life: Implementation of Conway's Game of Life for PCs.
hatch/ Implementation of Conway's Game of Life for Sun.
hensel/ PCLIFE: Implementation of Conway's Game of Life for the PC.
life_3d/ Life3D: Three-dimensional implementation of Life for the Amiga.
lifepas/ Conway's Game of Life in Pascal for the PC.
moraes/ Xlife: X-Windows Implementation of Conway's Game of Life
olsson/ Conway's Game of Life for the IBM PC
reilly/ Conway's Game of Life for Windows 3.0.
rokicki/ Conway's Game of Life for the Amiga
rupley/ Conway's Game of Life for VT100 using curses/termcap.
xlife/ XLIFE: Conway's Game of Life for X Windows
See Also: ?
===========================================================================
Package: areas/alife/systems/life/aaalife/
Name: AAALife
Summary: Fast implementation of Conway's Game of Life for PCs.
Version: 1.0 (13-JUL-89)
Description:
AAALIFE is a very fast implementation of Conway's Game of Life
for the IBM PC. It supports CGA, EGA, VGA and Hercules graphics and
includes a large collection of Life patterns.
Source code and executables are included.
===========================================================================
Package: areas/alife/systems/life/dionne/
Name:
Summary: Life in VMS Fortran for VT100 terminals.
Version: 12-MAY-94
Description:
This directory contains an implementation of Conway's Game of Life
in VMS Fortran for VT100 terminals.
===========================================================================
Package: areas/alife/systems/life/dr_life/
Name: DR Life
Summary: Implementation of Conway's Game of Life for PCs.
Version: 1.0 (12-FEB-92)
Description:
Implementation of Conway's Game of Life for the IBM PC.
===========================================================================
Package: areas/alife/systems/life/hatch/
Name:
Summary: Implementation of Conway's Game of Life for Sun.
Version: 15-JUN-92
Description:
This directory contains a fast pixel-level implementation of
Conway's Game of Life a on a torus for a black and white Sun.
Runs at 6.8 frames per second for the full screen on a Sparc.
===========================================================================
Package: areas/alife/systems/life/hensel/
Name: PCLIFE
Summary: Implementation of Conway's Game of Life for the PC.
Version: 1.06 (1-MAY-94)
Description:
This directory contains a fast implementation of Conway's Game of
Life for the IBM PC. It allows a huge universe (524288 x 524288)
and includes a large collection of patterns.
===========================================================================
Package: areas/alife/systems/life/life_3d/
Name: Life3D
Summary: Three-dimensional implementation of Life for the Amiga.
Version: 1.2 (2-MAY-87)
Description:
This directory contains a fast three-dimensional implementation of
Conway's Game of Life for the Amiga.
===========================================================================
Package: areas/alife/systems/life/lifepas/
Name:
Summary: Conway's Game of Life in Pascal for the PC.
Version: 13-MAY-94
Description:
This directory contains a fast implementation of Conway's Game of
Life written in Borland Pascal for the IBM PC. Some speed-critical
stuff is written in assembler.
===========================================================================
Package: areas/alife/systems/life/moraes/
Name: Xlife
Summary: X-Windows Implementation of Conway's Game of Life
Version: 4-AUG-89
Description:
A X-Windows implementation of Life.
===========================================================================
Package: areas/alife/systems/life/olsson/
Name:
Summary: Conway's Game of Life for the IBM PC
Version: 26-NOV-90
Description:
Yet another implementation of Life.
===========================================================================
Package: areas/alife/systems/life/reilly/
Name:
Summary: Conway's Game of Life for Windows 3.0.
Version: 28-MAY-91
Description:
This directory contains a fast implementation of Conway's Game of
Life for Windows 3.0. The program was written using Whitewater
Groups Actor 3.0, an object oriented programming development tool for
Windows.
===========================================================================
Package: areas/alife/systems/life/rokicki/
Name:
Summary: Conway's Game of Life for the Amiga
Version:
Description:
This directory contains a fast implementation of Conway's Game of
Life for the Amiga.
===========================================================================
Package: areas/alife/systems/life/rupley/
Name:
Summary: Conway's Game of Life for VT100 using curses/termcap.
Version: 6-FEB-90
Description:
This directory contains an implementation of Conway's Game of
Life for VT100 terminals using curses or termcap. Includes a large
collection of Life patterns.
This program is based on an old implementation by Leor Zolman for
the 8080; a copy of Zolman's original code is also included.
===========================================================================
Package: areas/alife/systems/life/xlife/
Name: XLIFE
Summary: Conway's Game of Life for X Windows
Version: 3.0 (10-JUL-91)
Description:
This directory contains an implementation of Conway's Game of Life
for X Windows. It includes a large collection of Life patterns.
===========================================================================
Package: areas/alife/systems/lsys/
Name: Lsys
Summary: Grow lifelike plants using simple rules.
Version: (21-MAR-91)
Description:
Lsys is a program to generate complex models using string production
systems called L-Systems, as described in Prusinkiewicz and
Lindenmayer's book. These L-Systems can be used to "grow"
natural-looking plants out of very simple rules. Lsys produces output
in PostScript and in a generic text format. Adding new output formats
is straightforward. Some of the L-systems described in Lindenmayer's
book have been included.
===========================================================================
Package: areas/alife/systems/nugs/
Name: Nugs
Summary: Graphic simulation of Darwinian evolution.
Version: 1.0 (5-OCT-93)
Description:
Nugs is an interactive graphic simulation of Darwinian evolution
(through survival of the fittest).
===========================================================================
Package: areas/alife/systems/pfg/
Name: PFG
Summary: Plant and Fractal Generator
Version: 3.0
Description:
Plant and Fractal Generator (PFG) is a Macintosh program that
generates natural-looking plants using string production systems
called L-Systems. See Prusinkiewicz's books for details.
===========================================================================
Package: areas/alife/systems/polywrld/
Name: Polyworld
Summary: Artificial Life Ecological Simulator
Version: Rev19 (28-AUG-92)
Description:
Polyworld is an ecological simulator written by Larry Yaeger. It
supports predation, mimicry, sexual reproduction, and communication.
===========================================================================
Package: areas/alife/systems/psoup/
Name: PSOUP
Summary: Primordial Soup
Version: 1.0 (19-APR-92)
Description:
Primordial Soup is an artificial life program similar in concept to
Thomas Ray's Tierra system. Organisms are computer software loops that
live in a shared memory space and self-reproduce. The organisms mutate
and evolve, behaving in accordance with the principles of Darwinian
evolution. Since the memory space is shared, multiple organisms can
execute the same program or program fragments, and can overwrite each
other in part or in whole.
===========================================================================
Package: areas/alife/systems/tierra/
Name: Tierra
Summary: Evolution of digital organisms
Version: 4.0 (16-MAR-94)
Description:
Tierra is an artificial life system for studying the evolution of
digital organisms. Tierra consists of a virtual computer and its
operating system, whose architecture has been designed in such a way
that the executable machine codes are evolvable. This means that the
machine code can be mutated (by flipping bits at random) or recombined
(by swapping segments of code between algorithms), and the resulting
code remains functional enough of the time for natural (or presumably
artificial) selection to be able to improve the code over time.
This system results in the production of synthetic organisms based on
a computer metaphor of organic life in which CPU time is the
``energy'' resource and memory is the ``material'' resource. Memory
is organized into informational patterns that exploit CPU time for
self-replication. Mutation generates new forms, and evolution
proceeds by natural selection as different genotypes compete for CPU
time and memory space. Diverse ecological communities have emerged.
Ready-made DOS executables may be purchased from
Virtual Life Virtual Life
25631 Jorgensen Road PO Box 625
Newman, CA 95360 Newark, DE 19715
for $65 on DOS disks.
[Virtual Life will also be offering a PC version of Karl Sims'
evolutionary art system, called Darwinian Art.]
===========================================================================
Package: areas/alife/systems/vamv/
Name: VAMV
Summary: Video Alpha Mosaic Virus
Version: 1.0 (31-MAY-90)
Description:
VAMV is an experiment in program evolution and population dynamics.
The goal is to have a system of evolving little programs that adapt
themselves to their environment. It should run on most terminals and
windows that support ANSI cursor positioning sequences.
===========================================================================
Package: areas/alife/systems/xantfarm/
Name:
Summary: An X Windows ant farm.
Version: 16-OCT-91
Description:
Displays a simulated ant hill in the X11 root window.
===========================================================================
Topic: areas/anneal/
Summary: Simulated Annealing
Description:
This directory contains software and materials concerning simulated
annealing.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Simulated Annealing, Software Packages
Contains:
asa/ ASA: Adaptive Simulated Annealing
See Also: ?
===========================================================================
Package: areas/anneal/asa/
Name: ASA
Summary: Adaptive Simulated Annealing
Version: 3.12 (29-APR-94)
Description:
ASA (Adaptive Simulated Annealing) is a powerful global optimization
C-code algorithm especially useful for nonlinear and/or stochastic
systems.
ASA is developed to statistically find the best global fit of a
nonlinear non-convex cost-function over a D-dimensional space. This
algorithm permits an annealing schedule for 'temperature' T decreasing
exponentially in annealing-time k, T = T_0 exp(-c k^1/D). The
introduction of re-annealing also permits adaptation to changing
sensitivities in the multi-dimensional parameter-space. This annealing
schedule is faster than fast Cauchy annealing, where T = T_0/k, and
much faster than Boltzmann annealing, where T = T_0/ln k.
===========================================================================
Topic: areas/blackbrd/
Summary: Blackboard Architectures
Description:
This directory contains software and materials concerning
blackboard architectures.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Blackboard Architectures, Software Packages
Contains:
gbb/ GBB: UMass blackboard system
gest/ GEST: Generic Expert System Tool
See Also: ?
===========================================================================
Package: areas/blackbrd/gbb/
Name: GBB
Summary: UMass blackboard system
Version: 1.20 (15-SEP-88)
Description:
UMass GBB is a free blackboard system written in Common Lisp. Work on
the UMass GBB project (and funding) ended over 2 years ago. Although
the UMass research system remains available, it should not be confused
with the commercial system. The commercial system is substantially
improved and extended. Many researchers using it have opted for the
commercial release, which is available from
Blackboard Technology Group
401 Main Street
Amherst, MA 01002
Tel: 413-256-8990
Fax: 413-256-3179
The GBB distribution includes GBB and three control shells:
Simple Shell
GBB1
OPS5 KS Shell
===========================================================================
Package: areas/blackbrd/gest/
Name: GEST
Summary: Generic Expert System Tool
Version: 8-JUL-93
Description:
GEST (Generic Expert System Tool) is a blackboard system from
Georgia Tech. The Symbolics version of GEST is available free for
classroom use only.
For information about commercial versions, contact
Susan Coryell .
===========================================================================
Topic: areas/bookcode/
Summary: Machine readable parts of various AI textbooks.
Description:
This directory contains software and problems from AI-related textbooks.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Books!AI
Contains:
knight/ Code from Rich and Knight's AI book.
winston/ Code from Winston's AI book.
See Also: ?
===========================================================================
Package: areas/bookcode/knight/
Name:
Summary: Code from Rich and Knight's AI book.
Version: 3-DEC-92
Description:
This directory contains source code for
Elaine Rich and Kevin Knight
"Artificial Intelligence", Second Edition
McGraw Hill, 1991. ISBN 0-07-052263-4.
All the software was written by Kevin Knight.
===========================================================================
Package: areas/bookcode/winston/
Name:
Summary: Code from Winston's AI book.
Version: 1.1.1 (23-APR-93)
Description:
This directory contains source code for
Patrick Henry Winston
"Artificial Intelligence", Third Edition,
Addison Wesley, Reading, MA, 1992, ISBN 0-201-53377-4.
===========================================================================
Topic: areas/ca/
Summary: Cellular Automata
Description:
This directory contains software and materials concerning cellular
automata and related topics.
Origin: FTP repositories for cellular automata include
sfi.santafe.edu:/pub/CA/
think.com:/mail/ca*
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: comp.theory.cell.automata, comp.theory.self-org-sys
The mailing list
cellular-automata@think.com (aka ca@think.com)
is gatewayed to comp.theory.cell.automata. To join,
send mail to cellular-automata-request@think.com.
Keywords:
AI Software Packages, Cellular Automata, Software Packages
Contains:
faq/ Cellular Automata FAQ: Frequently Asked Questions About
Cellular Automata
mail/ Mail archives for the CA mailing list
systems/ Cellular Automata Packages
See Also:
areas/genetic/
areas/alife/
===========================================================================
Package: areas/ca/faq/
Name: Cellular Automata FAQ
Summary: Frequently Asked Questions About Cellular Automata
Version:
Description:
A compendium of answers to frequently asked questions about
Cellular Automata and related topics. Posted to the
comp.theory.cell.automata newsgroup.
===========================================================================
Package: areas/ca/mail/
Name:
Summary: Mail archives for the CA mailing list
Version: Issues 0-109
Description:
This directory contains the mail archives for the Cellular Automata
mailing list.
===========================================================================
Topic: areas/ca/systems/
Summary: Cellular Automata Packages
Description:
This directory contains software concerning cellular automata and
related topics.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Cellular Automata
Contains:
cam/ CAM: Cellular Automata Simulator
cdm/ CDM: Interpreter for a cellular automata programming language.
cellsim/ Cellsim: Cellular automata simulator.
cinc/ Cinc: The NeXT Creatures Simulator
dtr/ DTR: Simple Systems Exhibiting Self-Directed Replication
hodge/ Hodge: C implementation of Gerhard and Schuster's hodge-podge
machine.
wautom/ Wautom: Cellular automata simulator for PCs.
wirewrld/ WireWorld: Cellular Automaton
See Also: ?
===========================================================================
Package: areas/ca/systems/cam/
Name: CAM
Summary: Cellular Automata Simulator
Version: 29-SEP-93
Description:
The CAM Simulator program is a general purpose cellular automata
simulation environment based on CAM-6 (see Toffoli, T. and Margolus,
N., Cellular Automata Machines, MIT Press (1987), for details). It
is not downwardly compatible with the original. The simulator is an
interactive FORTH interpreter.
===========================================================================
Package: areas/ca/systems/cdm/
Name: CDM
Summary: Interpreter for a cellular automata programming language.
Version: 5-FEB-91
Description:
CDM is an interpreter for SLANG, a specialized programming language for
implementing and executing asynchronous cellular automata.
===========================================================================
Package: areas/ca/systems/cellsim/
Name: Cellsim
Summary: Cellular automata simulator.
Version: 2.5 (9-APR-90)
Description:
Cellsim is a SunView-based cellular automata simulator. It allows
interactive specification, editing, running, and analysis of 1D and
2D cellular automata.
===========================================================================
Package: areas/ca/systems/cinc/
Name: Cinc
Summary: The NeXT Creatures Simulator
Version: 24-NOV-92
Description:
Cinc is an implementation of the Creatures processing model for the
NeXT. Creatures attempts to retain many of the attractive features of
cellular automata while allowing dynamic systems to be studied more
easily. This is done by describing the active elements of a system,
rather than the space in which they live.
===========================================================================
Package: areas/ca/systems/dtr/
Name: DTR
Summary: Simple Systems Exhibiting Self-Directed Replication
Version: March 1993
Description:
DTR is a cellular automata simulator for studying automata models of
self-replicating systems. The simulator is fairly general purpose and
application independent, and can run a variety of two-dimensional
cellular automata.
===========================================================================
Package: areas/ca/systems/hodge/
Name: Hodge
Summary: C implementation of Gerhard and Schuster's hodge-podge machine.
Version: 0.98j (23-MAR-93)
Description:
HODGE-C is a (mostly ANSI) C language implementation of Gerhard and
Schuster's hodge-podge machine. It implements a class of cellular
automata, that resemble very closely autocatalytic chemical reactions,
like for example, the Belousov-Zhabotinskii (BZ) reaction.
===========================================================================
Package: areas/ca/systems/wautom/
Name: Wautom
Summary: Cellular automata simulator for PCs.
Version: 1.0 (28-NOV-93)
Description:
WAUTOM is a simulator for 1-dimensional elementary binary cellular
automata (3-cell neighbors), with Wolfram's rules 0 to 255. WA2D is
similar, but for 2d automata (4-cell neighbors). WAUTNN simulates the
behavior of 1d binary CA with 5-cell neighbors.
2DHODGE is a simulator for the 2D "hodge-podge machine" with generic k
states and other parameters.
===========================================================================
Package: areas/ca/systems/wirewrld/
Name: WireWorld
Summary: Cellular Automaton
Version: 2.1 (18-FEB-93)
Description:
Wire World is a cellular automaton for building logical circuits based
on simple state-changes. The program includes a simple circuit editor
and comes with example logic gates.
Based in part on code posted by Kevin Dahlhausen
to comp.theory.cell-automata.
===========================================================================
Topic: areas/classics/
Summary: Classical AI Programs
Description:
This directory contains classical AI software, including Eliza,
Parry, and Shrdlu.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Classical AI Programs, Software Packages
Contains:
eliza/ Implementations of Eliza
parry/ PARRY: Paranoia mental hospital patient.
racter/ CLAUDE: Shareware Clone of Racter
shrdlu/ SHRDLU: Classical natural language understanding program.
See Also:
areas/alife/systems/life/
===========================================================================
Topic: areas/classics/eliza/
Summary: Implementations of Eliza
Description:
This directory contains a variety of implementations of Eliza.
Origin: Many Eliza implementations can be found on
eecs.nwu.edu:/pub/eliza/
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Classical AI Programs!Eliza, Eliza
Contains:
azile/ AZILE: The evil version of Eliza
basic/ Implementations of Eliza in BASIC
bender/ Eliza for the Macintosh
bg/ Eliza in Lisp
dbase/ Eliza in dBase III
emacs/ DOCTOR: Implementations of Eliza in Emacs Lisp
honey/ Honey: Eliza in Lisp
mac/ Eliza for the Macintosh
pascal/ Eliza in Pascal
pc/ Implementation of Eliza for PCs
prolog/ Prolog implementation of Eliza
splotch/ Splotch: Eliza-like program implemented in C.
See Also: ?
===========================================================================
Package: areas/classics/eliza/azile/
Name: AZILE
Summary: The evil version of Eliza
Version: 2.5 (4-AUG-92)
Description:
AZILE is an evil version of Eliza. If MacinTalk is installed, it
will actually speak.
===========================================================================
Package: areas/classics/eliza/basic/
Name:
Summary: Implementations of Eliza in BASIC
Version:
Description:
This directory contains several implementations of Eliza in BASIC.
eliza.tgz contains two implementations. One is of unknown origin.
The other is from Creative Computing (now defunct)
and was written by Patricia Danielson and Paul Hashfield.
eliza.100 is Eliza implemented in Model 100 BASIC, based on the
Creative Computing implementation. (26-JUL-87)
myeliza.bas is Keith Monahan's ELIZA in AMIGA 500 BASIC. (23-DEC-90)
eliza2.tgz contains Fredrick Maxwell Jr.'s implementation (13-JUN-89)
===========================================================================
Package: areas/classics/eliza/bender/
Name:
Summary: Eliza for the Macintosh
Version: 2.5 (4-AUG-92)
Description:
This is an implementation of Eliza for the Macintosh. If MacinTalk
is installed, it will actually speak.
===========================================================================
Package: areas/classics/eliza/bg/
Name:
Summary: Eliza in Lisp
Version: 20-MAR-91
Description:
This directory contains an implementation of Eliza in Lisp. It has
been tested with the sample script given in Weizenbaum's original paper.
===========================================================================
Package: areas/classics/eliza/dbase/
Name:
Summary: Eliza in dBase III
Version:
Description:
This directory contains an implementation of Eliza in Dbase III.
===========================================================================
Package: areas/classics/eliza/emacs/
Name: DOCTOR
Summary: Implementations of Eliza in Emacs Lisp
Version:
Description:
This directory contains doctor.el, an implementation of Eliza in
emacs-lisp. If you have GNU-Emacs, just type
[META]x doctor
to run it.
===========================================================================
Package: areas/classics/eliza/honey/
Name: Honey
Summary: Eliza in Lisp
Version: 12-DEC-86
Description:
This directory contains an implementation of Eliza in Lisp.
===========================================================================
Package: areas/classics/eliza/mac/
Name:
Summary: Eliza for the Macintosh
Version:
Description:
This directory contains an implementation of Eliza for the Apple
Macintosh.
===========================================================================
Package: areas/classics/eliza/pascal/
Name:
Summary: Eliza in Pascal
Version:
Description:
This directory contains implementations of Eliza in Pascal, with
IBM PC executables. BBSCHAT is an incomplete ELIZA BBS Door in PASCAL.
===========================================================================
Package: areas/classics/eliza/pc/
Name:
Summary: Implementation of Eliza for PCs
Version: 1.1
Description:
This directory contains implementations of Eliza for the IBM PC (no
source code).
===========================================================================
Package: areas/classics/eliza/prolog/
Name:
Summary: Prolog implementation of Eliza
Version: 10-APR-92
Description:
This directory contains several implementations of Eliza in Prolog.
uga.tgz contains eliza.ari and eliza.pl, an implementation by Viren
Patel for Arity Prolog and Quintus Prolog, respectively.
njr.tgz contains an implementation by Neil J. Rubenking
===========================================================================
Package: areas/classics/eliza/splotch/
Name: Splotch
Summary: Eliza-like program implemented in C.
Version: 1.0 beta (17-JUL-92)
Description:
Splotch is an Eliza-like program implemented in C. Its main feature
is its easy extensibility.
===========================================================================
Package: areas/classics/parry/
Name: PARRY
Summary: Paranoia mental hospital patient.
Version:
Description:
This is the original implementation of Parry, in MLISP (meta-lisp) for
a PDP-10. It will not work in Common Lisp and would require a
significant amount of porting (parts are written in PDP-10 assembly code).
[If anybody ports this to Common Lisp, please send a copy to the
CMU AI Repository.]
Also included in this directory is a sample of some amusing
dialogue between PARRY and ELIZA.
===========================================================================
Package: areas/classics/racter/
Name: CLAUDE
Summary: Shareware Clone of Racter
Version: 1.10
Description:
This directory contains a shareware clone of RACTER.
===========================================================================
Package: areas/classics/shrdlu/
Name: SHRDLU
Summary: Classical natural language understanding program.
Version: 13-DEC-89
Description:
This directory contains a copy of Winograd's SHRDLU, written in
MacLisp. [If anybody ports it to Common Lisp, please let the CMU AI
Repository have a copy.]
===========================================================================
Topic: areas/constrnt/
Summary: Constraint Processing
Description:
This directory contains materials concerned with constraint
programming techniques, including constraint processing,
constraint logic programming, concurrent constraint programming,
and constraint satisfaction, among others.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: comp.constraints
Keywords:
AI Software Packages, CCP, CLP, Constraint Processing,
Constraint Satisfaction, Software Packages
Contains:
bib/ Bibliographies of work in Constraint Logic Programming
faq/ Constraint FAQ: Frequently Asked Questions (FAQ) posting for
comp.constraints
systems/ Constraint Processing Packages
See Also:
lang/prolog/impl/clp/
===========================================================================
Topic: areas/constrnt/bib/
Summary: Bibliographies of work in Constraint Logic Programming
Description:
This directory contains bibliographies of work in Constraint Logic
Programming.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Bibliographies, CLP, Prolog!Bibliographies, Prolog!Documents
Contains:
clp/ Bibliography of work in Constraint Logic Programming
clpbib/ Bibliography of work in Constraint Logic Programming
satisf/ Constraint Propagation and Satisfaction References
sched/ Constraint-Based Scheduling Bibliography
See Also: ?
===========================================================================
Package: areas/constrnt/bib/clp/
Name:
Summary: Bibliography of work in Constraint Logic Programming
Version:
Description:
This directory contains a bibliography of work in Constraint Logic
Programming.
===========================================================================
Package: areas/constrnt/bib/clpbib/
Name:
Summary: Bibliography of work in Constraint Logic Programming
Version: 2
Description:
This directory contains Spiro Michaylov's BibTeX bibliography for
Constraint Logic Programming. Version 2 has more than 300 additions
by Michael Jampel.
===========================================================================
Package: areas/constrnt/bib/satisf/
Name:
Summary: Constraint Propagation and Satisfaction References
Version:
Description:
This directory contains a bibliography of work on Constraint
Propagation and Satisfaction.
===========================================================================
Package: areas/constrnt/bib/sched/
Name:
Summary: Constraint-Based Scheduling Bibliography
Version:
Description:
This directory contains a bibliography of work in Constraint-Based
Scheduling.
===========================================================================
Package: areas/constrnt/faq/
Name: Constraint FAQ
Summary: Frequently Asked Questions (FAQ) posting for comp.constraints
Version:
Description:
This directory contains a compendium of answers to frequently asked
questions about constraint programming techniques, including
constraint processing, constraint logic programming, concurrent
constraint programming, and constraint satisfaction.
===========================================================================
Topic: areas/constrnt/systems/
Summary: Constraint Processing Packages
Description:
This directory contains software related to constraint programming
techniques, including constraint processing, constraint logic
programming, concurrent constraint programming, and constraint
satisfaction.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, CCP, CLP, Constraint Processing,
Constraint Satisfaction, Software Packages
Contains:
cooldraw/ CoolDraw: Constraint-based drawing system
csplib/ CSPLIB: Routines for solving binary constraint satisfaction
problems.
d_blue/ DeltaBlue: Incremental dataflow constraint solver.
mlt_grnt/ Mult-Garnet: User interface toolkit with multi-way constraints.
skyblue/ SkyBlue: Extension of DeltaBlue constraint solver.
thinglab/ ThingLabII: Constraint-based user interfaces
See Also: ?
===========================================================================
Package: areas/constrnt/systems/cooldraw/
Name: CoolDraw
Summary: Constraint-based drawing system
Version: 5-APR-93
Description:
CoolDraw is a constraint-based object-oriented drawing framework,
similar to MacDraw, but with everything done with constraints.
===========================================================================
Package: areas/constrnt/systems/csplib/
Name: CSPLIB
Summary: Routines for solving binary constraint satisfaction problems.
Version: 29-APR-94
Description:
CSPLIB is a set of routines for solving binary constraint
satisfaction problems.
===========================================================================
Package: areas/constrnt/systems/d_blue/
Name: DeltaBlue
Summary: Incremental dataflow constraint solver.
Version: 9-FEB-94
Description:
This directory contains implementations of the DeltaBlue constraint
satisfaction algorithm written in portable C (DEC, Sun4),
Smalltalk, and Common Lisp.
===========================================================================
Package: areas/constrnt/systems/mlt_grnt/
Name: Mult-Garnet
Summary: User interface toolkit with multi-way constraints.
Version: 2.2
Description:
Multi-Garnet implements multi-directional constraints within Garnet.
Among the examples is a scatterplot for displaying a set of points.
===========================================================================
Package: areas/constrnt/systems/skyblue/
Name: SkyBlue
Summary: Extension of DeltaBlue constraint solver.
Version:
Description:
This directory contains an implementation of the SkyBlue constraint
solver code, which extends DeltaBlue with support for multi-output
methods and better behavior when encountering cycles.
===========================================================================
Package: areas/constrnt/systems/thinglab/
Name: ThingLabII
Summary: Constraint-based user interfaces
Version: v2 (20-MAY-90)
Description:
ThingLab II supports the exploration of constraint-based user
interfaces. It consists of a set of classes that define constraints
and constrainable objects called things. It also includes an
incremental constraint satisfier, a module compiler, a
construction-set style user interface, various tools, and an
extensible set of primitive user interface building blocks.
===========================================================================
Topic: areas/dai/
Name:
Summary: Distributed AI
Version:
Description:
This directory contains materials concerned with distributed AI.
===========================================================================
Topic: areas/discover/
Summary: Machine Discovery and Data-Mining
Description:
This directory contains materials concerned with Machine Discovery
and Data-Mining.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Data-Mining, Discovery, Machine Discovery,
Software Packages
Contains:
doc/ Documentation about Machine Discovery and Data-Mining
See Also: ?
===========================================================================
Topic: areas/discover/doc/
Summary: Documentation about Machine Discovery and Data-Mining
Description:
This directory contains bibliographies and surveys about Machine Discovery
and Data-Mining.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Data-Mining!Documents, Discovery!Documents, Machine Discovery!Documents
Contains:
bib/ Bibliography of machine discovery and data-mining references.
survey/ Survey of data-mining.
See Also: ?
===========================================================================
Package: areas/discover/doc/bib/
Name:
Summary: Bibliography of machine discovery and data-mining references.
Version:
Description:
This directory contains a bibliography of machine discovery and
data-mining references.
===========================================================================
Package: areas/discover/doc/survey/
Name:
Summary: Survey of data-mining.
Version:
Description:
This directory contains a survey of work on data-mining.
===========================================================================
Topic: areas/doc/
Summary: Documentation and other AI-related notes.
Description:
This directory contains AI-related notes and documentation,
including tutorials, bibliographies, and other materials of interest.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, AI!Documentation, Software Packages
Contains:
ai_tutor/ Artificial Intelligence Tutorial
aiexpert/ AI Expert: Source code from AI Expert Magazine
aigen/ AI Genealogy
bib/ Miscellaneous AI-related Bibliographies
ddj/ DDJ: AI Source code from Dr. Dobb's Journal
schedule/ Scheduling for Factory Processes
See Also: ?
===========================================================================
Package: areas/doc/ai_tutor/
Name:
Summary: Artificial Intelligence Tutorial
Version: 8-APR-91
Description:
This directory contains an AI Tutorial for PC users. It discusses
neural networks, expert systems, natural language, and artificial
intelligence. Includes sales info from Thinking Software, Inc.
===========================================================================
Package: areas/doc/aiexpert/
Name: AI Expert
Summary: Source code from AI Expert Magazine
Version: June 1986 through February 1991
Description:
This directory contains the collected source code from AI Expert
magazine from the premier issue in June of 1986 to the present.
See the file aix.ndx for an index to the contents of this directory.
Subscriptions to AI EXPERT are $42/year (12 issues), $6 extra in
Canada and Mexico, $15 extra (surface mail) or $40 (air mail) for
overseas. Write to Miller Freeman, Inc., 600 Harrison Street, San
Francisco, CA 94107 or call 1-800-274-2534 or 303-447-9330.
===========================================================================
Package: areas/doc/aigen/
Name:
Summary: AI Genealogy
Version:
Description:
This directory contains a genealogy of AI thesis-advising
relationships. Although intended to complement citation analysis
and free-text information retrieval as tools for understanding the AI
community and their connections to other disciplines, it should also
be useful to prospective graduate students. 2,600 MS and PhD theses
have been tabulated so far. If you'd like to contribute additional
listings, including year, title, abstract, school, advisor, committee
members, and subsequent employment, write to Rik Belew for the
questionnaire (see below for contact info).
===========================================================================
Package: areas/doc/bib/
Name:
Summary: Miscellaneous AI-related Bibliographies
Version:
Description:
This directory contains miscellaneous AI-related bibliographies.
Files that end in a ".bib" extension are in BibTeX format, ".bbl" or
".tex" in LaTeX format, ".ref" in Refer format, and ".txt" as
free-form ascii text files.
ai*.ref Leff's AI Bibliography
ai?.bib BibTeX bibliography of AI, 1950-1988 or so.
aids_ai.txt AIDS-related work in AI
aij.tgz Artificial Intelligence v30n2-v65n1
aimag.tgz AI Magazine v7n4-v14n3
aitr.ref AI Technical Reports
aix.tgz AI Expert v1n10-v8n6
articles.ref AI Articles and Technical Reports
backprop.bib Backpropagation
bebrnsci.tgz Behavioral and Brain Sciences v14n1-v16n2
brnchaos.txt Chaos in the Brain
cellaut.txt Annotated Bibliography of Cellular Automata
chalmers.tgz Chalmer's Philosophy of Mind and Cognition Bib
cognitn.tgz Cognition v23n3-v49n3
cogsci.tgz Cognitive Science v11n1-v17n4
compling.tgz Computational Linguistics v14n3-v19n4
compsurv.tgz ACM Computing Surveys v17n4-v24n4
cpls.txt Constraint Based Languages
cvgip_iu.tgz CVGIP: Image Understanding v53n3-v59n1
cybernet.txt Cybernetics
cyc.txt Non-annotated bibliography
cyc2.txt Non-annotated bibliography #2 (some overlap)
cyc_anno.txt Annotated bibliography on the Cyc project.
es_shlls.bib Expert System Shells
expert.txt York Expert Systems Bibliography (P. H. Roosen-Runge)
expsys.ref Expert Systems (Checking Rule-Based Systems)
frames.txt Publicly Available Frame Systems Bibliography
funlang.bib Functional Languages (Nikhil)
funlog.txt Functional Programming and Logic Programming (Andy
Cheese at the University of Nottingham, August 1986)
gatech.txt AI Bibliography for Qualifying Exams at Georgia Tech
ginsberg.bbl Matt Ginsberg's AI Bibliography; Lots of KR
hci.ref Human Computer Interaction
hci_umtr.txt HCI at UMD
humanfac.tgz Human Factors v28n4-v35n3
ieeeexp.tgz IEEE Expert v1n3-v8n5
itrkde.tgz IEEE Transactions of Knowledge and Data
Engineering v3n1-v5n6
itrnnet.tgz IEEE Transactions on Neural Networks v2n2
itrpami.tgz IEEE Transactions on Pattern Analysis and
Machine Intelligence v9n1-v14n4
itrrob.tgz IEEE Journal of Robotics and Automation v3n1-v7n4
itrsmc.tgz IEEE Transactions on Systems, Man, and
Cybernetics v16n4-v23n6
ijcv.tgz International Journal of Computer Vision v1n1-v6n1
ijmms.tgz International Journal of Man-Machine Studies
v34n1-v39n6
jautreas.tgz Journal of Automated Reasoning v2n4-v11n3
jep_gnrl.tgz Journal of Experimental Psychology: General
v115n4-v123n1
jep_lmc.tgz Journal of Experimental Psychology: Learning,
Memory, and Cognition v12n4-v20n2
jlogpro.tgz Journal of Logic Programming v5n1-v18n2
jrobosys.tgz Journal of Robotic Systems v8n1-v11n1
kolmogrv.txt Kolmogorov Complexity
langs.txt The Programming Languages List
lsc.tgz Lisp and Symbolic Computation v4n2
lopro8?.txt Logic Programming and Prolog
mlearn.tgz Machine Learning v1n1-v11n2-3
mtrans.tgz Machine Translation v5n4-v6n4
menu_nl.bib Menu-Based Natural Language
mit.txt Old copy of the MIT AI Lab bibliography
models.txt Mental Models
molbio.txt Molecular Biology and AI (NN, GA, GP).
musicocr.txt OCR of Music Notation
nc.tgz Neural Computation v1-v5
neu8801a.ref Neural Networks
nn_intro.txt Introductions to Neural Networks
nnet.ref NNets Bibliography from Zeidenberg's book
nnet.tgz Neural Networks v4n1-v4n6
nnet_c.txt Cariani's NNets Bibliography
oop.sh Shar file of OOP bibliography in Refer format.
pdp.txt Connectionism and Parallel Distributed
Processing (from Indiana)
percept.tgz Perception v16n1-v19n5
plan_abs.bbl Plan Abstraction
planning.bib Planning
psyrev.tgz Psychological Review v93n4-v101n1
prolog86.txt Prolog and Logic Programming
qualia.txt Qualia (Philosophy)
reflect.txt Reflection
reflect2.txt Reflective Languages
reports.txt Technical Reports (Outside US)
reports2.txt Technical Reports (Inside US)
rochestr.txt Univ. of Rochester Tech Reports
sched.bbl AI and Scheduling
scheme.txt Scheme (old)
search.txt Search and Constraint Satisfaction (Richard Shu)
speech.tgz Computer Speech and Language v5n1-v6n3
stanford.tex AI Bibliography for Qualifying Exams at Stanford
symbmath.ref Symbolic Mathematics (Mike Clarkson)
tampere.txt Technical Reports from Tampere
theses.txt AI Theses
time.bib Temporal Representation and Reasoning (Richard Shu)
uka.tgz Large Collection of BibTeX Bibliographies from
ftp.ira.uka.de:/pub/bibliography/
ut88_89.txt UTexas Technical Reports
virtual.txt Virtual Reality
vr.txt Virtual Reality
vr_fix.ref Corrected Virtual Reality Bibliography
vr_h.bib Hentschel's VR Bibliography
wisc_tr.txt Univ. of Wisconsin Technical Reports
Be sure to also look in the bib directory of each subarea for
additional bibliographies.
We plan on converting all of the files in this directory to BibTeX
format and generally cleaning up the bibliographies.
===========================================================================
Package: areas/doc/ddj/
Name: DDJ
Summary: AI Source code from Dr. Dobb's Journal
Version:
Description:
This directory contains AI-related source code from Dr. Dobb's Journal.
===========================================================================
Package: areas/doc/schedule/
Name:
Summary: Scheduling for Factory Processes
Version: 20-JAN-94
Description:
This directory contains a summary of scheduling for factory processes.
===========================================================================
Topic: areas/edu/
Summary: Educational Tools
Description:
This directory contains educational tools and materials for
teaching students about AI.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Educational Tools, Software Packages,
Teaching Materials, Tools
Contains:
pail/ PAIL: Portable AI Lab
sim/ SIM: Software Similarity Tester
See Also: ?
===========================================================================
Package: areas/edu/pail/
Name: PAIL
Summary: Portable AI Lab
Version: 2.4.3 (8-NOV-93); 2.4.2 (30-JUL-93); Mac (2-FEB-94)
Description:
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 AI courses (teaching or learning) 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).
PAIL is designed around a set of modules, each of which includes a
fully implemented and documented computational kernel together with a
representative set of autonomous demonstrations and running examples.
The modules also provide appropriate graphic visualizations for the
presentation of key algorithms and concepts. In addition, sufficient
documentation is provided to enable the user to retrieve key
literature references, understand the architecture and specifics of
the implementation, and modify the implementation if desired.
PAIL's current modules cover the following topics
- Automated Theorem Proving
- Natural Language Processing
- Rule-Based Inference
- Truth Maintenance Systems
- Constraint Satisfaction Problems
- Learning
- Knowledge Acquisition
- Genetic Algorithms
- Neural Networks
===========================================================================
Package: areas/edu/sim/
Name: SIM
Summary: Software Similarity Tester
Version: 2.7
Description:
SIM tests lexical similarity in C, Pascal, Modula-2, and Lisp
programs, and in natural language text. It is used
- to detect potentially duplicated code fragments in large software
projects, in program text but also in shell scripts and
documentation
- to detect plagiarism in software projects, educational and
otherwise.
===========================================================================
Topic: areas/expert/
Summary: Expert Systems and Production Systems
Description:
This directory contains software and materials about Expert Systems
and Production Systems.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Expert System Shells, Software Packages
Contains:
bench/ Expert Systems Benchmarks
faq/ Expert Systems FAQ: Frequently Asked Questions (FAQ) posting
for comp.ai.shells
systems/ Expert System Shells
See Also: ?
===========================================================================
Topic: areas/expert/bench/
Summary: Expert Systems Benchmarks
Description:
This directory contains expert systems benchmarks.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Expert System Shells!Benchmarks
Contains:
bench/ Expert Systems Benchmarks
expbench/ Expert System Benchmarking
See Also: ?
===========================================================================
Package: areas/expert/bench/bench/
Name:
Summary: Expert Systems Benchmarks
Version:
Description:
This directory rule benchmark programs and data generators. It
contains CLIPS versions of ARP (Aeronautical Route Planner), Waltz
(Diagram Labeling), and Weaver (VLSI routing for channels and
boxes). It also contains the OPS5 programs and data generators
described in Brant et. al. 1991, (e.g., Miss Manners, a program
that plans acceptable seating arrangements for a dinner party).
===========================================================================
Package: areas/expert/bench/expbench/
Name:
Summary: Expert System Benchmarking
Version: 28-DEC-87
Description:
This directory contains a programs and papers for benchmarking
expert systems. It includes a program for generating
backward-chaining benchmarks.
===========================================================================
Package: areas/expert/faq/
Name: Expert Systems FAQ
Summary: Frequently Asked Questions (FAQ) posting for comp.ai.shells
Version:
Description:
This directory contains the Expert System Shells FAQ posting
maintained by Mark Kantrowitz. It is posted to comp.ai.shells once a month.
===========================================================================
Topic: areas/expert/systems/
Summary: Expert System Shells
Description:
This directory contains a variety of Expert System Shells.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Expert System Shells
Contains:
babylon/ BABYLON: Development environment for expert systems.
clips/ CLIPS: C Language Integrated Production System
es/ ES: A Public Domain Expert System
esfm/ ESFM: Prolog Expert System for Forestry Management
esie/ ESIE and Logic-Line: Expert System Shell and AI
Retrieval/Correlation Tool.
expert/ Expert: An expert system written in ADA.
frulekit/ FRulekit: Frame-based RETE production system.
hugin/ HUGIN Expert System: Demo versions for Solaris, Sun4, and
Windows
les/ LES: Learning Expert System
mike/ MIKE: Free and portable expert system teaching system.
ops5/ OPS5: RETE-based expert system shell.
salvini/ PROTEST: Prolog Expert System Building Tool
See Also: ?
===========================================================================
Package: areas/expert/systems/babylon/
Name: BABYLON
Summary: Development environment for expert systems.
Version: 2.3 (22-JUN-94); 2.2 (24-APR-92)
Description:
BABYLON is a modular, configurable, hybrid environment for developing
expert systems. Its features include objects, rules with forward and
backward chaining, logic (Prolog) and constraints. BABYLON is
implemented and embedded in Common Lisp.
===========================================================================
Topic: areas/expert/systems/clips/
Name: CLIPS
Summary: C Language Integrated Production System
Description:
CLIPS 6.0 (C Language Integrated Production System) is an OPS-like
forward chaining production system written in ANSI C by NASA. The
CLIPS inference engine includes truth maintenance, dynamic rule
addition, and customizable conflict resolution strategies. CLIPS,
including the runtime version, is easily embeddable in other
applications. CLIPS includes an object-oriented language called COOL
(CLIPS Object-Oriented Language) which is directly integrated with the
inference engine.
Joseph Giarratano and Gary Riley's book, "Expert Systems Principles
and Practice", comes with an MS-DOS CLIPS 6.0 interpreter.
===========================================================================
Topic: areas/expert/systems/clips/contrib/
Summary: User-contributed CLIPS code.
Description:
This directory contains user-contributed CLIPS code.
Origin: hubble.jsc.nasa.gov:/pub/clips/
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
CLIPS, Expert System Shells
Contains:
clipsdll/ CLIPSDLL: Creates a CLIPS dynamic link library for MsWindows.
examples/ Examples of user-defined CLIPS functions
programs/ Example CLIPS programs
See Also: ?
===========================================================================
Package: areas/expert/systems/clips/contrib/clipsdll/
Name: CLIPSDLL
Summary: Creates a CLIPS dynamic link library for MsWindows.
Version: 22-FEB-93
Description:
CLIPSDLL contains a set of modified and added files to the standard
CLIPS distribution that can be used to create a CLIPS 5.1 Dynamic Link
Library for Microsoft Windows.
===========================================================================
Package: areas/expert/systems/clips/contrib/examples/
Name:
Summary: Examples of user-defined CLIPS functions
Version:
Description:
This directory contains examples of user-defined CLIPS functions.
===========================================================================
Package: areas/expert/systems/clips/contrib/programs/
Name:
Summary: Example CLIPS programs
Version:
Description:
This directory contains example CLIPS programs, including an
implementation of the Cannibals and Missionaries Problem.
===========================================================================
Topic: areas/expert/systems/clips/doc/
Summary: CLIPS documentation files.
Description:
This directory contains a variety of CLIPS documentation files and notes.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
CLIPS, Expert System Shells
Contains:
abstract/ CLIPS application abstracts booklet
bib/ Bibliography of CLIPS books, papers, and articles.
manuals/ CLIPS Manuals in Macintosh RTF and PostScript formats.
notes/ Various notes about CLIPS
See Also: ?
===========================================================================
Package: areas/expert/systems/clips/doc/abstract/
Name:
Summary: CLIPS application abstracts booklet
Version:
Description:
This directory contains a copy of the CLIPS application abstracts
booklet from the STB Help Desk.
===========================================================================
Package: areas/expert/systems/clips/doc/bib/
Name:
Summary: Bibliography of CLIPS books, papers, and articles.
Version: 26-MAY-94
Description:
This directory contains a bibliography of CLIPS books, papers, and
articles.
===========================================================================
Package: areas/expert/systems/clips/doc/manuals/
Name:
Summary: CLIPS Manuals in Macintosh RTF and PostScript formats.
Version: 5.1 (23-FEB-93); 6.0 (28-MAY-93)
Description:
This directory contains the CLIPS 5.1 and 6.0 Reference Manual and User
Guide in Macintosh RTF and PostScript formats. The PostScript
version was dumped in Word for Windows, so we've also included
a version that has been "fixed" with fixwfwps.
===========================================================================
Package: areas/expert/systems/clips/doc/notes/
Name:
Summary: Various notes about CLIPS
Version:
Description:
This directory contains a variety of notes about CLIPS, including
clips-and-c++ a document describing how CLIPS source files
can be compiled as C programs and integrated
with C++ files compiled using a C++ compiler
clips-and-windows a document describing three techniques for
using CLIPS with other Windows 3.1 applications
6.0-conversion suggestions for converting pre-6.0 programs
that use variables as the first field of a fact
pattern
===========================================================================
Package: areas/expert/systems/clips/dyna/
Name: DYNACLIPS
Summary: DYNAamic CLIPS Utilities
Version: 3.0 (22-APR-94); 2.0 (14-MAR-94)
Description:
DYNACLIPS (DYNAamic CLIPS Utilities), is a set of blackboard, dynamic
knowledge exchange, and agent tools for CLIPS 5.1 and 6.0. It is
implemented as a set of libraries that can be linked with CLIPS 5.1
and 6.0. Version 1.0 should be used with CLIPS 5.1 and version 2.0
should be used with CLIPS 6.0. Version 3.0 will work with both
CLIPS 5.1 and CLIPS 6.0. Source code is not available. Agents
use the blackboard to communicate with other intelligent agents in the
framework. Each intelligent agent can send and receive facts, rules,
and commands. Rules and facts are inserted and deleted dynamicly
while the agents are running. Knowledge can be transferred on a
temporary or permanent basis.
===========================================================================
Package: areas/expert/systems/clips/fzclips/
Name: FuzzyCLIPS
Summary: Fuzzy Logic Extensions for CLIPS
Version: 6.02 (31-MAY-94)
Description:
FuzzyCLIPS 6.02 is a version of the CLIPS rule-based expert system
shell with extensions for representing and manipulating fuzzy facts
and rules. In addition to the CLIPS functionality, FuzzyCLIPS can deal
with exact, fuzzy (or inexact), and combined reasoning, allowing fuzzy
and normal terms to be freely mixed in the rules and facts of an
expert system. The system uses two basic inexact concepts, fuzziness
and uncertainty.
Please read the terms for use in the FuzzyCLIPS documentation
before using.
FuzzyCLIPS was developed at the Institute for Information Technology
(Knowledge Systems Lab) of the National Research Council of Canada.
===========================================================================
Package: areas/expert/systems/clips/patches/
Name:
Summary: Bug fixes for version 6.0 of CLIPS.
Version:
Description:
This directory contains bug fixes for version 6.0 of CLIPS.
===========================================================================
Package: areas/expert/systems/clips/sybase/
Name:
Summary: Sybase interface for CLIPS
Version:
Description:
This directory contains DB Library functions that provide a Sybase
interface for CLIPS.
===========================================================================
Package: areas/expert/systems/clips/v4_3/
Name: CLIPS
Summary: C Language Integrated Production System
Version: 4.3 (13-JUN-89)
Description:
This directory contains CLIPS version 4.3 for DOS and Unix.
===========================================================================
Package: areas/expert/systems/clips/v4_3/dos/
Name: CLIPS
Summary: CLIPS 4.3 for DOS
Version: 4.3 (13-JUN-89)
Description:
This directory contains CLIPS version 4.3 for DOS.
===========================================================================
Package: areas/expert/systems/clips/v4_3/unix/
Name: CLIPS
Summary: CLIPS 4.3 for Unix.
Version: 4.3 (13-JUN-89)
Description:
This directory contains CLIPS version 4.3 source code for Unix.
===========================================================================
Package: areas/expert/systems/clips/v5_0/
Name: CLIPS
Summary: C Language Integrated Production System
Version: 5.0
Description:
This directory contains CLIPS version 5.0.
===========================================================================
Package: areas/expert/systems/clips/v5_0/mac/
Name: CLIPS
Summary: CLIPS 5.0 for Macintosh
Version: 5.0
Description:
This directory contains CLIPS version 5.0 executables for the
Macintosh in binhex format.
===========================================================================
Package: areas/expert/systems/clips/v5_1/
Name: CLIPS
Summary: C Language Integrated Production System
Version: 5.1
Description:
This directory contains CLIPS version 5.1.
===========================================================================
Package: areas/expert/systems/clips/v5_1/msdos/
Name: CLIPS
Summary: CLIPS 5.1 for IBM PCs.
Version: 5.1
Description:
This directory contains CLIPS version 5.1 for IBM PCs.
===========================================================================
Package: areas/expert/systems/clips/v5_1/unix/
Name: CLIPS
Summary: CLIPS 5.1 for Unix, including C source.
Version: 5.1
Description:
This directory contains CLIPS version 5.1 for Unix, including the
source code.
===========================================================================
Package: areas/expert/systems/clips/v6_0/
Name: CLIPS
Summary: C Language Integrated Production System
Version: 6.0
Description:
This directory contains CLIPS version 6.0.
===========================================================================
Package: areas/expert/systems/clips/v6_0/dos/
Name: CLIPS
Summary: CLIPS 6.0 for DOS.
Version: 6.0
Description:
This directory contains CLIPS version 6.0 for DOS/Windows.
===========================================================================
Package: areas/expert/systems/clips/v6_0/mac/
Name: CLIPS
Summary: CLIPS 6.0 for Macintosh.
Version: 6.0
Description:
This directory contains CLIPS version 6.0 for Macintosh.
===========================================================================
Package: areas/expert/systems/clips/v6_0/unix/
Name: CLIPS
Summary: CLIPS 6.0 for Unix.
Version: 6.0 (31-AUG-93)
Description:
This directory contains CLIPS version 6.0 for Unix.
===========================================================================
Package: areas/expert/systems/es/
Name: ES
Summary: A Public Domain Expert System
Version: 1.0 (October 1990)
Description:
ES is a public domain expert system. ES supports backward/forward
chaining, fuzzy set relations, and explanation. It includes a
standalone executable for IBM-PCs.
===========================================================================
Package: areas/expert/systems/esfm/
Name: ESFM
Summary: Prolog Expert System for Forestry Management
Version: 3-MAR-88
Description:
This directory contains a small expert system for forestry
management, written in Prolog. The rules are stored as Prolog
clauses, with inference occurring by Prolog executing the rules.
Inference is depth-first, backward-chaining, with no explanations
of why ESFM asked a question nor how it came to a conclusion.
===========================================================================
Package: areas/expert/systems/esie/
Name: ESIE and Logic-Line
Summary: Expert System Shell and AI Retrieval/Correlation Tool.
Version: ESIE 1.1 (6-DEC-86)
Description:
ESIE (Expert System Inference Engine) is an expert system shell for
personal computers.
Logic Line is an AI retrieval and correlation tool. It can be used to
find information in an ASCII file or database using keywords. One can
using it to create rules for ESIE.
===========================================================================
Package: areas/expert/systems/expert/
Name: Expert
Summary: An expert system written in ADA.
Version: 1.0 (3-DEC-85)
Description:
EXPERT is a backward chaining (goal driven) expert system. It is
based on two articles. The first (Duda and Gaschnig, September 1981
BYTE) published the expert system in BASIC skirting the use of
recursion, and the second (Darrell Morgeson, Jan/Feb 85 issue of
JOURNAL OF PASCAL, ADA, & MODULA-2) published in Modula-2 with
recursion implemented. The listing had one logic error which caused
pointer explosion on the last hypothesis in the GETRULE routine. This
implementation follows the MODULA-2 design completely and was not
designed from the ground up in Ada. Many improvements would be
possible if more time permitted my working on this.
===========================================================================
Package: areas/expert/systems/frulekit/
Name: FRulekit
Summary: Frame-based RETE production system.
Version: 25-AUG-93
Description:
FRulekit is a frame-based RETE production system written in Common
Lisp. It uses the Parmenides frame-based knowledge representation
system as the working memory elements (i.e., the rules match against
and modify Parmenides frames).
In addition to the standard OPS5 conflict resolution strategies, it
allows users to write their own conflict resolution strategies, and
incorporates an agenda system for controlling the order of rules.
===========================================================================
Package: areas/expert/systems/hugin/
Name: HUGIN Expert System
Summary: Demo versions for Solaris, Sun4, and Windows
Version: 19-JAN-94
Description:
HUGIN Explorer is a graphical expert system shell, for construction
and execution of model based expert systems in domains characterized
by inherent uncertainty.
This directory contains demo versions of the HUGIN Expert System
on the Sparc for SunOS 4.x and Solaris and on the PC under Windows 3.1.
Some company literature is also included.
===========================================================================
Package: areas/expert/systems/les/
Name: LES
Summary: Learning Expert System
Version:
Description:
LES is an expert system, plus learning and a knowledge
representation for the Macintosh.
===========================================================================
Package: areas/expert/systems/mike/
Name: MIKE
Summary: Free and portable expert system teaching system.
Version: 2.03 (1-APR-91), 2.50
Description:
MIKE (Micro Interpreter for Knowledge Engineering) is a full-featured,
free, and portable software environment designed for teaching purposes
at the UK's Open University. It includes forward and backward
chaining rules with user-definable conflict resolution strategies, and
a frame representation language with inheritance and 'demons' (code
triggered by frame access or change), plus user-settable inheritance
strategies. Automatic 'how' explanations (proof histories) are
provided for rule execution, as are user-specified 'why' explanations.
Coarse-grained and fine-grained rule tracing facilities are provided,
along with a novel 'rule graph' display which concisely shows the
history of rule execution. MIKE, which forms the kernel of an Open
University course on Knowledge Engineering, is written in a
conservative and portable subset of Edinburgh-syntax Prolog, and is
distributed as non-copy-protected source code.
MIKE version 1 was described in the October/November 1990 issue of
BYTE. MIKE v1.50, which was formerly available from a range of ftp
servers, has been superseded by two newer versions: MIKEv2.03, a full
Prolog source code version, incorporating a RETE algorithm for fast
forward chaining, a truth maintenance system, uncertainty handling,
and hypothetical worlds, and MIKEv2.50, a turnkey DOS version with
menu-driven interface and frame- and rule-browsing tools, fully
compatible with MIKEv2.03, but without source code.
===========================================================================
Package: areas/expert/systems/ops5/
Name: OPS5
Summary: RETE-based expert system shell.
Version:
Description:
This directory contains the original public domain implementation
of an OPS5 interpreter written by Charles L. Forgy and ported to
Common Lisp by George Wood and Jim Kowalski. Also included is an
updated version with several bug fixes and ports by Mark Kantrowitz.
Charles Forgy, the inventor of Rete and OPS5, has a company that sells RAL
(Rule-extended Algorithmic Language), a high-performance C-based
expert systems tool. RAL uses a more efficient match algorithm called
Rete II and was designed to permit seamless integration of rules and
objects into C programs. RAL is a superset of C. RAL rules can
operate directly on the data types used by the C code in your
application. RAL "understands" C type declarations, function
prototypes, #define constants, and so on. C expressions, statements,
macros, function calls, and so on can be embedded directly in the
rules. RAL has an open architecture that permits it to be used with
any GUI builder, data base library, or other library that can be used
with C. No bridges are required. For efficiency, RAL rules are
compiled into C code. A special version of the language, called
RAL/RT, adds the features that are required for real-time expert
systems. RAL and RAL/RT have a multi-windowed, point-and-click
development environment called the RAL Workbench. RAL and RAL/RT are
available for DOS, MS Windows, OS/2, and UNIX. License fees for
development systems are available on request. There are no run-time
fees charged for distributing applications developed using RAL. For
information about RAL, write Production Systems Technologies, Inc.,
5001 Baum Blvd., Pittsburgh, PA 15213, call 412-683-4000, or
fax 412-683-6347.
===========================================================================
Package: areas/expert/systems/ops5/ops5_fj/
Name: OPS5 From Japan
Summary: OPS5 for MS-DOS in Pascal and for KCL.
Version:
Description:
This directory contains two implementations of OPS5 from the FJ
("From Japan") sources repository in Japan. One is an
implementation in TURBO Pascal for MS-DOS. The other is a port to KCL
of Forgy's original OPS5.
NOTE: These files may contain Japanese characters.
===========================================================================
Package: areas/expert/systems/salvini/
Name: PROTEST
Summary: Prolog Expert System Building Tool
Version: 1-FEB-89
Description:
This is a cut-down version of the expert system building tool produced
by Steven Salvini as part of his M.Sc. dissertation in 1986.
PROTEST is a tool for building prototype expert systems. It accepts a
knowledge base written in IF-THEN rules whose conditions and conclusions
consist of object/attribute/value triples:
rule1:
if
pain/duration/constant
and
pain/localisation/accurate
and
pain/'initiated by'/'gentle touch'
and
pain/character/'sudden onset'
and
pain/character/'intense & throbbing'
and
gingivae/swelling/present
and
gingivae/erythema/present
and
miscellaneous/'local lymphadenopathy'/present
and
pain/'initiated by'/'clenching, biting or chewing'
and
tooth/mobility/present
then
diagnosis/group/abscess
with
certainty(0.9).
Conclusions may contain certainty factors.
Inference can be either backward chaining or mixed. The former is
normal backward chaining, giving a single firm conclusion if one has
been deduced or else as a list of possible conclusions in order of
their certainties.
Mixed mode is a "mixed" inference strategy which first prompts you to
enter your initial findings and then tries to deduce one or more of
the goals. If a firm conclusion is not reached, it then tries to solve
the problem by backward-chaining.
After PROTEST has given a conclusion, you can ask to see its chain of
reasoning.
A sample knowledge base, for dental diagnosis, is included.
===========================================================================
Package: areas/faq/
Name: AI FAQs
Summary: Frequently Asked Questions (FAQ) postings for comp.ai
Version:
Description:
A compendium of answers to frequently asked questions about Artificial
Intelligence and related topics. Posted monthly to the comp.ai newsgroup.
===========================================================================
Topic: areas/fuzzy/
Summary: Fuzzy Logic
Description:
This directory contains software and materials concerning fuzzy logic
and related topics.
Thanks to Erik Horstkotte for assistance in assembling this collection.
The ntia fuzzy logic repository is maintained by Tim Butler
, the Ostfold repository by Asgeir Osterhus
, the Togai InfraLogic mail server by Erik, and
the Aptronix mail server by Scott Irwin
Origin: FTP repositories for fuzzy logic include
ntia.its.bldrdoc.gov:/pub/fuzzy/ [132.163.64.201]
ftp.dhhalden.no:/pub/Fuzzy/
fuzzy-server@til.com
fuzzynet@aptronix.com
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Fuzzy Logic, Software Packages
Contains:
com/ Commercial Fuzzy Logic Products and Companies
doc/ Documentation and Bibliographies about Fuzzy Logic
faq/ Fuzzy Logic FAQ: Frequently Asked Questions (FAQ) posting for
comp.ai.fuzzy
mail/ Information about Fuzzy Logic mail servers.
systems/ Fuzzy Logic Packages
See Also: ?
===========================================================================
Topic: areas/fuzzy/com/
Summary: Commercial Fuzzy Logic Products and Companies
Description:
This directory contains literature and other materials concerning
fuzzy logic from companies with fuzzy logic products.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Fuzzy Logic
Contains:
aptronix/ Information from Aptronix
fril/ Information from FRIL, a Fuzzy Logic version of Prolog
iis/ Information from IIS
togai/ Information from Togai InfraLogic
See Also: ?
===========================================================================
Package: areas/fuzzy/com/aptronix/
Name:
Summary: Information from Aptronix
Version:
Description:
This directory contains literature from Aptronix, including a text
version of their FIDE brochure, a comparison of PID Control to Fuzzy
Logic Based Control, and some benchmarks for Fuzzy Logic for
microcontrollers.
===========================================================================
Package: areas/fuzzy/com/fril/
Name:
Summary: Information from FRIL, a Fuzzy Logic version of Prolog
Version:
Description:
This directory contains a description of FRIL, a commercial Prolog
with support for Fuzzy Logic.
===========================================================================
Package: areas/fuzzy/com/iis/
Name:
Summary: Information from IIS
Version:
Description:
This directory contains information about courses on Fuzzy Logic
from IIS. Although the date has passed, they run similar courses
periodicly.
===========================================================================
Package: areas/fuzzy/com/togai/
Name:
Summary: Information from Togai InfraLogic
Version:
Description:
This directory contains literature from Togai InfraLogic, including
copies of the company newsletter, products listing, a slide show
about TILShell 3.0 (requires IBM PC), and other information.
===========================================================================
Topic: areas/fuzzy/doc/
Summary: Documentation and Bibliographies about Fuzzy Logic
Description:
This directory contains documentation and bibliographies about fuzzy logic.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Fuzzy Logic!Bibliographies, Fuzzy Logic!Documentation
Contains:
bib/ Fuzzy Logic Bibliographies
elkan/ Information about and responses to the Elkan controversy.
intro/ Introductions and Tutorials for Fuzzy Logic.
notes/ Notes related to Fuzzy Logic.
whos_who/ Who's Who in Fuzzy Logic
See Also: ?
===========================================================================
Package: areas/fuzzy/doc/bib/
Name:
Summary: Fuzzy Logic Bibliographies
Version:
Description:
This directory contains fuzzy logic bibliographies.
===========================================================================
Package: areas/fuzzy/doc/elkan/
Name:
Summary: Information about and responses to the Elkan controversy.
Version:
Description:
This directory contains a revised version of Elkan's AAAI-93 paper,
"The Paradoxical Success of Fuzzy Logic", and two responses to the
paper from members of the fuzzy logic community. One response is by
Enrique Ruspini and the other by Didier Dubois and Henri Prade.
The following summary of the controversy comes from the Fuzzy Logic FAQ.
The presentation of Elkan's AAAI-93 paper
Charles Elkan, "The Paradoxical Success of Fuzzy Logic", in
Proceedings of the Eleventh National Conference on Artificial
Intelligence, 698-703, 1993.
has generated much controversy. The fuzzy logic community claims that
the paper is based on some common misunderstandings about fuzzy logic,
but Elkan still maintains the correctness of his proof. (See, for
instance, AI Magazine 15(1):6-8, Spring 1994.)
Elkan proves that for a particular set of axiomatizations of fuzzy
logic, fuzzy logic collapses to two-valued logic. The proof is correct
in the sense that the conclusion follows from the premises. The
disagreement concerns the relevance of the premises to fuzzy logic.
At issue are the logical equivalence axioms. Elkan has shown that if
you include any of several plausible equivalences, such as
not(A and not B) == (not A and not B) or B
with the min, max, and 1- axioms of fuzzy logic, then fuzzy logic
reduces to binary logic. The fuzzy logic community states that these
logical equivalence axioms are not required in fuzzy logic, and that
Elkan's proof requires the excluded middle law, a law that is commonly
rejected in fuzzy logic. Fuzzy logic researchers must simply take care
to avoid using any of these equivalences in their work.
It is difficult to do justice to the issues in so short a summary. Do
not assume that this summary is the last word on this topic, but
instead read Elkan's paper and some of the other correspondence on
this topic (some of which has appeared in the comp.ai.fuzzy
newsgroup).
A final version of Elkan's paper, together with responses from members
of the fuzzy logic community, will appear in an issue of IEEE Expert
sometime in 1994. A paper by Dubois and Prade will be presented at
AAAI-94.
===========================================================================
Package: areas/fuzzy/doc/intro/
Name:
Summary: Introductions and Tutorials for Fuzzy Logic.
Version:
Description:
This directory contains introductions to fuzzy logic and some tutorials.
===========================================================================
Topic: areas/fuzzy/doc/notes/
Summary: Notes related to Fuzzy Logic.
Description:
This directory contains notes related to fuzzy logic.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Fuzzy Logic!Notes
Contains:
appnotes/ Application Notes from Aptronix.
assocs/ Fuzzy Logic Associations
bench/ Fuzzy Logic Benchmark Foils
brub/ Brubaker's Huntington Technical Brief
fledkit/ How to get Motorola's Fuzzy Logic Education Kit
See Also: ?
===========================================================================
Package: areas/fuzzy/doc/notes/appnotes/
Name:
Summary: Application Notes from Aptronix.
Version:
Description:
This directory contains application notes from Aptronix, including:
How fuzzy logic is used in a washing machine.
How fuzzy logic is used to automatically focus a camera's image.
Servo-motor controller description.
Temperature controller in a glass melting furnace.
How fuzzy logic is used to control an air conditioner.
Temperature controller for an industrial reactor.
Automobile transmission controller.
Details of the two-stage inverted pendulum system built by Aptronix.
Review article: "Fuzzy Logic: From Concept To Implementation"
===========================================================================
Package: areas/fuzzy/doc/notes/assocs/
Name:
Summary: Fuzzy Logic Associations
Version:
Description:
This directory contains descriptions of the various Fuzzy Logic
associations:
flat.txt Spanish Fuzzy Logic Association
cansfins.txt Canadian Fuzzy Logic/NNets Association
===========================================================================
Package: areas/fuzzy/doc/notes/bench/
Name:
Summary: Fuzzy Logic Benchmark Foils
Version:
Description:
This directory contains a PostScript file of the Fuzzy Logic benchmark
foils presented at Computer Design's Fuzzy Logic '93 Conference in
July 1993. Discusses parameters and factors to consider when
comparing benchmarks from different vendors and sources.
===========================================================================
Package: areas/fuzzy/doc/notes/brub/
Name:
Summary: Brubaker's Huntington Technical Brief
Version:
Description:
This directory contains David Brubaker's Huntington Technical Briefs
on Fuzzy Logic, including:
brub1.txt A Fuzzy Web Tension Controller - January 15, 1992
brub2.txt Dynamic Extent of Fuzzy Variables - February 15, 1992
brub3.txt Hedges - June 15, 1992
brub4.txt Fuzzy Evidence in Character Recognition - July 15, 1992
brub5.txt Fuzzy Environmental Control - October 92
brub6.txt Fuzzy References (books) - November 92
brub7.txt Pseudo-Fuzzy, Table-Driven Kernel - December 92
brub8.txt Fuzzy System Design Rules of Thumb - January 93
brub9.txt A FUZZY STATE MACHINE MODEL - March 1993
===========================================================================
Package: areas/fuzzy/doc/notes/fledkit/
Name:
Summary: How to get Motorola's Fuzzy Logic Education Kit
Version:
Description:
This directory contains information for universities on how to
obtain Motorola's Fuzzy Logic Education Kit.
===========================================================================
Package: areas/fuzzy/doc/whos_who/
Name:
Summary: Who's Who in Fuzzy Logic
Version: 940613
Description:
This directory contains Robert Fuller's list of Who's Who in Fuzzy Logic.
===========================================================================
Package: areas/fuzzy/faq/
Name: Fuzzy Logic FAQ
Summary: Frequently Asked Questions (FAQ) posting for comp.ai.fuzzy
Version:
Description:
A compendium of answers to frequently asked questions about Fuzzy
Logic, Fuzzy Expert Systems, and related topics. Posted monthly to
the comp.ai.fuzzy newsgroup.
===========================================================================
Package: areas/fuzzy/mail/
Name:
Summary: Information about Fuzzy Logic mail servers.
Version:
Description:
This directory contains information about the Aptronix and Togai
InfraLogic Fuzzy Logic mail servers.
The Togai InfraLogic mail server is maintained by Erik Horstkotte, and
the Aptronix mail server by Scott Irwin
===========================================================================
Topic: areas/fuzzy/systems/
Summary: Fuzzy Logic Packages
Description:
This directory contains fuzzy logic software packages and demo systems.
Origin: FTP repositories for fuzzy logic include
ntia.its.bldrdoc.gov:/pub/fuzzy/ [132.163.64.201]
ftp.dhhalden.no:/pub/Fuzzy/
fuzzy-server@til.com
fuzzynet@aptronix.com
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Fuzzy Logic
Contains:
anfis/ ANFIS: Adaptive-Network-based Fuzzy Inference System
artmap/ Fuzzy ARTMAP
class/ Liliane Peters' Fuzzy Class
cncl/ CNCL: C++ Classes for Fuzzy Logic
demoshel/ DemoShell: Demo version of TILShell+
fcmdemo3/ FCM Demo: Demo version of Fuzzy Control Manager
fide/ FIDE Demo: Fuzzy Inference Development Environment
fismat/ FISMAT: Fuzzy Inference Systems toolbox for MATLAB
flie/ FLIE, C-FLIE and FUN: Fuzzy Logic Inference Engine
flipc/ FLIPC Demo: Fuzzy Logic Inverted Pendulum Control Simulation
funegen/ FuNeGen: Fuzzy neural system
fuzzdemo/ FuzzDemo: MATLAB demo of parameterizing membership functions
and learning in fuzzy inference systems.
fuzzyfan/ Fuzzy Fan Controller
fuzzytec/ fuzzyTECH: Demo of a Fuzzy Shell
gaf/ GAF: Adaptive fuzzy logic using Genetic Algorithms
ifr/ IFR_Fuzzy: Fuzzy control toolbox for MATLAB.
infer3/ INFER: General Purpose Fuzzy Inference Library
nefcon/ NEFCON: InterViews-based graphical simulation environment for
Neural Fuzzy Controllers
orr/ Doug Orr's Fuzzy C++ Classes
pendemo/ Simulation of a Fuzzy Inverted Pendulum Controller
rice/ RICE: Fuzzy/MV-logic C/C++ inference engine
til2msg/ TIL2MSG: Converts Fuzzy-C Compiler or TILGen messages
tracker/ Target tracking by a fuzzy expert system
xfuzzy/ XFUZZY: A Simulation Environment for Fuzzy Logic Control
Systems
See Also: ?
===========================================================================
Package: areas/fuzzy/systems/anfis/
Name: ANFIS
Summary: Adaptive-Network-based Fuzzy Inference System
Version: 10-SEP-93
Description:
This directory contains C code and simulation examples for the
ANFIS (Adaptive-Network-based Fuzzy Inference System) architecture
proposed in [1,2].
===========================================================================
Package: areas/fuzzy/systems/artmap/
Name:
Summary: Fuzzy ARTMAP
Version:
Description:
This directory contains source code for Carpenter and Grossberg's
Fuzzy ARTMAP.
===========================================================================
Package: areas/fuzzy/systems/class/
Name:
Summary: Liliane Peters' Fuzzy Class
Version: 2.1 (9-JUN-93)
Description:
This directory contains an example for controlling problems solved
with modules from Liliane Peters' IEEE-FUZZ93 paper.
===========================================================================
Package: areas/fuzzy/systems/cncl/
Name: CNCL
Summary: C++ Classes for Fuzzy Logic
Version: 0.19 (8-FEB-94)
Description:
This directory contains CNCL (Communication Networks Class Library), a
C++ library for fuzzy logic, event driven simulation, statistical
evaluation, and random number generators. It includes interface
classes for DEC's ezd graphics server.
===========================================================================
Package: areas/fuzzy/systems/demoshel/
Name: DemoShell
Summary: Demo version of TILShell+
Version: 2.0.0
Description:
This directory contains a demonstration version of TILShell+ for
the PC. TILShell is a Fuzzy Logic Expert System Shell from Togai
InfraLogic. The demonstration version is complete except it will
not save or compile files.
===========================================================================
Package: areas/fuzzy/systems/fcmdemo3/
Name: FCM Demo
Summary: Demo version of Fuzzy Control Manager
Version: 11-30-92
Description:
This directory contains the demo version of the "Fuzzy Control
Manager". It's a fuzzy shell which runs under MS-Windows.
===========================================================================
Package: areas/fuzzy/systems/fide/
Name: FIDE Demo
Summary: Fuzzy Inference Development Environment
Version: 2.0 Demo (27-JAN-94)
Description:
Fide is a PC based fuzzy logic design tool that runs under Windows.
Fide provides tools for the development, debugging and simulation
of fuzzy applications.
This software package contains a demonstration version of Fide Version
2.0. It is operational only with the included examples, with the
following restrictions: You cannot save files, use the Fide Compiler,
use the Real Time Code (RTC) generator, or use the Make functions of
the Composer application. Sample RTC output file for the supported
Motorola micro-controller chips have been included.
The fully functional version of FIDE may be purchased from Aptronix
(see Contact below) and includes a graphical membership function
editor, a rule matrix editor, a "Tracer" tool to trace inference unit
output back to the contributing rules, a tool for the graphical
depiction of the inference unit transfer function, and a signal
generator for driving the inference unit. It can also generate ANSI C,
Matlab script, and Assembly code for the MC6805, MC6808, MC68HC05,
MC68HC11, MC68HC16, and MC68HC33x Motorola micro controller chips.
Fide also has a Composer tool where the inference unit may be
integrated into a block diagram of the complete system for further
debugging and development.
See the INFO file for more information and installation instructions.
===========================================================================
Package: areas/fuzzy/systems/fismat/
Name: FISMAT
Summary: Fuzzy Inference Systems toolbox for MATLAB
Version: 25-OCT-93
Description:
This directory contains Fuzzy Inference Systems toolbox for MATLAB
(FISMAT). FISMAT accommodates different arithmetic operators,
fuzzification and defuzzification algorithm, implication relations,
and different method of approximate reasoning such as Compositional
Rule of Inference (CRI) and Approximate Analogical Reasoning Scheme
based on Similarity Measure.
To have a quick review of FIS and become familiar with developed
functions, a demonstration file "fisdemo.m" is provided. Therefore
after retrieving the files it is recommended to go through different
part of demo. The demonstration includes fuzzy controller demo which
investigate three well-known examples in control systems. These are
truck backer-upper control, inverted pendulum system (cart-pole), and
temperature and humidity control of a bathroom.
To become familiar with terminology used for FIS and also the list of
references for each function, see the provided postscript file
"fismat.ps".
===========================================================================
Package: areas/fuzzy/systems/flie/
Name: FLIE, C-FLIE and FUN
Summary: Fuzzy Logic Inference Engine
Version: 21-AUG-93
Description:
FLIE (Fuzzy Logic Inference Engine) has been developed at and used by
the Institute of Robotics (IfR), Swiss Federal Institute of Technology
Zurich (ETH). It is written entirely in MacMETH a dialect of Modula-2
for Macintosh computers also developed at the ETH. MacMETH is
distributed free of charge by anonymous ftp from neptune.ethz.ch
directory macmeth. All source code is included.
CFLIE is a C version of FLIE written by Ahmet Sekercioglu, Swinburne
University of Technology, Australia.
FUN (Fuzzy Using Neural networks) implements some learning strategies
for fuzzy rule based systems. Currently the source code is not ready
for distribution; interested parties should contact one of the listed
contacts at the ETH.
===========================================================================
Package: areas/fuzzy/systems/flipc/
Name: FLIPC Demo
Summary: Fuzzy Logic Inverted Pendulum Control Simulation
Version: 30-MAR-94
Description:
FLIPC (Fuzzy Logic Inverted Pendulum Control) is a simulation of the
behavior of an inverted pendulum standing over a moving cart.
===========================================================================
Package: areas/fuzzy/systems/funegen/
Name: FuNeGen
Summary: Fuzzy neural system
Version: 1.0 (5-JUL-94)
Description:
FuNeGen is a fuzzy neural system capable of generating fuzzy
classification systems (as C-code) from sample data. This directory
contains a demonstration version of FuNeGen.
===========================================================================
Package: areas/fuzzy/systems/fuzzdemo/
Name: FuzzDemo
Summary: MATLAB demo of parameterizing membership functions and
learning in fuzzy inference systems.
Version: 1-SEP-93
Description:
This directory contains MATLAB *.m files (V4.0) for demonstrating
several ways of parameterizing membership functions (MF) and
learning in fuzzy inference systems (FIS). Specifically, it includes
(a) manual tuning of MF's
(b) animation of MF's to show the effects of different parameters
(c) animation of MF's and the overall input/output behavior of FIS.
(d) learning (parameter identification) in FIS using
1. Simplex method
2. Simplex method + least-squares method
This is a prototype suitable for educational purposes.
===========================================================================
Package: areas/fuzzy/systems/fuzzyfan/
Name:
Summary: Fuzzy Fan Controller
Version: 8-OCT-93
Description:
This directory contains an example fuzzy logic fan controller. This
controller is designed to control the temperature and humidity of a
bathroom, where the ideal condition is 'warm and dry'.
===========================================================================
Package: areas/fuzzy/systems/fuzzytec/
Name: fuzzyTECH
Summary: Demo of a Fuzzy Shell
Version: 26-SEP-91
Description:
This directory contains a demonstration version of a fuzzy shell
(Schlssel zur Fuzzy-Technologie) developed in Germany by Zimmermann
and von Altrock's company. It runs under plain DOS with its own
graphical interface. The (short) manual and the bibliography are both
in German, but the program itself uses English.
===========================================================================
Package: areas/fuzzy/systems/gaf/
Name: GAF
Summary: Adaptive fuzzy logic using Genetic Algorithms
Version: 1.10b (26-JAN-94)
Description:
Genetic-Adapt FuzzyWare (GAF) provides off-line simulation,
adaptation, and eventually on-line adaptive control. GAF builds run
time data directly from fuzzy IF-THEN rule segments contained in
English like text files.
GAF allows users to generate a fuzzy control system by simply defining
the inputs, outputs, data set, and initial rule sets. GAF uses genetic
algorithm to derive proper rules and fuzzy sets from the initial rules.
By changing, adding, deleting rules and fuzzy membership sets, the genetic
algorithm automatically adapts and optimizes the fuzzy control system.
===========================================================================
Package: areas/fuzzy/systems/ifr/
Name: IFR_Fuzzy
Summary: Fuzzy control toolbox for MATLAB.
Version: 7-MAR-94
Description:
This directory contains IFR_fuzzy, an easy to use fuzzy-control
toolbox for MATLAB. Fuzzy variables and rules can be entered and
edited with M-files, or through GUI-tools (Matlab Version 4.x).
Several arithmetic operators on fuzzy sets, fuzzification and
defuzzification algorithms are provided.
Computationally extensive algorithms are implemented as Cmex functions.
===========================================================================
Package: areas/fuzzy/systems/infer3/
Name: INFER
Summary: General Purpose Fuzzy Inference Library
Version: 3.0
Description:
This directory contains a "General Purpose Fuzzy Reasoning Library"
developed at the University of Tokyo. The program is in C, with
English comments, but the documentation is in Japanese. This is a
set of English-language documentation for that library written by
John Nagle.
===========================================================================
Package: areas/fuzzy/systems/nefcon/
Name: NEFCON
Summary: InterViews-based graphical simulation environment for
Neural Fuzzy Controllers
Version: 1.0 (16-JUN-94)
Description:
NEFCON-I (NEural Fuzzy CONtroller) is an X11 simulation environment
based on Interviews designed to build and test neural fuzzy
controllers. NEFCON-I is able to learn fuzzy sets and fuzzy rules by
using a kind of reinforcement learning that is driven by a fuzzy error
measure. To do this NEFCON-I communicates with another process, that
implements a simulation of a dynamical process. NEFCON-I can optimize
the fuzzy sets of the antecedents and the conclusions of a given rule
base, and it can also create a rulebase from scratch.
===========================================================================
Package: areas/fuzzy/systems/orr/
Name:
Summary: Doug Orr's Fuzzy C++ Classes
Version: 8-SEP-93
Description:
This directory contains a copy of the Fuzzy C++ classes under
development by Doug Orr. They are used in defining fuzzy
variables. Common manipulations of fuzzy variables are performed by
the "degree" and "membership" classes. Arbitrary nonlinear membership
functions, as well as membership functions based on triangular piewise
membership are supported. The classes attempt to follow the FAM-style
structures found in Bart Kosko's Neural Networks and Fuzzy Systems book.
Early work on 3D fam surfaces is shown. It compiles but hasn't been tested.
===========================================================================
Package: areas/fuzzy/systems/pendemo/
Name:
Summary: Simulation of a Fuzzy Inverted Pendulum Controller
Version: 15-OCT-92
Description:
This directory contains DOS executable and source code for a
simulation of an inverted pendulum with a variable weight and variable
motor strength. The pendulum is controlled by a fuzzy logic knowledge
base. This is *not* the classical inverted pendulum which uses the
sliding "cart"; instead, this system just has a motor connected to the
pendulum. It's only intended as a simple example of a fuzzy control
system. It's not trying to prove anything.
The fuzzy logic knowledge base was developed with the Togai InfraLogic
Fuzzy-C Development System. All source code is supplied.
===========================================================================
Package: areas/fuzzy/systems/rice/
Name: RICE
Summary: Fuzzy/MV-logic C/C++ inference engine
Version: 4.02a (21-OCT-93)
Description:
This directory contains RICE (Routines for implementing C Expert
systems), a fuzzy logic inference engine written in C/C++.
The software can be compiled with ANSI C compilers. A C++ front
with classes is provided and several examples are available.
===========================================================================
Package: areas/fuzzy/systems/til2msg/
Name: TIL2MSG
Summary: Converts Fuzzy-C Compiler or TILGen messages
Version: 12-JUN-93
Description:
This directory contains til2msg.exe, a filter program that converts
the messages from the Fuzzy-C Compiler (FCC) or TILGen into a format
that is displayable in Borland's C++ IDE.
===========================================================================
Package: areas/fuzzy/systems/tracker/
Name:
Summary: Target tracking by a fuzzy expert system
Version: 26-OCT-92
Description:
This directory contains a simulation of target tracking by a fuzzy
expert system. The fuzzy system is compared in real time with the
results obtained from a Kalman-filter controller from which it was
automatically generated using Dr. Bart Kosko's DCL technique.
===========================================================================
Package: areas/fuzzy/systems/xfuzzy/
Name: XFUZZY
Summary: A Simulation Environment for Fuzzy Logic Control Systems
Version: 1.1 (23-MAR-94)
Description:
xfuzzy is an X-Windows based simulation tool for fuzzy controllers
that runs on Sun workstations.
The kernel of xfuzzy consists of the software implementation of a
fuzzy inference engine. The modules defining the behavior of the
controller (Fuzzifier, Rules Set, and Defuzzifier) and the system
being controlled (model) interact with this inference engine. The
environment is completed with a user interface which, through a group
of menus, eases the tasks of editing the membership functions, rules,
and the system model, as well as the graphic presentation of the
simulation results.
The closing of the feedback loop of the complete system (controller +
system under control) is accomplished by means of a program in C,
provided by the user according to the directions contained in a
template file supplied by the environment. This module is dynamically
linked to the inference engine, allowing the user to perform the whole
tuning of the controller without exiting the environment.
===========================================================================
Topic: areas/games/
Summary: Game Playing
Description:
This directory contains game playing software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Game Playing, Software Packages
Contains:
chess/ Chess
doc/ Documentation about Game Playing, including Bibliographies
metagame/ METAGAME: Game-playing workbench
x_word/ Crossword
See Also: ?
===========================================================================
Topic: areas/games/chess/
Summary: Chess
Description:
This directory contains chess software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Chess, Game Playing!Chess
Contains:
font/ Chess Font for TeX
gnuchess/ GNU Chess
san/ SAN Kit: Implemented Standards for Chess Move Notation
shamko/ Shamkovich Benchmark of a typical chess article
test/ 6000 position chess test suite
See Also: ?
===========================================================================
Package: areas/games/chess/font/
Name:
Summary: Chess Font for TeX
Version: 1.1 (30-NOV-90, 21-SEP-91)
Description:
This directory contains the ever-popular LaTeX/TeX chess font.
===========================================================================
Package: areas/games/chess/gnuchess/
Name:
Summary: GNU Chess
Version: 4.0pl70
Description:
This directory contains the GNU Chess program.
===========================================================================
Package: areas/games/chess/san/
Name: SAN Kit
Summary: Implemented Standards for Chess Move Notation
Version: 17-MAY-94
Description:
The SAN Kit is a freeware ANSI C source programming toolkit for chess
software authors and researchers. It consists of some twelve thousand
lines of portable code that includes everything needed to write a
chess-playing program except a search function and an evaluation
function. A set of public, portable standards for move notation
(SAN), position notation (FEN), and game notation are described and
implemented.
Example applications include chess-playing programs, chess opening book
repository software, chess game database software, and automated
distributed computer chess competition.
===========================================================================
Package: areas/games/chess/shamko/
Name:
Summary: Shamkovich Benchmark of a typical chess article
Version:
Description:
The Shamkovich Benchmark is an ASCII version of a typical chess
article. It is intended as a sample test for those interested in the
construction of NL (natural language) parsers with the goal of the
automated extraction of chess data.
===========================================================================
Package: areas/games/chess/test/
Name:
Summary: 6000 position chess test suite
Version:
Description:
This directory contains a 6000 chess position test suite.
===========================================================================
Package: areas/games/doc/
Name:
Summary: Documentation about Game Playing, including Bibliographies
Version:
Description:
This directory contains information about game playing, such as
bibliographies.
bridge.txt A short bibliography about computer bridge.
shuffle.txt How to shuffle a deck of cards (algorithmicly)
strategy.txt Computational strategy for game playing
8puzzle.txt Solving the N x N puzzle.
8queen.txt Heuristic for solving the 8 queens puzzle
games.bib Work on AI and Game Playing
===========================================================================
Package: areas/games/metagame/
Name: METAGAME
Summary: Game-playing workbench
Version: 3a
Description:
METAGAME is a game-playing workbench for developing and playing
metagame programs. It includes a generator for symmetric chess-like
games; definitions of chess, checkers, chinese chess, shogi, lose
chess, lose checkers, french checkers, and tic tac toe translated into
symmetric chess-like games; a legal move generator; and a variety of
player programs, from simple through sophisticated.
===========================================================================
Package: areas/games/x_word/
Name:
Summary: Crossword
Version: 1.0
Description:
Crossword allows you to create blank crossword puzzle frames and then
have the computer fill them with words from a chosen dictionary. You
can watch the computer while it works, even interrupting it and
stepping one letter at a time to better understand what it's doing.
The program is intended to provide a testing ground for different
search algorithms. It acts as a visual tool to identify the strengths
and weaknesses of a particular method. With a little work and proper
understanding of the code, one can add new search algorithms to the
program.
===========================================================================
Topic: areas/genetic/
Summary: Genetic Algorithms and Genetic Programming
Description:
This directory contains software and materials concerning
genetic algorithms, genetic programming, evolutionary
programming, and related topics.
Origin: FTP repositories for genetic algorithms include
ftp.aic.nrl.navy.mil:/pub/galist/
ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Evolutionary Programming, Genetic Algorithms,
Genetic Programming, Software Packages
Contains:
ga/ Genetic Algorithms
gp/ Genetic Programming
See Also:
areas/alife/
===========================================================================
Topic: areas/genetic/ga/
Summary: Genetic Algorithms
Description:
This directory contains software and materials concerning
genetic algorithms and related topics.
Origin: FTP repositories for genetic algorithms include
ftp.aic.nrl.navy.mil:/pub/galist/
ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Genetic Algorithms, Software Packages
Contains:
doc/ Documentation about Genetic Algorithms
faq/ Genetic Algorithms FAQ: Hitch-Hiker's Guide to Evolutionary
Computation
mail/ Mail archives for the GA-List mailing list.
systems/ Genetic Algorithms Software Packages
test/ Genetic Algorithms Benchmarks and Test Problems
See Also:
areas/alife/
===========================================================================
Topic: areas/genetic/ga/doc/
Summary: Documentation about Genetic Algorithms
Description:
This directory contains documents such as bibliographies,
introductions, and notes about genetic algorithms and related topics.
Origin: FTP repositories for genetic algorithms include
ftp.aic.nrl.navy.mil:/pub/galist/
ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Genetic Algorithms!Documents
Contains:
bib/ Genetic Algorithms Bibliographies
intro/ Introductions to Genetic Algorithms
notes/ Notes about Genetic Algorithms
See Also:
areas/alife/doc/
===========================================================================
Topic: areas/genetic/ga/doc/bib/
Summary: Genetic Algorithms Bibliographies
Description:
This directory contains bibliographies of work in genetic algorithms.
Origin: FTP repositories for genetic algorithms include
ftp.aic.nrl.navy.mil:/pub/galist/
ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Genetic Algorithms!Bibliographies
Contains:
alander/ Evolutionary Computation Bibliography
app/ Evolutionary Computation bibliography, sorted by application
domain
cogann/ Schaffer's COGANN Bibliography
ec/ Evolutionary Computation Bibliography
foga/ Genetic Algorithms Bibliography
ga_list/ Genetic Algorithms Bibliography
illigal/ Genetic Algorithms Bibliography
ruhland/ Bibliography of Applications of Genetic Algorithms to Neural
Networks
See Also:
areas/alife/doc/bib/
===========================================================================
Package: areas/genetic/ga/doc/bib/alander/
Name:
Summary: Evolutionary Computation Bibliography
Version:
Description:
This directory contains a PostScript bibliography of over
2,500 entries in the area of Evolutionary Computation (GA/ES/EP/GP).
===========================================================================
Package: areas/genetic/ga/doc/bib/app/
Name:
Summary: Evolutionary Computation bibliography, sorted by
application domain
Version:
Description:
This directory contains a quarterly updated list of evolutionary
computation references sorted by application domain.
===========================================================================
Package: areas/genetic/ga/doc/bib/cogann/
Name:
Summary: Schaffer's COGANN Bibliography
Version:
Description:
This directory contains Dave Schaffer's COGANN bibliography
collection in refer format.
===========================================================================
Package: areas/genetic/ga/doc/bib/ec/
Name:
Summary: Evolutionary Computation Bibliography
Version: 19-OCT-93
Description:
This directory contains a BibTeX/PostScript bibliography of over
500 entries in the area of Evolutionary Computation (GA/ES/EP/GP).
===========================================================================
Package: areas/genetic/ga/doc/bib/foga/
Name:
Summary: Genetic Algorithms Bibliography
Version:
Description:
This directory contains the abstracts from the papers in the FOGA-90
and FOGA-92 workshops.
===========================================================================
Package: areas/genetic/ga/doc/bib/ga_list/
Name:
Summary: Genetic Algorithms Bibliography
Version:
Description:
This directory contains the GA-List's list of commonly referenced
books and proceedings on GAs, including ordering information.
===========================================================================
Package: areas/genetic/ga/doc/bib/illigal/
Name:
Summary: Genetic Algorithms Bibliography
Version:
Description:
This directory contains Goldberg's bibliography of work in genetic
algorithms.
===========================================================================
Package: areas/genetic/ga/doc/bib/ruhland/
Name:
Summary: Bibliography of Applications of Genetic Algorithms to
Neural Networks
Version: 8-JUN-94
Description:
This directory contains a 300-item bibliography of work on
applications of genetic algorithms to neural networks. It comes
from Jochen Ruhland's thesis.
===========================================================================
Topic: areas/genetic/ga/doc/intro/
Summary: Introductions to Genetic Algorithms
Description:
This directory contains introductions to genetic algorithms and
related topics.
Origin: FTP repositories for genetic algorithms include
ftp.aic.nrl.navy.mil:/pub/galist/
ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Genetic Algorithms!Introductions
Contains:
overview/ Beginners Guide to GAs
survey/ Survey paper on genetic algorithm programming environments
See Also:
areas/alife/doc/intro/
===========================================================================
Package: areas/genetic/ga/doc/intro/overview/
Name:
Summary: Beginners Guide to GAs
Version:
Description:
This directory contains two introductions to genetic algorithms
written by David Beasley. They are suitable for beginners and
include many references.
===========================================================================
Package: areas/genetic/ga/doc/intro/survey/
Name:
Summary: Survey paper on genetic algorithm programming environments
Version:
Description:
This directory contains a survey paper on GA programming environments.
===========================================================================
Topic: areas/genetic/ga/doc/notes/
Summary: Notes about Genetic Algorithms
Description:
This directory contains notes about genetic algorithms and related topics.
Origin: FTP repositories for genetic algorithms include
ftp.aic.nrl.navy.mil:/pub/galist/
ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Genetic Algorithms!Documents
Contains:
softsurv/ GA Software Survey
See Also:
areas/alife/doc/notes/
===========================================================================
Package: areas/genetic/ga/doc/notes/softsurv/
Name:
Summary: GA Software Survey
Version: 13-APR-93
Description:
This directory contains Nici Schraudolph's survey of GA software. It
was previously posted monthly to comp.ai.genetic, but has been
incorporated into Joerg Heitkoetter's FAQ posting for comp.ai.genetic.
===========================================================================
Package: areas/genetic/ga/faq/
Name: Genetic Algorithms FAQ
Summary: Hitch-Hiker's Guide to Evolutionary Computation
Version: 2.2 (20-JUN-94)
Description:
A compendium of answers to frequently asked questions about
Genetic Algorithms, Genetic Programming, Evolutionary Computation,
and related topics. Posted quarterly to the comp.ai.genetic.
===========================================================================
Package: areas/genetic/ga/mail/
Name:
Summary: Mail archives for the GA-List mailing list.
Version: v1 through v8n19
Description:
This directory contains the archives of the Genetic Algorithms
Digest, a moderated mailing list sent out in digest format.
===========================================================================
Topic: areas/genetic/ga/systems/
Summary: Genetic Algorithms Software Packages
Description:
This directory contains genetic algorithms software packages.
Origin: FTP repositories for genetic algorithms include
ftp.aic.nrl.navy.mil:/pub/galist/
ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Genetic Algorithms
Contains:
cfsc/ CFS-C: Domain Independent Subroutines for Implementing
Classifier Systems in Arbitrary, User-Defined Environments
dgenesis/ DGENESIS: Distributed GA
em/ EM: Evolution Machine
ga_ucsd/ GAucsd: Genetic Algorithm Software Package
gac/ GAC: Simple GA in C
gacc/ GACC: Genetic Aided Cascade-Correlation
gaga/ GAGA: A Genetic Algorithm for General Application
gags/ GAGS: Genetic algorithm application generator and C++ class
library
gal/ GAL: Simple GA in Lisp
game/ GAME: Genetic Algorithms Manipulation Environment
gannet/ GANNET: Genetic Algorithm / Neural NETwork
gaw/ GAW: Genetic Algorithm Workbench
geco/ GECO: Genetic Evolution through Combination of Objects
genalg/ GENALG: Genetic Algorithm package written in Pascal
genesis/ GENESIS: GENEtic Search Implementation System
genesys/ GENEsYs: Experimental GA based on GENESIS
genet/ GenET: Domain-independent generic GA software package
genie/ Genie: GA-based modeling/forecasting system
genitor/ GENITOR: Modular GA package with floating-point support.
giga/ GIGA: Gene Invariant Genetic Algorithm
libga/ LibGA: Library of GA routines written in C.
lice/ LICE: Parameter optimization program based on evolution
strategies
messy_ga/ mGA: C and Common Lisp implementations of a messy GA
michal/ GENOCOP, Genetic-2, and Genetic-2N: GA numeric optimization
packages
paragene/ PARAGENESIS: Parallel version of Grefenstette's GENESIS program
paratsp/ ParaTSP: Parallel GA with Simulated Annealing to solve TSP's
pga/ PGA: Parallel Genetic Algorithms Testbed
scs/ SCS: C port of Goldberg's Simple Classifier System
scsc/ SCS-C: C port of Goldberg's Simple Classifier System
ses/ SES: Simple Evolution Strategy
sga/ SGA: Ports and extensions of Goldberg's "Simple Genetic
Algorithm"
tolkien/ TOLKIEN: C++ Class Library for GA and Classifier System
Applications
See Also:
areas/alife/systems/
===========================================================================
Package: areas/genetic/ga/systems/cfsc/
Name: CFS-C
Summary: Domain Independent Subroutines for Implementing
Classifier Systems in Arbitrary, User-Defined Environments
Version: 1.98j (8-NOV-93), 1.02j (20-SEP-91)
Description:
This directory contains Rick Riolo's CFS-C original and an ANSI C port.
===========================================================================
Package: areas/genetic/ga/systems/dgenesis/
Name: DGENESIS
Summary: Distributed GA
Version: 1.0 (27-APR-94)
Description:
This directory contains DGENESIS. Based on GENESIS 5.0, it aims to
implement a distributed GA on a network of workstations. Each
subpopulation is handled by a UNIX process and communication is via
UNIX sockets.
The user can set the migration rate, the migration interval and the
topology of communication between subpopulations.
===========================================================================
Package: areas/genetic/ga/systems/em/
Name: EM
Summary: Evolution Machine
Version: 2.2 (23-AUG-93)
Description:
This directory contains the Evolution Machine (EM). EM presents a
collection of evolutionary algorithms (Genetic Algorithms and
Evolution Strategies) in a common framework. EM is universally
applicable to continuous real-coded optimization problems. In the EM,
the authors have coded fundamental evolutionary algorithms, and added
some of their approaches to evolutionary search.
The EM includes extensive menu techniques with:
* Default parameter setting for inexperienced users.
* Well-defined entries for EM- control by freaks of
the EM, who want to leave the standard process
control.
* Data processing for repeated runs (with or without
change of the strategy parameters).
* Graphical presentation of results:
online presentation of the evolution progress, one-,
two- and three-dimensional graphic output to analyze
the fitness function and the evolution process.
* Integration of calling MS--DOS utilities (Turbo C).
EM runs on PC's with MS-DOS.
===========================================================================
Package: areas/genetic/ga/systems/ga_ucsd/
Name: GAucsd
Summary: Genetic Algorithm Software Package
Version: 1.4 (7-JUL-92)
Description:
This directory contains materials related to the GAucsd Genetic
Algorithm software package. Genetic Algorithms (GAs) are a class of
computer algorithms for optimizing arbitrary functions via methods
inspired by biological evolution.
GAucsd is based on GENESIS, but with numerous bug fixes and
user-interface improvements. Major additions include a wrapper that
simplifies the writing of evaluation functions, a facility to
distribute experiments over networks of machines, and Dynamic
Parameter Encoding, a technique that improves GA performance in
continuous search spaces by adaptively refining the representation of
real-valued genes.
===========================================================================
Package: areas/genetic/ga/systems/gac/
Name: GAC
Summary: Simple GA in C
Version: 9106.12
Description:
This directory contains GAC, a simple GA (conceptually based on
Grefenstette's Genesis) written in C.
Baker's SUS selection algorithm is employed, n-point crossover is
maintained at 60%, and mutation is very low. Selection is based on
proportional fitness. This GA uses generations. It is also important
to note that this GA maximizes.
A note on crossover is in order. This version of GAC allows for
n-point crossover, where n is less than the length of an individual
(although there is no check for that). It is also possible to run
uniform crossover (see discussion below).
GAC will display run-time information as it executes. GAC also has
the ability to output this information into files. These statistics
include best behavior, online/ offline measurements, convergence, and
the number of reevaluations per generation. At this time the code is
commented out. The user can simply remove a few comment symbols to use
this facility. See run.c and geval.c for details.
There is no ranking, adaptive operators, etc. We intend to explore
these issues in future work.
===========================================================================
Package: areas/genetic/ga/systems/gacc/
Name: GACC
Summary: Genetic Aided Cascade-Correlation
Version: 15-MAR-93
Description:
This directory contains Genetic Aided Cascade-Correlation (GACC).
Genetic algorithms are applied to the optimization of the weights in
the cascade-correlation learning architecture. In this architecture,
the neural network starts out with a layer of output neurons. The
output neuron weights are then adjusted to minimize the error in the
network. A hidden neuron is then added and its weights adjusted so
its output correlates with the error in the network. It is then
connected to the output neurons and the weights of the output neuron
are once again readjusted. This process of adding neurons continues
until a network with an acceptable error is produced.
Genetic algorithms are used to find the weights for both the hidden
and output neurons. We attempt to use the global optimization
characteristics of genetic algorithms to find the global set of
weights. However, while simple genetic algorithms can find the area
of the weight space where there is a minimum error for the output
weights or maximum correlation for the hidden layers, they do not
converge to the actual minimum or maximum. We must find a way to
supplement the simple genetic algorithm.
In our approach, the Genetic aided cascade-correlation, we explore the
weight space first by using simple genetic algorithms with
non-overlapping populations and binary encoded weights. We then use
Quickprop to converge to the minimum or maximum. We have applied our
algorithm to the two spiral test with resulting average network sizes
of an average of 21.6 hidden nodes.
===========================================================================
Package: areas/genetic/ga/systems/gaga/
Name: GAGA
Summary: A Genetic Algorithm for General Application
Version: 9b (25-AUG-88)
Description:
This directory contains GAGA, a genetic algorithm for general application.
It is suitable for minimization of 'difficult' cost functions.
Originally written in Pascal by Ian Poole, it was rewritten in C by
Jon Crowcroft.
===========================================================================
Package: areas/genetic/ga/systems/gags/
Name: GAGS
Summary: Genetic algorithm application generator and C++ class library
Version: 0.91 (27-JUN-94)
Description:
GAGS 0.9 (Genetic Algorithms from Granada, Spain) is a system designed
to make it simpler to design a genetic algorithm. It consists of a C++
class library for programming genetic algorithms. But from a user
point of view, it is a genetic algorithm application generator. The
application generator takes a fitness function written in C and
surrounds with enough code to produce a complete program. It then
compiles it and runs it for you.
GAGS includes the following features:
- Selection procedures include steady-state, tournament, and
roulette-wheel.
- Crossover is 2-point. Uniform crossover is also supported in
the library, but the apps generator does not know about it.
- Mutation is bit-flip, with user-supplied frequency. Other
operators, like gene duplication or elimination, and gene
transposition, are also included in the library, but not in
the apps generator.
- Best fitness and individual are printed on STDOUT or to a file.
- Most GA parameters are inside a configuration file, so that
different operators and frequencies can be tested on a
fitness function. Only the fitness function and the output
options are fixed, once the program has been generated and
compiled.
- Fitness evaluation using training files.
- Graphics output through gnuplot.
The application generator gags.pl is written in perl, so this language
must also be installed before using GAGS.
===========================================================================
Package: areas/genetic/ga/systems/gal/
Name: GAL
Summary: Simple GA in Lisp
Version: 9106.12
Description:
This directory contains GAC, a simple GA (conceptually based on
Grefenstette's Genesis) written in Common Lisp.
Baker's SUS selection algorithm is employed, n-point crossover is
maintained at 60%, and mutation is very low. Selection is based on
proportional fitness. This GA uses generations. It is also important
to note that this GA maximizes.
A note on crossover is in order. This version of GAC allows for
n-point crossover, where n is less than the length of an individual
(although there is no check for that). It is also possible to run
uniform crossover (see discussion below).
GAC will display run-time information as it executes. GAC also has
the ability to output this information into files. These statistics
include best behavior, online/ offline measurements, convergence, and
the number of reevaluations per generation. At this time the code is
commented out. The user can simply remove a few comment symbols to use
this facility. See run.c and geval.c for details.
There is no ranking, adaptive operators, etc. We intend to explore
these issues in future work.
===========================================================================
Package: areas/genetic/ga/systems/game/
Name: GAME
Summary: Genetic Algorithms Manipulation Environment
Version: 2.1
Description:
This directory contains Genetic Algorithms Manipulation Environment
(GAME). GAME aims to demonstrate GA applications and build a suitable
programming environment. Currently in the early development stage,
the programming environment will comprise a graphic interface (using
X-Windows), a library of parameterized algorithms and applications, a
specialized high level language based on C++, and compilers to various
workstations and parallel machines. GAME is being developed as part
of the PAPAGENA project of the European Community's Esprit III
initiative.
===========================================================================
Package: areas/genetic/ga/systems/gannet/
Name: GANNET
Summary: Genetic Algorithm / Neural NETwork
Version: 0.91 (5-SEP-90, 8-SEP-92)
Description:
This directory contains GANNET (Genetic Algorithm / Neural NETwork).
GANNET allows one to evolve neural networks using genetic algorithms.
GANNET evolves nets based upon three fitness functions: Input/Output
Accuracy, Output 'Stability', and Network Size. The evolved neural
network presently has a binary input and binary output format, with
neurodes that have either 2 or 4 inputs and weights ranging from -3 to
+4. GANNET only allows for 250 neurodes in a net.
The distribution includes source code, a verifier program that
verifies the best neural network generated, and some sample datasets.
===========================================================================
Package: areas/genetic/ga/systems/gaw/
Name: GAW
Summary: Genetic Algorithm Workbench
Version: 1.10 (29-JUN-92)
Description:
GAW is an interactive tool and demonstration program for experimenting
with genetic algorithms.
===========================================================================
Topic: areas/genetic/ga/systems/geco/
Name: GECO
Summary: Genetic Evolution through Combination of Objects
Version: 2.0 (29-NOV-93); 1.0 (16-NOV-92)
Description:
This directory contains GECO, an extendible object-oriented toolbox
for constructing genetic algorithms. It provides a set of extensible
classes and methods designed for generality. Some simple examples are
also provided to illustrate the intended use.
===========================================================================
Package: areas/genetic/ga/systems/geco/v10/
Name: GECO
Summary: Genetic Evolution through Combination of Objects
Version: 1.0 (16-NOV-92)
Description:
This directory contains GECO, an extendible object-oriented toolbox
for constructing genetic algorithms. It provides a set of extensible
classes and methods designed for generality. Some simple examples are
also provided to illustrate the intended use.
===========================================================================
Package: areas/genetic/ga/systems/geco/v20/
Name: GECO
Summary: Genetic Evolution through Combination of Objects
Version: 2.0 (29-NOV-93)
Description:
This directory contains GECO, an extendible object-oriented toolbox
for constructing genetic algorithms. It provides a set of extensible
classes and methods designed for generality. Some simple examples are
also provided to illustrate the intended use.
===========================================================================
Package: areas/genetic/ga/systems/genalg/
Name: GENALG
Summary: Genetic Algorithm package written in Pascal
Version: 3 (21-JUL-90)
Description:
This directory contains GENALG, a program that demonstrates the
operation of genetic algorithms. From a randomly generated population
of real numbers, it attempts to find a number arbitrarily close to a
goal real number.
===========================================================================
Package: areas/genetic/ga/systems/genesis/
Name: GENESIS
Summary: GENEtic Search Implementation System
Version: 5.0 (October 1990)
Description:
This directory contains GENEtic Search Implementation System
(GENESIS). GENESIS is system for function optimization based on
genetic search techniques. Since genetic algorithms are task
independent optimizers, the user must provide only an "evaluation"
function which returns a value when given a particular point in the
search space.
This version offers several enhancements over previous versions that
should make the system much more user friendly. The major improvement
is a user-level representation that allows the user to think about the
genetic structures as vectors of real numbers, rather than bit strings.
This level of representation should make the application of GENESIS to
new problems easier than ever. A number of new options have been added,
including: a display mode that includes an interactive user interface,
the option to maximize or minimize the objective function, the choice of
rank-based or proportional selection algorithm, and an option to use a
Gray code as a transparent lower level representation.
The purpose of making this system available is to encourage the
experimental use of genetic algorithms on realistic optimization
problems, and thereby to identify the strengths and weaknesses of
genetic algorithms.
===========================================================================
Package: areas/genetic/ga/systems/genesys/
Name: GENEsYs
Summary: Experimental GA based on GENESIS
Version: 1.0 (3-JUL-92)
Description:
This directory contains GENEsYs, a genetic algorithms implementation
based on Grefenstette's GENESIS. It includes extensions and new
features for experimental purposes, such as different selection
mechanisms (linear ranking, Boltzmann selection, mu-selection,
lambda-selection), general extinctive selection variants, and extended
recombination operators (m-point, uniform, discrete and intermediate
recombination). Self-adaptation of mutation rates is also possible.
A set of objective functions is provided, including De Jong's functions,
complicated continuous functions, a TSP-problem, binary functions, and a
fractal function. There are also additional data-monitoring facilities
such as recording average, variance and skew of object variables and
mutation rates, or creating bitmap-dumps of the population.
===========================================================================
Package: areas/genetic/ga/systems/genet/
Name: GenET
Summary: Domain-independent generic GA software package
Version: 1.00 (20-SEP-93)
Description:
GenET is a domain-independent GA package. All problem independent
mechanisms have been implemented and can be used regardless of
application domain. It allows the fast development of applications.
GenET is intended to become a depository of representations and
operators and to be used as a tool for comparing different models and
strategies.
The algorithm provides many models and choices. For example,
population models include generational GA, steady-state, (n,m)-EP and
(n,n+m)-EP models. Choices include automatic adaptation of operator
probabilities and a dynamic ranking mechanism.
The two included examples illustrate how to implement problems with
heterogeneous and homogeneous structures (with explicit rep/opers) and
how to use the existing library (FP).
===========================================================================
Package: areas/genetic/ga/systems/genie/
Name: Genie
Summary: GA-based modeling/forecasting system
Version: 19-JAN-94
Description:
This directory contains Genie, a GA-based modeling/forecasting system.
Genie is used for long-term planning. One can construct a model of an
environment and then view the forecasts of how that environment will
evolve into the future. It is then possible to alter the future
picture of the environment so as to construct a picture of a desired
future. The GA is then employed to suggest changes to the existing
environment so as to cause the desired future to come about.
===========================================================================
Package: areas/genetic/ga/systems/genitor/
Name: GENITOR
Summary: Modular GA package with floating-point support.
Version:
Description:
This directory contains GENITOR. Genitor is a modular GA package
containing examples for floating-point, integer, and binary
representations. Its features include many sequencing operators as
well as subpopulation modeling.
===========================================================================
Package: areas/genetic/ga/systems/giga/
Name: GIGA
Summary: Gene Invariant Genetic Algorithm
Version: 22-JAN-93
Description:
This directory contains GIGA (Gene Invariant Genetic Algorithm). GIGA
propagates information throughout a population, using crossover as its
operator.
===========================================================================
Package: areas/genetic/ga/systems/libga/
Name: LibGA
Summary: Library of GA routines written in C.
Version: 1.00 (23-JUL-93)
Description:
This directory contains LibGA, a library of genetic algorithm routines
written in C. It is simple and easy to use, with many knobs to turn.
Both generational and steady state models supported. Most GA
parameters can be set or changed via configuration file, with no need
to recompile. Function pointers are used for the GENETIC OPERATORs,
so they can easily be manipulated on the fly. Several genetic
operators are supplied and it is easy to add more.
===========================================================================
Package: areas/genetic/ga/systems/lice/
Name: LICE
Summary: Parameter optimization program based on evolution strategies
Version: 1.01 (23-JUN-94)
Description:
LICE is a parameter optimization program based on Evolution
Strategies. In contrast to classic ES, LICE has a local selection
scheme to prevent premature stagnation.
===========================================================================
Package: areas/genetic/ga/systems/messy_ga/
Name: mGA
Summary: C and Common Lisp implementations of a messy GA
Version: 1.0
Description:
This directory contains mGA1.0. mGA is a C implementation
of a messy GA as described in TCGA report No. 91008. Messy GAs
overcome the linkage problem of simple genetic algorithms by combining
variable-length strings, GENE expression, messy operators, and a
nonhomogeneous phasing of evolutionary processing. Results on a
number of difficult deceptive test functions have been encouraging
with the messy GA always finding global optima in a polynomial number
of function evaluations.
A Common Lisp version is forthcoming.
===========================================================================
Topic: areas/genetic/ga/systems/michal/
Name: GENOCOP, Genetic-2, and Genetic-2N
Summary: GA numeric optimization packages
Version: GENOCOP 1.0 (10-OCT-92), 2.0 (1-FEB-93);
GENETIC2 4.3 (26-JAN-89, 17-AUG-92);
GENETIC2N 4.3 (26-JAN-89, 16-AUG-92)
Description:
This directory contains three genetic algorithm numerical
optimization packages by Zbigniew Michalewicz, as described in his
book.
GENOCOP GEnetic algorithm for Numerical Optimization for
COnstrained Problems. Optimizes functions with any
number of linear constraints (equalities and inequalities)
Genetic-2 Optimization package for the linear transportation
problem (minimization of the transportation cost).
Genetic-2N Optimization package for the nonlinear transportation
problem (minimization of the transportation cost).
===========================================================================
Package: areas/genetic/ga/systems/michal/genetc2/
Name: Genetic-2
Summary: Optimization package for the linear transportation problem
Version: GENETIC2 4.3 (26-JAN-89, 17-AUG-92)
Description:
This directory contains the Genetic-2 genetic algorithm numerical
optimization package by Zbigniew Michalewicz, as described in his
book. Genetic-2 is an optimization package for the linear transportation
problem (minimization of the transportation cost).
===========================================================================
Package: areas/genetic/ga/systems/michal/genetc2n/
Name: Genetic-2N
Summary: Optimization package for the nonlinear transportation problem
Version: GENETIC2N 4.3 (26-JAN-89, 16-AUG-92)
Description:
This directory contains the Genetic-2N genetic algorithm numerical
optimization package by Zbigniew Michalewicz, as described in his
book. Genetic-2N is an optimization package for the nonlinear
transportation problem (minimization of the transportation cost).
===========================================================================
Package: areas/genetic/ga/systems/michal/genocop/
Name: GENOCOP
Summary: GEnetic algorithm for Numerical Optimization for
COnstrained Problems
Version: GENOCOP 1.0 (10-OCT-92), 2.0 (1-FEB-93)
Description:
This directory contains the GENOCOP genetic algorithm numerical
optimization package by Zbigniew Michalewicz, as described in his
book. GENOCOP (GEnetic algorithm for Numerical Optimization for
COnstrained Problems) optimizes functions with any
number of linear constraints (equalities and inequalities)
===========================================================================
Package: areas/genetic/ga/systems/paragene/
Name: PARAGENESIS
Summary: Parallel version of Grefenstette's GENESIS program
Version: 8-DEC-92
Description:
Paragenesis is a parallel version of Grefenstette's GENESIS program.
It is intend to improve performance without changing the behavior of
the genetic algorithm.
Unlike the punctuated equilibria and local selection models
PARAGENESIS doesn't modify the genetic algorithm to be more
parallelizable as these modifications can drastically alter the
behavior of the algorithm. Instead each member is placed on a
separate processor allowing initialization, evaluation and mutation to
be completely parallel. The costs of global control and communication
in selection and crossover are present but minimized as much as
possible. In general PARAGENESIS on an 8k CM-200 seems to run 10-100
times faster than GENESIS on a Sparc 2 and finds equivalent solutions.
The solutions are not identical only because the parallel random
number generator gives a different stream of numbers.
PARAGENESIS includes all the features of serial GENESIS plus some
additions. The additions include the ability to collect timing
statistics, probabilistic selection(as opposed to Baker's stochastic
universal sampling), uniform crossover and local or neighborhood
selection. Anyone familiar with the serial implementation of GENESIS
and C* should have little problem using PARAGENESIS.
===========================================================================
Package: areas/genetic/ga/systems/paratsp/
Name: ParaTSP
Summary: Parallel GA with Simulated Annealing to solve TSP's
Version: 1.0 (6-JUN-94)
Description:
ParaTSP is a software package for solving Traveling Salesman Problems
(TSP) using genetic algorithms (GA) and simulated annealing (SA).
ParaTSP is based on Baeck's GeneSyS.
===========================================================================
Package: areas/genetic/ga/systems/pga/
Name: PGA
Summary: Parallel Genetic Algorithms Testbed
Version: 2.5 (4-OCT-93)
Description:
PGA is a simple testbed for basic explorations in genetic algorithms.
Command line arguments control a range of parameters, there are a
number of built-in problems for the GA to solve. The current set
consists of:
- maximize the number of bits set in a chromosome
- De Jong's functions DJ1, DJ2, DJ3, DJ5
- binary F6, used by Schaffer et al
- a crude 1-d knapsack problem; you specify a target and a set of
numbers in an external file, GA tries to find a subset that sums
as closely as possible to the target
- the `royal road' function(s); a chromosome is regarded as
a set of consecutive blocks of size K, and scores K for each
block entirely filled with 1s
and it's easy to add your own problems (see below). Chromosomes are
represented as character arrays, so you are not (quite) stuck with
bit-string problem encodings.
PGA allows multiple populations, with periodic migration between
them, and a range of other options. For example, you can choose
the chromosome length independently of the choice of problem.
===========================================================================
Package: areas/genetic/ga/systems/scs/
Name: SCS
Summary: C port of Goldberg's Simple Classifier System
Version: 19-AUG-93
Description:
SCS (Simple Classifier System) is a C port of the system from
Appendix D of Goldberg's "Genetic Algorithms in Search,
Optimization, and Machine Learning".
The following is a short description on the operation of the simple
classifier system:
The classifier system randomly generates a starting population
of classifiers. The program then generates a random signal to
the environment (in this case the multiplexer). The multiplexer
responds with the environmental message. The program then attempts
to match the random signal with the classifiers and those that match
are allowed to bid. The strengths of the matching classifiers are
deducted by the amount that is to be bid specified by the CBID variable
and the effective bids of the classifiers are compared. The classifer
with the largest effective bid (the bid modified by EBID) wins and the
classifier message is compared with the environmental message. If the
messages match, the classifier is given a reward. If the bucket brigade
flag is activated, the classifier will post a reward to be given to
the last matching classifier. The genetic algorithm is activated at
the iteration specified by the variable GAPERIOD. Pairs of
classifiers are chosen randomly according to their strengths. Bad
performing classifiers are replaced according to their similarities
to the new offsprings. Data about the population and its parameters
is recorded in REPORT.OUT at periodic intervals.
===========================================================================
Package: areas/genetic/ga/systems/scsc/
Name: SCS-C
Summary: C port of Goldberg's Simple Classifier System
Version: 0.99j
Description:
SCS-C is another port to C of Goldberg's Simple Classifier System,
with a few extensions.
===========================================================================
Package: areas/genetic/ga/systems/ses/
Name: SES
Summary: Simple Evolution Strategy
Version: 1.0 (28-JUN-94)
Description:
SES (Simple Evolution Strategy) is a parameter optimization program
based on Evolution Strategies (ES). It is a more or less traditional
ES implementation, except for:
- correlated mutations not implemented
- global recombination not implemented
- geometric intermediate recombination added for variances sigma[i]
- discrete recombination on both parameters and variances is
performed simultaneously, i.e. sigma[i] and x[i] are taken from
one parent at each position i.
===========================================================================
Topic: areas/genetic/ga/systems/sga/
Name: SGA
Summary: Ports and extensions of Goldberg's "Simple Genetic Algorithm"
Description:
This directory contains several ports and extensions of Goldberg's
Simple Genetic Algorithm, as described in his book. These include
SGA-C, SGA-CUBE, SGA-F, and SGA-P -- ports for C, NCube, Fortran,
and Pascal.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Genetic Algorithms, Goldberg, SGA
Contains:
sga_c/ SGA-C: C port and extension of Goldberg's Simple Genetic
Algorithm
sga_cube/ SGA-Cube: Goldberg's SGA modified for nCUBE 2 hypercube
parallel computer
sga_f/ SGA-F: Goldberg's Simple Genetic Algorithm (enhanced) in
FORTRAN-77.
sga_p/ SGA-P: Goldberg's Simple Genetic Algorithm Pascal
See Also: ?
===========================================================================
Package: areas/genetic/ga/systems/sga/sga_c/
Name: SGA-C
Summary: C port and extension of Goldberg's Simple Genetic Algorithm
Version: 1.1 shar (6-NOV-92) 1.1 tar (11-AUG-93, 2-MAR-94)
Description:
This directory contains SGA-C, a C-language port and extension of
the original Pascal SGA code presented in Goldberg's book. The
operation is essentially the same as that of the original Pascal
version. See TCGA report 91002 for a description of SGA-C.
===========================================================================
Package: areas/genetic/ga/systems/sga/sga_cube/
Name: SGA-Cube
Summary: Goldberg's SGA modified for nCUBE 2 hypercube parallel computer
Version: shar 6-NOV-92; tar 5-AUG-93, 2-MAR-94
Description:
SGA-Cube is a C-language translation of Goldberg's SGA code with
modifications to allow execution on the nCUBE 2 Hypercube Parallel
Computer. When run on the nCUBE 2, SGA-Cube can take advantage of the
hypercube architecture, and is scalable to any hypercube dimension.
The hypercube implementation is modular, so that the algorithm for
exploiting parallel processors can be easily modified.
In addition to its parallel capabilities, SGA-Cube can be compiled on
various serial computers via compile-time options. When compiled on a
serial computer, SGA-Cube is essentially identical to SGA-C. SGA-Cube
is described in TCGA report No. 91005.
===========================================================================
Package: areas/genetic/ga/systems/sga/sga_f/
Name: SGA-F
Summary: Goldberg's Simple Genetic Algorithm (enhanced) in FORTRAN-77.
Version: 1.0 (24-NOV-93)
Description:
This directory contains a FORTRAN port of Goldberg's Simple Genetic
Algorithm, as described in his book.
===========================================================================
Package: areas/genetic/ga/systems/sga/sga_p/
Name: SGA-P
Summary: Goldberg's Simple Genetic Algorithm Pascal
Version: 3-DEC-93
Description:
This directory contains Goldberg's Simple Genetic Algorithm, in
Turbo Pascal and Sun Pascal. It was typed in by Gary Gibson, based
on the code in Appendix C of Goldberg's book (minus the comments),
and then made more portable by Gibson and Heitkoetter.
===========================================================================
Package: areas/genetic/ga/systems/tolkien/
Name: TOLKIEN
Summary: C++ Class Library for GA and Classifier System Applications
Version:
Description:
TOLKIEN (TOoLKIt gENetics-based applications) is a C++ class library
for GA and classifier system applications. The package includes
source code, a reference manual, a tutorial, and several demo
programs.
===========================================================================
Topic: areas/genetic/ga/test/
Summary: Genetic Algorithms Benchmarks and Test Problems
Description:
This directory contains benchmarks and test problems for genetic
algorithms.
Origin: FTP repositories for genetic algorithms include
ftp.aic.nrl.navy.mil:/pub/galist/
ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Genetic Algorithms!Benchmarks
Contains:
ga_bench/ GAbench: Genetic Algorithms Benchmarks and Test Problems
sac/ SAC94 Suite: Collection of Multiple Knapsack Problems
tsp/ TSPLIB: Library of Traveling Salesman and Related Problem
Instances
See Also: ?
===========================================================================
Package: areas/genetic/ga/test/ga_bench/
Name: GAbench
Summary: Genetic Algorithms Benchmarks and Test Problems
Version:
Description:
This directory contains genetic algorithms benchmarks and test problems.
The file others.tgz contains references to collections of machine
learning test problems that may be of interest.
Please note that the files still aren't very well annotated and are
offered on an as-is basis. Eventually, a standard way to specify the
parameters and various encodings of them for these problems will be
recorded along with the code.
===========================================================================
Package: areas/genetic/ga/test/sac/
Name: SAC94 Suite
Summary: Collection of Multiple Knapsack Problems
Version: 13-JUL-93
Description:
This directory contains a collection of 0/1 Multiple Knapsack Problems,
that are well known from the literature, and heuristically solved in the
following publications.
Tabu Search:
F. Dammeyer and S. Voss, "Dynamic tabu list management using
the reverse elimination method."
Annals of Operations Research, 1991.
Simulated Annealing:
A. Drexel, "A Simulated Annealing Approach to the
Multiconstraint Zero-One Knapsack Problem."
Computing, 40:1-8, 1988.
Genetic Algorithms:
S. Khuri, T. Baeck, J. Heitkoetter, "The Zero/One Multiple
Knapsack Problem and Genetic Algorithms", to appear in the 1994
ACM Symposium on Applied Computing, SAC'94, Phoenix,
Arizona, 1994.
===========================================================================
Package: areas/genetic/ga/test/tsp/
Name: TSPLIB
Summary: Library of Traveling Salesman and Related Problem Instances
Version: 1.2 (1-AUG-92)
Description:
This directory contains TSPLIB, a library of instances of the
traveling salesman problem. The following problem classes are
included:
1. Symmetric traveling salesman problems (TSP)
2. Asymmetric traveling salesman problems (ATSP)
3. Capacitated vehicle routing problems (CVRP)
The library was established as a result of the CRPC workshop on the
Traveling Salesman Problem (TSP '90). The initial library of eighty
four (now 144) test problems was collected from a group of well-known
international researchers working on solutions to the Traveling
Salesman Problem.
===========================================================================
Topic: areas/genetic/gp/
Summary: Genetic Programming
Description:
This directory contains software and materials concerning
genetic programming and related topics.
Origin: FTP repositories for genetic programming include
ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: genetic-programming@cs.stanford.edu
To subscribe to the list, send mail to
genetic-programming-request@cs.stanford.edu
Keywords:
AI Software Packages, Genetic Programming, Software Packages
Contains:
bib/ Bibliography of Genetic Programming
faq/ Genetic Programming FAQ
systems/ Genetic Programming Software Packages
See Also: ?
===========================================================================
Package: areas/genetic/gp/bib/
Name:
Summary: Bibliography of Genetic Programming
Version:
Description:
This directory contains an annotated bibliography on genetic
programming in ascii format, as posted to GA Digest.
===========================================================================
Package: areas/genetic/gp/faq/
Name:
Summary: Genetic Programming FAQ
Version:
Description:
A compendium of answers to frequently asked questions about
Genetic Programming and related topics.
===========================================================================
Topic: areas/genetic/gp/systems/
Summary: Genetic Programming Software Packages
Description:
This directory contains genetic programming software packages.
Origin: FTP repositories for genetic programming include
ftp.cc.utexas.edu:/pub/genetic-programming/ [128.83.186.13]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: genetic-programming@cs.stanford.edu
To subscribe to the list, send mail to
genetic-programming-request@cs.stanford.edu
Contact: Jim McCoy
Keywords:
Genetic Programming
Contains:
abs/ GPX/Abstractica: A Karl Sims Genetic Art Workalike
cerebrum/ CEREBRUM: Framework for the Genetic Programming of Neural
Networks
doodle/ Doodle Garden: Screen saver based on Genetic Programming
evoplane/ EvolvePlanes: Evolving 3d Models of Jet Aircraft
geppetto/ Geppetto: C Library for Writing Genetic Programming
Applications
gp_pl/ Genetic Programming in Prolog
gpcpp/ GPC++: Genetic Programming in C++
gpeist/ GPEIST: GP System in Smalltalk
gpgraphs/ GP-Graphs: Script for graphing the info in geppetto log files.
gpquick/ GPQUICK: Simple GP system implemented in C++
gpsteps/ GPSTEPS: Genetic Programming SmallTalk Easy Prototyping System
imogenes/ Imogenes: GP System
koza/ KOZA: Genetic Programming Paradigm
litlflet/ LITLFLET: Genetic Programming Program
sgpc/ SGPC: Simple Genetic Programming in C
See Also: ?
===========================================================================
Package: areas/genetic/gp/systems/abs/
Name: GPX/Abstractica
Summary: A Karl Sims Genetic Art Workalike
Version: 22-MAR-93
Description:
This directory contains GPX/Abstractica, a Karl Sims Genetic Art
workalike. Abstractica applies Genetic Programming, using your good
taste as a fitness function, to the generation of abstract images.
Two different versions of the software are included --
abs.tgz Normal executables. Try this one first.
abs_stat.tgz Same as above, but linked with the -Bstatic option
for portability to systems which have their sharable
libraries installed funny. Try this one if the
other doesn't work.
Source code is not included because the authors do not have the
rights to distribute some of the user-interface, image manipulation,
and memory management routines.
===========================================================================
Package: areas/genetic/gp/systems/cerebrum/
Name: CEREBRUM
Summary: Framework for the Genetic Programming of Neural Networks
Version: 12-APR-93
Description:
This directory contains CEREBRUM, a framework for the genetic
programming of neural networks.
===========================================================================
Package: areas/genetic/gp/systems/doodle/
Name: Doodle Garden
Summary: Screen saver based on Genetic Programming
Version: 8-DEC-93
Description:
This directory contains the Doodle Garden Screen Saver. It uses
Genetic Programming to evolve new drawings ("doodles") from a basic
set (screen).
A small computer program draws each doodle. The screen saver mutates
(randomly changes) a doodle program, or crosses programs (attach part of
one to part of another) with interesting results. When the screen saver
is activated, it automatically generates new doodles every few seconds
by mutating and crossing the doodles that make up the base screen. By
selecting your favorite Doodle Garden Screen, you are exploring Genetic
Programming and a fascinating visual space.
===========================================================================
Package: areas/genetic/gp/systems/evoplane/
Name: EvolvePlanes
Summary: Evolving 3d Models of Jet Aircraft
Version:
Description:
This directory contains EvolvePlanes, a Mathematica program based
on genetic programming.
===========================================================================
Package: areas/genetic/gp/systems/geppetto/
Name: Geppetto
Summary: C Library for Writing Genetic Programming Applications
Version: 2.0 (10-MAR-94); 1.2 (3-SEP-93)
Description:
This directory contains Geppetto, a C library for writing Genetic
Programming applications, much like SGPC.
===========================================================================
Package: areas/genetic/gp/systems/gp_pl/
Name:
Summary: Genetic Programming in Prolog
Version: 5-JUL-93
Description:
System for genetic programming in prolog.
===========================================================================
Package: areas/genetic/gp/systems/gpcpp/
Name: GPC++
Summary: Genetic Programming in C++
Version: 0.40 (19-JUN-94); 0.30 (16-NOV-93)
Description:
This directory contains GPCplus (Genetic Programming in C++). Ramped
half and half and tournament selection are implemented along with
standard GP components. Project and make files are also included. A
Santa Fe trail module is included which works. DOS and UNIX
implementations.
===========================================================================
Package: areas/genetic/gp/systems/gpeist/
Name: GPEIST
Summary: GP System in Smalltalk
Version: 3 (13-MAY-94)
Description:
GPEIST provides a framework for implementing and monitoring GP
experiments. A single experiment has been provided as an example --
the Ant Trail Problem with John Muir and Santa Fe trails.
A number of browsers/inspectors are included with the system:
(1) A graphical browser that displays the fittest program to date.
(2) A report browser giving fitness, size and depth statistics.
(3) A population inspector that can load and save populations.
(4) A chart browser allowing the display of fitness, size and
depth stats.
(5) An animation browser (for the Ant Trail Problem).
===========================================================================
Package: areas/genetic/gp/systems/gpgraphs/
Name: GP-Graphs
Summary: Script for graphing the info in geppetto log files.
Version: 18-MAY-94
Description:
GP-Graphs is a script for graphing the info in geppetto log files.
===========================================================================
Package: areas/genetic/gp/systems/gpquick/
Name: GPQUICK
Summary: Simple GP system implemented in C++
Version: 2.1 (15-MAR-94)
Description:
GPQUICK is a simple GP system implemented in C++. It features an
elegant object architecture with function (Function), program
(Chrome), GA (Pop) and problem (Problem) classes. The Problem class
is proposed as a portable representation for problems that would be
source compatible with a variety of other GP systems. GPQUICK uses a
steady state GA, tournament selection, one type of mutation, and
subtree crossover. It uses a fast, compact linear representation for
S-expressions. It includes documentation from the associated magazine
article (Byte, "Some Assembly Required", February 1994).
===========================================================================
Package: areas/genetic/gp/systems/gpsteps/
Name: GPSTEPS
Summary: Genetic Programming SmallTalk Easy Prototyping System
Version: 12-APR-94
Description:
GPSTEPS (Genetic Programming SmallTalk Easy Prototyping System) is a
system for experimenting with Genetic Programming. The Smalltalk
source code is provided in addition to an executable (MSDOS Windows
3.1) version for the Artificial Ant problem.
===========================================================================
Package: areas/genetic/gp/systems/imogenes/
Name: Imogenes
Summary: GP System
Version: 17-FEB-94
Description:
===========================================================================
Package: areas/genetic/gp/systems/koza/
Name: KOZA
Summary: Genetic Programming Paradigm
Version: 4-MAR-93
Description:
koza_gp.cl is a pure (CLtL2) Common Lisp implementation of the
Genetic Programming Paradigm, as described in Koza's book.
===========================================================================
Package: areas/genetic/gp/systems/litlflet/
Name: LITLFLET
Summary: Genetic Programming Program
Version: 26-MAY-94
Description:
Genetic programming system in Lisp implementing automatically
defined functions.
===========================================================================
Package: areas/genetic/gp/systems/sgpc/
Name: SGPC
Summary: Simple Genetic Programming in C
Version: 1.1 (19-AUG-93)
Description:
This directory contains SGPC (Simple Genetic Programming in C),
a simple Koza and Rice workalike system written in C. It is a C
program that writes the same kind of Lisp programs as the Koza system,
but is very portable and somewhat faster.
===========================================================================
Topic: areas/icot/
Name: IFS
Summary: ICOT Free Software
Description:
This directory contains free AI-related software from Japan's
Institute for New Generation Computer Technology (ICOT). The
collection includes a variety of prolog-based programs in symbol
processing, knowledge representation, reasoning and problem solving,
natural language processing.
General information on the software can be obtained in the files
archived in info.tgz. This includes documents on copyright and
conditions for use, Japanese Kanji code, KLIC (KL1 language processor
on UNIX), and Common-ESP (ESP language processor on UNIX).
Programs are written in KL1 (Parallel logic programming language on
Parallel Inference Machine), C, Prolog, ESP (Sequential Logic
programming language on PSI), Common-ESP (ESP on UNIX machine).
Note that most of the programs are written for the PSI machines,
and very few have been ported to Unix-based emulators.
See the index.txt file for an index to the contents of this directory.
Origin: ftp.icot.or.jp:/ifs/ [192.26.9.33]
Copying: Copyright (c) 1991-93 ICOT.
Use, copying, modification, and distribution permitted.
See the copyright files in each package for details.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Contact: ICOT Free Software desk
Institute for New Generation Computer Technology
21th Floor, Mita Kokusai Bldg.
4-28, Mita 1-chome,
Minato-ku, Tokyo 108
Japan
Fax: +81-3-3456-1618
Keywords:
AI Software Packages, FGCS, Fifth Generation Computer Systems,
ICOT Free Software, IFS, Japan, Software Packages
Contains:
apps/ ICOT: Applications programs of parallel logic programming
kbms_clp/ ICOT: Knowledge Representation, Knowledge Base and Constraint
Logic Programming Software
manuals/ ICOT: Manuals and textbooks on the languages and OS
newsltr/ ICOT: IFS Newsletter
nlp/ ICOT: Natural Language Analysis and Generation
reasonng/ ICOT: Systems for problem solvers and theorem provers
symbolic/ ICOT: Symbolic Processing Software
See Also: ?
===========================================================================
Package: areas/icot/apps/
Name: ICOT
Summary: Applications programs of parallel logic programming
Version:
Description:
This directory contains applications programs of parallel logic programming
from ICOT.
===========================================================================
Package: areas/icot/kbms_clp/
Name: ICOT
Summary: Knowledge Representation, Knowledge Base and Constraint
Logic Programming Software
Version:
Description:
This directory contains knowledge representation and constraint
logic programming software from ICOT.
===========================================================================
Topic: areas/icot/manuals/
Name: ICOT
Summary: Manuals and textbooks on the languages and OS
Description:
This directory contains manuals and textbooks for the languages and
OS used by the ICOT software.
Origin: ftp.icot.or.jp:/ifs/ [192.26.9.33]
Copying: Copyright (c) 1991-93 ICOT.
Use, copying, modification, and distribution permitted.
See the copyright files in each package for details.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Contact: ICOT Free Software desk
Institute for New Generation Computer Technology
21th Floor, Mita Kokusai Bldg.
4-28, Mita 1-chome,
Minato-ku, Tokyo 108
Japan
Fax: +81-3-3456-1618
Keywords:
ICOT, Japan
Contains:
esp/ ICOT: ESP manuals and textbooks
kl1/ ICOT: KL1 manuals and textbooks
pimos/ ICOT: PIMOS manuals and textbooks
See Also: ?
===========================================================================
Package: areas/icot/manuals/esp/
Name: ICOT
Summary: ESP manuals and textbooks
Version:
Description:
This directory contains manuals and textbooks ESP.
===========================================================================
Package: areas/icot/manuals/kl1/
Name: ICOT
Summary: KL1 manuals and textbooks
Version:
Description:
This directory contains manuals and textbooks KL1.
===========================================================================
Package: areas/icot/manuals/pimos/
Name: ICOT
Summary: PIMOS manuals and textbooks
Version:
Description:
This directory contains manuals and textbooks PIMOS.
===========================================================================
Package: areas/icot/newsltr/
Name: ICOT
Summary: IFS Newsletter
Version:
Description:
This directory contains back issues of the IFS Newsletter from ICOT.
===========================================================================
Package: areas/icot/nlp/
Name: ICOT
Summary: Natural Language Analysis and Generation
Version:
Description:
This directory contains natural language analysis and generation
software from ICOT.
===========================================================================
Package: areas/icot/reasonng/
Name: ICOT
Summary: Systems for problem solvers and theorem provers
Version:
Description:
This directory contains problem solver and theorem prover software
from ICOT.
===========================================================================
Package: areas/icot/symbolic/
Name: ICOT
Summary: Symbolic Processing Software
Version:
Description:
This directory contains symbolic processing software from ICOT.
===========================================================================
Topic: areas/kr/
Summary: Knowledge Representation
Description:
This directory contains software and materials concerning knowledge
representation and related topics, such as Semantic Nets, Frames,
and KL-One.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Knowledge Representation, Software Packages
Contains:
doc/ Knowledge Representation Information Files
systems/ Knowledge Representation Software Packages
See Also: ?
===========================================================================
Package: areas/kr/doc/
Name:
Summary: Knowledge Representation Information Files
Version:
Description:
This directory contains materials concerning knowledge representation.
kqml.txt Information about KQML (Knowledge Query
and Manipulation Language), a protocol for
exchanging information and knowledge.
===========================================================================
Topic: areas/kr/systems/
Summary: Knowledge Representation Software Packages
Description:
This directory contains software concerning knowledge representation
and related topics, including Semantic Nets, Frames, and KL-One.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Knowledge Representation
Contains:
colab/ COLAB: Knowledge Representation and Compilation Laboratory
frames/ Frame Systems
kl_one/ KL-ONE Family of Knowledge Representation Systems
knowbel/ KNOWBEL: Telos temporal/sorted logic system
ontic/ ONTIC: Sequent Based High Level Proof System
rhet/ RHETORICAL: Rochester Knowledge Tools Distribution
sneps/ SNePS: Semantic Network Processing System
uranus/ URANUS: Logic-Based Knowledge Representation Language
See Also: ?
===========================================================================
Package: areas/kr/systems/colab/
Name: COLAB
Summary: Knowledge Representation and Compilation Laboratory
Version:
Description:
This directory contains the COmpilation LABoratory (COLAB).
COLAB is a hybrid knowledge representation system emphasizing the
horizontal and vertical compilation of knowledge bases. It has been
designed as a COmpilation LABoratory aiming at a synergetic
collaboration of different knowledge representation and reasoning
formalisms. It is comprised of subsystems dealing with different
kinds of knowledge and that can also be used as stand-alone systems.
The COLAB representation architecture splits into two main parts, an
affirmative part, sometimes also called `assertional', and a taxonomic
part.
The affirmative part provides efficient reasoning with different kinds
of relational or functional knowledge using tailored inference
engines. For affirmative knowledge represented as constraint nets
COLAB supplies constraint propagation techniques (CONTAX). Relational
knowledge in the form of Horn rules is processed by forward (FORWARD)
and backward (RELFUN) chaining. The backward component is also suited
for expressing (non-deterministic) functional dependencies. Taxonomic
knowledge is represented by intensional concept definitions which are
automatically arranged in a subsumption hierarchy (TAXON). Dynamic
cooperation of the subsystems is organized through access primitives
providing an interface to the respective reasoning services.
COLAB is a piece of research software developed at DFKI and the
University of Kaiserslautern.
COLAB involves 4 subsystems:
+ RELFUN is a logic-programming language with call-by-value
(eager), non-deterministic, non-ground functions, and
higher-order operations [Boley92b].
SHORT DESCRIPTION: Operational (interpreter in pure LISP), procedural
(SLV-resolution), fixpoint, and model-theoretic semantics [Boley92c].
Interpreter for full RELFUN; WAM emulator for fixed-arity subset.
Layered compiler system, from source-to-source transformers to
declarative classifier, to WAM-code generator [Boley90a]. Translator
to relational subset of RELFUN, henceforth to PROLOG. Accepting
freely interchangeable LISP-style and PROLOG-style syntaxes. Tracer
for valued conjunctions; interface to LISP; on-line help. Prelude
with useful relations/functions; library of declarative hypergraph
operations [Boley92a]; components for mechanical-engineering system
using declarative geometry [BoleyHanschke+91b]. Tight (WAM-level)
coupling with FORWARD.
+ TAXON is a terminological knowledge representation system extended by
concrete domains [BaaderHanschke91b,Hanschke92b].
SHORT DESCRIPTION: Comprises a T-box and an A-box formalism for
representing terminological and assertional knowledge. The T-box
provides expressive concept forming operators, in particular for
specifying role/attribute interaction. The TAXON A-box can
instantiate concepts, roles, etc. All reasoning services (e.g.,
classification, realization) are implemented by terminating, sound
and complete algorithms. A concrete domain of rational numbers with
comparison operators is tightly coupled with the abstract
terminological formalism. Can compute the domain hierarchy for
CONTAX.
+ CONTAX is a constraint system for weighted constraints over
hierarchically structured finite domains.
SHORT DESCRIPTION: The CONTAX system supports primitive
(extensional), compound (conjunctive), disjunctive and predicative
constraints. Constraint instances are connected by variables that
range over specific domains which can be plain or hierarchically
structured. Hierarchical domains can be defined in CONTAX itself or
by using the classifier of TAXON. Intervals regarded as subdomains of
integers are also supported. All constraints are given a weight (from
a discrete set ranging from 'hard' to 'soft') that is used by CONTAX
for relaxation of overspecified problems. Besides being integrated
in COLAB, there also exists a stand-alone version of CONTAX with a
programmer interface to LISP [MeyerSteinle92] that enables any
LISP-based application to use CONTAX as its own constraint-reasoning
formalism. The CONTAX system has already been used to formalize the
tool selection problem in a CIM application [Meyer92a,Meyer92b].
+ FORWARD is a logic programming language with bottom-up and top-down
evaluation of Horn clauses [HarmHinkelmann+92].
SHORT DESCRIPTION: User-specifiable division of Horn clauses for
bottom-up, top-down and bidirectional reasoning. Semi-naive
bottom-up evaluation with top-down provable premises. Generalized
Magic-Set transformation for goal-directed bottom-up reasoning,
supporting conjunctive queries and considering top-down premises. An
interpreter version is available, there is also an abstract machine,
which will be available in the near future. Simulation of forward
chaining in a backward chaining system by rule transformation.
Compilation into a WAM with special forward code area and additional
so-called retain stack for derived facts. Upside-down
meta-interpreter in RELFUN for forward chaining, partial evaluation
of the meta-interpreter. Tight coupling with the RELFUN system on
interpreter-level and WAM-level. A tight integration of the
semi-naive strategy with the TAXON system is currently under
development.
Other subsystems used in COLAB include
- GAMA (General Abstract Machine Assembler)
- NyWAM (WAM emulator in Common Lisp)
===========================================================================
Topic: areas/kr/systems/frames/
Summary: Frame Systems
Description:
This directory contains software concerning frame systems.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Frame Systems, Knowledge Representation
Contains:
doc/ Documentation about Frame Systems
framewrk/ FrameWork: Generic Frame System
frl/ FRL: Frame Representation Language
frobs/ FROBS: Object-oriented frame language for Common Lisp
kr/ KR: Kernel Knowledge Representation System
parmenid/ Parmenides: Frame-based knowledge representation system.
See Also: ?
===========================================================================
Package: areas/kr/systems/frames/doc/
Name:
Summary: Documentation about Frame Systems
Version:
Description:
This directory contains documentation related to frame systems.
frameref.txt List of References about Frame KR.
framesys.txt Old list of Frame Systems; superseded by AI FAQ.
===========================================================================
Package: areas/kr/systems/frames/framewrk/
Name: FrameWork
Summary: Generic Frame System
Version: 2.1 (18-MAR-93)
Description:
FrameWork is a Common Lisp portable frame-based knowledge
representation language. It combines some of the better features of a
variety of other frame languages. It includes a variety of tools for
building, examining, and using knowledge-based systems. It is
intended primarily to be a solid example of how such a system could be
built. FrameWork is easily extended.
Features include generic demons (active values) & procedural
attachment, object-oriented programming with attribute and behavior
inheritance in an associative network (methods and message passing),
cached values, default values, listener, object database maintenance
utilities.
===========================================================================
Package: areas/kr/systems/frames/frl/
Name: FRL
Summary: Frame Representation Language
Version:
Description:
This directory contains the Frame Representation Language (FRL).
Examples include a simple ATN parser, Towers of Hanoi, match function,
and the FRAMISH language.
===========================================================================
Package: areas/kr/systems/frames/frobs/
Name: FROBS
Summary: Object-oriented frame language for Common Lisp
Version: 1.2 (2-AUG-88)
Description:
FROBS is a merger between frames and objects. It is implemented in
Common Lisp and provides an object-oriented language as well as frame
type operations and a forward chaining rule system. The rule system
translates rule definitions into functions which can then be compiled
by the native Common Lisp compiler.
The frobs-doc.l file is something that someone else did to add
documentation strings to FROBS. It is not something that we load
automatically, so is separate. Having it be a separate file is fine.
It is not a document describing FROBS or FROLIC, which are in the tar
files as frobs.ps and prolog.ps.
===========================================================================
Package: areas/kr/systems/frames/kr/
Name: KR
Summary: Kernel Knowledge Representation System
Version:
Description:
This directory contains KR, a kernel knowledge representation
system. Unlike other systems, KR implements a small, carefully
selected amount of functionality in order to keep performance within
reasonable limits.
===========================================================================
Package: areas/kr/systems/frames/parmenid/
Name: Parmenides
Summary: Frame-based knowledge representation system.
Version: 1.5 (22-APR-91)
Description:
PARMENIDES (PropagAting, Rulekit-Motivated ENgine for Instance
DEScriptions) is a frame-based knowledge representation system. It is
influenced by SRL, Framekit, CommonLoops, and the Spice lisp structure
implementation. The slot and facet access functions have comparable
speed to the Slisp slot access functions. It has some of the Framekit
and SRL functionality, such as facets, demons, and user-defined
relations. However, like Loops, it makes a distinction between
classes and instances. This means that instances can only be an
instance of one class, while classes may be subclasses of (have an
is-a relation with) more than one class. Instances may not have any
slots that their classes don't have. Classes describe a way to make
instances, and instances only participate in the frame network through
their classes. Parmenides is implemented in Common Lisp. Other
features of Parmenides include multiple language messages and
user-defined relations.
Parmenides is used by FRulekit, a CommonLisp frame-based RETE
production system.
===========================================================================
Topic: areas/kr/systems/kl_one/
Summary: KL-ONE Family of Knowledge Representation Systems
Description:
This directory contains the KL-ONE family of knowledge
representation systems.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
KL-ONE, Knowledge Representation
Contains:
back/ BACK: Berlin Advanced Computational Knowledge Representation
System
cec/ CEC: Conditional Equational Completion
dp/ DP: Solving Propositional Satisfiability Problems
motel/ MOTEL: Modal KL-ONE
See Also: ?
===========================================================================
Package: areas/kr/systems/kl_one/back/
Name: BACK
Summary: Berlin Advanced Computational Knowledge Representation System
Version: 5.2 (September 1993)
Description:
BACK supports reasoning based on terminological logics (KL-ONE),
supporting inheritance, consistency checking, cycle detection,
classification, completion of partial descriptions, role inferences,
abox revision, and extended query answering. The main system
components are TBox (KB scheme), ABox (KB assertions), IBox
(extensional implications), and the uniform access language.
The system is currently being re-implemented in C++. (NSL, 57-59 rue
Lhomond, F-75005 Paris; e-mail: back@nsl.fr).
===========================================================================
Package: areas/kr/systems/kl_one/cec/
Name: CEC
Summary: Conditional Equational Completion
Version: 1.9 (16-SEP-91)
Description:
CEC is a rewrite rule laboratory for order-sorted specifications with
conditional equations. The major module of CEC is a powerful
completion procedure for conditional equations.
===========================================================================
Package: areas/kr/systems/kl_one/dp/
Name: DP
Summary: Solving Propositional Satisfiability Problems
Version: 02.1 (1-JUL-93)
Description:
This directory contains DP, an implementation of the well known
Davis Putnam procedure for solving propositional satisfiability
problems.
===========================================================================
Package: areas/kr/systems/kl_one/motel/
Name: MOTEL
Summary: Modal KL-ONE
Version: 10-AUG-93
Description:
MOTEL is a logic-based knowledge representation language of the KL-ONE
family. It contains as a kernel the ALC language which is a decidable
sublanguage of first-order predicate logic.
Whereas ALC is a single-agent knowledge representation language, i.e.
ALC is only able to represent general world knowledge or the knowledge
of one agent about the world, MOTEL is a multi-agent knowledge
representation system. The MOTEL language allows modal contexts and
modal concept forming operators which allow to represent and reason
about the believes and wishes of multiple agents. Furthermore it is
possible to represent defaults and stereotypes.
Beside the basic reasoning facilities for consistency checking,
classification, and realization, MOTEL provides an abductive inference
mechanism. Furthermore it is able to give explanations for its
inferences.
===========================================================================
Package: areas/kr/systems/knowbel/
Name: KNOWBEL
Summary: Telos temporal/sorted logic system
Version: KNOWBEL (26-JUN-91); MANUAL (6-FEB-92)
Description:
KNOWBEL is a Common Lisp implementation of the Telos Knowledge
Representation Language. This includes a frame-based object language
with inheritance, a resolution theorem prover, and a temporal
reasoner.
KNOWBEL is no longer actively being worked on so support will be
minimal.
===========================================================================
Package: areas/kr/systems/ontic/
Name: ONTIC
Summary: Sequent Based High Level Proof System
Version: 11.5
Description:
This directory contains ONTIC, a sequent based high level proof system.
Ontic is an integrated system for the development and manipulation of
technical information, such as abstract mathematical concepts and
theorems, formal system specifications, system implementations, and
system verifications. The Ontic language is a simple generalization of
strongly typed functional programming languages like ML and the typed
lambda-calculus.
===========================================================================
Topic: areas/kr/systems/rhet/
Name: RHETORICAL
Summary: Rochester Knowledge Tools Distribution
Version: 26-MAY-93
Description:
This directory contains the knowledge tools distribution as maintained
by the University of Rochester Computer Science Dept. RHETORICAL is
a planning and knowledge tool.
===========================================================================
Package: areas/kr/systems/rhet/cl_lib/
Name: CL-LIB
Summary: Common Lisp Library
Version: 3.89 (26-MAY-94)
Description:
Library of snippets of Lisp code needed for the rest of the Rhet
system.
===========================================================================
Package: areas/kr/systems/rhet/doc/
Name:
Summary: Papers and other RHET documentation.
Version:
Description:
This directory papers and reports about RHET.
===========================================================================
Package: areas/kr/systems/rhet/rhet/
Name: RHETORICAL
Summary: RHET Knowledge Representation System
Version: 21.30 (31-MAY-94)
Description:
This directory contains the knowledge tools distribution as maintained
by the University of Rochester Computer Science Dept. RHETORICAL is
a planning and knowledge tool.
This is a Knowledge Representation system based on concepts proved
with HORNE, and follow James Allen's grand design for KR following his
publications (in particular, see his book with Pelavin and Kautz). It
includes 2 major modes for representing knowledge (as Horn Clauses or
as frames), which are interchangable; a type subsystem for typed and
type restricted objects (including variables); E-unification;
negation; forward and backward chaining; complete proofs (prove,
disprove, find the KB inconsistent, or claim a goal is neither
provable nor disprovable); contextual reasoning; truth maintenance;
intelligent backtracking; full LISP compatibility (can call or be
called by lisp); upward compatible with HORNE; Allen & Koomen's TEMPOS
time interval reasoning subsystem; frames have KL-1 type features,
plus arbitrary predicate restrictions on slots within a frame as well
as default values for slots; separate subsystem providing
user-interface facilities and ZMACS interface on the lispms.
RHET is currently being rewritten into a new system called Shocker.
===========================================================================
Package: areas/kr/systems/rhet/rprs/
Name: RPRS
Summary: Plan Recognition/System Demo
Version: 3.3 (13-MAY-93)
Description:
RPRS is a plan recognition system for RHET.
===========================================================================
Package: areas/kr/systems/rhet/time/
Name: TimeLogic and Tempos
Summary: Time reasoning system.
Version: Tempos 3.12, TimeLogic 5.1
Description:
TIMELOGIC and TEMPOS add James Allen's interval logic to Rhet.
The TimeLogic system is an interval-based forward chaining inference
engine and database manager of temporal constraints. Relational
constraints, indicating relative order between intervals, are based on
Allen's interval logic. The TimeLogic system also supports durational
constraints, indicating relative magnitude between intervals, and
reference links, used for the explicit or automatic construction of
interval hierarchies. Constraints are posed and propagated in
user-defined contexts with inheritance. Supports relative metric
constraints but no absolute dates or times.
===========================================================================
Package: areas/kr/systems/sneps/
Name: SNePS
Summary: Semantic Network Processing System
Version: 2.1 rel 1-400
Description:
SNePS (Semantic Network Processing System) is the implementation of a
fully intensional theory of propositional knowledge representation and
reasoning. SNePS includes a module for creating and accessing
propositional semantic networks, path-based inference, node-based
inference based on SWM (a relevance logic with quantification) that
uses natural deduction and can deal with recursive rules, forward,
backward and bi-directional inference, nonstandard logical connectives
and quantifiers, an assumption based TMS for belief revision (SNeBR), a
morphological analyzer and a generalized ATN (GATN) parser for parsing
and generating natural language, SNePSLOG, a predicate-logic-style
interface to SNePS, XGinseng, an X-based graphics interface for
displaying, creating and editing SNePS networks, SNACTor, a
preliminary version of the SNePS Acting component, and SNIP 2.2, a new
implementation of the SNePS Inference Package that uses rule shadowing
and knowledge migration to speed up inference. SNeRE (the SNePS
Rational Engine), which is part of Deepak Kumar's dissertation about
the integration of inference and acting, will replace the current
implementation of SNACTor.
Note: The bib.tgz and manual.pgz files are already included in the
release; they're there in case you don't want to unpack the entire
release just to get the bibliography and manual.
===========================================================================
Package: areas/kr/systems/uranus/
Name: URANUS
Summary: Logic-Based Knowledge Representation Language
Version: V-19.8 (13-OCT-93)
Description:
URANUS is a logic-based knowledge representation language. Uranus is
an extension of Prolog written in Common Lisp and using the syntax of
Lisp. Uranus extends Prolog with a multiple world mechanism for
knowledge representation and term descriptions to provide
functional programming within the framework of logic programming.
===========================================================================
Topic: areas/learning/
Summary: Machine Learning
Description:
This directory contains software and materials concerning machine learning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Machine Learning, Software Packages
Contains:
bib/ Machine Learning Bibliographies
database/ Machine Learning Databases
mail/ Machine Learning Mailing List Archives
systems/ Machine Learning Software Packages
See Also: ?
===========================================================================
Package: areas/learning/bib/
Name:
Summary: Machine Learning Bibliographies
Version:
Description:
This directory contains two BibTeX machine learning bibliographies,
both of which originate from the ILP ESPRIT project.
lrefs.bib BibTeX file developed by Luc de Raedt and Stephen
Muggleton for a Logic Programming Journal article
on ILP (around 325 entries).
ilp_book.bib BibTeX file, which Nada Lavrac created for the
forthcoming book "Inductive Logic Programming:
Techniques and Applications", published by Ellis
Horwood (around 200 entries).
id3.txt References about induction algorithms
===========================================================================
Topic: areas/learning/database/
Summary: Machine Learning Databases
Description:
This directory contains copies of machine learning databases and
benchmark data sets. These databases can be used to evaluate
machine learning algorithms.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Benchmark Data Sets, Machine Learning!Databases
Contains:
uci_mldb/ UCI Repository of Machine Learning Databases and Domain
Theories
See Also: ?
===========================================================================
Package: areas/learning/database/uci_mldb/
Name:
Summary: UCI Repository of Machine Learning Databases and Domain Theories
Version: 2-JUN-94
Description:
The UC/Irvine (UCI) Repository of Machine Learning Databases and
Domain Theories contains over 99 benchmark data sets for classifier
systems (30mb). These data sets have been or can be used to
evaluate learning algorithms.
Note: Three of the databases (the Ljubljana breast-cancer,
lymphography, and primary-tumor databases) have restricted access
and hence are not available by anonymous ftp. They are available to
individuals in academia upon request by contacting the UCI
Repository maintainers directly.
===========================================================================
Topic: areas/learning/mail/
Summary: Machine Learning Mailing List Archives
Description:
This directory contains archives for machine learning mailing lists.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Mail Archives!Machine Learning
Contains:
ml_list/ ML-List: Archives of the Machine Learning List
See Also: ?
===========================================================================
Package: areas/learning/mail/ml_list/
Name: ML-List
Summary: Archives of the Machine Learning List
Version: v1-v6n12
Description:
This directory contains archives for the ML-List mailing list.
The Machine Learning List is moderated. Contributions should be
relevant to the scientific study of machine learning.
===========================================================================
Topic: areas/learning/systems/
Summary: Machine Learning Software Packages
Description:
This directory contains machine learning software packages.
Origin: FTP repositories for machine learning include
ftp.ics.uci.edu:/pub/
cs.utexas.edu:/pub/mooney/
ftp.gmd.de:/gmd/mlt/ML-Program-Library/
ftp.gmd.de:/MachineLearning/
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Machine Learning
Contains:
accel/ ACCEL: Abduction
classweb/ CLASSWEB: Classit and Cobweb
focl/ FOCL: Expert System Shell and Machine Learning Program
foil/ FOIL: Produces Horn clauses from data expressed as relations.
golem/ GOLEM: Inductive learning algorithm
index/ INDEX: Experimental inductive data engineering system.
learn_pl/ Machine Learning Algorithms Implemented in Prolog
miles/ MILES: Flexible environment for tests with ILP methods.
mobal/ MOBAL: Knowledge Acquisition and Machine Learning System
occam/ Occam: Learning program that combines EBL and SBL
pebls/ PEBLS: Parallel Exemplar-Based Learning System
rwm/ RWM: Refinement With Macros
utexas/ Raymond Mooney's Machine Learning Collection
See Also: ?
===========================================================================
Package: areas/learning/systems/accel/
Name: ACCEL
Summary: Abduction
Version: 5-JUN092
Description:
Accel is an experimental system developed by Hwee Tou Ng as part of
his Ph.D. dissertation.
===========================================================================
Package: areas/learning/systems/classweb/
Name: CLASSWEB
Summary: Classit and Cobweb
Version: 2-FEB-90
Description:
This is an implementation of Classify (COBWEB/CLASSIT).
Classit/2 is built on top of Classweb, by adding an attention
mechanism.
===========================================================================
Package: areas/learning/systems/focl/
Name: FOCL
Summary: Expert System Shell and Machine Learning Program
Version: 2.1 (21-APR-94)
Description:
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.
The Macintosh version includes a graphical interface that displays the
search space explored by FOCL, so it is a useful pedagogical tool.
This application also contains a graphical interface for building rule
bases, so you can ignore the machine learning aspects, and use it as
an expert system shell with the following capabilities:
+ A backward-chaining rule interpreter.
+ A graphical rule and fact editor.
+ Graphical display of the rule base.
+ (Simple) Natural language explanation of inferences
+ Menu-based facilities for editing rules and adding natural language
translations to rules.
+ Optional typing of variables and checking the rule base for type
conflicts
+ Tracing of rules
+ Analysis of the accuracy of rules in a rule base.
Sample rule bases are included.
The Common Lisp source code is limited to portable source code for
the machine learning program only, since the interface depends on
the Macintosh.
===========================================================================
Topic: areas/learning/systems/foil/
Name: FOIL
Summary: Produces Horn clauses from data expressed as relations.
Description:
This directory includes several versions of Quinlan's FOIL (First
Order Inductive Learning) machine learning program.
===========================================================================
Package: areas/learning/systems/foil/foil2/
Name: FOIL2
Summary: Produces Horn clauses from data expressed as relations.
Version: 2.1
Description:
This directory contains version 2 of Quinlan's machine learning program.
===========================================================================
Package: areas/learning/systems/foil/foil4/
Name: FOIL4
Summary: Produces Horn clauses from data expressed as relations.
Version: 4.1 (10-MAY-93)
Description:
This directory contains version 4 of Quinlan's machine learning program.
===========================================================================
Package: areas/learning/systems/foil/foil5/
Name: FOIL5
Summary: Produces Horn clauses from data expressed as relations.
Version:
Description:
This directory includes version 5 of Quinlan's machine learning program.
===========================================================================
Package: areas/learning/systems/foil/foil6/
Name: FOIL6
Summary: Produces Horn clauses from data expressed as relations.
Version:
Description:
This directory contains version 6 of Quinlan's machine learning program.
===========================================================================
Package: areas/learning/systems/golem/
Name: GOLEM
Summary: Inductive learning algorithm
Version: August 1992 (22-JUL-93)
Description:
Golem is an ILP algorithm written by Stephen Muggleton.
===========================================================================
Package: areas/learning/systems/index/
Name: INDEX
Summary: Experimental inductive data engineering system.
Version: 1-FEB-94
Description:
This directory contains INDEX, an experimental system for inductive
data engineering.
===========================================================================
Topic: areas/learning/systems/learn_pl/
Summary: Machine Learning Algorithms Implemented in Prolog
Version: 9-FEB-94
Description:
In 1988 the Special Interest Group on Machine Learning of the German
Society for Computer Science (GI e.V.) decided to establish a library
of PROLOG implementations of Machine Learning algorithms. The library
includes - amongst others - PROLOG implementations of Winston's arch,
Becker's AQ-PROLOG, Fisher's COBWEB, Brazdil's generation of
discriminations from derivation trees, Quinlan's ID3, FOIL, IDT,
substitution matching, explanation based generalization, inverse
resolution, and Mitchell's version spaces algorithm. Most of the
algorithms are copyleft under the GNU General Public License.
They are also available by surface mail from Thomas Hoppe (see address
below). Files will be distributed via MS-DOS formated 3.5 inch floppy
(double, high and extra-high density), which should be included with
your request. You can also get them by sending an email message to
Thomas Hoppe.
Send additional PROLOG implementations of Machine Learning
Algorithms, complaints about them and detected bugs or problems
to Thomas Hoppe. Send suggestions and complaints about the ftp
library to Werner Emde.
The directory ftp.gmd.de:/MachineLearning/ contains additional
machine learning publications, data, and software, primarily related
to the European ESPRIT projects Machine Learning Toolbox (MLT) and
Inductive Logic Programming (ILP), the European Network of Excellence
in Machine Learning (MLnet) and the Inductive Logic Programming
Pan-European Scientific Network (ILPnet). It includes the source code
of Stephen Muggleton's and Cao Feng's GOLEM learning system (in
/MachineLearning/ILP/public/software/golem) and a BibTeX file with
around 325 entries of articles related to ILP (in
/MachineLearning/ILP/public/bib). For more information, send mail to
Marcus Luebbe .
===========================================================================
Package: areas/learning/systems/learn_pl/aq1/
Name: AQ-Prolog
Summary: Reimplementation of Michalski's AQ for attribute vectors
Version: 14-JAN-94
Description:
This directory contains Jeffrey M. Becker's AQ-PROLOG, a
reimplementation of Michalski's AQ for attribute vectors
===========================================================================
Package: areas/learning/systems/learn_pl/arch1/
Name: ARCH1
Summary: Winston's incremental learning procedure.
Version: 14-JAN-94
Description:
This directory contains ARCH1, Stefan Wrobel's implementation of
Winston's incremental learning procedure for structural descriptions.
===========================================================================
Package: areas/learning/systems/learn_pl/arch2/
Name: ARCH2
Summary: Winston's incremental learning procedure.
Version: 14-JAN-94
Description:
This directory contains ARCH2, Ivan Bratko's minimal implementation of
Winston's incremental learning procedure for structural descriptions.
This is a strong restricted version of Winston's incremental learning
procedure for structural descriptions. The following restrictions are
known:
- The first example must be positive.
- The implementation can handle only up to six objects.
- The list containing missing or extra descriptors of a concept
can contain only 3 descriptors.
===========================================================================
Package: areas/learning/systems/learn_pl/attdsc/
Name: ATTDSC
Summary: Bratko's simple algorithm for attributional descriptions.
Version: 14-JAN-94
Description:
This directory contains ATTDSC Ivan Bratko's simple algorithm for
learning attributional descriptions.
===========================================================================
Package: areas/learning/systems/learn_pl/cobweb/
Name: COBWEB
Summary: Gennari, Langley, and Fisher's incremental concept
formation algorithm.
Version: 14-JAN-94
Description:
This directory contains Joerg-Uwe Kietz's implementation of Fisher's
incremental concept formation algorithm. Several examples are included:
- Gennari, Langley and Fisher's rectangle classification example
- Fischer's animal classification example
- Gennari, Langley and Fischer's cell classification example
===========================================================================
Package: areas/learning/systems/learn_pl/discr/
Name: DISCR
Summary: Generation of discriminants from derivation trees.
Version: 14-JAN-94
Description:
Pavel Brazdil's generation of discriminants from derivation trees.
===========================================================================
Package: areas/learning/systems/learn_pl/ebg/
Name: EBG
Summary: Explanation Based Generalization
Version: 14-JAN-94
Description:
This directory contains implementations of different kinds of
Prolog meta-interpreters for Mitchell's explanation based
generalization and partial evaluation based on Kedar-Cabelli &
McCarty's idea.
===========================================================================
Package: areas/learning/systems/learn_pl/idt/
Name: IDT
Summary: Torgos ID3-like system based on the gain-ratio measure
Version: 9-FEB-94
Description:
This directory contains IDT, Luis Torgo's ID3-like program for
induction of decision trees based on the gain-ratio measure.
===========================================================================
Package: areas/learning/systems/learn_pl/invers/
Name: INVERS
Summary: Two versions of the two main operators for inverse resolution.
Version: 14-JAN-94
Description:
This directory contains INVERS, an implementation of Steven
Muggleton's absorption and intra-construction operators for inverse
resolution based on the representation change idea of Celine Rouveirol
and Jean-Francois Puget.
===========================================================================
Package: areas/learning/systems/learn_pl/logic/
Name:
Summary: Logic procedures that are useful for learning
Version: 14-JAN-94
Description:
This package contains several logic procedures that are useful for
learning, including: determination of substitutions, implies, Plotkin's
least general generalization, Buntine's generalized subsumption.
===========================================================================
Package: areas/learning/systems/learn_pl/multagnt/
Name: MULTAGNT
Summary: Brazdil's Simulation of a tutoring setting between two agents
Version: 14-JAN-94
Description:
This directory contains MULTAGNT, Yiu Cheung HO's implementation of
Brazdil's tutoring setting.
===========================================================================
Package: areas/learning/systems/learn_pl/vs/
Name:
Summary: Version Spaces
Version: 14-JAN-94
Description:
This directory contains Luc de Raeth's reimplementation of Mitchell's
version space algorithm. It learns conjunctions and constructs
examples for a simple attribute-valued generalization language.
===========================================================================
Package: areas/learning/systems/miles/
Name: MILES
Summary: Flexible environment for tests with ILP methods.
Version: January 1994
Description:
MILES is a flexible environment for tests with ILP methods and
operators.
===========================================================================
Package: areas/learning/systems/mobal/
Name: MOBAL
Summary: Knowledge Acquisition and Machine Learning System
Version: 3.0b
Description:
MOBAL is a system for developing operational models of application
domains in a first order logic representation. It integrates a manual
knowledge acquisition and inspection environment, an inference engine,
machine learning methods for automated knowledge acquisition, and a
knowledge revision tool. By using MOBAL's knowledge acquisition
environment, you can incrementally develop a model of your domain in
terms of logical facts and rules. You can inspect the knowledge you
have entered in text or graphics windows, augment the knowledge, or
change it at any time. The built-in inference engine can immediately
execute the rules you have entered to show you the consequences of
your inputs, or answer queries about the current knowledge. MOBAL also
builds a dynamic sort taxonomy from your inputs. If you wish, you can
use several machine learning methods to automatically discover
additional rules based on the facts that you have entered, or to form
new concepts. If there are contradictions in the knowledge base due to
incorrect rules or facts, there is a knowledge revision tool to help
you locate the problem and fix it.
MOBAL includes a graphical interface implemented using Tcl/TK.
Since the very first releases, MOBAL has been a kind of toolbox
offering different tools (including the Rule Discovery Tool RDT) to
support the modeling of domains. Now we have coupled MOBAL with some
other well known ILP systems. The new release contains interfaces to
and the code of following learning systems:
- FOIL 5 (J. Ross Quinlan),
- GOLEM (S. Muggleton and C. Feng),
- mFOIL (S. Dzeroski and I. Bratko),
- CILGG (J.-U. Kietz), and
- INCY (E. Sommer).
===========================================================================
Package: areas/learning/systems/occam/
Name: Occam
Summary: Learning program that combines EBL and SBL
Version: 12-NOV-91
Description:
Occam is a learning system that combines EBL and SBL. TalespinOccam
is a version of Occam that learns from the output of Meehan's
talespin.
===========================================================================
Package: areas/learning/systems/pebls/
Name: PEBLS
Summary: Parallel Exemplar-Based Learning System
Version: 2.1
Description:
PEBLS (Parallel Exemplar-Based Learning System) is a nearest-neighbor
learning system designed for applications where the instances have
symbolic feature values. PEBLS has been applied to the prediction of
protein secondary structure and to the identification of DNA promoter
sequences.
PEBLS incorporates a number of features intended to support
flexible experimentation in symbolic domains. We have provided
support for k-nearest neighbor learning, and the ability to choose
among different techniques for weighting both exemplars and individual
features. A number of post-processing techniques specific to the
domain of protein secondary structure have also been provided.
===========================================================================
Package: areas/learning/systems/rwm/
Name: RWM
Summary: Refinement With Macros
Version: 17-NOV-92
Description:
RWM (Refinement With Macros) is an interactive system for learning
problem solving strategies. RWM incorporates two techniques, namely
Refinement and Macro Generation. The input to the RWM is the definition
of a problem, the output is a strategy for solving the given problem.
A strategy is a sequence of subproblems which are easier then the original
problem, and when solved in the the given order it yields a solution
for the original problem.
===========================================================================
Topic: areas/learning/systems/utexas/
Summary: Raymond Mooney's Machine Learning Collection
Description:
This directory contains a copy of the machine learning programs and
publications made available by the machine learning group under
Raymond Mooney at UT-Austin.
There are four subdirectories:
course/ information and homeworks from a graduate course
in machine learning taught by Dr. Mooney. Homeworks
include "miniatures" of various machine learning
systems written in Common Lisp.
code/ Common Lisp code corresponding to the assignments
for the course in the course directory.
progs/ More "research-level" versions of inductive
classification algorithms and software for automated
experiments that generation learning curves that
compare several systems.
papers/ Publications produced by the machine learning
research group.
===========================================================================
Package: areas/learning/systems/utexas/code/
Name: ML-Code
Summary: Lisp Code for Assignments in Mooney's Machine Learning Course
Version:
Description:
This directory contains a copy of the Common Lisp code
corresponding to the assignments for the graduate course in machine
learning taught by Dr. Mooney.
The programs include:
1. AQ algorithms for learning from examples. Uses either beam
search with bounded stars or the version space algorithm to
compute stars.
2. BACKPROP.
3. COBWEB. Incremental conceptual clustering algorithm (with
soybean data).
4. DEDUCE. Prolog-like theorem prover or deductive retrieval
system. Uses generators to retrieve one answer at a time and
also generates proofs. Supports only backward chaining, with
optional depth bound on the number of rules.
5. EGGS. Explanation-Based Generalizer. EGGS can generalize the
proofs returned by DEDUCE and generate macro-rules from the
general proofs. These macro-rules are stored and preferentially
used in future deductions to increase performance.
6. EXPLORER. In the spirit of AM, but more limited. Explores a
space of concepts, guided by "interestingness" measures and
makes conjectures about the concepts it explores.
7. ID3 algorithm for learning from examples. Produces decision trees
discriminating positive and negative instances.
8. PERCEPTRON. Simple system for learning from examples
using the perceptron learning procedure to adjust a set of
weights on a single linear threshold unit until all of the
training examples are correctly classified.
9. VERSION-SPACE algorithm for incremental learning from examples.
===========================================================================
Package: areas/learning/systems/utexas/course/
Name: ML-Course
Summary: Homework Assignments in Mooney's Machine Learning Course
Version:
Description:
This directory contains a copy of the syllabus, handouts, and homework
assignments from the graduate course in machine learning taught by
Dr. Mooney. Homework assignments include "miniatures" of various
machine learning systems written in Common Lisp.
===========================================================================
Package: areas/learning/systems/utexas/neither/
Name: NEITHER
Summary: NEITHER Theory Refinement System
Version:
Description:
NEITHER, which stands for "New EITHER", is an extension of the EITHER
theory refinement system. Theory refinement systems are used to modify
a set of rules which are incomplete or incorrect. Given a set of
examples, the rules are refined until the rule base is consistent with
the examples. One example of the use of theory refinement is the
knowledge acquisition phase of expert system construction.
Specifically, it may be relatively simple to develop a set of rules to
cover most of a problem but difficult to generate a complete solution.
Often, additional examples can be generated easily and given with the
partially correct theory to a system like NEITHER. The result is an
improved set of rules.
===========================================================================
Package: areas/learning/systems/utexas/papers/
Name:
Summary: Publications of the UT-Austin Machine Learning Research Group
Version:
Description:
This directory contains publications produced by the machine learning
research group.
===========================================================================
Package: areas/learning/systems/utexas/progs/
Name: ML-Progs
Summary: More "Research-Level" Implementations of Learning Algorithms
Version:
Description:
This directory contains a copy of more "research-level" versions of
the inductive classification algorithms and software for automated
experiments that generate learning curves that compare several systems.
Programs include:
1. AQ
2. Bayes independent classification system.
3. CobWeb
4. DEDUCE
5. Extentron
6. FOIL (First Order Inductive Learning) in Lisp and Prolog
7. ID3
8. K-Nearest Neighbor Algorithm
9. Perceptron
10. Backprop
11. A dual propositional version of FOIL for learning CNF.
12. A propositional version of FOIL for learning DNF.
13. Functions for running statistical t-test on results of experiments.
===========================================================================
Topic: areas/misc/
Summary: Miscellaneous Unclassified AI Packages
Description:
This directory contains miscellaneous unclassified AI-related
software packages.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Miscellaneous AI, Software Packages
Contains:
faq/ Miscellaneous Frequently Asked Questions (FAQ) postings
qwertz/ QWERTZ Toolbox: AI Routines for Standard ML
symbmath/ SymbMath: Symbolic Calculator with Learning
See Also: ?
===========================================================================
Topic: areas/misc/faq/
Summary: Miscellaneous Frequently Asked Questions (FAQ) postings
Description:
A compendium of answers to frequently asked questions about
miscellaneous AI-related topics.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Answers, FAQ!Miscellaneous, Questions
Contains:
lit_prog/ Literate Programming FAQ: Frequently Asked Questions (FAQ)
posting for the comp.programming.literate newsgroup
oop/ OOP FAQ: Frequently Asked Questions (FAQ) posting for the
comp.object newsgroup
See Also: ?
===========================================================================
Package: areas/misc/faq/lit_prog/
Name: Literate Programming FAQ
Summary: Frequently Asked Questions (FAQ) posting for the
comp.programming.literate newsgroup
Version: 1.1.2
Description:
A compendium of answers to frequently asked questions about
Literate Programming. Posted monthly to the comp.programming.literate
newsgroup.
===========================================================================
Package: areas/misc/faq/oop/
Name: OOP FAQ
Summary: Frequently Asked Questions (FAQ) posting for the
comp.object newsgroup
Version: 1.0.5 (13-DEC-93)
Description:
A compendium of answers to frequently asked questions about
Object Oriented Programming. Posted monthly to the comp.object newsgroup.
===========================================================================
Package: areas/misc/qwertz/
Name: QWERTZ Toolbox
Summary: AI Routines for Standard ML
Version: 25-MAR-94
Description:
The QWERTZ toolbox is a library of Standard ML modules with an
emphasis on symbolic Artificial Intelligence programming, (including
implementations of heuristic search and an ATMS reason maintenance
system).
===========================================================================
Package: areas/misc/symbmath/
Name: SymbMath
Summary: Symbolic Calculator with Learning
Version: 3.1a
Description:
SymbMath (Symbolic Mathematics) is a computer algebra system that can
perform exact numeric, symbolic and graphic computation.
SymbMath can provide analytical and numeric answers for:
- Differentiation: regular or higher order, partial or total,
mixed and implicit differentiation, one-sided derivatives.
- Integration: indefinite or definite integration, multiple
integration, infinity as a bound, parametric or iterated
integration, line or surface integrals, discontinuous or
implicit integration.
- Solution of equations: roots of a polynomial, systems of
algebraic or differential equations.
- Manipulation of expressions: simplification, factoring or
expansion, substitution, evaluation.
- Calculation: exact and floating-point numeric computation
of integer, rational, real and complex numbers in the range
from minus to plus infinity, even with different units.
- Limits: real, complex or one-sided limits, indeterminate forms.
- Complex: calculation, functions, derivatives, integration.
- Sum and product: partial, finite or infinite.
- Others: series, lists, arrays, vectors, matrices, tables, etc.
Also included are:
- Plot: functions, polar, parametric, data, and list.
- Draw: lines, arcs, ellipse, circles, ovals.
- Auto-loaded library in the source code.
- Pull-down and pop-up menus, resizable and colorable windows.
- On-line help, and on-line manual.
- Procedural, conditional, iterational, recursive, functional,
rule-based, logic, pattern-matching and graphic programming.
- Database searching.
===========================================================================
Topic: areas/music/
Summary: Music
Description:
This directory contains AI-related music software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Music, Software Packages
Contains:
clm/ CLM: Common Lisp Music
cm/ CM: Common Music
cmn/ CMN: Common Music Notation
See Also: ?
===========================================================================
Package: areas/music/clm/
Name: CLM
Summary: Common Lisp Music
Version: 22-JUN-94
Description:
Common Lisp Music (CLM) is a software synthesis and signal
processing package (CL-MUSIC) and a package that makes it relatively
easy to take advantage of the Motorola DSP 56000 (CL-MUSIC-56).
===========================================================================
Package: areas/music/cm/
Name: CM
Summary: Common Music
Version: 11-MAY-94
Description:
Common Music is a music composition language written in Common Lisp
and CLOS that outputs music (directly or through scorefiles) to a
variety of synthesis packages, such as the Music Kit, Common Lisp
Music, MIDI, and CSound.
[Note: In the Common Music sources, there is a generic portable Lisp
Listener style interpreter that supports command dispatching in
addition to Lisp evaluation. It is the file ./utils/tl.lisp.]
libdsp.a is a special version of the DSP library for CM.
===========================================================================
Package: areas/music/cmn/
Name: CMN
Summary: Common Music Notation
Version: 10-MAY-94
Description:
Common Music Notation (CMN) is a western music notation package
based on Common Lisp, CLOS (pcl), PostScript, and the Adobe Sonata
font.
===========================================================================
Topic: areas/neural/
Summary: Neural Networks, Connectionist Systems, and Neural Systems
Description:
This directory contains neural networks, connectionist systems, and
neural systems software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Connectionist Systems, Neural Networks,
Neural Systems, Software Packages
Contains:
bench/ Neural Networks Benchmarks
cns/ CNS: Neural Networks Materials from the Central Neural Systems
BBS
doc/ Neural Networks Documentation
edu/ Educational Materials for Teaching/Learning Neural Networks
faq/ Neural Nets FAQ: Frequently Asked Questions (FAQ) postings for
comp.ai.neural-nets newsgroup
mail/ Mail archives for Neural Networks mailing lists.
systems/ Neural Networks, Connectionist Systems, and Neural Systems
util/ Neural Networks Utilities
See Also: ?
===========================================================================
Topic: areas/neural/bench/
Summary: Neural Networks Benchmarks
Description:
This directory contains benchmark data and code for neural networks
and machine learning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Benchmarks, Machine Learning!Benchmarks, Neural Networks!Benchmarks
Contains:
cmu/ Bench: CMU Neural Networks Benchmark Collection
parse/ Parse: Functions for parsing data files in the CMU Learning
Benchmark
tesauro/ Tesauro: Backgammon move-selection evaluation function for
benchmarking
See Also: ?
===========================================================================
Package: areas/neural/bench/cmu/
Name: Bench
Summary: CMU Neural Networks Benchmark Collection
Version:
Description:
This directory contains the CMU Neural Networks Benchmark Collection.
All the benchmark data sets are in a standardized format. The data
sets include the NETtalk data, speaker-independent recognition of
vowels, N-input parity, prediction of secondary structure of proteins,
classification of sonar signals, distinction of a twin spiral pattern,
and the traditional XOR task.
===========================================================================
Package: areas/neural/bench/parse/
Name: Parse
Summary: Functions for parsing data files in the CMU Learning Benchmark
Version: 1.0.4 (20-FEB-94)
Description:
This directory contains two functions for the parsing of data files in
the CMU Learning Benchmark format. Given the name of the data file,
information on how to deal with enumerations, and a data structure,
the parse procedure will build the data structure and fill it with
information on how to build the network. A function is also provided
to destroy this data structure.
===========================================================================
Package: areas/neural/bench/tesauro/
Name: Tesauro
Summary: Backgammon move-selection evaluation function for benchmarking
Version:
Description:
This directory contains a backgammon move-selection evaluation
function for benchmark comparisons written by Gerry Tesauro.
===========================================================================
Package: areas/neural/cns/
Name: CNS
Summary: Neural Networks Materials from the Central Neural Systems BBS
Version:
Description:
This directory contains neural networks materials from the Central
Neural Systems BBS. We've deleted some obsolete files, files which
are duplicated elsewhere in the AI Repository, and files whose
copyright restrictions prevent their inclusion in this repository.
We intend to eventually merge these files into the rest of the
repository, complete with 0.doc index files. For now, however, this
single 0.doc file will have to do. See the index.txt file for an index
to the contents of this directory.
===========================================================================
Topic: areas/neural/doc/
Summary: Neural Networks Documentation
Description:
This directory contains documents such as bibliographies,
introductions, and notes about neural networks, connectionist systems,
and neural systems.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Connectionist Systems!Documentation, Machine Learning!Neural Networks,
Neural Networks!Documentation, Neural Systems!Documentation
Contains:
bib/ Neural Networks Bibliographies
notes/ Neural Networks Notes
See Also: ?
===========================================================================
Package: areas/neural/doc/bib/
Name:
Summary: Neural Networks Bibliographies
Version:
Description:
This directory contains bibliographies of work on neural networks,
connectionist systems, and neural systems.
The bibliographies include
nnmanuf.ref Neural Networks in Manufacturing, compiled by
Stefan Korn
stocks.txt Forecasting Stock Prices with Neural Networks
nn_ga.ref Bibliography of work relating Neural Networks
with genetic search and artificial life.
pca.tgz Principal Component Analysis Neural Networks
dendrite.hut.fi:/pub/ref/ (Wang)
ftp.ai.mit.edu:/pub/sanger-papers/pca.bib (Sanger)
===========================================================================
Package: areas/neural/doc/notes/
Name:
Summary: Neural Networks Notes
Version:
Description:
This directory contains notes and information about neural networks,
connectionist systems, and neural systems.
The files include
nn_ftp.txt A list of ftp sites of Neural Networks materials.
patents.txt A list of patents dealing with Neural Networks
whos_who.txt A list of people doing research in Neural Networks
nn_com.txt A list of commercial neural network software
packages for the IBM PC
===========================================================================
Topic: areas/neural/edu/
Summary: Educational Materials for Teaching/Learning Neural Networks
Description:
This directory contains materials for teaching neural networks,
such as syllabi, problem sets, lecture notes, etc.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Connectionist Systems, Lecture Notes!Neural Networks,
Machine Learning!Neural Networks, Neural Networks!Teaching Materials,
Problem Sets!Neural Networks, Teaching Materials!Neural Networks
Contains:
15_882a/ 15-882A: CMU's Introduction to Artificial Neural Networks
See Also: ?
===========================================================================
Package: areas/neural/edu/15_882a/
Name: 15-882A
Summary: CMU's Introduction to Artificial Neural Networks
Version: Fall 1993
Description:
This directory contains some of the materials for CMU's graduate
course 15-882A, "Introduction to Artificial Neural Networks". Some
materials have been excluded due to copyright restrictions (e.g.,
the PDP simulator).
There is some software included with the handouts and syllabus:
backprop.lisp A direct implementation of the backpropagation
learning algorithm of Rumelhart, Hinton, and
Williams, for networks with a single hidden
layer. Written by David Touretzky, July 1991.
backprop.c Backpropagation algorithm for training a
fully-connected MLP neural network with 1 layer
of hidden units. Ported to C from backprop.lisp by
Justin Boyan, 5-OCT-93.
perceptron.lisp A simple-minded simulator for two-input perceptrons.
Written by David Touretzky, January 1990.
perceptron.c A simple-minded simulator for 2 bool input to
1 bool output perceptrons. Ported to C from
perceptron.lisp by Justin Boyan, September 1993.
qpole.c Q-learning to solve the cart-pole problem.
Written by Rich Sutton, Chuck Anderson, and
Claude Sammut.
===========================================================================
Package: areas/neural/faq/
Name: Neural Nets FAQ
Summary: Frequently Asked Questions (FAQ) postings for
comp.ai.neural-nets newsgroup
Version:
Description:
A compendium of answers to frequently asked questions about Neural
Networks and related topics. Posted monthly to the comp.ai.neural-nets
newsgroup.
===========================================================================
Topic: areas/neural/mail/
Summary: Mail archives for Neural Networks mailing lists.
Description:
This directory contains the archives of various neural networks
mailing lists.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Machine Learning!Neural Networks, Mail Archives!Neural Networks,
Neural Networks!Mail Archives
Contains:
connect/ Mail archives for the Connectionists mailing list.
neuron/ Mail archives for the Neuron Digest mailing list.
See Also: ?
===========================================================================
Package: areas/neural/mail/connect/
Name:
Summary: Mail archives for the Connectionists mailing list.
Version: 1988-1994n05
Description:
This directory contains the archives of the Connectionists mailing list.
This is a restricted mailing list for discussion of technical
issues relating to neural computation, and for dissemination of
information directly relevant to researchers in the field. Membership
is restricted to students and faculty who are actively involved in
connectionist research.
===========================================================================
Package: areas/neural/mail/neuron/
Name:
Summary: Mail archives for the Neuron Digest mailing list.
Version: v1 -- v13n34
Description:
This directory contains the archives of the Neuron Digest
mailing list.
Neuron-Digest is a moderated list (in digest form) dealing with all
aspects of neural networks (and any type of network or neuromorphic
system). Topics include both connectionist models (artificial neural
networks) and biological systems ("wetware"). The digest is posted to
comp.ai.neural-nets.
===========================================================================
Topic: areas/neural/systems/
Summary: Neural Networks, Connectionist Systems, and Neural Systems
Description:
This directory contains neural networks, connectionist systems, and
neural systems software.
Origin: FTP sites for neural networks include
ftp.cs.cmu.edu:/afs/cs.cmu.edu/project/connect/code/
funic.funet.fi:/pub/sci/neural/ [128.214.6.100]
archive.cis.ohio-state.edu:/pub/neuroprose/ [128.146.8.52]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Connectionist Systems, Neural Networks, Neural Systems
Contains:
animator/ HYPERPLANE ANIMATOR: Graphical display of backpropagation
training data and weights
anncam/ ANNCAM: Content-Addressable Memory Neural Network Simulator
ansil/ ANSIL: Advanced Network Simulator in Lisp
art/ ART: Implementations of ART-1 and ART-2 Neural Networks
atree/ ALN: Atree Adaptive Logic Network Simulation Package
backprop/ BACKPROP: Backpropagation Simulators
bam/ BAM: Bidirectional Associative Memory Simulation
blue/ Blue: Backpropagation and Conjugate Gradient programs in
Fortran
bp/ BP: BackProp simulator for the PC
bpnn/ BPNN: BackPropagation Neural Network Engine
bps/ BPS: Backpropagation Simulation Package
brain/ THE BRAIN: Neural Network (Backpropagation) Simulator for MSDOS
cascor/ CASCOR: Lisp and C implementations of Cascade Correlation
cmac/ CMAC: Cerebellar Model Articulation Controller
cog/ COG: Cognitron Simulation Program
condela/ CONDELA III: Neural Network Definition Language
dartnet/ DartNet: Neural Network Simulator with a nice graphical
interface.
datarep/ DATAREP: Representing Data in Neural Nets
et/ ET: Perceptron Simulator
flight/ Flight: A neural network that learns to fly.
gatordem/ Propagator: Demo version of a backpropagation neural network
simulator
gradsim/ GRADSIM: Connectionist Network Optimization Package
hopfield/ Hopfield: Traveling Salesman Problem
ics/ ICS: Hopfield Networks and Backpropagation
mactivat/ Mactivation
matrix/ Matrix: C++ Matrix class with backpropagation example
mbp/ MBP: Matrix Backpropagation Package
mume/ MUME: Multi-Module Neural Computing Environment
nasanets/ NASA NETS: Backpropagation Neural Networks System
neocog/ NeoCognitron: Neural Network Simulator
nerves/ NERVES: Nervous System Construction Kit
netstuff/ Netstuff: From 'A Practical Guide to Neural Networks'
neudl/ NeuDL: Neural-Network Description Language
neural/ SLUG: Backpropagation neural network for Windows 3.1
neuronc/ NeuronC: Biophysically-Based Compartmental Simulator
nevprop/ NevProp: General purpose backpropagation in C.
newton/ Newton: Demonstrations of backpropagation neural networks.
nn/ NN: Backpropagation and Perceptrons
nndt/ NNDT: A Neural Network Tool for Windows
nnetdraw/ NNETDRAW: Short Course on Neural Networks
nns/ NNS: Neural Network Simulator with 256 Neurons
nnutl/ NNUTL: C source library/tutorial for neural networks
percept/ PERCEPT: Implementation of a perceptron
planet/ PlaNet: Neural network simulator.
qprop/ Quickprop: Backpropagation variation in Lisp, Scheme, and C
rcc/ RCC: Recurrent Cascade-Correlation Learning Algorithm in Lisp
and C
rcs/ RCS: Rochester Connectionist Simulator
rns/ RNS: Recurrent Network Simulator
sciam/ SCIAM: Neural network simulator kernel
simul/ NN-Simulator: Flexible and User-Friendly Neural Network
Simulator
snns/ SNNS: Stuttgart Neural Network Simulator
som_lvq/ LVQ_PAK and SOM_PAK: Classification of data using
self-organizing memory networks.
suzy/ SUZY: Neural Network Classifier System for PCs
tcs/ TCS: Tasmanian Connectionist Simulator
thnet/ THNET: THinkNet connectionist software
tooldiag/ ToolDiag: Feature selection software for improving classifiers.
topmap/ TOPMAP: Kohonen topology preserving maps in Pascal
utexas/ Neural network code from the University of Texas.
winnn/ WinNN: Windows Neural Networks
xerion/ XERION: Neural network simulator
xpp/ XPP: Analysis and Simulation of Dynamic and Probabilistic
Phenomena
See Also: ?
===========================================================================
Package: areas/neural/systems/animator/
Name: HYPERPLANE ANIMATOR
Summary: Graphical display of backpropagation training data and weights
Version: 1.01 (10-OCT-93)
Description:
The HYPERPLANE ANIMATOR is a program that allows convenient graphical
display of the training data and weights in a back-propagation neural
network. As learning progresses and the weights in a neural net
alter, the hyperplane positions move. At the end of the training they
are in positions that roughly divide training data into partitions,
each of which contains only one class of data. Observations of
hyperplane movement can yield valuable insights into neural network
learning. The system currently animates only hyperplanes
representing input-to-hidden weights.
===========================================================================
Package: areas/neural/systems/anncam/
Name: ANNCAM
Summary: Content-Addressable Memory Neural Network Simulator
Version: 03-JAN-91
Description:
This directory contains a simulation of a simple stable state
content addressable memory neural network.
===========================================================================
Package: areas/neural/systems/ansil/
Name: ANSIL
Summary: Advanced Network Simulator in Lisp
Version: 2.02
Description:
ANSIL (Advanced Network Simulator in Lisp) is a neural network
simulator written in Lisp. It simulates a kind of neural network
known as a RAAM (Recursive Auto-Associative Memory). RAAMs are
built using a matrix implementation of backpropagation. The Matrix
Backprop Package (MBP), in turn, is built upon a nice set of linear
algebra routines written in Lisp (and C).
===========================================================================
Topic: areas/neural/systems/art/
Name: ART
Summary: Implementations of ART-1 and ART-2 Neural Networks
Description:
This directory contains several implementations of ART1 and ART2
Neural Networks. Adaptive Resonance Theory (ART) networks, as
proposed by Carpenter and Grossberg, form clusters and are trained
without supervision.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
ART-1, ART-2, Adaptive Resonance Theory, Carpenter, Classification,
Clustering, Grossberg, Machine Learning!Neural Networks,
Neural Networks!Simulators
Contains:
art1/ ART-1: Simulation of ART-1 Neural Networks
art2/ ART-2: Simulation of ART-2 Neural Networks
next/ Implementation of ART-2 Neural Networks for NeXTStep
See Also: ?
===========================================================================
Package: areas/neural/systems/art/art1/
Name: ART-1
Summary: Simulation of ART-1 Neural Networks
Version: ART-1 (18-MAY-91)
Description:
This directory contains a simulation of ART-1 Neural Networks.
Adaptive Resonance Theory (ART) networks, as proposed by Carpenter
and Grossberg, form clusters and are trained without supervision.
===========================================================================
Package: areas/neural/systems/art/art2/
Name: ART-2
Summary: Simulation of ART-2 Neural Networks
Version: 2-JUL-92
Description:
This directory contains two implementations of ART-2 Neural
Networks. They were written by students of Stephen Grossberg in a
programming laboratory (CN550). The file gaudiano.tgz contains what
seems to be a more up to date version of the implementation included
in art2.tgz.
Adaptive Resonance Theory (ART) networks, as proposed by Carpenter
and Grossberg, form clusters and are trained without supervision.
===========================================================================
Package: areas/neural/systems/art/next/
Name:
Summary: Implementation of ART-2 Neural Networks for NeXTStep
Version: 1.1 (12-AUG-93)
Description:
This directory contains a NeXTStep application for simulating an
ART-2 network with a modification for distributed classification.
Adaptive Resonance Theory (ART) networks, as proposed by Carpenter
and Grossberg, form clusters and are trained without supervision.
===========================================================================
Package: areas/neural/systems/atree/
Name: ALN
Summary: Atree Adaptive Logic Network Simulation Package
Version: 2.7 (IBM PC), 2.0 (UNIX)
Description:
Atree Adaptive Logic Network (ALN) is a neural network simulation package.
It includes an impressive OCR demo.
If interested in the commercial version, contact Dendronic
Decisions Limited, 3624 - 108 Street, Edmonton, Alberta,
Canada, T6J 1B4, phone (403) 438 8285.
===========================================================================
Package: areas/neural/systems/backprop/
Name: BACKPROP
Summary: Backpropagation Simulators
Version: 17-SEP-90
Description:
This directory contains programs for experimenting with
backpropagation, from Tveter's book "The Basis of Artificial
Intelligence" (Computer Science Press, 1990).
===========================================================================
Package: areas/neural/systems/bam/
Name: BAM
Summary: Bidirectional Associative Memory Simulation
Version: 13-MAY-90
Description:
This directory contains BAM, a simulation of bidirectional
associative memory.
===========================================================================
Package: areas/neural/systems/blue/
Name: Blue
Summary: Backpropagation and Conjugate Gradient programs in Fortran
Version: 21-JUN-93
Description:
This directory contains the backpropagation (bp) and conjugate
gradient (cg) programs written by James Blue. Both programs train and
test standard "3-layer" fully-connected feed-forward networks and are
written in Fortran using the Ratfor preprocessor.
===========================================================================
Package: areas/neural/systems/bp/
Name: BP
Summary: BackProp simulator for the PC
Version: 1.4 (21-DEC-92)
Description:
BP is a PC-based backpropagation simulator. BP lets you design
small nets with the mouse. It is suitable for educational purposes.
It is written in Pascal (source code not included).
===========================================================================
Package: areas/neural/systems/bpnn/
Name: BPNN
Summary: BackPropagation Neural Network Engine
Version: 1.33u (19-NOV-92)
Description:
This directory contains BPNN, a backpropagation neural network engine.
===========================================================================
Package: areas/neural/systems/bps/
Name: BPS
Summary: Backpropagation Simulation Package
Version: 1.00 (14-JUN-90), 2.10 (25-JUL-91, DOS only)
Description:
This directory contains BPS, a backprop simulator. Source
code (C) is available for $50.
===========================================================================
Package: areas/neural/systems/brain/
Name: THE BRAIN
Summary: Neural Network (Backpropagation) Simulator for MSDOS
Version: 1.2 (21-MAR-94)
Description:
THE BRAIN is a neural network (backpropagation) simulator for MSDOS
systems. It is simple enough to be used by non-technical people,
yet sophisticated enough for serious research work.
Examples include recognition of numerals (1, 2, and 3), AND, and XOR.
===========================================================================
Package: areas/neural/systems/cascor/
Name: CASCOR
Summary: Lisp and C implementations of Cascade Correlation
Version: C 1.1 (31-MAY-94); Lisp 1.0 ()
Description:
This directory contains C and Lisp implementations of the Cascade
Correlation Algorithm.
The Lisp code was written by Scott Fahlman, then ported to C by
Scott Crowder. More recent C versions have been re-engineered by Matt
White. Features have been added to allow data sets from the CMU
learning benchmark database to run on this system.
===========================================================================
Package: areas/neural/systems/cmac/
Name: CMAC
Summary: Cerebellar Model Articulation Controller
Version: 15-SEP-93
Description:
CMAC implements the cerebellar model articulation controller (CMAC), a
neural network architecture proposed by J.S. Albus. This network is
applied to two of the example problems that accompany the MATLAB
Neural Network Toolbox, BCKPROP4 and CSTRAIN. These simple function
approximation examples illustrate some of the features of CMAC.
===========================================================================
Package: areas/neural/systems/cog/
Name: COG
Summary: Cognitron Simulation Program
Version: 24-JUL-91
Description:
This directory contains COG, a Cognitron Simulation Program.
===========================================================================
Package: areas/neural/systems/condela/
Name: CONDELA III
Summary: Neural Network Definition Language
Version: 1.05 Beta (November 1991)
Description:
CONDELA III is a Neural Network Definition Language.
===========================================================================
Package: areas/neural/systems/dartnet/
Name: DartNet
Summary: Neural Network Simulator with a nice graphical interface.
Version:
Description:
DartNet is a Macintosh-based Neural Network Simulator with a nice
graphical interface. New network architectures and learning algorithms
can be added to the system by writing small XCMD-like CODE resources
called nDEF's ("Network Definitions").
===========================================================================
Package: areas/neural/systems/datarep/
Name: DATAREP
Summary: Representing Data in Neural Nets
Version: 22-FEB-90
Description:
This directory contains code for the June 1990 AI Expert article
"Representing data in neural nets".
===========================================================================
Package: areas/neural/systems/et/
Name: ET
Summary: Perceptron Simulator
Version: 31-AUG-89
Description:
This directory contains ET, a perceptron demonstration program.
===========================================================================
Package: areas/neural/systems/flight/
Name: Flight
Summary: A neural network that learns to fly.
Version: 29-MAR-94
Description:
The Real Time Recurrent Learning Algorithm was used to train a
multi-layer, feed-forward Artificial Neural Network controller to
perform the function of a Flight Test Maneuver Autopilot for a High
Performance Fighter Aircraft flight simulator. The flight simulator
was used to train an Artificial Neural Controller to fly a 2g
coordinated turn at Mach 1 and 20000 feet.
===========================================================================
Package: areas/neural/systems/gatordem/
Name: Propagator
Summary: Demo version of a backpropagation neural network simulator
Version: 18-OCT-93
Description:
This directory contains a Windows demo version of Propagator, a
backpropagation neural network simulator. You cannot save files
with the demo version and the C source code generation program is
not included.
Full versions are available from ARD Corporation:
PC Windows 3.x version $199
Macintosh System 7.x version $199
Sun Solaris 1.x and Solaris 2.x version $499
===========================================================================
Package: areas/neural/systems/gradsim/
Name: GRADSIM
Summary: Connectionist Network Optimization Package
Version: 2.0 (8-OCT-90)
Description:
GRADSIM is a connectionist network optimization package, a neural
network simulator that supports recurrent time-delay network
optimization. GRADSIM was designed for simulation experiments with
the temporal flow model and was developed for research in speech
recognition. The temporal flow model is characterized by delay links
and unrestricted network connectivity. The simulator accepts network
descriptors and experiment descriptors in a very simple format, and
efficiently computes the complete gradient of recurrent networks. It
can be configured for several gradient descent methods.
===========================================================================
Package: areas/neural/systems/hopfield/
Name: Hopfield
Summary: Traveling Salesman Problem
Version: 13-JUL-90
Description:
This directory contains an implementation of the Traveling Salesman
Problem using Hopfield Networks.
===========================================================================
Package: areas/neural/systems/ics/
Name: ICS
Summary: Hopfield Networks and Backpropagation
Version: 172-1 (15-FEB-90)
Description:
This directory contains some simple neural network programs given
as homework assignments in a course. The implementations include
Hopfield networks and backpropagation.
===========================================================================
Package: areas/neural/systems/mactivat/
Name:
Summary: Mactivation
Version: 3.3
Description:
This directory contains MACTIVATION.
===========================================================================
Package: areas/neural/systems/matrix/
Name: Matrix
Summary: C++ Matrix class with backpropagation example
Version: 1-APR-94
Description:
This directory contains the C++ Matrix class. An implementation of
backpropagation for multi-layer feed-forward neural networks is
included to demonstrate the Matrix class.
===========================================================================
Package: areas/neural/systems/mbp/
Name: MBP
Summary: Matrix Backpropagation Package
Version: 1.1 (23-NOV-93)
Description:
MBP (Matrix Back Propagation) is an efficient implementation of the
back-propagation algorithm for current-generation workstations. The
algorithm includes a per-epoch adaptive technique for gradient
descent. All the computations are done through matrix multiplications
and make use of highly optimized C code. The goal is to reach almost
peak-performances on RISCs with superscalar capabilities and fast
caches. On some machines (and with large networks) a 30-40x speed-up
can be measured respect to conventional implementations.
===========================================================================
Package: areas/neural/systems/mume/
Name: MUME
Summary: Multi-Module Neural Computing Environment
Version: 0.5
Description:
MUME (Multi-Module Neural Computing Environment) is a simulation
environment for multi-modules neural computing. It provides an object
oriented facility for the simulation and training of multiple nets
with various architectures and learning algorithms. The object
oriented structure makes simple the addition of new network classes
and new learning algorithms. MUME includes a library of network
architectures including feedforward, simple recurrent, and
continuously running recurrent neural networks. Each architecture is
supported by a variety of learning algorithms, including backprop,
weight perturbation, node perturbation, and simulated annealing. MUME
can be used for large scale neural network simulations as it provides
support for learning in multi-net environments. It also provide pre-
and post-processing facilities. MUME can be used to include
non-neural computing modules (decision trees, etc.) in applications.
MUME is being developed at the Machine Intelligence Group at Sydney
University Electrical Engineering.
===========================================================================
Package: areas/neural/systems/nasanets/
Name: NASA NETS
Summary: Backpropagation Neural Networks System
Version: 2.0 (7-JUN-90)
Description:
This directory contains the NETS neural network simulator from NASA.
===========================================================================
Package: areas/neural/systems/neocog/
Name: NeoCognitron
Summary: Neural Network Simulator
Version: 1.0 (16-JUN-92)
Description:
This directory contains an implementation of Fukushima's
NeoCognitron Simulator. The NeoCognitron is a hierarchical
self-organizing feedforward network.
===========================================================================
Package: areas/neural/systems/nerves/
Name: NERVES
Summary: Nervous System Construction Kit
Version: 2.0 (9-APR-91)
Description:
This directory contains NERVES, the nervous system construction
kit. It includes a computer simulation of the real-time behavior of a
simplified cockroach, based on the work of Randall Beer.
===========================================================================
Package: areas/neural/systems/netstuff/
Name: Netstuff
Summary: From 'A Practical Guide to Neural Networks'
Version: 27-FEB-91
Description:
This directory contains several examples of neural networks:
- TSP by Bill and Bev Thompson
- HAM, a C net example by David Leasure
- DELTA, a C program by Yoh-Han Pao
===========================================================================
Package: areas/neural/systems/neudl/
Name: NeuDL
Summary: Neural-Network Description Language
Version: 0.21 (17-JUN-94)
Description:
NeuDL (Neural-Network Description Language) is a prototype of a
description language for the design, training, and operation of neural
networks.
NeuDL is currently limited to the backpropagation neural-network
model, but offers a great deal of flexibility. For example, the user
can explicitly specify the connections between nodes and can create or
destroy connections dynamically as training progresses.
NeuDL is an interpreted language resembling C or C++. A NeuDL program
can be run in interpreted mode or it can be automatically translated
into C++ which can be compiled and then executed. The NeuDL
interpreter is written in C++ and can be easly extended with new
instructions.
===========================================================================
Package: areas/neural/systems/neural/
Name: SLUG
Summary: Backpropagation neural network for Windows 3.1
Version: 2.2 (16-APR-94); 1.0 (8-JUN-93)
Description:
This directory contains SLUG, a backpropagation neural network for
Windows 3.1, including Pascal source.
Version 2.2 is the last free version of SLUG. SLUG4 is now a
commercial product, available for $59 plus $10 shipping, from Southern
Scientific fax 27-21-788-6613.
Charles Marais
===========================================================================
Package: areas/neural/systems/neuronc/
Name: NeuronC
Summary: Biophysically-Based Compartmental Simulator
Version: 7-JUL-94
Description:
Neuronc is a general-purpose computer language somewhat
like C that has special features for simulating large neural
circuits using compartments. It allows creating large arrays and
uses an iterative difference equation solver so that virtually
any network geometry may be specified (e.g. geometry is not
limited to "tree" structure, and may include loops).
Since NeuronC is primarily a language it does not contain a
complete interactive pull-down menu system for describing and
running a simulation. However, there is a complete graphics
facility for displaying on standard devices such as X11,
PostScript, and VGA. NeuronC also produces ray-traced
scenes for rendering with the POVRAY simulator.
The "NeuronC" simulator was originally designed for vision
experiments on large neural circuits. It includes a 2D light stimulus
(with optical blur and photon noise) and photoreceptor models complete
with spectral sensitivities and time-responses. A flexible set of
synapse and membrane channel models is also included, including HH,
sequential-state, and calcium-dependent versions. Any network
geometry can be simulated (including electrical loops) and a virtually
unlimited number of voltage- clamp/current clamp and recording sites
may be specified and plotted.
===========================================================================
Package: areas/neural/systems/nevprop/
Name: NevProp
Summary: General purpose backpropagation in C.
Version: 1.16 (13-JUL-93)
Description:
NevProp is a C implementation of general purpose backpropagation
software, based on Quickprop 1.0 by Scott Fahlman, as translated from
Common Lisp into C by Terry Regier. The quickprop algorithm itself
has not changed substantially, but it now includes options to force
gradient descent (per-epoch or per-pattern), generalization & stopped
training, c index, and interface enhancements.
Questions and comments regarding the Quickprop algorithm itself should
be directed to Scott Fahlman at sef+@cs.cmu.edu. Issues pertaining
to NevProp code or functionality itself should be directed to the authors.
===========================================================================
Package: areas/neural/systems/newton/
Name: Newton
Summary: Demonstrations of backpropagation neural networks.
Version: 12-NOV-90
Description:
This directory contains a few demonstration programs to illustrate
backpropagation neural networks. These programs demonstrate two
features that one rarely finds in backpropagation neural nets:
(1) Newton's Method is used to update weights and threshold biases,
(2) Recurrence is allowed, with "persistent activations" (the
activation level of cells in the neural net is preserved
between steps).
===========================================================================
Package: areas/neural/systems/nn/
Name: NN
Summary: Backpropagation and Perceptrons
Version: 30-MAR-93
Description:
This directory contains an implementation of backpropagation and
perceptrons.
===========================================================================
Package: areas/neural/systems/nndt/
Name: NNDT
Summary: A Neural Network Tool for Windows
Version: 0.98b
Description:
NNDT is a tool for neural network development which runs under MS
Windows 3.1. The program includes models for multilayer feed-forward
and recurrent networks and routines for graphical presentation of the
results. Network training is carried out by the Levenberg-Marquardt
method. The program is easy to use; all parameters are presented in
setup windows and on-line help is available. The user-interface is
developed with Microsoft Visual Basic while the network calculations
and the training method are implemented in C and compiled to
dynamic-link library (DLL) routines.
===========================================================================
Package: areas/neural/systems/nnetdraw/
Name: NNETDRAW
Summary: Short Course on Neural Networks
Version: 13-MAR-91
Description:
This directory contains the executable and source code for a "one
page short course" on neural networks.
===========================================================================
Package: areas/neural/systems/nns/
Name: NNS
Summary: Neural Network Simulator with 256 Neurons
Version: 29-MAY-89
Description:
This directory contains NNS, a neural network simulator with 256 neurons.
===========================================================================
Package: areas/neural/systems/nnutl/
Name: NNUTL
Summary: C source library/tutorial for neural networks
Version: 1.01 (2-AUG-93)
Description:
This directory contains a tutorial/source code library for writing
and understanding C implementations of neural networks.
It includes implementations of XOR, feedforward networks with
backpropagation as the learning algorithm, competitive learning
networks with a Hebbian Learning algorithm, and recurrent networks
with backpropagation.
===========================================================================
Package: areas/neural/systems/percept/
Name: PERCEPT
Summary: Implementation of a perceptron
Version: 6-NOV-90
Description:
This directory contains an implementation of a perceptron in Basic.
===========================================================================
Package: areas/neural/systems/planet/
Name: PlaNet
Summary: Neural network simulator.
Version: 5.7 (25-JUN-91)
Description:
PLANET (aka SunNet) is a neural network simulator that runs under X
Windows.
===========================================================================
Package: areas/neural/systems/qprop/
Name: Quickprop
Summary: Backpropagation variation in Lisp, Scheme, and C
Version: Quickprop (19-DEC-91); Backprop (6-MAR-89)
Description:
This directory contains Lisp, Scheme, and C implementations of
Quickprop, a variation on backpropagation by Scott Fahlman.
The original Lisp version was written by Scott Fahlman.
The C port is by Terry Regier, and the Scheme port by Song Koh.
===========================================================================
Package: areas/neural/systems/rcc/
Name: RCC
Summary: Recurrent Cascade-Correlation Learning Algorithm in Lisp and C
Version: Lisp 1.0 (10-OCT-91); C 2.0 (7-OCT-91)
Description:
This directory contains Lisp and C implementations of the recurrent
cascade-correlation learning algorithm. The original Lisp version was
written by Scott Fahlman. It was then ported to C by Scott Crowder.
This directory contains the C version modified by Conor Doherty.
===========================================================================
Package: areas/neural/systems/rcs/
Name: RCS
Summary: Rochester Connectionist Simulator
Version: 4.2 (13-JUN-90)
Description:
Rochester Connectionist Simulator (RCS) includes a backprop package
and an X11/SunView interface.
NOTE: The Rochester Connectionist Simulator has been unsupported
since 1990. You are probably better off using some other package,
like Aspirin/MIGRAINES.
===========================================================================
Package: areas/neural/systems/rns/
Name: RNS
Summary: Recurrent Network Simulator
Version: 1.6b (5-MAR-94)
Description:
RNS (Recurrent Network Simulator) is a simulator for recurrent neural
networks. Regular neural networks are also supported. The program uses
a derivative of the back-propagation algorithm, but also includes
other (not that well tested) algorithms.
Features include
- freely choosable connections, no restrictions besides memory
or CPU constraints
- delayed links for recurrent networks
- fixed values or thresholds can be specified for weights
- (recurrent) back-propagation, Hebb, differential Hebb, simulated
annealing and more
- patterns can be specified with bits, floats, characters, numbers, and
random bit patterns with Hamming distances can be chosen for you
- user definable error functions
- output results can be used without modification as input
===========================================================================
Package: areas/neural/systems/sciam/
Name: SCIAM
Summary: Neural network simulator kernel
Version: 30-SEP-92
Description:
SCIAM is a little program that contains the basic kernel use to run
the simulations in the Amateur Scientist article in the September 1992
issue of Scientific American.
===========================================================================
Package: areas/neural/systems/simul/
Name: NN-Simulator
Summary: Flexible and User-Friendly Neural Network Simulator
Version: 26-JUN-93
Description:
The simulate program is a user-friendly and flexible neural network
simulator. It is designed to handle the simulation of associative
learning style networks, such as the LMS (aka Rescorla-Wagner)
learning procedure and Backpropagation. Multiple interacting networks
can be simulated in parallel, with their behavior and interactions
specified by a simple command language.
Some of the more useful features of the simulator include:
- Simulation weights can be saved, and later used to initialize the
weights of a new simulation.
- Multilayer networks with arbitrary interconnectivity can be
created.
- Quickprop, a faster version of backpropagation is supported.
- Network behavior on each cycle in the simulation can be
specified.
- The output of the simulation on each cycle can be specified.
The example network files include:
- ENCODER. Simulation files for a 10-5-10 encoder (described in
(Rumelhart & McClelland, 1986 v.1). Demonstrates a simple
backpropagation network.
- HINTON. Simulation files for Hinton's "family tree problem"
(Hinton, 1986). This demonstrates a more sophisticated
example of backpropagation: the network is six layers instead of 3.
Includes both backprop and quickprop versions of the network.
- SHANKS. Simulation files for some simple linear associative
networks (discussed in Shanks, 1991).
===========================================================================
Package: areas/neural/systems/snns/
Name: SNNS
Summary: Stuttgart Neural Network Simulator
Version: SNNS 3.1; Nessus 2.1; SNNS2C 2.1
Description:
SNNS (Stuttgart Neural Network Simulator) is a software simulator for
neural networks on Unix workstations developed at the Institute for
Parallel and Distributed High Performance Systems (IPVR) at the
University of Stuttgart. The SNNS simulator contains a simulator kernel
written in ANSI C and a 2D/3D graphical user interface running under
X11R4/X11R5.
SNNS includes the following learning procedures: backpropagation
(online, batch, with momentum and flat spot elimin., time delay),
counterpropagation, quickprop, backpercolation 1, and generalized
radial basis functions (RBF), RProp, recurrent ART-1, ART-2 and ARTMAP,
Cascade Correlation and Recurrent Cascade Correlation, Dynamic LVQ,
and Time delay networks (TDNN). (Elman networks and some other network
paradigms have already been implemented but are scheduled for a later
release.)
NESSUS is a language for the description of neural networks. The
Nessus compiler creates a network description that can be read by SNNS.
SNNS2C is a tool to convert the description of a neural network
from SNNS format to C source code. This code can then be linked to an
existing program as a subroutine.
SNNS is among the most popular neural network simulators.
===========================================================================
Package: areas/neural/systems/som_lvq/
Name: LVQ_PAK and SOM_PAK
Summary: Classification of data using self-organizing memory networks.
Version: LVQ_PAK 2.1 (9-OCT-91); SOM_PAK 1.2 (2-NOV-92)
Description:
LVQ_PAK (Learning Vector Quantization) and SOM_PAK (Self-Organizing Maps)
are programs for classification of data using self-organizing
memory networks. SOM is better suited to visualization of
complex data; LVQ is more appropriate for classification tasks.
Also included is a comprehensive BibTeX/PostScript bibliography of
Kohonen Self-Organizing Maps and Learning Vector Quantization, with
more than 1,000 entries, and the Xvisual program which is used with
SOM_PAK.
===========================================================================
Package: areas/neural/systems/suzy/
Name: SUZY
Summary: Neural Network Classifier System for PCs
Version: 1.0 (11-OCT-93)
Description:
SUZY is a simple neural net classifier system for PCs written in C++
and Turbo Vision. RBFs (Radial Basis Functions) are used to implement
the classifier system with a class-based algorithm being applied to
find the centres and radii of the RBS units. The program is not
intended for any serious applications and is quite slow, but may be of
interest to some people.
===========================================================================
Package: areas/neural/systems/tcs/
Name: TCS
Summary: Tasmanian Connectionist Simulator
Version: 4-AUG-93
Description:
TCS (Tasmanian Connectionist Simulator) is a neural network
simulation package written in Borland C++ for MS Windows.
Examples include an interactive activation network for 4-letter words,
the Rescorla-Wagner model of classical conditioning, Schnys's
Clustering Network (uses a non-supervised Kohonen-style learning
rule), and an XOR network using backpropagation.
===========================================================================
Package: areas/neural/systems/thnet/
Name: THNET
Summary: THinkNet connectionist software
Version: 1.1 September 1988 (12-MAR-93)
Description:
This directory contains the THNET (THinkNet) connectionist software
package, including ACME, ARCS, and ECHO. It is a set of Common Lisp
programs for modeling high-level cognitive operations using
connectionist networks. Its major components are:
1. common modules for running and displaying networks;
2. ACME (Analogical Constraint Mapping Engine), a program
that creates networks for analogical mapping;
3. ECHO (Explanatory Coherence Model), a program that creates networks
for evaluating explanatory hypotheses; and
4. ARCS (Analogical Retrieval by Constraint Satisfaction), a program
to model analogical retrieval.
===========================================================================
Package: areas/neural/systems/tooldiag/
Name: ToolDiag
Summary: Feature selection software for improving classifiers.
Version: 1.4.1 (3-DEC-93)
Description:
ToolDiag is a feature selection program that increases the accuracy of
classifiers and reduces their complexity by providing them with a
subset containing only the most relevant features. It has interfaces
to LVQ_PAK and SNNS, and uses a data file format that is compatible
with that of LVQ_PAK. The 2-d graphics can be displayed using the
GNUPLOT plotting package. ToolDiag implements many concepts from
Devijver and Kittler's book "Pattern Recognition -- A Statistical
Approach" (Prentice Hall, 1982), including the optimal branch and
bound search strategy, together with several different selection
criteria. ToolDiag can also perform an error estimation using the
leave-one-out method and a K-nearest-neighbor classifier. It also
includes a learning module (Q*) that has the same functionality as
LVQ. ToolDiag cannot handle missing values and requires continuous or
ordered discrete numerical features.
===========================================================================
Package: areas/neural/systems/topmap/
Name: TOPMAP
Summary: Kohonen topology preserving maps in Pascal
Version: 22-SEP-87
Description:
This directory contains Teuvo Kohonen's topologically preserving
maps, and were distributed at the First International Conference
on Neural Networks in San Diego, June 1987.
===========================================================================
Topic: areas/neural/systems/utexas/
Summary: Neural network code from the University of Texas.
Description:
This directory contains several neural network research systems
from the University of Texas.
Origin: ftp.cs.utexas.edu:/pub/neural-nets/
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Author(s): Risto Miikkulainen
Keywords:
Authors!Miikkulainen, Connectionist Systems,
Machine Learning!Neural Networks, Neural Networks, Univ. of Texas
Contains:
discern/ DISCERN: Script-processing system
fgrep/ FGREP: Distributed representations for words in the case-role
assignment task.
fm_2d/ FM_2D: 2-d feature mapping for 2-d input vectors
fm_nd/ FM_ND: 2-d feature mapping for n-d input vectors
lex/ DISLEX: A double feature map model of the lexicon
lissom/ LISSOM: Simulations of visuo-cortical development.
papers/ Neural network code from the University of Texas.
See Also: ?
===========================================================================
Package: areas/neural/systems/utexas/discern/
Name: DISCERN
Summary: Script-processing system
Version: 7-MAY-93
Description:
Eventually, this directory will contain complete training, testing, and
data generation programs, sample data files, and full documentation for
the DISCERN system.
===========================================================================
Package: areas/neural/systems/utexas/fgrep/
Name: FGREP
Summary: Distributed representations for words in the case-role
assignment task.
Version: 3-OCT-91
Description:
This package contains the code and data for nonrecurrent FGREP
simulation in the case-role assignment task, i.e. in mapping sentence
constituents into case roles, simultaneously developing distributed
representations for the words.
===========================================================================
Package: areas/neural/systems/utexas/fm_2d/
Name: FM_2D
Summary: 2-d feature mapping for 2-d input vectors
Version: 3-OCT-91
Description:
This package forms a 2-d feature mapping for uniformly distributed 2-D
input vectors in the unit square x,y e [0,1] (includes fancy graphics
displays for HP workstations).
===========================================================================
Package: areas/neural/systems/utexas/fm_nd/
Name: FM_ND
Summary: 2-d feature mapping for n-d input vectors
Version: 3-OCT-91
Description:
This package forms a 2-d (or 1-d) feature mapping for n-d input
vectors. The example data comes from the fgrep simulations.
===========================================================================
Package: areas/neural/systems/utexas/lex/
Name: DISLEX
Summary: A double feature map model of the lexicon
Version: 3-OCT-91
Description:
This package contains the programs and data for DISLEX, a double feature
map model of the lexicon.
===========================================================================
Package: areas/neural/systems/utexas/lissom/
Name: LISSOM
Summary: Simulations of visuo-cortical development.
Version:
Description:
This directory contains images of simulations of visuo-cortical
development using the LISSOM (Laterally Interconnected
Synergetically Self-Organizing Map) model. C code is included.
===========================================================================
Package: areas/neural/systems/utexas/papers/
Name:
Summary: Neural network code from the University of Texas.
Version:
Description:
This directory contains several neural network research systems
from the University of Texas.
===========================================================================
Package: areas/neural/systems/winnn/
Name: WinNN
Summary: Windows Neural Networks
Version: 0.9.3 (18-MAY-94)
Description:
WinNN is a neural networks package for windows 3.1. WinNN incorporates
a friendly user interface with a powerful computational engine. WinNN
can implement feed forward multi-layered neural nets and uses a modified
back-propagation algorithm for training. WinNN was written in
Visual Basic 3.0. (Source code isn't included.)
===========================================================================
Package: areas/neural/systems/xerion/
Name: XERION
Summary: Neural network simulator
Version: 3.1.147
Description:
XERION is a neural network simulator from Drew van Camp at the
University of Toronto. It provides a library of routines for building
networks and graphically displaying them. Example simulators include
Backpropagation, Recurrent Backpropagation, Boltzmann Machine, Mean
Field Theory, Free Energy Manipulation, Kohonnen Net, and Hard and
Soft Competitive Learning.
See also SCIAM, a little program that contains the basic kernel which
was published in the September 1992 issue of Scientific American.
===========================================================================
Package: areas/neural/systems/xpp/
Name: XPP
Summary: Analysis and Simulation of Dynamic and Probabilistic Phenomena
Version: 1.61 (11-OCT-93)
Description:
XPP is a system for the analysis and simulation of dynamic and
probabilistic phenomena. It solves differential equations, difference
equations, delay equations, functional equations, iterative equations,
boundary value problems, and stochastic equations, all combined with
probabilistic models. It evolved from a chapter written by Bard
Ermentrout and John Rinzel on the qualitative theory of nerve
membranes and eventually became a commercial product for MSDOS
computers called PHASEPLANE. It is now available for free as a
program running under X11 and UNIX.
A variety of numerical methods are employed so that the user
can generally be sure that the solutions are accurate. Examples include
connectionist type neural nets, biophysical models, models with memory,
and models of cells with random inputs or with random transitions.
A graphical interface using X Windows as well as numerous plotting
options are provided. PostScript output is supported.
===========================================================================
Topic: areas/neural/util/
Summary: Neural Networks Utilities
Description:
This directory contains neural networks utilities.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Machine Learning!Neural Networks, Neural Networks!Utilities
Contains:
netpic/ NETPIC: Neural network weight diagram macros for LaTeX
See Also: ?
===========================================================================
Package: areas/neural/util/netpic/
Name: NETPIC
Summary: Neural network weight diagram macros for LaTeX
Version: 1.0 (15-FEB-91)
Description:
This directory contains LaTeX macros for drawing Hinton diagrams of
neural network.
===========================================================================
Topic: areas/nlp/
Summary: Natural Language Processing (NLU, NLG, Parsing, Morphology,
Machine Translation ...)
Description:
This directory contains natural language processing software and
related materials. Topics include natural language understanding,
natural language generation, parsing, and morphology.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Corpora, Discourse, Machine Translation, Morphology,
NLG, NLP, NLU, Natural Language Interfaces, Parsing, Software Packages
Contains:
bookcode/ Machine readable parts of various NLP textbooks.
corpora/ Natural Language Corpora and Dictionaries
discours/ Discourse Structure
doc/ Information about Natural Language Processing
faq/ NLP FAQ: Frequently Asked Questions (FAQ) postings for
comp.ai.nat-lang
fonts/ Fonts for Natural Language Processing
misc/ Miscellaneous Natural Language Processing Software
morph/ Morphology
mt/ Machine Translation
nlg/ Natural Language Generation
nli/ Natural Language Interfaces
nlu/ Natural Language Understanding
parsing/ Parsing
See Also: ?
===========================================================================
Topic: areas/nlp/bookcode/
Summary: Machine readable parts of various NLP textbooks.
Description:
This directory contains software and problems from NLP-related textbooks.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Books!NLP, NLP
Contains:
allen/ Code from James Allen's "Natural Language Understanding"
nlp_pp/ Code from Covington's "NLP for Prolog Programmers"
See Also: ?
===========================================================================
Topic: areas/nlp/bookcode/allen/
Summary: Code from James Allen's "Natural Language Understanding"
Description:
This directory contains software from James Allen's "Natural
Language Understanding".
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Authors!Allen, Books!NLP, NLP, NLU
Contains:
nlu_e1/ Code from Allen's "Natural Language Understanding", 1st edition
nlu_e2/ Code from Allen's "Natural Language Understanding", 2st edition
See Also: ?
===========================================================================
Package: areas/nlp/bookcode/allen/nlu_e1/
Name:
Summary: Code from Allen's "Natural Language Understanding", 1st edition
Version:
Description:
This directory contains software from
James Allen, "Natural Language Understanding", The Benjamin/Cummings
Publishing Company, Inc., 1987. ISBN 0-8053-0330-8. (First edition)
and is intended to be used with the book. It includes a simple RTN
(recursive transition network), ATN (augmented transition network), an
Eliza program, and a logic-based parser.
===========================================================================
Package: areas/nlp/bookcode/allen/nlu_e2/
Name:
Summary: Code from Allen's "Natural Language Understanding", 2st edition
Version:
Description:
This directory contains software from
James Allen, "Natural Language Understanding", The Benjamin/Cummings
Publishing Company, Inc., 1994. (Second edition, forthcoming)
and is intended to be used with the book. It includes a bottom-up
chart parser as described in Chapters 3 and 4 of the book.
===========================================================================
Package: areas/nlp/bookcode/nlp_pp/
Name:
Summary: Code from Covington's "NLP for Prolog Programmers"
Version: 2-AUG-93
Description:
This directory contains code from
Michael A. Covington, "Natural Language Processing for Prolog
Programmers", First Edition, Prentice-Hall, 1994.
===========================================================================
Topic: areas/nlp/corpora/
Summary: Natural Language Corpora and Dictionaries
Description:
This directory contains natural language processing corpora,
dictionaries, and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Corpora, Dictionaries, NLP
Contains:
advising/ Advising Corpora
dicts/ Natural Language Dictionaries
doc/ Information about Natural Language Corpora
jmorph/ Japanese morphological dictionary and search program.
keiras/ LEX: Tagged English Lexicon, with program
names/ Name Corpus: List of Male, Female, and Pet names
ota/ OTA: Wordlists by Subject
pron/ Pronunciation Corpus
roget/ Roget Thesaurus
wordnet/ Information about WordNet
See Also: ?
===========================================================================
Package: areas/nlp/corpora/advising/
Name:
Summary: Advising Corpora
Version: 9-JUN-93
Description:
This directory contains a corpus of student-advisor advising
sessions used to develop the ADVISOR II system described in
Elhadad's thesis. The corpus is a transcriptions 6 hours of audio
tapes recorded at the Columbia University, Department of Computer
Science in Fall 1987.
Four versions of the corpus are included:
+ Formatted: The corpus with each turn in a separate paragraph,
student turn marked with S, advisor turn marked with C.
+ Raw: The raw corpus - just the text, without marks.
+ Sentences: The raw corpus with a format facilitating
automatic processing: one sentence on each line, each word
separated by 2 spaces.
+ Tagged: The file sentences tagged by Ken Church's automatic
part-of-speech tagger.
The corpus contains 3500 sentences and 30500 words.
===========================================================================
Topic: areas/nlp/corpora/dicts/
Summary: Natural Language Dictionaries
Description:
This directory contains natural language processing dictionaries.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Dictionaries, NLP
Contains:
doc/ Information about Natural Language Dictionaries
edictj/ EDICT: Japanese/English Dictionary
lifscdic/ LIFSCIDIC: Japanese/English Life Science Dictionary
misc/ Miscellaneous Dictionaries
sigurd/ Sigurd: American Language Standardized Dictionary
spanish/ Spanish Lexicon
stolfi/ Stolfi: DEC SRC Collection of Public Domain Wordlists
words/ English Lexicon
See Also: ?
===========================================================================
Package: areas/nlp/corpora/dicts/doc/
Name:
Summary: Information about Natural Language Dictionaries
Version:
Description:
This directory contains information about natural language
processing dictionaries.
cuvoald.txt Information about Roger Mitton's dictionary
based on the Oxford Advanced Learner's
Dictionary of Current English, available from
black.ox.ac.uk:/ota/dicts/710/
britdict.txt A summary of sources for British English
Pronunciation Dictionaries.
===========================================================================
Package: areas/nlp/corpora/dicts/edictj/
Name: EDICT
Summary: Japanese/English Dictionary
Version: V94-001 (27-JAN-94)
Description:
EDICT is the outcome of a voluntary project to produce a public domain
Japanese/English Dictionary in machine-readable form. It was intended
initially for use with MOKE (Mark's Own Kanji Editor) and related
software such as JDIC and JREADER, however it has come to be used in a
large number of packages. The dictionary has 77,406 entries.
===========================================================================
Package: areas/nlp/corpora/dicts/lifscdic/
Name: LIFSCIDIC
Summary: Japanese/English Life Science Dictionary
Version:
Description:
This dictionary has been prepared by Japanese bioscientists participating
in Bio-Net (a biological forum in a Japanese commercial BBS, Nifty-Serve).
It contains about 15,000 Japanese terms (kana and kanji) used in Physiology,
Pharmacology, Biophysics, Biochemistry, Organic Chemistry, Biology
etc. as well as their corresponding English terms (involving adjective,
verb, adverb forms too).
===========================================================================
Package: areas/nlp/corpora/dicts/misc/
Name:
Summary: Miscellaneous Dictionaries
Version:
Description:
This directory contains a collection of miscellaneous word lists,
including Dutch, English, German, Italian, Japanese, Norwegian, and
Swedish word lists.
===========================================================================
Package: areas/nlp/corpora/dicts/sigurd/
Name: Sigurd
Summary: American Language Standardized Dictionary
Version:
Description:
This directory contains Sigurd P. Crossland's American language
standardized dictionary. It contains most common American words,
abbreviations, and hyphenations. It also contains (intentionally)
many incorrect spellings.
The word lists are compiled from several sources, including commercial
news services, Usenet news postings, existing dictionaries, name
lists, company lists, UNIX man pages, project Gutenberg's E-texts,
project Wordnet, and email.
Please send words for inclusion in future dictionaries should be
submitted to the author's email address or in the /pub/incoming/
directory of his ftp site.
===========================================================================
Package: areas/nlp/corpora/dicts/spanish/
Name:
Summary: Spanish Lexicon
Version: 8-NOV-93
Description:
This directory contains a simple list of about 90,000 Spanish words.
===========================================================================
Package: areas/nlp/corpora/dicts/stolfi/
Name: Stolfi
Summary: DEC SRC Collection of Public Domain Wordlists
Version: DEC-SRC-92-04-05
Description:
This directory contains the DEC SRC collection of public domain
wordlists. The wordlists span several natural languages and were
compiled and merged from several publicly available files from around
the world. The languages include Dutch, English, German, Italian,
Norwegian, and Swedish.
===========================================================================
Package: areas/nlp/corpora/dicts/words/
Name:
Summary: English Lexicon
Version: 6-SEP-91
Description:
This directory contains a list of over 100,000 English words
transcribed orthographically. The list originally came from Public
Brand Software.
The original list contained 146,440 words, but contained thousands of
duplicate words. Evan Antworth resorted the list and removed the
duplicates using the Unix utility uniq. The total number of words is
now 109,582.
This word list includes inflected forms, such as plural nouns and the
-s, -ed and -ing forms of verbs. Thus the number of lexical stems
represented in the list is considerably smaller than the total
number of words.
===========================================================================
Package: areas/nlp/corpora/doc/
Name:
Summary: Information about Natural Language Corpora
Version:
Description:
This directory contains information about natural language corpora.
ota.txt Information about the Oxford Text Archive.
===========================================================================
Package: areas/nlp/corpora/jmorph/
Name:
Summary: Japanese morphological dictionary and search program.
Version:
Description:
This directory contains a Japanese morphological dictionary with a
search program for accessing it.
===========================================================================
Package: areas/nlp/corpora/keiras/
Name: LEX
Summary: Tagged English Lexicon, with program
Version: 23-FEB-93
Description:
This directory contains LEX, a tagged English lexicon. Tags include
part of speech, past participle flag, negative flag, to be flag, verb
+ ing flag, and aux flag.
===========================================================================
Package: areas/nlp/corpora/names/
Name: Name Corpus
Summary: List of Male, Female, and Pet names
Version: 1.3 (29-MAR-94)
Description:
This directory contains a list of several thousand male, female, and
pet names compiled by Mark Kantrowitz, with some help from Bill Ross.
===========================================================================
Package: areas/nlp/corpora/ota/
Name: OTA
Summary: Wordlists by Subject
Version: 13-JUL-92
Description:
This directory contains a large collection of public domain word
lists organized by subject. The intention is for use in eliminating
easy-to-guess passwords; there's no guarantee that all the words are
spelled correctly.
The word lists include:
Australian
Chinese (only a list of the HanYu PinYin)
Computer (various stuff including common passwords, domains, ...)
Danish
Dutch
Finnish
French
German
Italian
Japanese (List of words in Romaji -- see edictj)
Literature (including various authors and genre)
Movies&TV (including Monty Python and Star Trek word lists)
Names (includes names in a number of languages and others)
Norwegian
Place Names (including colleges, wordl factbook, zip codes, ...)
Random (includes various random sorts of word lists)
Religion (includes Q'ran and King James Bible word lists)
Science (includes asteroids and biology lists)
Spanish
Swedish
Yiddish
===========================================================================
Package: areas/nlp/corpora/pron/
Name:
Summary: Pronunciation Corpus
Version:
Description:
This directory contains a 6,100 word English pronunciation
database, based on the TIMIT database.
===========================================================================
Package: areas/nlp/corpora/roget/
Name:
Summary: Roget Thesaurus
Version: 1911
Description:
This directory contains a computer-readable version of Roget's
Thesaurus published in 1911, prepared by MICRA, Inc., in 1991.
===========================================================================
Package: areas/nlp/corpora/wordnet/
Name:
Summary: Information about WordNet
Version: 1.4
Description:
This directory contains a copy of the WordNet README file.
WordNet is an online lexical reference system whose design inspired
by current psycholinguistic theories of human lexical memory. English
nouns, verbs, and adjectives are organized into synonym sets, each
representing one underlying lexical concept. Different relations link
the sets.
===========================================================================
Topic: areas/nlp/discours/
Summary: Discourse Structure
Description:
This directory contains natural language processing software for
processing discourse structure and related topic.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Discourse, NLP
Contains:
drt/ DRT: Discourse Representation Theory
See Also: ?
===========================================================================
Package: areas/nlp/discours/drt/
Name: DRT
Summary: Discourse Representation Theory
Version:
Description:
This directory contains Michael Convington's code related to
Discourse Representation Theory.
drt.tgz English-to-Prolog translator based on Discourse
Representation Theory. (28-MAY-92)
drtn.tgz Experimental Implementation of Discourse
Representation Theory.
drt_tex.tgz TeX macros for glossed sentences, discourse
representation theory, feature structures, etc.
===========================================================================
Topic: areas/nlp/doc/
Summary: Information about Natural Language Processing
Description:
This directory contains natural language processing information
files, such as bibliographies.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
NLP!Documentation
Contains:
bib/ Natural Language Processing Bibliographies
notes/ Information about Natural Language Processing
soft_reg/ Lists of Natural Language Processing Programs
See Also: ?
===========================================================================
Topic: areas/nlp/doc/bib/
Summary: Natural Language Processing Bibliographies
Description:
This directory contains natural language processing bibliographies.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
NLP!Bibliographies
Contains:
anaphora/ Bibliography of Pronominal Anaphora Resolution
csli/ CSLI: CSLI's Natural Language Processing Bibliography
robust/ Bibliography of Robust Parsing of Natural Language
systemic/ Bibliography of Work on Systemic Grammars
See Also: ?
===========================================================================
Package: areas/nlp/doc/bib/anaphora/
Name:
Summary: Bibliography of Pronominal Anaphora Resolution
Version:
Description:
This directory contains a bibliography of work on pronominal
anaphora resolution and focus (center) tracking.
===========================================================================
Package: areas/nlp/doc/bib/csli/
Name: CSLI
Summary: CSLI's Natural Language Processing Bibliography
Version: 1.0 (20-JUL-92)
Description:
This directory contains CSLI's 3,300 entry linguistics bibliography
database in bib/tib/refer format. It is heavily slanted towards
phonetics/phonology but with a fair amount of morphology, syntax, and
semantics thrown in, especially if your interests are computational.
Contributions are welcome, but should be in tib format.
===========================================================================
Package: areas/nlp/doc/bib/robust/
Name:
Summary: Bibliography of Robust Parsing of Natural Language
Version:
Description:
This directory contains natural language processing bibliographies.
===========================================================================
Package: areas/nlp/doc/bib/systemic/
Name:
Summary: Bibliography of Work on Systemic Grammars
Version:
Description:
This directory contains a bibliography of work on parsing systemic grammars.
===========================================================================
Package: areas/nlp/doc/notes/
Name:
Summary: Information about Natural Language Processing
Version:
Description:
This directory contains miscellaneous notes about natural language
processing.
lsastyle.txt Style sheet for publications of the Linguistic
Society of America, 1988.
corpora.txt Survey of Corpora by Jane Edwards
clr.nmsu.edu:/CLR/resources/CorpusSurvey
ldoceerr.txt Guide to Errors in the Longman Dictionary of
Contemporary English (LDOCE) by Robert Krovetz
clr.nmsu.edu:/CLR/resources/Ldoce.errors.guide
clr.txt Information about the Consortium for Lexical Research.
clr.nmsu.edu:/CLR/00README*
===========================================================================
Topic: areas/nlp/doc/soft_reg/
Summary: Lists of Natural Language Processing Programs
Description:
This directory contains lists of natural language processing programs.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
NLP!Software Registries
Contains:
nlsr/ NLSR: Natural Language Software Registry
schulze/ German-Language List of Natural Language Processing Programs
See Also: ?
===========================================================================
Package: areas/nlp/doc/soft_reg/nlsr/
Name: NLSR
Summary: Natural Language Software Registry
Version: 2.1 (1-MAR-93)
Description:
The Natural Language Software Registry is a catalogue of software
implementing core natural language processing techniques, whether
available on a commercial or noncommercial basis. Some of the topics
listed include speech signal processing, morphological analysis,
parsers, natural language generation systems, and knowledge
representation systems. The second edition of the catalog contains
more than 100 descriptions of natural language processing software.
The catalogue is compiled by the German Research Institute for
Artificial Intelligence (DFKI) in Saarbruecken (Germany).
If you'd like to include your NLP software in the registry, return
a copy of the questionnaire.
===========================================================================
Package: areas/nlp/doc/soft_reg/schulze/
Name:
Summary: German-Language List of Natural Language Processing Programs
Version: 26. Oktober 1993
Description:
This directory contains a German-language list of 250 NLP programs (with
addresses and technical information). It is titled
Software zur Verarbeitung nat"urlicher Sprache
and is in A4 format postscript.
===========================================================================
Package: areas/nlp/faq/
Name: NLP FAQ
Summary: Frequently Asked Questions (FAQ) postings for comp.ai.nat-lang
Version:
Description:
A compendium of answers to frequently asked questions about Natural
Language Processing and related topics. Posted monthly to the
comp.ai.nat-lang newsgroup.
===========================================================================
Package: areas/nlp/fonts/
Name:
Summary: Fonts for Natural Language Processing
Version:
Description:
This directory contains fonts for natural language processing, such
as IPA fonts and other phonetic fonts.
cyrttf.zip Cyrillic typefaces for Windows 3.1 (Normal,
Bold, Italic, and Bold Italic).
These fonts were created by Bill Tavolga for
free distribution. See documentation for details.
ipa_asci.txt Standard scheme for representing IPA
transcriptions in ASCII, by Evan Kirshenbaum
. (4-JAN-93)
Includes summary.
ipa_font.txt Information about IPA fonts.
palphon.hqx Binhexed Compactor archive of the Macintosh
TrueType font PalPhon (Palatino Phonetic).
phonts.zip A set of Laserjet II/III fonts and Word
Perfect printer drivers for typesetting phonetics,
Greek, and Cyrillic, as well as the ordinary
English alphabet. They are distributed free of
charge by Timothy Montler of the University of
North Texas.
sil_ipa.zip International Phonetic Alphabet fonts
distributed free by SIL in TrueType and
PostScript form.
IPA12.bdf Oxford University Press IPA 12pt BDF font
IPA14.bdf Oxford University Press IPA 14pt BDF font
===========================================================================
Topic: areas/nlp/misc/
Summary: Miscellaneous Natural Language Processing Software
Description:
This directory contains miscellaneous natural language processing
software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
NLP
Contains:
alvey/ ANLT: Information about the Alvey NL Tools
babbler/ BABBLER: Simple Markov chain language acquisition-and-use
cg/ Conceptual Graph Tools
conc/ CONC: Program for producing concordances of texts.
foggy/ Foggy: Pseudotext Generator
gramtsy/ GRAMTSY: GRAMmatical Transformational SYstem
hum/ HUM: Concordance and textual analysis package
itp/ ITP: Interlinear Text Processor
ldbdemo/ LDB: Demo version of the Linguistic DataBase program
lq_text/ LQ-Text: Text Retrieval Package
maclex/ MacLex: Create and Maintain a Lexicon
rook/ ROOK: Grammar writing
sh/ SHOEBOX: Database program for linguists.
synoname/ SYNONAME: Matches different versions of personal names
verbal/ Verbalist: Demonstration of inflectional forms of English verbs
wlist/ WLIST: Language-independent word frequency and word length
counter
wordsurv/ WORDSURV: Analyzing word lists collected in a language survey.
See Also: ?
===========================================================================
Package: areas/nlp/misc/alvey/
Name: ANLT
Summary: Information about the Alvey NL Tools
Version: 4
Description:
This directory contains information about the Alvey Natural
Language Tools (ANLT). Using the Alvey NL Tools requires paying a
licensing fee to get the decryption key. This directory contains
some information about the tools, in addition to copies of the license
agreements.
===========================================================================
Package: areas/nlp/misc/babbler/
Name: BABBLER
Summary: Simple Markov chain language acquisition-and-use
Version: 18-DEC-92
Description:
This directory contains BABBLER, a program that a keystroke stream
"sliding window" as an echoic (short term) memory and stores
overlapping replicas of the successive windows in an associative
memory which is driven by a Markov chain to create a language
acquisition-and-use system.
A compiled executable for IBM PCs is available for $34 from the author.
===========================================================================
Package: areas/nlp/misc/cg/
Name:
Summary: Conceptual Graph Tools
Version: 13-AUG-92
Description:
This directory contains a variety of tools for working with
conceptual graphs (e.g., Sowa's Conceptual Structures Theory). It
includes a simple C/YACC parser for the linear form of a Conceptual
Graph, a conceptual graph editor, and more.
===========================================================================
Package: areas/nlp/misc/conc/
Name: CONC
Summary: Program for producing concordances of texts.
Version: 1.71
Description:
Conc is a program for producing concordances of texts. A concordance
consists of a list of the words in the text with a short section of
the context that precedes and follows each word. Conc also produces an
index, consisting of a list of the distinct words in the text, each
with the number of times it occurs and a list of the places where it
occurs. Conc displays the original text, the concordance, and the
index each in its own window. Clicking on a word in any one of the
three windows causes the other two windows to display the entries for
the same word.
===========================================================================
Package: areas/nlp/misc/foggy/
Name: Foggy
Summary: Pseudotext Generator
Version: 2-APR-92
Description:
This directory contains Foggy, an extremely simple, "one-from-column-A
and one-from-column-B" pseudotext generator, with TurboPascal V.5.5
source code and modules covering Software Engineering, Folklore
Research, and Government and Binding Theory.
===========================================================================
Package: areas/nlp/misc/gramtsy/
Name: GRAMTSY
Summary: GRAMmatical Transformational SYstem
Version: 4.1.1 (27-FEB-91)
Description:
This directory contains GRAMTSY, an interpreter for
transformational grammars that work on labeled bracketings. GRAMTSY
accepts grammars in a more or less linguistically familiar notation,
and applies them in a straightforward way.
===========================================================================
Package: areas/nlp/misc/hum/
Name: HUM
Summary: Concordance and textual analysis package
Version: 14-DEC-92
Description:
This is the HUM concordance and textual analysis package done by Bill
Tuthill when he was at Berkeley (1981). HUM is a package of programs
for literary and linguistic computing, emphasizing the preparation of
concordances and supporting documents. Both keyword in context and
keyword and line generators are provided, as well as exclusion
routines, a reverse concordance module, formatting programs, a
dictionary maker, and lemmatization facilities. There are also word,
character, and digraph frequency counting programs, word length
tabulation routines, a cross reference generator, and other related
utilities.
===========================================================================
Package: areas/nlp/misc/itp/
Name: ITP
Summary: Interlinear Text Processor
Version: 1.1c (11-SEP-91)
Description:
The IT ('eye-tee' for Interlinear Text) software has been developed by
the Summer Institute of Linguistics to give linguists, literary
scholars, translators, and anthropologists a tool for developing a
corpus of annotated interlinear text. The centerpiece of IT is a
program called itp--an interactive and automated interlinear text
processor. Itp insures consistency in text analysis by retrieving
interlinear word and morpheme annotations from an on-line database of
lexical information which it maintains. The interlinear text file
produced by itp is a clean ASCII file which is accessible by other
text processing software for purposes such as concordancing, indexing,
or display formatting. In addition to itp, the IT package includes a
collection of other software tools which support the conversion of
conventional texts to interlinear text format and which support the
maintenance of the auxiliary lexical database files. Many interlinear
text processing systems support only a fixed, two-line model of
interlinear text. IT views text as a sequence of text units, each of
which contains a text line plus a multidimensional set of annotations
entered according to a model provided by the analyst. In addition to
word and morpheme level annotations, the IT system supports freeform
annotations of the whole text unit, such as translations.
===========================================================================
Package: areas/nlp/misc/ldbdemo/
Name: LDB
Summary: Demo version of the Linguistic DataBase program
Version:
Description:
The Linguistic DataBase (LDB) program is a database system for
syntactic analysis trees.
The LDB program, together with a 130,000 word analyzed corpus of
modern English (the Nijmegen corpus), is available free of charge to
academic institutions andfor Hfl. 5000,- to others.
This directory contains a demo version of the LDB program.
===========================================================================
Package: areas/nlp/misc/lq_text/
Name: LQ-Text
Summary: Text Retrieval Package
Version: 1.10
Description:
LQ-Text lets you search for phrases in text that you previously
indexed with lqaddfile.
===========================================================================
Package: areas/nlp/misc/maclex/
Name: MacLex
Summary: Create and Maintain a Lexicon
Version: 8-FEB-93
Description:
This directory contains MacLex, a program for creating and
maintaining a lexicon.
===========================================================================
Package: areas/nlp/misc/rook/
Name: ROOK
Summary: Grammar writing
Version:
Description:
This directory contains ROOK, a system for authoring descriptive
grammars in Hypercard for the Macintosh.
===========================================================================
Package: areas/nlp/misc/sh/
Name: SHOEBOX
Summary: Database program for linguists.
Version: 1.2a (31-OCT-91)
Description:
SHOEBOX is a database program for field linguists. Can enter, edit,
and analyze lexical, textual, anthropological and other types of data,
maintain a dictionary or more complex lexicon, inter-linearize text,
automatically entering new words into the dictionary, do grammatical
filing and analysis of text data, enter and file cultural notes, and
maintain nonlinguistic types of databases, such as address lists or
library catalogs.
===========================================================================
Package: areas/nlp/misc/synoname/
Name: SYNONAME
Summary: Matches different versions of personal names
Version:
Description:
SYNONAME is a program for identifying possible forms of a single
personal name, for using in matching different versions of personal
names.
===========================================================================
Package: areas/nlp/misc/verbal/
Name: Verbalist
Summary: Demonstration of inflectional forms of English verbs
Version: 2.0 (11-JUN-93); 1.1 (3-NOV-92)
Description:
VERBALIST is a "verb-building robot" that demonstrates various
inflectional forms of English verbs, and indicates as well some of
their collocational restrictions. Includes an interesting summary of
the overt rules used.
===========================================================================
Package: areas/nlp/misc/wlist/
Name: WLIST
Summary: Language-independent word frequency and word length counter
Version: 1.1 (Oct 1993)
Description:
WLIST is a language-independent word frequency and word length counter.
===========================================================================
Package: areas/nlp/misc/wordsurv/
Name: WORDSURV
Summary: Analyzing word lists collected in a language survey.
Version: 2.4 (8-MAY-92)
Description:
This directory contains miscellaneous natural language processing
software and related materials.
===========================================================================
Topic: areas/nlp/morph/
Summary: Morphology
Description:
This directory contains morphology software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Morphology, NLP
Contains:
fonol/ FONOL: Phonological Programming Language
map/ MAP: Cambridge/Edinburgh Morphological Analyzer and Dictionary
System
morfogen/ MORFOGEN: A Morphology Grammar Builder and Dictionary Interface
Tool
pc_kimmo/ PC Kimmo: Two-Level Processor for Morphological Analysis
tulip/ TULIP: A two level phonological formalism.
See Also: ?
===========================================================================
Package: areas/nlp/morph/fonol/
Name: FONOL
Summary: Phonological Programming Language
Version: 4.2.1 (18-DEC-91)
Description:
This directory contains Fonol, a programming language that
simulates phonological rules of the sort described in Chomsky and
Halle's "Sound Pattern of English" and Schane's "Generative Phonology".
It also incorporates the input and output filters (conditions) which came
into common use at about the same time. These filters are currently
restricted to the identification of a pattern and two actions:
preventing the successful application of a specific rule or
blocking (starring) the entire derivation.
===========================================================================
Package: areas/nlp/morph/map/
Name: MAP
Summary: Cambridge/Edinburgh Morphological Analyzer and Dictionary System
Version: 3.1 (August 1992)
Description:
MAP lets the user create lexicons for English (and other languages)
suitable for use in a natural language parsing systems. In addition
to simple look up, the system includes a rule driven morphological
analyzer. Thus words to be held in the lexicon in stem and affix form
(e.g. "move", and "ed", "ing"), and the morphological analyzer can
segment given full words into their basic components (e.g. "moved" to
"move ed" and "travelling" to "travel ing"). thus cutting down the
number of required entries in the lexicon. The work is done within
the framework of general feature grammars and two-level morphology.
MAP is a more powerful representation formalism than KIMMO
two-level finite state transducers, which offer only finite state
morphosyntax and finite state morphographemics.
===========================================================================
Package: areas/nlp/morph/morfogen/
Name: MORFOGEN
Summary: A Morphology Grammar Builder and Dictionary Interface Tool
Version: 7-OCT-91
Description:
This directory contains a demo version of MORFOGEN, a morphological
rule compiler and dictionary interface tool. MORFOGEN consists of a
finite state compiler, which converts inflectional and derivational
paradigms into a finite state machine, and a recognizer, which accepts
inflected forms as input and returns base forms (constrained by
inflection class information in the lexicon) as well as any morphemes
that matched during analysis. MORFOGEN can handle concatenative as
well as non-concatenative morphology, and can be used for inflecting
as well as agglutinating languages. Analyzers using MORFOGEN have
been written for English, French, Spanish, Turkish, Japanese, Korean
and Arabic.
===========================================================================
Topic: areas/nlp/morph/pc_kimmo/
Name: PC Kimmo
Summary: Two-Level Processor for Morphological Analysis
Description:
PC-Kimmo is a new implementation of a program dubbed KIMMO after its
inventor Kimmo Koskenniemi (see Koskenniemi 1983). The program is
designed to generate (produce) and/or recognize (parse) words using a
two-level model of word structure in which a word is represented as a
correspondence between its lexical level form and its surface level
form. PC-Kimmo includes descriptions for English, Finnish,
Japanese, Hebrew, Kasem, Tagalog, and Turkish.
This directory contains PC-Kimmo and several related utilities:
+ KGEN. A rule compiler for PC-Kimmo, written by Nathan Miles of
Ohio State University.
+ KTEXT. A text processor that uses the PC-KIMMO parser to produce a
morphological parse of each word in the text.
+ Englex. A 20,000 entry morphological parsing lexicon of
English intended for use with PC-KIMMO and/or KTEXT.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
KIMMO, Morphology, NLP
Contains:
englex/ Englex: Morphological parsing lexicon of English for use with
PC-KIMMO
kgen/ KGEN: Rule compiler for PC-Kimmo
ktext/ KTEXT: Text Processor for Producing Morphological Parses
pckimmo/ PC Kimmo: Two-Level Processor for Morphological Analysis
turklex/ TurkLex: PC-Kimmo specification for Turkish
See Also: ?
===========================================================================
Package: areas/nlp/morph/pc_kimmo/englex/
Name: Englex
Summary: Morphological parsing lexicon of English for use with PC-KIMMO
Version: 1.0 (26-NOV-91; 20-JAN-92)
Description:
Englex is a 20,000 entry morphological parsing lexicon of English
intended for use with PC-KIMMO and/or KTEXT. The entries consist of
affixes, roots, indivisible stems, and solid compounds. Of these,
there are approximately 11,000 nouns, 4,000 verbs, and 3,400
adjectives. Both inflectional and derivational morphology are analyzed.
===========================================================================
Package: areas/nlp/morph/pc_kimmo/kgen/
Name: KGEN
Summary: Rule compiler for PC-Kimmo
Version: 0.3 (30-APR-91)
Description:
KGEN is a rule compiler for PC-Kimmo. It translates two-level
morphological rules like
y:i => @:C___+:0
into a format suitable for use with Kimmo.
===========================================================================
Package: areas/nlp/morph/pc_kimmo/ktext/
Name: KTEXT
Summary: Text Processor for Producing Morphological Parses
Version: 1.0.3 (18-FEB-92)
Description:
KTEXT is a text processor that uses the PC-KIMMO parser to produce a
morphological parse of each word in the text.
===========================================================================
Package: areas/nlp/morph/pc_kimmo/pckimmo/
Name: PC Kimmo
Summary: Two-Level Processor for Morphological Analysis
Version: 1.0.8 (18-FEB-92)
Description:
PC-Kimmo is a new implementation of a program dubbed KIMMO after its
inventor Kimmo Koskenniemi (see Koskenniemi 1983). The program is
designed to generate (produce) and/or recognize (parse) words using a
two-level model of word structure in which a word is represented as a
correspondence between its lexical level form and its surface level
form. PC-Kimmo includes descriptions for English, Finnish,
Japanese, Hebrew, Kasem, Tagalog, and Turkish.
===========================================================================
Package: areas/nlp/morph/pc_kimmo/turklex/
Name: TurkLex
Summary: PC-Kimmo specification for Turkish
Version:
Description:
TurkLex is a set of PC-Kimmo rule specifications for Turkish morphology.
===========================================================================
Package: areas/nlp/morph/tulip/
Name: TULIP
Summary: A two level phonological formalism.
Version: 8-MAR-93
Description:
This directory contains the source code for TULIP, a partial
implementation of the system described in
S. G. Pulman and M. R. Hepple, "A Feature Based Formalism for Two
Level Phonology: A description and implementation", Computer Speech
and Language.
The implementation was by Hepple, based on an original version
by Pulman.
===========================================================================
Topic: areas/nlp/mt/
Summary: Machine Translation
Description:
This directory contains machine translation software and
related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Machine Translation, NLP
Contains:
cognate/ COGNATE: Identifies related words in bilingual texts.
mtran/ MTRAN: Machine Translation Program
See Also: ?
===========================================================================
Package: areas/nlp/mt/cognate/
Name: COGNATE
Summary: Identifies related words in bilingual texts.
Version: 9-DEC-91
Description:
COGNATE is the implementation of a prototype algorithm for identifying
related words across languages. Given the same list of words in two
different languages, COGNATE will determine which words are likely
to be regularly derivable from each other, and which are not.
===========================================================================
Package: areas/nlp/mt/mtran/
Name: MTRAN
Summary: Machine Translation Program
Version: 1.2 (25-NOV-91)
Description:
This directory contains a machine translation program with associated
Masters thesis. Examples are given for Spanish. ICON source code is
included.
===========================================================================
Topic: areas/nlp/nlg/
Summary: Natural Language Generation
Description:
This directory contains natural language generation software and
related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
NLG, NLP
Contains:
bib/ Natural Language Generation Bibliographies
fuf/ FUF and SURGE: NLG system based on Functional Unification
Grammar
See Also: ?
===========================================================================
Topic: areas/nlp/nlg/bib/
Summary: Natural Language Generation Bibliographies
Description:
This directory contains natural language generation bibliographies.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
NLG!Bibliographies, NLP
Contains:
dale/ Robert Dale's Natural Language Generation Bibliographies
explain/ Menzies' bibliography of 'explanations'
mk/ Mark Kantrowitz's Natural Language Generation Bibliography
See Also: ?
===========================================================================
Package: areas/nlp/nlg/bib/dale/
Name:
Summary: Robert Dale's Natural Language Generation Bibliographies
Version: 2.01 a4 (14-MAR-93)
Description:
This directory contains two natural language generation
bibliographies by Robert Dale. One is a fairly comprehensive list
of NLG references, in PostScript. The other is an earlier annotated
bibliography and includes LaTeX source.
Note that the postscript bibliography is formatted for A4 paper.
Stick in a line
.94 .94 scale
after the %! line to print on 8.5 x 11 paper.
===========================================================================
Package: areas/nlp/nlg/bib/explain/
Name:
Summary: Menzies' bibliography of 'explanations'
Version: 6-MAY-94
Description:
This directory contains Tim Menzies' bibliography of explanations.
===========================================================================
Package: areas/nlp/nlg/bib/mk/
Name:
Summary: Mark Kantrowitz's Natural Language Generation Bibliography
Version: 5-JUL-94
Description:
This directory contains Mark Kantrowitz's BibTeX bibliography of research
in natural language generation. In addition to the tech report, the
BibTeX file containing the bibliography is also available. The
bibliography contains more than 1,200 entries.
The bibliography file (nlg.bib) is being actively maintained, and
is more recent than the version included in the tar file. Please
send additions and corrections to mkant+nlgbib@cs.cmu.edu.
===========================================================================
Package: areas/nlp/nlg/fuf/
Name: FUF and SURGE
Summary: NLG system based on Functional Unification Grammar
Version: FUF 5.3 (24-APR-94); SURGE 1.2 (21-DEC-93)
Description:
This directory contains FUF and SURGE. FUF is a natural language
generation system based on the formalism of functional unification
grammars. SURGE is a large grammar for FUF with a very good coverage
of English syntax. SURGE is inspired by systemic grammars [Halliday
1985] and HPSG. A user manual and numerous examples are included.
Also included is a copy of Elhadad's thesis, which provides
detailed information on the design of FUF and the only documentation
available on the SURGE grammar.
===========================================================================
Topic: areas/nlp/nli/
Summary: Natural Language Interfaces
Description:
This directory contains software concerned with natural language
interfaces.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
NLP, Natural Language Interfaces
Contains:
interbas/ InterBASE: Demo system for constructing natural language
database interfaces
See Also: ?
===========================================================================
Package: areas/nlp/nli/interbas/
Name: InterBASE
Summary: Demo system for constructing natural language database interfaces
Version:
Description:
This directory contains an English demo of the InterBase system for
constructing natural language interfaces for databases in xBase
format for MS-DOS, together with a series of demo linguistic
processors for various applied software systems.
===========================================================================
Topic: areas/nlp/nlu/
Summary: Natural Language Understanding
Description:
This directory contains natural language understanding software and
related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
NLP, NLU
Contains:
icu/ ICU: Miniature NLU programs from Schank and Riesbeck
mcdypar/ McDypar: Scheme and Common Lisp implementations of Dyer's
McDypar
See Also: ?
===========================================================================
Package: areas/nlp/nlu/icu/
Name: ICU
Summary: Miniature NLU programs from Schank and Riesbeck
Version: 13-JUL-93
Description:
This directory contains Common Lisp versions of the miniature
natural language understanding programs from
Roger C. Schank and Christopher K. Riesbeck, "Inside Computer
Understanding" Lawrence Erlbaum Associates, 1981.
The distribution includes the SAM, ELI, and Tale-Spin miniatures. It
will eventually include copies of the miniature versions of PAM, and
POLITICS.
Also included in the distribution are:
- FOR Macro. This is the generalized iteration macro found, among
other places, in Charniak's "Artificial Intelligence Programming"
(1987). An older version of it is used in the original
versions of the mini programs.
- CD Functions. This is a set of functions for manipulating and
matching lisp representations of Conceptual Dependency formulas.
===========================================================================
Package: areas/nlp/nlu/mcdypar/
Name: McDypar
Summary: Scheme and Common Lisp implementations of Dyer's McDypar
Version: 21-FEB-92
Description:
This directory contains Scheme and Common Lisp implementations of
McDypar, based on the description in Michael Dyer's "In Depth
Understanding". The program produces a CD parse of a story.
===========================================================================
Topic: areas/nlp/parsing/
Summary: Parsing
Description:
This directory contains parsing software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
NLP, Parsing
Contains:
av/ AV Parser: Unification-based parser.
flex/ FLEX: Fast Lexical Analyzer Generator
gb/ Gibberish: Prolog Government-binding parser.
hdrug/ Hdrug: Environment for developing logic grammars for natural
languages
lhip/ LHIP: Left-Head-Corner Island Parser Compiler
linger/ LINGER: Language INdependent Grammatical Error Reporter
link/ Link Parser: Fast and efficient English parser
montague/ Montague: Montague Parser
pleuk/ PLEUK: Grammar Development System
pnla/ PNLA: Prolog and DCG programs from "Prolog and Natural Language
Analysis"
proof/ Proof: Left-Associative Natural Language Parser
regex/ RegEx: Translates regular expressions to DFAs
sax/ SAX: Syntactic Analyzing Program
taggers/ Part of Speech Taggers
tom/ Tom: C implementation of the Tomita parsing algorithm
See Also:
lang/lisp/code/parsing/
lang/scheme/code/parsing/
lang/prolog/code/parsing/
===========================================================================
Package: areas/nlp/parsing/av/
Name: AV Parser
Summary: Unification-based parser.
Version: 20p2
Description:
The AV Parser is a ``unification-based'' parser (Shieber 1986)
for natural language parsing with ``attribute-value'' based
theories of grammar.
It is intended for research and instructional purposes and has the
following features
- graphical user interface, with tree and attribute-value
matrix drawing routines, and the graphics can be "cut and paste"
into other applications (e.g. word processors), supported by a
scrolling-pict-view window class
- completely customizable grammar specification language (an
LALR(1) parser-generator is included)
- several small sample grammars are included
The graphics routines and the LALR(1) parser generator may be
of independent interest to the MCL community.
===========================================================================
Package: areas/nlp/parsing/flex/
Name: FLEX
Summary: Fast Lexical Analyzer Generator
Version: 2.4.3
Description:
Fles is a tool for generating programs which recognize lexical
patterns in text. Flex reads the given input files for a description
of a scanner to generate. The description is in the form of pairs of
regular expressions and C code - these are called rules. Flex
generates as output a C source file, lex.yy.c, which defines a routine
yylex(). This file is compiled and linked with the library to produce
an executable. When the executable is run, it analyzes its input for
occurrences of the regular expressions. Whenever it finds one, it
executes the corresponding C code.
===========================================================================
Package: areas/nlp/parsing/gb/
Name: Gibberish
Summary: Prolog Government-binding parser.
Version: 21-AUG-93
Description:
This directory contains Gibberish, a first attempt at a
Government-Binding (GB) type parser. This parser is intended as an
introductory 'toy' parser for natural-language-understanding courses,
so complexity will be kept to a minimum while still being general
enough to be easily extended. All constraints have been been
implemented as explicit Prolog goals for perspicuity. Many
optimizations are possible! The gapping mechanism actually performs a
transformation of the sentence into a 'normal' form and so has been
made general enough to move arbitrary structures through the parse tree.
===========================================================================
Package: areas/nlp/parsing/hdrug/
Name: Hdrug
Summary: Environment for developing logic grammars for natural languages
Version: alfa (14-JUN-94)
Description:
Hdrug is an environment to develop logic grammars for natural
languages. The package comes with a number of example grammars,
parsers and generators.
The package allows easy comparison of different parsers/generators,
extensive possibilities of compiling feature equations into Prolog
terms, graphical (Tk), LaTeX and ordinary Prolog output of trees,
feature structures and Prolog terms.
Example grammars, parsers, and generators include TL (a HPSG grammar
for Dutch), TT (a small Tree Adjoining Grammar), TG (a small DCG for
Dutch), TC (a Constraint-based Categorial Grammar for English), TD (a
minimal DCG), and TX (an extraposition grammar).
===========================================================================
Package: areas/nlp/parsing/lhip/
Name: LHIP
Summary: Left-Head-Corner Island Parser Compiler
Version: 1.1
Description:
LHIP is a left-head-corner island parser compiler. The system compiles
grammar rules to Prolog code in much the same way as the Prolog DCG
system does. The rules themselves are an extended version of the DCG
rules, allowing optional constituents, negation, disjunction, the
specification of adjacency, and the ability to mark multiple heads in
a rule body.
===========================================================================
Package: areas/nlp/parsing/linger/
Name: LINGER
Summary: Language INdependent Grammatical Error Reporter
Version: 1.1 (4-SEP-92)
Description:
This directory contains LINGER, a tool for grammar analysis of
Western European languages.
LINGER is a language-independent system to analyze natural language
sentences and report and correct grammatical errors encountered. An
important objective is that the system should be easily configured for a
particular natural language by an expert in that language but not in
computer science.
This library contains two versions of Linger. The older one contains
only a French grammar. The more recent also has German, Spanish, and
English. Both versions were contributed by Paul O'Brien and Masoud
Yazdani, and were written in Expert Systems International Prolog-2.
===========================================================================
Package: areas/nlp/parsing/link/
Name: Link Parser
Summary: Fast and efficient English parser
Version: 27-MAY-92
Description:
The Link Parser is a highly efficient English parser written by Danny
Sleator and Davy Temperley. It uses a novel grammatical formalism known
as Link Grammar to represent a robust and diverse collection of
English-language phenomena.
To see an online demo of the parser, do telnet spade.pc.cs.cmu.edu 4000
===========================================================================
Package: areas/nlp/parsing/montague/
Name: Montague
Summary: Montague Parser
Version:
Description:
This directory contains a Montague Parser.
===========================================================================
Package: areas/nlp/parsing/pleuk/
Name: PLEUK
Summary: Grammar Development System
Version: Pleuk 1.0; HPSG-PL 1.2.2 (12-MAY-92)
Description:
This directory contains the Pleuk Grammar Development System.
The following grammatical formalisms currently work with Pleuk:
Cfg A simple context-free grammar system, intended for
demonstration purposes.
HPSG-PL A system for developing HPSG-style grammars.
Mike A simple graph-based unification system, enhanced with
additional operations for the treatment of free word order
proposed by Mike Reape in various publications.
SLE A graph-based formalism enhanced with arbitrary relations in
the manner of Johnson and Rosner (EACL, 1989) and Doerre and
Eisele. Delayed evaluation is used to compute infinite
relations. This system has been used for the development of
several HPSG-style grammars.
Term A term-based unification grammar system, originally developed
for the support of Unification Categorial Grammar (Zeevat,
Klein and Calder).
===========================================================================
Package: areas/nlp/parsing/pnla/
Name: PNLA
Summary: Prolog and DCG programs from "Prolog and Natural
Language Analysis"
Version:
Description:
This directory contains the Prolog and DCG programs from Pereira
and Shieber's book, "Prolog and Natural Language Analysis"
===========================================================================
Package: areas/nlp/parsing/proof/
Name: Proof
Summary: Left-Associative Natural Language Parser
Version: 0.2 (28-SEP-91)
Description:
This directory contains the "proof" left-associative natural
language parser. It includes an interactive proofreader that uses
the rules of the left-associative parser to check grammar.
===========================================================================
Package: areas/nlp/parsing/regex/
Name: RegEx
Summary: Translates regular expressions to DFAs
Version: 17-MAY-93
Description:
This directory contains RegEx, a program that translates regular
expressions to DFAs. It includes a RE to DFA and a RE to NFA converter.
===========================================================================
Package: areas/nlp/parsing/sax/
Name: SAX
Summary: Syntactic Analyzing Program
Version:
Description:
SAX (Sequential Analyzer for syntaX and semantics) is a syntactic
analyzer based on logic programming. SAX employs a bottom-up and
breadth-first parsing algorithm. The SAX grammar rules are basically
written in Definite Clause Grammar (DCG). The SAX grammar rules are
translated into a parsing program written in Prolog.
===========================================================================
Topic: areas/nlp/parsing/taggers/
Summary: Part of Speech Taggers
Description:
This directory contains part of speech taggers.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
NLP, Parsing, Part of Speech Taggers, Taggers
Contains:
brill/ Brill: Trainable Part of Speech Tagger
xerox/ Xerox Part of Speech Tagger
See Also: ?
===========================================================================
Package: areas/nlp/parsing/taggers/brill/
Name: Brill
Summary: Trainable Part of Speech Tagger
Version: 1.13 (21-JUN-94)
Description:
This directory contains Eric Brill's trainable rule-based part of
speech tagger. This tagger is based on transformation-based
error-driven learning, a technique that has been effective in a number
of natural language applications, including part of speech and word
sense tagging, prepositional phrase attachment, and syntactic parsing.
The code includes a tokenizer for ASCII English, an English lexicon
enduced from the Brown corpus, a table of mappings for word suffixes
to likely ambiguity classes, and an HMM trained on the odd numbered
sentences in the Brown corpus.
For more information, see chapter 6 of Brill's thesis.
===========================================================================
Package: areas/nlp/parsing/taggers/xerox/
Name:
Summary: Xerox Part of Speech Tagger
Version: 1.2 (23-MAR-94)
Description:
This directory contains the Xerox part-of-speech tagger.
===========================================================================
Package: areas/nlp/parsing/tom/
Name: Tom
Summary: C implementation of the Tomita parsing algorithm
Version: 23-MAY-93
Description:
This directory contains Tom, a C implementation of the Tomita
parsing algorithm.
The software constructs LR(0) parsing tables for arbitrary context
free grammars, which you specify. It then processes any input you
give it and displays the resulting parse forest and optionally the
parse stack as well. The parse tables are also shown, if you
requests it, since reference is made to them in the parse stack.
One difference between this and Tomita's original algorithm is this
algorithm has been modified into a dynamic programming algorithm,
capable of handling all CFG's including cyclic grammars.
===========================================================================
Topic: areas/planning/
Summary: Planning and Plan Recognition
Description:
This directory contains software and other materials about planning
and plan recognition.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Planning, Software Packages
Contains:
systems/ Planning and Plan Recognition Systems
See Also:
areas/testbeds/
===========================================================================
Topic: areas/planning/systems/
Summary: Planning and Plan Recognition Systems
Description:
This directory contains planning and plan recognition software
systems.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Planning
Contains:
3plan/ 3plan: SNLP, TOCL, and TOPI planners
abtweak/ ABTWEAK: Nonlinear planning with abstraction
build/ BUILD: A blocks-world planner
buridan/ BURIDAN: Extension of SNLP that models probabilistic
conditional outcomes.
idm/ IDM: STRIPS-like planning
nonlin/ NONLIN: Hierarchical, non-linear planner.
prodigy/ Prodigy: Integrated Planning and Learning System
snlp/ SNLP: Domain-Independent Systematic Nonlinear Planner.
soar/ Soar: Integrated Agent Architecture
spa/ SPA: Systematic Plan Adaptor
ucpop/ UCPOP: Partial Order Planner
See Also: ?
===========================================================================
Package: areas/planning/systems/3plan/
Name: 3plan
Summary: SNLP, TOCL, and TOPI planners
Version: 23-FEB-93
Description:
This directory contains contains 3 comparable planners -- SNLP, TOCL,
and TOPI -- along with domain and testing information. SNLP is a
domain independent systematic conjunctive nonlinear (partial-order)
planner that is both complete and sound, TOCL is a total ordered
version of SNLP, and TOPI is a backward chaining planner.
The planners were created for comparing linear and nonlinear
planning in the Barrett and Weld paper.
===========================================================================
Package: areas/planning/systems/abtweak/
Name: ABTWEAK
Summary: Nonlinear planning with abstraction
Version: v93 (19-APR-93)
Description:
ABTWEAK is a complete hierarchical, non-linear planner that extends
David Chapman's (MIT 1986) TWEAK planner as described by
Yang (Waterloo) and Tenenberg (Rochester) in 1989. This implementation
includes a complete search strategy suited to abstraction hierarchies
known as LEFT-WEDGE (Woods 1991). This planner and related work
predates that of SNLP.
The planning language is the first order predicate logic
without quantifiers and logical connectives. Given an initial state
description and a goal state description, represented as sets of
literals, it finds a partially ordered, least-committed set of
operators to achieve the goal. It is correct in that every solution
plan found necessarily solves the goal from the initial state, and
complete in that it will terminate with a solution if one exists.
Also, source, all related papers, and manuals are available via WWW
at the home page of Steve Woods on URL
http://logos.uwaterloo.ca/students/sgwoods.html
or via the Logic Programming and Artificial Intelligence Group (LPAIG)
page on URL http://logos.uwaterloo.ca/.
===========================================================================
Package: areas/planning/systems/build/
Name: BUILD
Summary: A blocks-world planner
Version: 5-DEC-88
Description:
This directory contains a Common Lisp version of Scott Falhman's
Build, a blocks-world planner. It is a classical recursive-descent
planner, and is one of the first solid geometric modelers. It was
converted from CONNIVER to Common Lisp by John Nagle.
===========================================================================
Package: areas/planning/systems/buridan/
Name: BURIDAN
Summary: Extension of SNLP that models probabilistic conditional outcomes.
Version: 22-OCT-93
Description:
This directory contains BURIDAN, an extension of SNLP which breaks
free from the tortuous chains of STRIPS-style operators by modeling
probabilistic, conditional outcomes. Whereas classical planners'
primitive is of the form "Generate a plan that provably achieves goal
G", BURIDAN responds to requests of the form "Generate a plan that,
with probability at least tau, will achieve goal G".
It also includes the VCR graphical plan browser, which requires CLIM.
===========================================================================
Package: areas/planning/systems/idm/
Name: IDM
Summary: STRIPS-like planning
Version: 13-AUG-92
Description:
This directory contains IDM, a STRIPS-like planning system.
Examples include standard Blocksworld problems, Towers of Hanoi,
and the Register-Swapping Problem.
Also included is a C implementation of sockets with a Lisp
interface and a Lisp implementation of distributed task allocation
for load balancing. (?)
===========================================================================
Package: areas/planning/systems/nonlin/
Name: NONLIN
Summary: Hierarchical, non-linear planner.
Version: 1.2 (5-FEB-92)
Description:
This directory contains a Common Lisp implementation of NONLIN, a
hierarchical, non-linear planning system. NONLIN was originally
designed and implemented by Austin Tate.
===========================================================================
Topic: areas/planning/systems/prodigy/
Name: Prodigy
Summary: Integrated Planning and Learning System
Description:
This directory contains the Prodigy planning and learning system.
===========================================================================
Package: areas/planning/systems/prodigy/static/
Name: STATIC
Summary: Static Analyzer for Prodigy
Version: 2.0
Description:
This directory contains STATIC, a static analysis tool for the full
PRODIGY 2.0 language.
===========================================================================
Package: areas/planning/systems/prodigy/version2/
Name: Prodigy
Summary: Integrated Planning and Learning System
Version: 2.11 (2-OCT-90)
Description:
This directory contains the Prodigy planning and learning system.
Domains include Blocksworld, Gridworld (3d Blocksworld), Logic, Matrix
Algebra (Gaussian Elimination), MultiRobot, R1 (VAX configuration),
Rocket, Schedworld (Machine Shop Scheduling), STRIPS World, Telescope
Mirrors, Path Planning, Jupiter, 8-Puzzle, Monkey and Bananas, and
Towers of Hanoi.
The additional Prodigy domains in domains.tgz were provided by Oren
Etzioni .
===========================================================================
Package: areas/planning/systems/prodigy/version4/
Name: Prodigy
Summary: Integrated Planning and Learning System
Version: 4.0 (1-FEB-94)
Description:
This directory contains the Prodigy planning and learning system.
===========================================================================
Package: areas/planning/systems/snlp/
Name: SNLP
Summary: Domain-Independent Systematic Nonlinear Planner.
Version: 9-NOV-92
Description:
This directory contains SNLP, a domain-independent systematic
nonlinear planner that is both complete and sound.
No longer maintained. UCPOP is upward compatible to SNLP (and
better in all respects too).
===========================================================================
Topic: areas/planning/systems/soar/
Name: Soar
Summary: Integrated Agent Architecture
Description:
This directory contains Lisp and C versions of Soar. Soar is an
integrated agent architecture that supports learning through chunking.
===========================================================================
Package: areas/planning/systems/soar/neomycin/
Name: NeoMycin
Summary: Medical expert implemented in Soar
Version:
Description:
This directory contains NeoMycin implemented in Soar.
===========================================================================
Package: areas/planning/systems/soar/soar5/
Name: Soar
Summary: Integrated Agent Architecture
Version: Soar 5.2.2; TAQL 3.1.4; CParaOPS5 5.4; SoarX 5.4
Description:
This directory contains the Lisp version of Soar. Soar is an
integrated agent architecture that supports learning through chunking.
Included are CParaOPS5, TAQL (Task Acquisition Language), soar-mode
for GNU Emacs, the SoarX graphic display, and SoarSIM (simulation
building tool for Soar).
===========================================================================
Package: areas/planning/systems/soar/soar6/
Name: Soar
Summary: Integrated Agent Architecture
Version: Soar 6.2.1 (13-JUN-94); SDE 0.7 (23-JUN-94);
MacSoar 6.1.0 (3-NOV-93); IntelSoar 6.1.0 (9-NOV-93);
Dismal 0.94b (17-JUN-94)
Description:
This directory contains the C version of Soar. Soar is an
integrated agent architecture that supports learning through chunking.
Included are soar-mode for GNU Emacs, the Soar Development
Environment (SDE), Dismal, and SimTime.
===========================================================================
Package: areas/planning/systems/spa/
Name: SPA
Summary: Systematic Plan Adaptor
Version: 4-NOV-92
Description:
This directory contains SPA (Systematic Plan Adaptor), a Lisp
case-based planning system.
SPA is a domain-independent algorithm for case-based plan adaptation that
is sound, complete, and systematic. Since SPA is sound, every plan it
returns is guaranteed to achieve the goal. Since the algorithm is complete,
it is guaranteed to find a plan if one exists, regardless of the initial
plan returned from the library. Systematicity guarantees that SPA explores
the space of partially specified, incomplete plans avoiding redundant or
wasted effort. The algorithm provides an excellent vehicle for further
study, particularly on issues involving the role of heuristic and
problem-specific knowledge in the planning process.
===========================================================================
Package: areas/planning/systems/ucpop/
Name: UCPOP
Summary: Partial Order Planner
Version: 2.0 (5-OCT-93); 1.00a (10-NOV-92)
Description:
This directory contains UCPOP, a domain independent partial order
planner that handles an expressive action representation (conditional
effects, universally quantified effects, and universally quantified
preconditions and goals. UCPOP is both complete and sound.
UCPOP operates with actions that have conditional effects, universally
quantified preconditions and effects, and accepts universally
quantified goals, in addition to disjunction, negation, and
existential quantification. With a conservative search strategy
UCPOP is both sound and complete for this representation.
The Common Lisp implementation is quite efficient requiring between
5-50ms to explore and refine a partial plan. In particular, UCPOP is
as fast as or faster than SNLP in comparable domains. (UCPOP is upward
compatible with SNLP.) Instructors interested in using UCPOP in a
classroom setting will be happy to note that the UCPOP code is
exceptionally clean and only slightly larger than SNLP. It also has a
CLIM-based graphical plan-space browser, a user's manual, and a
large set of domain theories and search functions for testing.
===========================================================================
Topic: areas/reasonng/
Summary: Reasoning
Description:
This directory contains software and other materials about
Analogical Reasoning, Case Based Reasoning, Defeasible Reasoning,
Legal Reasoning, Medical Reasoning, Probabilistic Reasoning,
Qualitative Reasoning, Temporal Reasoning, Theorem Proving/Automated
Reasoning, and Truth Maintenance.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Reasoning, Software Packages
Contains:
analogy/ Analogical Reasoning
atp/ Theorem Proving and Automated Reasoning
case_bsd/ Case-Based Reasoning
chem/ Chemical Reasoning
defeasbl/ Defeasible Reasoning
medical/ Medical Reasoning
meta/ Meta Reasoning
probabl/ Probabilistic Reasoning
qualittv/ Qualitative Reasoning
temporal/ Temporal Reasoning
tms/ Truth Maintenance
toolset/ Toolset: OSU LAIR Generic Task Toolset
See Also: ?
===========================================================================
Topic: areas/reasonng/analogy/
Summary: Analogical Reasoning
Description:
This directory contains software and other materials about
Analogical Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Analogical Reasoning, Reasoning!Analogical Reasoning
Contains:
sme/ SME: Structure-Mapping Engine
See Also: ?
===========================================================================
Package: areas/reasonng/analogy/sme/
Name: SME
Summary: Structure-Mapping Engine
Version: 2e (21-JAN-92)
Description:
This directory contains the Structure-Mapping Engine (SME), as
described in Falkenhainer, Forbus, and Gentner's 1987 AIJ article.
===========================================================================
Topic: areas/reasonng/atp/
Summary: Theorem Proving and Automated Reasoning
Description:
This directory contains software and other materials about
Theorem Proving and Automated Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Automated Reasoning, Reasoning!Automated Reasoning, Theorem Proving
Contains:
doc/ Documentation about Theorem Proving and Automated Reasoning
problems/ Problem Libraries for Theorem Proving and Automated Reasoning
systems/ Theorem Proving and Automated Reasoning Systems
See Also: ?
===========================================================================
Package: areas/reasonng/atp/doc/
Name:
Summary: Documentation about Theorem Proving and Automated Reasoning
Version:
Description:
This directory contains documentation files for
Theorem Proving and Automated Reasoning.
===========================================================================
Topic: areas/reasonng/atp/problems/
Summary: Problem Libraries for Theorem Proving and Automated Reasoning
Description:
This directory contains problem libraries for Theorem Proving and
Automated Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Automated Reasoning!Problem Libraries, Reasoning!Automated Reasoning,
Test Problems, Theorem Proving!Problem Libraries
Contains:
atp/ ATP Problem Library
tptp/ TPTP: Problem Library for Automated Theorem Proving Systems
See Also: ?
===========================================================================
Package: areas/reasonng/atp/problems/atp/
Name:
Summary: ATP Problem Library
Version:
Description:
This directory contains a collection of ATP problems from Otter, CADE,
and JAR. They may be used to testing and benchmarking theorem provers.
The problems include algebra, analysis, circuits, geometry, logic
problems, Pelletier's problem set, program verification, puzzles, set
theory, and topology. The problems are given in the form of Otter
input files.
===========================================================================
Package: areas/reasonng/atp/problems/tptp/
Name: TPTP
Summary: Problem Library for Automated Theorem Proving Systems
Version: 1.1.1 (8-JUL-94)
Description:
*** This copy of the TPTP is not guaranteed to be the most ***
*** recent. The most recent release is always available from ***
*** one of the Origin sites listed below. ***
The TPTP (Thousands of Problems for Theorem Provers) Problem Library
is a collection of test problems for Automated Theorem Proving systems
(ATPs), using the clausal normal form of 1st order predicate logic.
The TPTP aims to supply the ATP community with the following:
1. A comprehensive list of the ATP test problems that are available
today, in order to provide a simple and unambiguous reference
mechanism.
2. New generalized variants of those problems whose original
presentation is hand-tailored towards a particular automated proof.
3. The availability of these problems via FTP in a general-purpose
format, together with a utility to convert the problems to existing
ATP formats. (Currently the METEOR, MGTP, OTTER, PTTP, SETHEO, and
SPRFN formats are supported, and the utility can easily be extended
to produce any format required.)
4. A comprehensive list of references and other interesting information
on each problem.
5. General guidelines outlining the requirements for ATP system evaluation.
===========================================================================
Topic: areas/reasonng/atp/systems/
Summary: Theorem Proving and Automated Reasoning Systems
Description:
This directory contains theorem proving and automated reasoning systems.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Automated Reasoning, Reasoning!Automated Reasoning, Theorem Proving
Contains:
coq/ Coq: Calculus of Inductive Constructions
dtp/ DTP: General theorem prover with domain-independent control of
inference.
elf/ Elf: LF Logical Framework
frapps/ FRAPPS: Framework for Resolution-based Automated Proof
Procedures
ft/ FT: Theorem Prover for Intuitionistic Predicate Logic
hiper/ HIPER: Term rewriting E-completion system
isabelle/ Isabelle: Automated generic theorem prover
keim/ KEIM: Tools for Building Theorem Provers
mkrp/ MKRP: Markgraf Karl Refutation Procedure
mvl/ MVL: Multi-Valued Logic
nqthm/ NQTHM: The Boyer-Moore theorem prover.
nuprl/ Nuprl: Proof Development System
otter/ Otter: Resolution-based theorem prover.
plaisted/ Plaisted: Theorem Prover in Prolog
qu_pl/ Qu-Prolog and Ergo: Prototyping of Interactive Theorem Provers
rrl/ RRL: Rewrite Rule Laboratory
setheo/ SETHEO: SEquential THEOrem prover
thm/ THM: Boyer-Moore Theorem Prover
xpnet/ XPNet: X Proof Net
See Also: ?
===========================================================================
Package: areas/reasonng/atp/systems/coq/
Name: Coq
Summary: Calculus of Inductive Constructions
Version: Unix 5.8.3 (6-DEC-93); Mac 5.8.2 (8-JUL-93)
Description:
This directory contains Coq, the Calculus of Inductive Constructions.
===========================================================================
Package: areas/reasonng/atp/systems/dtp/
Name: DTP
Summary: General theorem prover with domain-independent control
of inference.
Version: 2.4 (24-JUN-94)
Description:
DTP (Don's Theorem Prover) is a sound and complete inference engine
for first-order predicate calculus. It specializes in
domain-independent control of inference. The intended audience is
those who need a reliable black box for drawing conclusions and
answering queries from a knowledge base of full first-order axioms.
It was created to incorporate all the necessary search control
knowledge; the database itself need have no search control at all,
either explicit or implicit (e.g. rule or conjunct ordering). An
ideal application, for example, would be as the back end to a machine
learning program or mobile robot. Such systems have a hard enough
time just discovering true things about their worlds, much less
figuring out how to arrange that knowledge in a computationally
tractable way. The philosophy in DTP is that the user need only be
concerned about writing down true axioms, and all search control
knowledge will be embedded in the inference engine.
It includes some logic puzzle examples and a users manual.
===========================================================================
Package: areas/reasonng/atp/systems/elf/
Name: Elf
Summary: LF Logical Framework
Version: 0.4 (1-JUL-93)
Description:
Elf implements the LF Logical Framework (based on the theory of
dependent types) and gives it a logic programming interpretation in
order to support search and the implementation of other algorithms (e.g.
evaluation or compilation in programming languages). It comes with a
number of examples from logic and the theory of programming languages
such as the Church Rosser theorem for the untyped lambda-calculus and
type soundness for Mini-ML. It includes some support code for
editing and interaction in GNU Emacs.
===========================================================================
Package: areas/reasonng/atp/systems/frapps/
Name: FRAPPS
Summary: Framework for Resolution-based Automated Proof Procedures
Version: 2.0 (27-JUN-92)
Description:
FRAPPS (Framework for Resolution-based Automated Proof Procedures) is
a portable resolution theorem-prover written in Common Lisp.
It facilitates the construction of a wide variety of resolution-based
deductive systems. FRAPPS offers the basic functionality necessary to
build such systems, freeing users from low-level implementation
concerns. It is not intended for use in the construction of
high-performance theorem provers, but rather to provide a modular and
customizable system useful for rapid prototyping and experimentation
in teaching and research. An extension to FRAPPS, called "Hooked on
FRAPPS" or "Constraints in FRAPPS" enables the introduction of
specialized unification procedures and constraints.
===========================================================================
Package: areas/reasonng/atp/systems/ft/
Name: FT
Summary: Theorem Prover for Intuitionistic Predicate Logic
Version: C 1.23 (27-JAN-92); Prolog 1.0 (29-MAR-89)
Description:
This directory contains FT, a theorem prover for intuitionistic
predicate logic.
===========================================================================
Package: areas/reasonng/atp/systems/hiper/
Name: HIPER
Summary: Term rewriting E-completion system
Version: 1.0 (28-FEB-92)
Description:
This directory contains the HIPER term rewriting system.
===========================================================================
Package: areas/reasonng/atp/systems/isabelle/
Name: Isabelle
Summary: Automated generic theorem prover
Version: Isabelle 93 (16-DEC-93); Elle 2.4 (6-MAY-94);
LCF 1.5 (25-AUG-92)
Description:
Isabelle is a highly automated generic theorem prover written in
Standard ML. New logics are introduced by specifying their syntax and
rules of inference. Proof procedures can be expressed using tactics
and tacticals. Isabelle comes with 8 different logics, including LCF,
some modal logics, first-order logic, Zermelo-Fraenkel set theory, and
higher-order logic. Isabelle-93 is not upwardly compatible with its
predecessor, but comes with advice on converting to the new
simplifier.
The Elle Verification Environment for ML (requires Isabelle-92),
the archives of the isabelle-users mailing list, and Martin Coen's
Substitutions system are included.
Also included is the Cambridge LCF (Logic for Computable Functions)
interactive theorem prover. Proofs are conducted in PPLAMBDA, a
natural deduction logic based on the domain theory of Dana Scott.
PPLAMBDA is particularly suitable for proofs involving denotational
semantics, lazy evaluation, or higher-order functions. LCF provides a
metalanguage (Standard ML), a functional programming language whose
values include PPLAMBDA terms, formulas, and theorems.
Theorem-proving primitives such as inference rules, subgoaling
strategies (tactics), and simplifiers are implemented as ML functions.
The user can extend LCF by programming in ML. See the book "Logic
and Computation" by L. Paulson, Cambridge University Press, 1987,
for details.
===========================================================================
Package: areas/reasonng/atp/systems/keim/
Name: KEIM
Summary: Tools for Building Theorem Provers
Version: 1.1 (10-OCT-93)
Description:
KEIM is a collection of software modules, written in Common Lisp with
CLOS, designed to be used in the production of theorem proving
systems. KEIM is intended to be used by those who want to build or
use deduction systems (such as resolution theorem provers) without
having to write the entire framework. KEIM is also suitable for
embedding a reasoning component into another Common Lisp program.
KEIM offers a range of datatypes implementing a logical language of
type theory (higher order logic), in which first order logic can be
embedded. KEIM's datatypes and algorithms include: types; terms
(symbols, applications, abstractions), environments (e.g., associating
symbols with types); unification and substitutions; proofs, including
resolution and natural deduction style.
KEIM also provides functionality for the pretty-printing, error
handling, formula parsing and user interface facilities which form a
large part of any theorem prover. Implementing with KEIM thus allows
the programmer to avoid a great deal of drudgery.
The KEIM architecture, based on CLOS (Common Lisp Object System),
allows great flexibility in the integration of new classes of objects.
The generic function paradigm allows one to specialize the behavior of
a function on a new type of object without changing its behavior on
existing objects and without having to rewrite existing code.
===========================================================================
Package: areas/reasonng/atp/systems/mkrp/
Name: MKRP
Summary: Markgraf Karl Refutation Procedure
Version: 21-DEC-92
Description:
This directory contains MKRP, the Markgraf Karl Refutation
Procedure system.
===========================================================================
Package: areas/reasonng/atp/systems/mvl/
Name: MVL
Summary: Multi-Valued Logic
Version: 19-AUG-93
Description:
This directory contains MVL (Multi-Valued Logic), a theorem proving
shell written in Common Lisp. It includes first-order logic, ATMS,
default reasoning and circumscription as special cases.
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.
===========================================================================
Package: areas/reasonng/atp/systems/nqthm/
Name: NQTHM
Summary: The Boyer-Moore theorem prover.
Version: 1992 (January 1994)
Description:
This directory contains Nqthm-1992, the Boyer-Moore theorem prover.
The 1992 version of the theorem prover is upwardly compatible with the
previous (1987) version. Included in the distribution are thousands of
Nqthm-checked theorems formulated by Bevier, Boyer, Brock, Bronstein,
Cowles, Flatau, Hunt, Kaufmann, Kunen, Moore, Nagayama, Russinoff,
Shankar, Talcott, Wilding, Yu, and others. The release of Nqthm-1992
includes three revised chapters of the book `A Computational Logic
Handbook', including Chapter 4, on the formal logic for which the
system is a prover, and Chapter 12, the reference guide to user
commands.
PC-NQTHM is Matt Kaufmann's interactive proof-checking enhancements to
Nqthm-1992.
===========================================================================
Package: areas/reasonng/atp/systems/nuprl/
Name: Nuprl
Summary: Proof Development System
Version: 3.2 (26-MAY-94)
Description:
This directory contains the Nuprl Proof Development System.
===========================================================================
Package: areas/reasonng/atp/systems/otter/
Name: Otter
Summary: Resolution-based theorem prover.
Version: 3.0.2 (17-JUN-94); 3.0.1 (PC, 21-FEB-94);
3.0.0 (24-JAN-94); 2.2 (July 1991)
Description:
Otter (Organized Techniques for Theorem-proving and Effective
Research) is a resolution-style theorem-proving program for
first-order logic with equality. Otter includes the inference rules
binary resolution, hyperresolution, UR-resolution, and binary
paramodulation. Some of its other abilities are conversion from
first-order formulas to clauses, forward and back subsumption,
factoring, weighting, answer literals, term ordering, forward and back
demodulation, evaluable functions and predicates, and Knuth-Bendix
completion.
===========================================================================
Package: areas/reasonng/atp/systems/plaisted/
Name: Plaisted
Summary: Theorem Prover in Prolog
Version: October 1988
Description:
This directory contains Plaisted's theorem prover in Prolog. It is
based on the simplified problem reduction format.
===========================================================================
Package: areas/reasonng/atp/systems/qu_pl/
Name: Qu-Prolog and Ergo
Summary: Prototyping of Interactive Theorem Provers
Version: Qu-Prolog 3.2 (7-DEC-93); Ergo 4.0 (9-DEC-93)
Description:
Qu-Prolog is a high-level language designed primarily for rapid
prototyping of interactive theorem provers and, more generally, for
symbolic computation on formal languages. Its object level includes
quantified terms and object variables. As an example, the interactive
theorem prover Ergo 4.0 is implemented in Qu-Prolog. The compactness
and high level of Ergo 4.0 source code demonstrate the advantages of
Qu-Prolog for such applications. Ergo includes a 'window inference'
method that is specifically designed to support hierarchical
goal-directed proofs and allow easy access to the context of a
subterm. Ergo also provides support for defining a variety of logics
and support for proving schematic theorems and answer extraction.
Ergo is being used to support the development of verified software.
===========================================================================
Package: areas/reasonng/atp/systems/rrl/
Name: RRL
Summary: Rewrite Rule Laboratory
Version: RRL (24-JUL-92); SUTRA 1.0 (30-MAR-90); Herky (5-MAY-93);
Franz RRL (28-MAY-89)
Description:
This directory contains RRL, the Rewrite Rule Laboratory, and
related systems.
===========================================================================
Package: areas/reasonng/atp/systems/setheo/
Name: SETHEO
Summary: SEquential THEOrem prover
Version: 3.0 (26-APR-93)
Description:
SETHEO (SEquential THEOrem prover) is an automated theorem prover for
formulae of predicate logic. SETHEO is based on the calculus of
``connection tableaux''.
===========================================================================
Package: areas/reasonng/atp/systems/thm/
Name: THM
Summary: Boyer-Moore Theorem Prover
Version: November 1987
Description:
This directory contains THM, the Boyer-Moore Theorem Prover. It is
superseded by NQTHM.
===========================================================================
Package: areas/reasonng/atp/systems/xpnet/
Name: XPNet
Summary: X Proof Net
Version: 10-SEP-93
Description:
XPNet (X Proof Net) is a graphical interface to proof nets with an
efficient proof checker.
===========================================================================
Topic: areas/reasonng/case_bsd/
Summary: Case-Based Reasoning
Description:
This directory contains software and other materials about
Case-Based Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Case-Based Reasoning, Reasoning!Case-Based Reasoning
Contains:
protos/ CL-Protos: Knowledge Acquisition for Heuristic Classification
Tasks
riesbeck/ ICBR: Code from "Inside Case-Based Reasoning"
See Also: ?
===========================================================================
Package: areas/reasonng/case_bsd/protos/
Name: CL-Protos
Summary: Knowledge Acquisition for Heuristic Classification Tasks
Version: 15-FEB-90
Description:
CL-PROTOS is a Common Lisp reconstruction of the research version of
the Protos exemplar-based learning apprentice conceived by E. Ray
Bareiss and Bruce W. Porter of the Artificial Intelligence Laboratory
at The University of Texas at Austin. Protos was originally developed
as an experiment in knowledge acquisition for heuristic classification
tasks.
The original research version of Protos was written in Prolog. This
Common Lisp implementation is a reconstruction, not a Prolog-to-Lisp
rewrite. Thus, CL-Protos differs from the original Protos in several
places, but mostly by intention. Ray Bareiss had a consulting role in
this reconstruction and suggested many of the changes.
===========================================================================
Package: areas/reasonng/case_bsd/riesbeck/
Name: ICBR
Summary: Code from "Inside Case-Based Reasoning"
Version: 19-MAR-91
Description:
This directory 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.
===========================================================================
Topic: areas/reasonng/chem/
Summary: Chemical Reasoning
Description:
This directory contains software and other materials about
Chemical Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Chemical Reasoning, Reasoning!Chemical Reasoning
Contains:
congen/ DENDRAL and CONGEN: Molecular Structure Elucidation in Organic
Chemistry
See Also: ?
===========================================================================
Package: areas/reasonng/chem/congen/
Name: DENDRAL and CONGEN
Summary: Molecular Structure Elucidation in Organic Chemistry
Version:
Description:
The DENDRAL Project was an application of computer science to the
problem of molecular structure elucidation in organic chemistry: the
determination of the topological structure of organic compounds from
indirect observations of these compounds with the empirical procedures
of modern chemistry such as mass spectrometry. This problem is
important because the chemical and physical properties of compounds
are determined not just by their constituent atoms, but by the
arrangement of these atoms as well.
"DENDRAL" is the name of the research project, which was conducted at
Stanford University from 1965-1980, under Joshua Lederberg, Edward
Feigenbaum, Bruce Buchanan, and Carl Djerassi as principal
investigators. "DENDRAL" is also the name of the programs produced by
the project. DENDRAL originally stood for DENDRitic ALgorithm, a
procedure for exhaustively and nonredundantly enumerating all the
topologically distinct arrangements of any given set of atoms,
consistent with the rules of chemical valence.
The CONGEN program, the CONstrained GENerator, is one of the most
important programs resulting from this research and embodies the
general (acyclic and cyclic) generation algorithm in a system that
allows a chemist to constrain its enumeration in a variety of ways.
CONGEN is written in BCPL and is being made available to interested
researchers as is, without any warranty or support.
===========================================================================
Topic: areas/reasonng/defeasbl/
Summary: Defeasible Reasoning
Description:
This directory contains software and other materials about
Defeasible Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Defeasible Reasoning, Reasoning!Defeasible Reasoning
Contains:
belief/ BELIEF: Implementation of Paris and Vencovska's model of belief
dprolog/ DPROLOG: Prolog extension for Defeasible Reasoning
nathan/ NATHAN (Spec13): Argues defeasibly in first-order logic.
See Also: ?
===========================================================================
Package: areas/reasonng/defeasbl/belief/
Name: BELIEF
Summary: Implementation of Paris and Vencovska's model of belief
Version: 18-MAR-94
Description:
Paris and Vencovska's paper provides a mathematical model of an
agent's belief in an event by identifying it with his ability to
imagine the event within the context of his previous experience.
This approach leads to beliefs having properties different from
those normally ascribed to it [1].
The package includes a brief introduction, an implementation of
Paris and Vencovska's model of belief and a description of the
implementation.
===========================================================================
Package: areas/reasonng/defeasbl/dprolog/
Name: DPROLOG
Summary: Prolog extension for Defeasible Reasoning
Version:
Description:
DPROLOG is an extension of Prolog implementing defeasible reasoning.
===========================================================================
Package: areas/reasonng/defeasbl/nathan/
Name: NATHAN (Spec13)
Summary: Argues defeasibly in first-order logic.
Version: 19-FEB-94
Description:
Nathan (specs1-13) is a relatively fast implementation of a defeasible
reasoner with specificity. It uses arguments of the kind described in
[1,2] and its specificity comparator (LMNOP) is described in [3] which
is a modification of the criterion of Poole.
It solves all basic benchmark problems to the author's satisfaction.
Its limitations in planning applications are due to the limits of its
underlying resolution-refutation linear-input set-of-support
theorem-prover for FOL.
It includes a predicate for unique names. It includes a perl
preprocessor for extracting rules from cases.
===========================================================================
Topic: areas/reasonng/medical/
Summary: Medical Reasoning
Description:
This directory contains software and other materials about
Medical Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Medical Reasoning, Reasoning!Medical Reasoning
Contains:
tmycin/ TMYCIN: Medical Reasoning System
See Also: ?
===========================================================================
Package: areas/reasonng/medical/tmycin/
Name: TMYCIN
Summary: Medical Reasoning System
Version: 5-JAN-90
Description:
This directory contains TMYCIN (Tiny EMYCIN), a simple expert
system tool patterned after the EMYCIN tool developed at Stanford.
===========================================================================
Topic: areas/reasonng/meta/
Summary: Meta Reasoning
Description:
This directory contains software and other materials about
Meta Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Meta Reasoning, Reasoning!Meta Reasoning
Contains:
multagnt/ MULTAGNT: Prolog simulation of multi-agent tutoring.
See Also: ?
===========================================================================
Package: areas/reasonng/meta/multagnt/
Name: MULTAGNT
Summary: Prolog simulation of multi-agent tutoring.
Version: 21-AUG-93
Description:
MULTAGNT is a simulation of error detection and identification in a
small tutoring setting, consisting of a Teacher and a Learner. The
objective of MULTAGNT is to show, how through meta-logical knowledge the
Teacher can detect and identify deficiencies in the Learner's knowledge.
The meta-logical knowledge used consists of predicates:
- can_do, for determining what a theory of an agent can prove
- cannot_do, for determining what a theory of an agent cannot
prove
- demo_trace_2, for determining the erroneous clause in an
agent's theory
which are used by an agent (usually the Teacher) to judge the
knowledge of another agent (referred-to as Learner). Agent's are
represented by sets of theories, where a theory is a set of clauses.
In this setting the Teacher's knowledge is assumed to be correct.
Thus, it can be used as reference knowledge, for generating question
posed to the Learner and to judge the knowledge of the Learner.
===========================================================================
Topic: areas/reasonng/probabl/
Summary: Probabilistic Reasoning
Description:
This directory contains software and other materials about
Probabilistic Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Probabilistic Reasoning, Reasoning!Probabilistic Reasoning
Contains:
bayes/ BAYES: Tree-structured Bayesian belief network
belief/ BELIEF: Graphical Belief Function Models and Graphical
Probabilistic Models
doc/ Documentation related to Probabilistic Reasoning
ideal/ IDEAL: Information about the IDEAL testbed for influence
diagrams and Bayesian networks
rcstat/ RCSTAT: Produces probability intervals from raw data using the
Kyburg/Pollock method.
See Also: ?
===========================================================================
Package: areas/reasonng/probabl/bayes/
Name: BAYES
Summary: Tree-structured Bayesian belief network
Version: 11-MAR-91
Description:
This directory contains an implementation of Judea Pearl's belief
propagation algorithm for tree-structured Bayesian belief networks.
===========================================================================
Package: areas/reasonng/probabl/belief/
Name: BELIEF
Summary: Graphical Belief Function Models and Graphical
Probabilistic Models
Version: 1.2 (6-MAR-92)
Description:
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 uses the Shenoy and Shafer version of the
algorithm, so one of its unique features is that it supports both
probability distributions and belief functions. It also has limited
support for second order models (probability distributions on
parameters).
Version 1.2 corresponds to CLtL2 and Version 1.1 to CLtL1.
Contact the author at almond@statsci.com for information about a
commercial version GRAPHICAL-BELIEF currently in the prototype stages.
===========================================================================
Package: areas/reasonng/probabl/doc/
Name:
Summary: Documentation related to Probabilistic Reasoning
Version:
Description:
This directory contains documentation related to probabilistic reasoning.
===========================================================================
Package: areas/reasonng/probabl/ideal/
Name: IDEAL
Summary: Information about the IDEAL testbed for influence
diagrams and Bayesian networks
Version:
Description:
This directory contains software and other materials about
Probabilistic Reasoning.
===========================================================================
Package: areas/reasonng/probabl/rcstat/
Name: RCSTAT
Summary: Produces probability intervals from raw data using
the Kyburg/Pollock method.
Version: 9-DEC-92
Description:
Few uncertainty reasoning programs go directly from raw observations
to probabilities. Statistical techniques in the Neyman-Pearson
tradition are widely available, but require more expert intervention
than is acceptable for some AI applications. The main problem is
identifying the reference class: as past instances are required to
resemble the target more closely, the sample of such instances
diminishes. The logic for finding the right balance between relevance
and sufficient sample size is not treated in mathematical statistics,
but is treated in the philosophical foundations of probability.
===========================================================================
Topic: areas/reasonng/qualittv/
Summary: Qualitative Reasoning
Description:
This directory contains software and other materials about
Qualitative Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Qualitative Reasoning, Reasoning!Qualitative Reasoning
Contains:
qpe/ QPE: Qualitative Process Engine
qsim/ QSIM: A Tool for Modeling and Simulation with Incomplete
Knowledge
See Also: ?
===========================================================================
Package: areas/reasonng/qualittv/qpe/
Name: QPE
Summary: Qualitative Process Engine
Version: 2.6 (20-FEB-90)
Description:
QPE is the Qualitative Process Engine, an envisioner for QP theory.
===========================================================================
Package: areas/reasonng/qualittv/qsim/
Name: QSIM
Summary: A Tool for Modeling and Simulation with Incomplete Knowledge
Version: 2.0
Description:
QSIM is a qualitative reasoning system implemented in Common Lisp.
===========================================================================
Topic: areas/reasonng/temporal/
Summary: Temporal Reasoning
Description:
This directory contains software and other materials about
Temporal Reasoning.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Reasoning!Temporal Reasoning, Temporal Reasoning
Contains:
hic/ HIC: Hierarchical Interval Constraint Temporal Reasoning System
tg/ TimeGraph II (TG-II): Reasoning about Qualitative Temporal
Information
zeno/ ZENO: Temporal Planning with Continuous Change
See Also: ?
===========================================================================
Package: areas/reasonng/temporal/hic/
Name: HIC
Summary: Hierarchical Interval Constraint Temporal Reasoning System
Version: 3-NOV-92
Description:
HIC is the hierarchical interval constraint temporal reasoning system.
===========================================================================
Package: areas/reasonng/temporal/tg/
Name: TimeGraph II (TG-II)
Summary: Reasoning about Qualitative Temporal Information
Version: 1.0 (30-MAR-94)
Description:
TimeGraph II (TG-II) handles the set of the relations of the Point
Algebra and of the Pointizable Interval Algebra (also called Simple
Interval Algebra by P. van Beek). Temporal relations are represented
through a "timegraph", a graph partitioned into a collection of "time
chains" which are automatically structured for efficiency. The system
is scalable, in the sense that the storage tends to remain linear in
the number of relations asserted. Efficient query handling is achieved
through a time point numbering scheme and a "metagraph" data
structure.
===========================================================================
Package: areas/reasonng/temporal/zeno/
Name: ZENO
Summary: Temporal Planning with Continuous Change
Version: 4-NOV-94
Description:
This directory contains the ZENO temporal planner. It is a least
commitment planner that handles actions occurring over extended
intervals of time. ZENO supports deadline goals, metric preconditions,
metric effects, and continuous change. It is sound and complete.
===========================================================================
Topic: areas/reasonng/tms/
Summary: Truth Maintenance
Description:
This directory contains software and other materials about
Truth Maintenance.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Reasoning!Truth Maintenance, Truth Maintenance
Contains:
bps/ BPS: Code from "Building Problem Solvers"
slg/ SLG: Goal-Oriented Deductive Query Processing and Non-Monotonic
Reasoning
tutorial/ Truth Maintenance Tutorial Code
See Also: ?
===========================================================================
Package: areas/reasonng/tms/bps/
Name: BPS
Summary: Code from "Building Problem Solvers"
Version: 102493
Description:
This directory contains the truth maintenance system and problem
solver implementations described in the book "Building Problem
Solvers" by Ken Forbus and Johan de Kleer.
===========================================================================
Package: areas/reasonng/tms/slg/
Name: SLG
Summary: Goal-Oriented Deductive Query Processing and Non-Monotonic
Reasoning
Version: 4-NOV-93
Description:
The SLG system is a meta interpreter implementation of
goal-oriented deductive query processing and non-monotonic
reasoning with the following features:
* goal-oriented query evaluation of normal logic programs
under the well-founded semantics by Van Gelder, Ross
and Schliph;
* goal-oriented query evaluation of general logic programs
under the alternating fixpoint logic by Van Gelder, with
the restriction that the body of a clause has to be either
an existential conjunction of literals or a universal
disjunction of literals.
* goal-oriented query evaluation under the stable model semantics
by Gelfond and Lifchitz.
* integration with Prolog execution, and the use of Prolog syntax
for all programs.
===========================================================================
Package: areas/reasonng/tms/tutorial/
Name:
Summary: Truth Maintenance Tutorial Code
Version: 2-OCT-91
Description:
This directory contains the AAAI tutorial on ATMS by Ken Forbus and
Johan de Kleer.
===========================================================================
Package: areas/reasonng/toolset/
Name: Toolset
Summary: OSU LAIR Generic Task Toolset
Version: Fafner release 1.1-DoD
Description:
The Integrated Generic Task Toolset provides computational mechanisms
especially suited for certain reasoning tasks which are typically
encountered during the course of diagnosis, design, planning, and
similar knowledge-based activities. By directly supporting a set of
basic reasoning tasks, the toolset provides building blocks out of
which more complex reasoning systems can be built. To support a
particular reasoning task, the toolset provides a set of appropriate
mechanisms, each with its own control strategies and characteristic
ways of organizing and representing knowledge. Thus, the toolset
provides to the knowledge system builder an advantage over rules,
logic, semantic nets, frames, and neural nets, similar to the
advantage that higher-level languages provide over assembly language
for the computer programmer.
===========================================================================
Topic: areas/robotics/
Summary: Robotics
Description:
This directory contains robotics software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Robotics, Software Packages
Contains:
doc/ Robotics Documentation Files
faq/ Robotics FAQ: Frequently Asked Questions (FAQ) postings for
comp.robotics
systems/ Robotics Software Packages
See Also: ?
===========================================================================
Topic: areas/robotics/doc/
Summary: Robotics Documentation Files
Description:
This directory contains robotics documentation and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Robotics
Contains:
bib/ Robotics Bibliographies
notes/ Robotics Documentation Files
See Also: ?
===========================================================================
Package: areas/robotics/doc/bib/
Name:
Summary: Robotics Bibliographies
Version:
Description:
This directory contains robotics bibliographies and related materials.
===========================================================================
Package: areas/robotics/doc/notes/
Name:
Summary: Robotics Documentation Files
Version:
Description:
This directory contains robotics documentation and related materials.
Current files include:
whos_who.txt Grad Students Who's Who in Robotics (6-JUN-94)
===========================================================================
Package: areas/robotics/faq/
Name: Robotics FAQ
Summary: Frequently Asked Questions (FAQ) postings for comp.robotics
Version:
Description:
A compendium of answers to frequently asked questions about
Robotics and related topics. Posted monthly to the comp.robotics
newsgroup.
comp.robotics is archived on wilma.cs.brown.edu:/pub/comp.robotics/
===========================================================================
Topic: areas/robotics/systems/
Summary: Robotics Software Packages
Description:
This directory contains robotics software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Robotics
Contains:
hyperbot/ HYPERBOT: Programmer's interface for robotics sensors and
effectors.
pcrobots/ PC Robots: Graphical, Multilanguage Crobots Game
stiquito/ Stiquito: Information about nitinol-propelled hexapod robots
See Also:
areas/testbeds/
===========================================================================
Package: areas/robotics/systems/hyperbot/
Name: HYPERBOT
Summary: Programmer's interface for robotics sensors and effectors.
Version: 14-JUN-92
Description:
This directory contains Max Heilperin's simple programmer's
interface for robotics sensors and effectors, such as in Lego(R)
Technic Control kits and the like, using the Hyperbot(TM) controller.
The Hyperbot controller hardware can be obtained from Bots, 905 South
Springer Rd., Los Altos, CA 94024, USA. Phone: (415) 949-2126; Fax:
(415) 949-2566; CompuServe: 75500,2027; Internet: 75500.2027@compuserve.com.
Lego(R) kits compatible with the Hyperbot controller can be obtained from
Bots, or directly from Lego Dacta, 555 Taylor Rd., P.O. Box 1600,
Enfield, CT 06083-1600, USA. Phone: (800) 526-8339; Fax: (203) 763-2466.
Other kits, e.g. fischertechnik(R) and Capsella(R), may also work with
Hyperbot; contact Bots for more information.
===========================================================================
Package: areas/robotics/systems/pcrobots/
Name: PC Robots
Summary: Graphical, Multilanguage Crobots Game
Version: 1.3 (1-NOV-92)
Description:
This directory contains PCROBOTS, a graphical, multilanguage crobots game.
It is an adaptation of Tom Poindexter's CROBOTS, but with more
features and allowing for more intelligent robots. It isn't limited
to any particular language, with C, Pascal, Compiled Basic, and 8086
Assembler implementations. The only limitation is it must (currently)
be run on an IBM PC compatible.
===========================================================================
Package: areas/robotics/systems/stiquito/
Name: Stiquito
Summary: Information about nitinol-propelled hexapod robots
Version:
Description:
Stiquito is a small (3cm H x 7cm W x 6cm L), simple (32 parts) and
inexpensive (< $30) nitinol-propelled hexapod robot developed at the
Indiana University (Bloomington) Robotics Laboratory. Its legs are
propelled by nitinol actuator wires. Each leg has one degree of freedom.
The robot walks up to 10 centimeters per minute and can carry a 9-volt
cell, a MOSIS "tiny chip" and power transistors to drive the nitinol
actuator wires. Nitinol wire (aka BioMetal, Flexinol), is a nickel-titanium
alloy which exerts useful force as it is heated by passing a current
through it. IUCS Technical Report 363a describes Stiquito's construction.
This directory contains that report and related materials.
A kit containing all the materials needed to construct a simple
version of Stiquito and its controller is available for an extra $10
from the address below (use attn line "Stiquito Kit"). To receive a
video showing the assembly of Stiquito, include an additional $10 and
add "Video" to the "Attn:" line.
===========================================================================
Topic: areas/search/
Summary: Search
Description:
This directory contains search software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Search, Software Packages
Contains:
aisearch/ AI Search: AI C++ Search Class Library
See Also: ?
===========================================================================
Package: areas/search/aisearch/
Name: AI Search
Summary: AI C++ Search Class Library
Version: 6-JAN-94
Description:
The search class library is meant to be used as a tool for developing
problem solving software. The library offers the programmer a set of
search algorithms that may be used to solve all kind of different
problems.
The following search algorithms have been implemented:
- depth-first tree and graph search.
- breadth-first tree and graph search.
- uniform-cost tree and graph search.
- best-first search.
- bidirectional depth-first tree and graph search.
- bidirectional breadth-first tree and graph search.
- AND/OR depth tree search.
- AND/OR breadth tree search.
===========================================================================
Topic: areas/speech/
Summary: Speech Recognition and Synthesis
Description:
This directory contains speech recognition and speech synthesis
software and related materials.
Origin: Speech recognition and synthesis materials, including
the articles from the comp.speech newsgroup, are
archived on
svr-ftp.eng.cam.ac.uk:/comp.speech/ [129.169.24.20]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Software Packages, Speech Recognition,
Speech Synthesis
Contains:
archive/ Archive of articles from the comp.speech newsgroup
database/ Speech-related databases
doc/ Speech Recognition and Synthesis Documentation Files
faq/ Speech FAQ: Frequently Asked Questions (FAQ) postings for
comp.speech
systems/ Speech Recognition and Synthesis Software
See Also: ?
===========================================================================
Package: areas/speech/archive/
Name:
Summary: Archive of articles from the comp.speech newsgroup
Version:
Description:
This directory contains an archive of the articles from the
comp.speech newsgroup.
===========================================================================
Topic: areas/speech/database/
Summary: Speech-related databases
Description:
This directory contains several speech-related databases.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Speech Recognition!Databases, Speech Synthesis!Databases
Contains:
britpron/ BritPron: Pronunciation dictionary
homofonz/ HOMOPHONES: List of homophones in General American English
hvd/ hVd Database: Spoken vowels in context.
pb/ Peterson Barney: Vowel formant frequency database
See Also: ?
===========================================================================
Package: areas/speech/database/britpron/
Name: BritPron
Summary: Pronunciation dictionary
Version: 0.11 (8-JUN-94)
Description:
This directory Tony Robinson's pronunciation dictionary.
===========================================================================
Package: areas/speech/database/homofonz/
Name: HOMOPHONES
Summary: List of homophones in General American English
Version: 1.01 (17-MAY-94)
Description:
This directory contains a list of homophones in "General American
English". Homophones are words that "sound the same" but are spelled
differently. For example, "bear" and "bare" are homophones, but "bear"
(noun) and "bear" (verb) are not.
This list is based on the book "Handbook of Homophones" by William
Cameron Townsend, 1975.
===========================================================================
Package: areas/speech/database/hvd/
Name: hVd Database
Summary: Spoken vowels in context.
Version:
Description:
This directory contains a database of vowels spoken in between a h
and a d (hence the name "hVd"). The speakers 'andy' and 'geoff'
were recorded directly on to the computer by Andy Hewett during 1987.
The other speakers were recorded in a quiet (but not anechoic) office
using a Sony PCM video tape machine by David Deterding during 1987.
It includes male and female speakers. The speech is sampled using a
12 bit ADC at 10kHz.
===========================================================================
Package: areas/speech/database/pb/
Name: Peterson Barney
Summary: Vowel formant frequency database
Version: 5-JAN-93
Description:
This directory contains the Peterson and Barney vowel formant
frequency database, as used in their 1952 JASA paper. Peterson and
Barney measured the frequency and amplitude of F1, F2 and F3 for 10
vowels and 76 speakers.
===========================================================================
Topic: areas/speech/doc/
Summary: Speech Recognition and Synthesis Documentation Files
Description:
This directory contains documentation about speech recognition and
speech synthesis, such as bibliographies and notes.
Origin: Speech recognition and synthesis materials, including
the articles from the comp.speech newsgroup, are
archived on
svr-ftp.eng.cam.ac.uk:/comp.speech/ [129.169.24.20]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Speech Recognition!Documentation, Speech Synthesis!Documentation
Contains:
bib/ Speech Recognition and Synthesis Bibliography
notes/ Speech Recognition and Synthesis Information Files
See Also: ?
===========================================================================
Package: areas/speech/doc/bib/
Name:
Summary: Speech Recognition and Synthesis Bibliography
Version:
Description:
This directory contains a bibliography of work on speech recognition and
speech synthesis.
===========================================================================
Package: areas/speech/doc/notes/
Name:
Summary: Speech Recognition and Synthesis Information Files
Version:
Description:
This directory contains several notes about speech recognition and
speech synthesis, including
mac_talk.txt List of Macintosh Speech Manager/MacInTalk
Pro/PlainTalk aware applications, 4e. By
Joe Campbell (13-SEP-93).
audiofmt.tgz Audio File Formats FAQ 3.08 (22-FEB-94).
By Guido van Rossum .
ftp.cwi.nl:/pub/audio/AudioFormats.part{1,2}
[192.16.184.180]
ldc.tar Information about the Linguistic Data Consortium
ftp.cis.upenn.edu:/pub/ldc/ [130.91.6.8]
Elizabeth Hodas
celp_com.txt Information about CVI's commercial
implementation of CELP voice compression.
csre.txt Information about CSRE's speech analysis and
synthesis software.
diy_sr.txt How to do Simple Speech Recognition
htk.txt Information about the HTK speech recognition system.
dragon.txt Information about IBM VoiceType.
icassp94.tgz Information about the ICASSP94 cdrom.
hcrc_map.txt Information bout the HCRC's map task corpus.
trillium.txt Information about Trillium Sound Research's
text to speech kits for the NeXT.
patents.txt Speech patents 1992-93
phon_dat.txt Information about PhonDat, a large database of
spoken German.
qualix.txt Information about Qualix Group and Agog, Inc.'s
SayIt voice recognition product for the Sparc.
products.txt A list of speech recognition products.
synth.txt Information about speech synthesis software.
tidigits.txt Information about the TI DIGITS database on CD-ROM.
fonetiks.txt Information about the foNETiks mailing list.
===========================================================================
Package: areas/speech/faq/
Name: Speech FAQ
Summary: Frequently Asked Questions (FAQ) postings for comp.speech
Version:
Description:
A compendium of answers to frequently asked questions about
Speech Recognition, Speech Synthesis, and related topics. Posted
monthly to the comp.speech newsgroup.
comp.speech is archived on
svr-ftp.eng.cam.ac.uk:/comp.speech/archive/ [129.169.24.20]
===========================================================================
Topic: areas/speech/systems/
Summary: Speech Recognition and Synthesis Software
Description:
This directory contains speech recognition and speech synthesis
software.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Speech Recognition, Speech Synthesis
Contains:
afsp/ AFsp: Audio File I/O Routines
celp/ CELP: FS-1016 Code Excited Linear Prediction coder
cookbook/ Cookbook: Speech processing functions in C.
eng2phon/ English to Phoneme Translation
fview/ Fview: Speech trajectory analysis and display
g7xx/ G711_G721_G723: CCITT ulaw and ADPCM compression coders.
gsm/ GSM: Implementation of the 13 kbps GSM speech coding standard.
hmm/ HMM: Hidden Markov Model software for automatic speech
recognition.
klatt/ Klatt: A Klatt-style speech synthesizer implemented in C.
kplot/ KPlot: Simple graphical editor for Klatt parameter files.
ldcelp/ LD-CELP: Implementation of the Low-Delay Code Excited Linear
Prediction Speech Coding Standard
lotec/ LOTEC: Simple Speech Recognition System
lpc/ LPC-10: Implementation of DoD LPC-10 2400 bps Voice Coder
netaudio/ NetAudio: Audio protocol for networks
ogitools/ OGI Speech Tools: Speech data manipulation tools
pc_conv/ PC Convolution Demo: Graphic illustration of the convolution
operation
pcm2alaw/ PCM to A-law: Convert from linear or u-law PCM to and from
A-law PCM
pt/ Pitch Tracker: Pitch extractor and pitch period marking program
rasta/ Rasta: The RASTA-PLP front end for speech recognition
recnet/ RECNET: Connectionist speech recognition system using recurrent
nets.
rplay/ RPLAY: Sound package with network audio
rsynth/ RSYNTH: Complete speech synthesis system for UNIX
shorten/ Shorten: A lossless compressor for waveform files
sox/ SOX: Converts between various audio formats
spasm/ SPASM: Perry Cook's Singing Voice Synthesizer
spctools/ SPC Toolbox: Signal Processing and Communications
speak/ SPEAK: Text to speech via phoneme concatenation.
textnorm/ TEXTNORM: A very simple text normalization package.
See Also: ?
===========================================================================
Package: areas/speech/systems/afsp/
Name: AFsp
Summary: Audio File I/O Routines
Version: V1R2 (24-FEB-94)
Description:
The AFsp package is a library of routines for reading and writing
audio files. The emphasis is on providing support for the type of
audio file used by the speech processing research community. The
routines have been designed to be easy to use, yet provide transparent
support the reading of several audio file formats. A secondary
purpose for distributing these routines is to encourage the use of a
standard audio file format for the header information in the output
files.
The following file formats are supported for reading.
- NIST SPHERE audio files
- Sun/NeXT audio files
- DEC audio files
- IRCAM SoundFiles
- INRS-Telecom audio files
- ESPS sampled data feature files
- Headerless audio files
The audio file open routine automatically senses the file type and
communicates it to the audio file reading routines. Formats are
converted on the fly as the file is read, so the user manipulates
floats and doesn't need to worry about the underlying data format.
For writing, the routines produce a standard format file, though
options are available to produce headerless files if desired. This
standard format is a compatible with the Sun audio file format. There
is provision for storing extra information in the extensible part of
the header.
Several audio file utilities (for copying, comparing, and filtering
audio files) are included in the package.
===========================================================================
Package: areas/speech/systems/celp/
Name: CELP
Summary: FS-1016 Code Excited Linear Prediction coder
Version: 3.2a (3-AUG-93)
Description:
CELP is a lossy compression algorithm used for low bit rate (e.g.,
4800 bps in U.S. Fed-Std-1016) speech coding. CELP stands for "code
excited linear prediction". CELP coding, at 4800 bps, breaks the
performance barrier of most Government standards, providing Consortium
ratings of "very good" intelligibility and "excellent" quality,
comparable to 32,000 bps CVSD.
Like all vector quantization techniques, CELP coding is a
frame-oriented technique that breaks a sampled input signal into
blocks of samples (i.e., vectors) that are processed as one unit.
CELP coding is based on analysis-by-synthesis search procedures,
perceptually weighted vector quantization (VQ), and linear prediction
(LP). A 10th order LP filter is used to model the speech signal's
short-term spectrum, or formant structure. Long-term signal
periodicity, or pitch, is modeled by an adaptive code book VQ. The
residual from the short-term LP and pitch VQ is vector quantized using
a fixed stochastic code book. The optimal scaled excitation vectors
from the adaptive and stochastic code books are selected by minimizing
a time varying, perceptually weighted distortion measure that improves
subjective speech quality by exploiting masking properties of human
hearing.
The CELP coder's computational requirements are dominated by the two
code book searches. The computational complexity and speech quality
of the coder depend upon the search sizes of the code books. Any
subset of either code book can be searched to fit processor
constraints, at the expense of speech quality.
Fed-Std-1016 uses an 8 kHz sample rate and a 30 ms frame size with
four 7.5 ms subframes. CELP analysis consists of three basic
functions: 1) short-term linear prediction, 2) long-term adaptive code
book search, and 3) innovation stochastic code book search. CELP
synthesis consists of the corresponding three synthesis functions
performed in reverse order with the optional addition of a fourth
function, called a postfilter, to enhance the output speech. The
transmitted CELP parameters are the stochastic code book index and
gain, the adaptive code book index and gain, and 10 line spectral
parameters (LSP).
This directory contains the U.S. DoD's Federal-Standard-1016 based
4800 bps code excited linear prediction voice coder version 3.2
(CELP 3.2) Fortran and C simulation source codes. Example input and
processed speech files are included.
[Not really AI, but included for completeness relative to
comp.speech. --mark]
===========================================================================
Package: areas/speech/systems/cookbook/
Name: Cookbook
Summary: Speech processing functions in C.
Version: 01-JUL-94
Description:
This directory contains cookbook of C functions that are often used
in speech processing. These currently include LPC, FFT, DTW,
windowing, and supporting code such as file reading and command line
argument passing. Example applications include a simple DTW based
recognizer and a simple Viterbi based pitch tracker.
This package is still under active development.
===========================================================================
Package: areas/speech/systems/eng2phon/
Name:
Summary: English to Phoneme Translation
Version: 15-APR-85
Description:
This directory contains a classic implementation of letter to phoneme
rules by the Naval Research Laboratory.
===========================================================================
Package: areas/speech/systems/fview/
Name: Fview
Summary: Speech trajectory analysis and display
Version: 1.2 (1-JUL-94)
Description:
Fview is a GUI program for speech trajectory analysis and display.
The program is used for projecting higher dimensional data onto
the screen of the computer and manipulating it in various ways. It is
particularly useful (and designed for) speech data in the form of
trajectories in twelve dimensional space.
===========================================================================
Package: areas/speech/systems/g7xx/
Name: G711_G721_G723
Summary: CCITT ulaw and ADPCM compression coders.
Version: 31-AUG-92
Description:
This directory contains the reference implementations of the ulaw
and ADPCM coders as described by the CCITT (International Telegraph
and Telephone Consultative Committee) G.711, G.721 and G.723 voice
compression standards. The implementations were written by Sun
Microsystems and released to the public domain.
===========================================================================
Package: areas/speech/systems/gsm/
Name: GSM
Summary: Implementation of the 13 kbps GSM speech coding standard.
Version: 1.0.4 (10-MAY-94)
Description:
This directory contains an implementation of the European GSM 06.10
provisional standard for full-rate speech transcoding, prI-ETS 300 036,
which uses RPE/LTP (residual pulse excitation/long term prediction)
coding at 13 kbit/sec.
GSM 06.10 compresses frames of 160 13-bit samples (8 kHz sampling
rate, i.e. a frame rate of 50 Hz) into 260 bits; for compatibility
with typical UNIX applications, this implementation turns frames of 160
16-bit linear samples into 33-byte frames (1650 Bytes/s).
The quality of the algorithm is good enough for reliable speaker
recognition; even music often survives transcoding in recognizable
form (given the bandwidth limitations of 8 kHz sampling rate).
The interfaces offered are a front end modeled after compress(1), and
a library API. Compression and decompression run faster than realtime
on most SPARCstations. The implementation has been verified against
the ETSI standard test patterns.
===========================================================================
Package: areas/speech/systems/hmm/
Name: HMM
Summary: Hidden Markov Model software for automatic speech recognition.
Version: 1.0 (31-MAY-94)
Description:
This directory contains HMM, an example of the Hidden Markov Model
algorithms used by L. Rabiner, K-F Lee, and others for speech
recognition. The code implements in C++ a basic left-right Hidden
Markov Model and corresponding Baum-Welch (ML) training algorithm.
===========================================================================
Package: areas/speech/systems/klatt/
Name: Klatt
Summary: A Klatt-style speech synthesizer implemented in C.
Version: 3.0.4 (9-MAY-94)
Description:
This directory contains a C implementation of a Klatt-style cascade
parallel formant speech synthesizer. The software is an attempt to
implement, and remain faithful to, Dennis Klatt's original design of
software synthesizer, as described in the original JASA article.
The aim of the software is to convert frames of audio parameters into
chunks of speech waveform. Forty parameters are specified per frame,
including formant frequencies, amplitudes and bandwidths, voicing,
frication and so on. Each frame of parameters usually represents 10ms
of output speech. Two (simple!) example parameter files are
supplied with the package.
===========================================================================
Package: areas/speech/systems/kplot/
Name: KPlot
Summary: Simple graphical editor for Klatt parameter files.
Version: 1.00 (12-JUN-94)
Description:
This directory contains KPlot, a simple graphical editor for files
of parameters to control a Klatt synthesiser.
===========================================================================
Package: areas/speech/systems/ldcelp/
Name: LD-CELP
Summary: Implementation of the Low-Delay Code Excited Linear
Prediction Speech Coding Standard
Version: 13-AUG-93
Description:
This directory contains an implementation of the new Low-Delay Code
Excited Linear Prediction (LD-CELP) speech coding standard (CCITT G.728).
===========================================================================
Package: areas/speech/systems/lotec/
Name: LOTEC
Summary: Simple Speech Recognition System
Version: 23-MAY-94
Description:
The Lotec Speech Recognition Package is all you need to build a
single-speaker, small-vocabulary, low-quality continuous speech
recognition module, for use as part of a larger system. Input is sound
samples in the Sun .au file format, plus word templates in the same
format, and output is a bunch of word hypotheses, each consisting of
temporal location and likelihood score (e.g., `template 2 for the word
"central" matched the input best in the time span from 450 to 830
milliseconds, and the match discrepancy was 405.32). (That is, it
outputs a lattice of word hypotheses.)
===========================================================================
Package: areas/speech/systems/lpc/
Name: LPC-10
Summary: Implementation of DoD LPC-10 2400 bps Voice Coder
Version: 1.0 (October 1993)
Description:
This directory contains an implementation of the U.S. Department of
Defense LPC-10 2400 bps Voice Coder (version 55). Also included are
some sample speech files, before and after coding, a file of
Frequently Asked Questions items for LPC and CELP, and ABTOOL 1.2
(beta), a Sun GUI tool for playing listening comparisons between
speech files.
===========================================================================
Package: areas/speech/systems/netaudio/
Name: NetAudio
Summary: Audio protocol for networks
Version: 1.2
Description:
This directory contains NetAudio, the network-transparent audio
system that NCD originally designed for its MCX line of X terminals.
===========================================================================
Package: areas/speech/systems/ogitools/
Name: OGI Speech Tools
Summary: Speech data manipulation tools
Version: 1.0 (20-OCT-93)
Description:
This directory contains the OGI Speech Tools, a set of speech data
manipulation tools developed at the Center for Spoken Language
Understanding (CSLU) at the Oregon Graduate Institute of Science and
Technology (Portland Oregon). The tools can be used to compute and
display signal representations, label speech at different levels
(e.g., phonetic, phonemic and word), train neural network classifiers,
and display the output of classification or recognition algorithms
time-aligned with the speech.
The distribution includes, among other things,
+ LYRI, an X Windows tool for displaying data in a time
synchronous fashion (speech signal, spectrograms, phoneme
labels).
+ NOPT, a neural network training package, which uses Conjugate
Gradient descent optimization.
+ LIBNSPEECH, an extensive set of C library signal processing
routines for the manipulation of speech data, including PLP
Analysis, Rasta PLP Analysis, Linear Predictive Coding, Mel
Cepstrum Coding, and Fast Fourier Transform.
+ Utilities for converting file formats, such as ADC to NIST,
to/from mu-law, filtering the speech waveform, and
ascii/binary data streams.
+ A Vector-Quantizer based on the Linde Buzo and Gray (LBG) algorithm.
===========================================================================
Package: areas/speech/systems/pc_conv/
Name: PC Convolution Demo
Summary: Graphic illustration of the convolution operation
Version: 4.8.1
Description:
This directory contains a demonstration version of the program
P.C. Convolution. This program executes on most DOS machines
and graphically demonstrates the convolution operation. It
is useful in undergraduate Electrical Engineering courses.
A fully operational version of this software is available free of
charge to university instructors. Contact Dr. Kurt Kosbar for more
details.
===========================================================================
Package: areas/speech/systems/pcm2alaw/
Name: PCM to A-law
Summary: Convert from linear or u-law PCM to and from A-law PCM
Version: 14-JUN-93
Description:
This directory contains some C-routines which convert
+ A-law (8bit) to/from linear (16bit)
+ A-law (8bit) to/from U-law (8bit)
===========================================================================
Package: areas/speech/systems/pt/
Name: Pitch Tracker
Summary: Pitch extractor and pitch period marking program
Version: 1.0 (16-JUN-94)
Description:
This directory contains a pitch extractor and pitch period marking
program from Christine Tuerk.
===========================================================================
Package: areas/speech/systems/rasta/
Name: Rasta
Summary: The RASTA-PLP front end for speech recognition
Version: 21-OCT-92
Description:
This directory contains an original implementation of the
Perceptual Linear Prediction (PLP) and RASTA PLP of Hermansky.
===========================================================================
Package: areas/speech/systems/recnet/
Name: RECNET
Summary: Connectionist speech recognition system using recurrent nets.
Version: 1.3 (12-JUL-93)
Description:
This directory contains RECNET, a connectionist speech recognition
system. It performs phone and word recognition for the TIMIT and
Resource Management databases using recurrent nets. Known to be of
limited use.
===========================================================================
Package: areas/speech/systems/rplay/
Name: RPLAY
Summary: Sound package with network audio
Version: 3.1.0
Description:
This directory contains RPLAY, a sound package that supports both
local and remote sound control. RPLAY is based on client/server
communication using two protocols. The first protocol that can be
used is RPLAY, which is UDP based and allows sounds to be played,
paused, continued, and stopped. The second protocol is RPTP (the
Remote Play Transfer Protocol) which is TCP based and allows sounds to
be played, paused, continued, stopped, and transferred.
===========================================================================
Package: areas/speech/systems/rsynth/
Name: RSYNTH
Summary: Complete speech synthesis system for UNIX
Version: 1.0 (25-FEB-94)
Description:
This directory contains RSYNTH, a complete speech synthesis system
for UNIX systems with audio support. It integrates several
publicly available pieces of a speech system into a cohesive whole.
===========================================================================
Package: areas/speech/systems/shorten/
Name: Shorten
Summary: A lossless compressor for waveform files
Version: 1.13 (11-APR-94)
Description:
This directory contains SHORTEN, a high quality speech coder that
operates from lossless coding down to three bits per sample.
===========================================================================
Package: areas/speech/systems/sox/
Name: SOX
Summary: Converts between various audio formats
Version: 10
Description:
SOX (Sound Exchange) converts between the various audio formats. It
can read and write different types of audio files, and optionally
applies some special effects (e.g. echo, channel averaging, or rate
conversion).
===========================================================================
Package: areas/speech/systems/spasm/
Name: SPASM
Summary: Perry Cook's Singing Voice Synthesizer
Version: 2.106
Description:
This directory contains SPASM (Singing Physical Articulatory
Synthesis Model), Perry Cook's singing voice synthesis program.
===========================================================================
Package: areas/speech/systems/spctools/
Name: SPC Toolbox
Summary: Signal Processing and Communications
Version: 2.00 (6-JUL-94)
Description:
This directory contains the Signal Processing and Communications
(SPC) Toolbox. It was designed to assist in the application of the
signal processing concepts learned in the classroom and to illustrate
their advantages and drawbacks.
===========================================================================
Package: areas/speech/systems/speak/
Name: SPEAK
Summary: Text to speech via phoneme concatenation.
Version: 30-NOV-90
Description:
This directory contains a simple text-to-speech program that is
based on phoneme concatenation. Includes prerecorded phonemes.
===========================================================================
Package: areas/speech/systems/textnorm/
Name: TEXTNORM
Summary: A very simple text normalization package.
Version: 26-NOV-93
Description:
This directory contains TEXTNORM, a very simple text normalization
front end for speech synthesis.
===========================================================================
Topic: areas/testbeds/
Summary: Testbeds, Simulators, and Micro-Worlds for Planning, Agents,
and Robotics
Description:
This directory contains testbeds, simulators, and micro-worlds for
planning, agents, and robotics.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Agent Architectures, Micro-Worlds, Planning,
Robotics, Simulators, Software Packages, Testbeds
Contains:
arsmagna/ ARS MAGNA: Abstract Robot Simulator
eden/ Eden: Poplog-based AI Microworld
erratic/ Erratic: Mobile Robot Simulator and Controller
mice/ MICE: Michigan Intelligent Coordination Experiment testbed
rsim/ RSIM: Robot Arm Simulator
simderel/ Simderella: Robot Simulator
tilewrld/ TILEWORLD: Planning testbed and simulator
trckwrld/ TRUCKWORLD: Testbed for AI Planning Programs
See Also: ?
===========================================================================
Package: areas/testbeds/arsmagna/
Name: ARS MAGNA
Summary: Abstract Robot Simulator
Version: 1.0 (27-JAN-93)
Description:
The ARS MAGNA abstract robot simulator provides an abstract world in
which a planner controls a mobile robot. This abstract world is more
realistic than typical blocks worlds, in which micro-world simplifying
assumptions do not hold. Experiments may be controlled by varying
global world parameters, such as perceptual noise, as well as building
specific environments in order to exercise particular planner
features. The world is also extensible to allow new experimental
designs that were not thought of originally. The simulator also
includes a simple graphical user-interface which uses the CLX
interface to the X window system. The simulator is written in Nisp,
a macro-package for Common Lisp.
RPL is the reactive plan language interpreter.
===========================================================================
Package: areas/testbeds/eden/
Name: Eden
Summary: Poplog-based AI Microworld
Version: 1.0 (29-NOV-92); 2.0 (21-AUG-93)
Description:
Eden is a Poplog-based AI microworld developed by Simon Perkins,
Jocelyn Paine and Edmund Chattoe of the Oxford University Artificial
Intelligence Society. It is intended to serve as a testbed for
learning and planning programs. Programs written in Pop-11, Prolog,
Lisp, and ML control a "bug" that lives in a 2-dimensional world. Any
kind of algorithm may be used to control the bug, including genetic
algorithms, neural nets, and rule-based systems. Eden consists of a
grid of cells, each of which can contain objects such as keys, doors,
boulders and quicksand. Bug's objective is to find and eat a piece of
food which the simulator has placed somewhere within this grid. To do
this, Bug must negotiate its way towards the food while dealing
intelligently with obstacles. Eden's laws of physics allow Bug to take
one of several different actions when it encounters an object. The
simulator then works out the consequences of the chosen action on Bug
and on Eden, and displays these graphically in a Ved window. Bug's
perceptions are updated to reflect the new state of the world, and the
cycle repeats.
Eden includes PopBeast, a simple Prolog bug which can read and
parse simple commands, extract their meaning, plan how to satisfy
these commands, and then carry out the plans.
Two versions of Eden are included. Version 1 is the original, which
was used in the bug competition. Version 2 is an updated version
used by Jocelyn Paine in an AI and Prolog course and includes a
production-system bug. Version 2 is not compatible with the
original and is not intended for the competition; please use the
original for that.
===========================================================================
Package: areas/testbeds/erratic/
Name: Erratic
Summary: Mobile Robot Simulator and Controller
Version: 2a (29-JUN-94); 1 (19-JAN-94)
Description:
Erratic is a mobile robot simulator and controller.
===========================================================================
Package: areas/testbeds/mice/
Name: MICE
Summary: Michigan Intelligent Coordination Experiment testbed
Version: MICE 2.0 (18-OCT-92); MacMICE 3.0 (1-APR-94)
Description:
The Michigan Intelligent Coordination Experiment (MICE) testbed is a
tool for experimenting with coordination between intelligent systems
under a variety of conditions. MICE simulates a two-dimensional
grid-world in which agents may move, communicate, and affect their
environment. MICE is essentially a discrete-event simulator that
helps control the domain and a graphical representation, but provides
relatively few constraints on the form of the domain and the agents'
abilities. Users may specify the time required by various activities,
the constraints on an agents' sensors, the configuration of the domain
and its properties, etc.
Source code, documentation, and examples are included.
===========================================================================
Package: areas/testbeds/rsim/
Name: RSIM
Summary: Robot Arm Simulator
Version: 22-JUL-92
Description:
RSIM is a SGI-based graphical robot simulator from the University
of Melbourne, with very nice graphics. It does discrete time
simulation of an arbitrary linked robot arm, with full kinematics and
dynamics. There is a discrete-time controller and a standard C interface
so that users can create and test different controller algorithms.
The robot simulator currently only works on SGI machines, and in a
no-graphics mode on other machines. When the IPRS GUI standard is
established, the authors will be converting this to run under IPRS,
which will make it machine independent.
===========================================================================
Package: areas/testbeds/simderel/
Name: Simderella
Summary: Robot Simulator
Version: 2.0.1 (17-MAR-94)
Description:
Simderella is a robot simulator consisting of three programs: CONNEL
(the controller), SIMMEL (the robot simulator), and BEMMEL (the
X-windows oriented graphics back-end). SIMMEL performs a few matrix
multiplications, based on the Denavit Hartenberg method, calculates
velocities with the Newton-Euler scheme, and communicates with the
other two programs. BEMMEL only displays the robot. It is a fast
general-purpose display method which places separate objects in space
depending on the homogeneous matrices it receives from SIMMEL. CONNEL
is the controller, which must be designed by the user. In the
distributed version, CONNEL is a simple inverse kinematics routine.
No neural networks are included. The programs use Unix sockets for
communication, so you must have sockets, but you can run the programs
on different machines. Since data communication is high-level (all
data is encoded before transmission), cross architecture portability
is high. In fact, CONNEL can simultaneously control a real robot and
the simulated one. When nothing is happening, Simderella will sleep
and not use any processor time.
===========================================================================
Package: areas/testbeds/tilewrld/
Name: TILEWORLD
Summary: Planning testbed and simulator
Version: New (25-NOV-91); Old (30-AUG-91)
Description:
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. It includes an X interface.
===========================================================================
Package: areas/testbeds/trckwrld/
Name: TRUCKWORLD
Summary: Testbed for AI Planning Programs
Version: Truckworld 2.0 (26-AUG-93)
Description:
TRUCKWORLD is a simulated world intended to provide a
testbed for AI planning programs, where the planning agent
is a truck with arms that roams around the simulated world.
It includes an X interface.
===========================================================================
Topic: areas/vision/
Summary: Computer Vision
Description:
This directory contains computer vision software and related materials.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Software Packages, Computer Vision, Software Packages, Vision
Contains:
doc/ Computer Vision Documentation
obvius/ OBVIUS: Object-Based Vision and Image Understanding System
See Also: ?
===========================================================================
Package: areas/vision/doc/
Name:
Summary: Computer Vision Documentation
Version:
Description:
This directory contains documentation about computer vision.
Currently it includes:
vision.bib Books for Visual Perception
===========================================================================
Package: areas/vision/obvius/
Name: OBVIUS
Summary: Object-Based Vision and Image Understanding System
Version: 3.0.3 (30-MAY-94)
Description:
OBVIUS (Object-Based Vision and Image Understanding System) is an
image-processing system based on Common Lisp and CLOS (Common Lisp
Object System). The system provides a flexible interactive user
interface for working with images, image-sequences, and other
pictorially displayable objects. By using Lisp as its primary
language, the system is able to take advantage of the interpretive
lisp environment (the ``listener''), object-oriented programming, and
the extensibility provided by incremental compilation.
The top-level of OBVIUS is implemented in Common Lisp, thus providing
an interpreted, object-oriented programming environment. The
low-level floating point operations are implemented in C for
efficiency. A graphical user interface, based on menus and dialog
boxes is also provided, in addition to the Lisp interpreter
(listener). In the typical mode of interaction, the user types an
expression to the lisp listener (or enters a command in a dialog box)
and it returns a result. A picture of that result will then be
automatically displayed in a window. Each window contains a circular
stack of pictures. The user can cycle through this stack using mouse
clicks with certain shift (``bucky'') key combinations. Commonly used
operations such as histogram and zoom are also provided via mouse
clicks.
The system provides a library of low-level image processing
routines, including
- arithmetic operations (add, multiply, lookup-table point
operations, etc)
- image statistics (mean, variance, kurtosis, maximum,
histograms etc)
- convolutions, Fourier transforms, Hilbert transforms
- geometric operations (crop, slice, rotate, flip-x, etc)
- comparisons (greater-than, etc)
- synthetic image generation
- matrix operations
OBVIUS also provides postscript output of pictures. Writing new
operations in OBVIUS is relatively simple, and it is straightforward
to add new viewable and picture types.
OBVIUS 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.
===========================================================================
Topic: lang/
Summary: AI Programming Languages
Description:
This directory contains implementations, code and other materials
related to various programming languages of interest to AI
researchers, educators, students, and practitioners.
Please note that the lang/ directory on Issue 1-1 of Prime Time
Freeware for AI is split across the two CD-ROMs. If you can't find
a language, make sure you're on the right disc!
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
AI Programming Languages, Programming Languages
Contains:
lisp/ CMU Common Lisp Repository
others/ Other programming languages of interest to AI folks, including
Standard ML, Dylan, and Lisp dialects besides Scheme and Common
Lisp.
prolog/ CMU Prolog Repository
scheme/ CMU Scheme Repository
st/ CMU Smalltalk Repository
See Also: ?
===========================================================================
Topic: lang/lisp/
Summary: CMU Common Lisp Repository
Description:
Welcome to the Common Lisp Repository.
The Common Lisp Repository (formerly the Lisp Utilities Repository)
was established by Mark Kantrowitz in 1990 to collect files and
programs of general interest to Common Lisp programmers. Many of the
programs will run in any Common Lisp implementation; others are easily
ported. Information files include the FAQ (Frequently Asked Questions)
postings for the comp.lang.lisp and comp.lang.clos newsgroups,
introductions to some Lisp topics, and some summaries of topics of
interest to Common Lisp programmers. In 1993 the Lisp Utilities
Repository was incorporated into the CMU Artificial Intelligence
Repository, and was renamed the Common Lisp Repository to reflect an
expanded mission.
If this is the first time you have used the Repository, please read
this file and the file named readme.txt. The file readme.txt contains
important information concerning the repository and conditions on use
of the repository. By retrieving files from the repository, you
signify your agreement to these conditions.
Other files of interest to new users include copying.txt, the license
for the programs written by Mark Kantrowitz.
To contribute files to the repository, first see section [7] of the
readme.txt file. Then send mail to lisp-utilities-request@cs.cmu.edu. If
possible, please put the files in ftp.cs.cmu.edu:user/ai/new/.
Origin: ftp.cs.cmu.edu:user/ai/lang/lisp/ [128.2.206.173]
Give "anonymous" (without the quotes) at the username:
prompt and type your email address (in the form "user@host")
at the password: prompt. NOTE: There is *no* leading slash
before user/ai/lang/lisp/; just type "cd user/ai/lang/lisp/"
at the ftp> prompt.
If you will be transferring compressed files, be sure to
type the "binary" command before retrieving the files. The
"get" command is used to get a single file, and "mget" to
retrieve multiple files using wildcards. If you're using
the "mget" command, you might want to turn off prompting
first by using the "prompt" command.
The Lisp Utilities Repository is kept in the Andrew File
System (AFS) directory
/afs/cs.cmu.edu/project/ai-repository/ai/lang/lisp/
and its subdirectories. If your site runs AFS, you can
just cd to this directory and copy the files directly.
(The FTP location given above is just a link to the AFS
directory.)
Further information about AFS can be obtained by
sending email to afs-sales@transarc.com.
Updated: 4-JAN-93
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Bug Reports: lisp-utilities-request@cs.cmu.edu
Mailing List: lisp-utilities@cs.cmu.edu
This is a moderated low-volume mailing list for matters
concerning the Lisp Utilities Repository. It is primarily
intended for notification of updates to the Repository,
but other relevant messages may also be included, at the
discretion of the moderator. If you use any of the
programs included in the Repository, you should join this
mailing list.
To subscribe, send a message to
lisp-utilities-request@cs.cmu.edu
with your name, your Internet email address, and your
affiliation (e.g., company name, university, etc.)
if any, in the following format:
first-name middle-initials last-name, affiliation
Author(s): Maintained by Mark Kantrowitz .
Contact: lisp-utilities-request@cs.cmu.edu
Keywords:
Lisp, Programming Languages!Lisp
Contains:
bookcode/ Machine readable parts of various Lisp books
code/ Lisp code for benchmarking, research, education, and fun
doc/ Documentation, including standards and proposals
faq/ Lisp and CLOS FAQs: Frequently Asked Questions (FAQ) postings
for comp.lang.lisp and comp.lang.clos newsgroups
gui/ Graphical User Interfaces (GUI) for Lisp and other graphics
code.
impl/ Free/Shareware Common Lisp implementations
mail/ Mail archives for the {\tt lisp-utilities@cs.cmu.edu} list.
oop/ OOP: Code related to object-oriented programming.
txt/ Online Lisp-related tech reports and papers.
util/ Utilities for programming in Lisp.
See Also: ?
===========================================================================
Topic: lang/lisp/bookcode/
Summary: Machine readable parts of various Lisp books
Description:
Contains machine readable parts of various books.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Books!Lisp, Lisp!Code
Contains:
dst/ Code from David S. Touretzky's book
norvig/ NORVIG: Code from Peter Norvig's Lisp book
winston/ WINSTON: Source code from Winston's Lisp book, 3rd edition
See Also: ?
===========================================================================
Package: lang/lisp/bookcode/dst/
Name:
Summary: Code from David S. Touretzky's book
Version:
Description:
This directory contains source code from
David S. Touretzky
"Common Lisp: A Gentle Introduction to Symbolic Computation"
Benjamin/Cummings Publishers, Redwood City, CA, 1990. 592 pages.
ISBN 0-8053-0492-4.
Touretzky's book is perhaps the best tutorial introduction to the
language. It has clear and correct explanations, and covers some
fairly advanced topics. The book is an updated Common Lisp version of
the 1984 edition published by Harper and Row Publishers.
Three free Lisp educational tools which were used in the book --
Evaltrace, DTRACE and SDRAW -- are available in the lisp/ and
evaltrace/ subdirectories. Evaltrace is agraphical notation for
explaining how evaluation works and is described in "Visualizing
Evaluation in Applicative Languages" by David S. Touretzky and Peter
Lee, CACM 45-59, October 1992. DTRACE is a "detailed trace" which
provides more information than the tracing tools provided with most
Common Lisp implementations. SDRAW is a read-eval-draw loop that
evaluates Lisp expressions and draws the result as a cons cell diagram
(for both X11 and ascii terminals). Also available is PPMX, a tool for
pretty printing macro expansions.
===========================================================================
Package: lang/lisp/bookcode/norvig/
Name: NORVIG
Summary: Code from Peter Norvig's Lisp book
Version:
Description:
This directory contains source code for
Peter Norvig, "Paradigms of Artificial Intelligence Programming:
Case Studies in Common Lisp", Morgan Kaufmann Publishers, Inc.,
1992. 946 pages. ISBN 1-55860-191-0.
Norvig's book provides an in-depth exposition of advanced AI
programming techniques and includes large-scale detailed examples. The
book is the most advanced AI/Common-Lisp programming text and
reference currently available, and hence is not for the complete
novice. It focuses on the programming techniques necessary for
building large AI systems, including object-oriented programming, and
has a strong performance orientation.
The text is marked by its use of "non-toy" examples to illustrate the
techniques. All of the examples are written in Common Lisp, and copies
of the source code are available in this directory. Some of the
techniques described include rule-based pattern matching (GPS, Eliza,
a subset of Macsyma, the Emycin expert system shell), constraint
propagation and backtracking (Waltz line-labeling), alpha-beta search
(Othello), natural language processing (top-down, bottom-up and chart
parsing), logic-programming (unification and Prolog), interpreters and
compilers for Scheme, and object-oriented programming (CLOS).
The examples are also used to illustrate good programming style and
efficiency. There is a guide to trouble-shooting and debugging Lisp
programs, a style guide, and a discussion of portability problems.
Some of the efficiency techniques described include memoization,
data indexing, compilation, delaying computation, proper use of
declarations, avoiding garbage collection, and choosing and using the
correct data structure.
The book also serves as an advanced introduction to Common Lisp, with
sections on the Loop macro, CLOS and sequences, and some coverage of
error handling, series, and the package facility.
===========================================================================
Package: lang/lisp/bookcode/winston/
Name: WINSTON
Summary: Source code from Winston's Lisp book, 3rd edition
Version:
Description:
Contains source code from Winston's Lisp book:
Patrick H. Winston and Berthold K. P. Horn.
"LISP", 3rd edition.
Addison-Wesley (Reading, MA), 1989. 611 pages. ISBN 0-201-08319-1
Winston's book covers the basic concepts of the language, but also
gives a lot of detail about programming AI topics such as rule-based
expert systems, forward chaining, interpreting transition trees,
compiling transition trees, object oriented programming, and finding
patterns in images. Not a tutorial. Has many good examples. Source
code for the examples is available in this directory.
===========================================================================
Topic: lang/lisp/code/
Summary: Lisp code for benchmarking, research, education, and fun
Description:
This directory contains a variety of Lisp code and algorithm
implementations. This collection is intended to facilitate
code reuse. The code included here is of a type more basic to
programming in Lisp. AI software systems that happen to be
implemented in Lisp will appear in the areas/ directory tree.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Code
Contains:
bench/ Lisp Benchmarking Suites
codewalk/ Codewalking: Lisp code that grovels over arbitrary Lisp code
csp/ Prosser's hybrid algorithms for the Constraint Satisfaction
Problem
db/ Database programs implemented in Lisp.
ext/ Lisp Code Extensions: Collection of miscellaneous Lisp code.
fun/ Some random fun programs written in Lisp, including Life and
sunrise/sunset calculations.
ilu/ ILU: Xerox PARC Inter-Language Unification
impdep/ Collections of Implementation-Dependent Lisp Code
io/ IO: Lisp code dealing with input and output routines.
iter/ ITER: Macro packages for iteration in Common Lisp.
match/ Pattern matching code, unifiers, regular expression matchers.
math/ Math Library: Lisp code for various mathematical functions.
parsing/ Collection of Lisp code for parsing.
search/ Lisp code for searching.
syntax/ Code related to changing or translating to/from Lisp syntax.
testing/ Lisp programs for testing Lisp programs.
tools/ Lisp Utilities: Collection of miscellaneous Lisp tools.
See Also: ?
===========================================================================
Topic: lang/lisp/code/bench/
Summary: Lisp Benchmarking Suites
Description:
Code for benchmarking Lisp implementation performance.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Benchmarks!Lisp, Lisp!Benchmarks
Contains:
acuff/ Acuff's Lisp Benchmarking Suite
fateman/ Fateman's Discussion of Fast Floating-Point in Common Lisp
gabriel/ Gabriel's Lisp Benchmarking Suite
See Also: ?
===========================================================================
Package: lang/lisp/code/bench/acuff/
Name:
Summary: Acuff's Lisp Benchmarking Suite
Version:
Description:
Source code for the benchmark programs used to gather data for
Richard Acuff, "Performance of Two Common Lisp Programs on
Several Systems", Stanford University Knowledge Systems Lab
(KSL) Report 89-02, 1989.
Includes copies of the tech report in LaTeX and Microsoft Word
formats. The TR contains information about running the tests.
Acuff benchmarks 10 Common Lisp implementations on a variety of
hardware platforms using two moderate-sized application programs,
BB1 1.2 and SOAR 4.4.4. Neither of these programs makes intensive
use of numeric computation. He also considers the effects of
compiler optimization levels and the impact of display I/O on run time.
The lisp implementations tested include Lucid, Franz Allegro CL,
MACL, AKCL, KCL, VaxLisp, TI Explorers, Symbolics MacIvory,
Symbolics 3650, and Xerox 1186.
The results suggest that the performance of Lisp systems is very
mcuh application dependent.
===========================================================================
Package: lang/lisp/code/bench/fateman/
Name:
Summary: Fateman's Discussion of Fast Floating-Point in Common Lisp
Version:
Description:
PostScript version of
Richard J. Fateman, Kevin A. Broughan, Diane K. Willcock, and
Duane Rettig, "Fast Floating-Point Processing in Common Lisp",
May 4, 1993.
The emphasis is on fast numeric computing in Common Lisp.
===========================================================================
Package: lang/lisp/code/bench/gabriel/
Name:
Summary: Gabriel's Lisp Benchmarking Suite
Version:
Description:
The code from the benchmarks described in the book "Performance
Evaluation of Lisp Systems" by Richard Gabriel.
===========================================================================
Topic: lang/lisp/code/codewalk/
Name: Codewalking
Summary: Lisp code that grovels over arbitrary Lisp code
Description:
Since the underlying syntax of Lisp programs and data is the same,
it is possible to write Lisp programs that walk down the structure
of a program. These programs provide just such a facility.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Code Walking, Lisp!Code Walking
Contains:
mapforms/ Mapforms: Moon's code walker
walk/ Xerox Code Walker: Lisp code that grovels over arbitrary Lisp
code
See Also:
lang/lisp/code/tools/xref/
===========================================================================
Package: lang/lisp/code/codewalk/mapforms/
Name: Mapforms
Summary: Moon's code walker
Version: April 1983
Description:
Moon's MAPFORMS program is a tool for walking over your lisp source
code. It can do substitutions as well as analysis (most of the
complexity comes from the goal of being able to make substitutions
with minimum consing).
===========================================================================
Package: lang/lisp/code/codewalk/walk/
Name: Xerox Code Walker
Summary: Lisp code that grovels over arbitrary Lisp code
Version: 1990
Description:
A simple code walker designed for use in PCL, based in part on code
walking programs by Larry Masinter, David Moon, and Gary Drescher.
Very easy to port to different Common Lisp implementations.
===========================================================================
Package: lang/lisp/code/csp/
Name:
Summary: Prosser's hybrid algorithms for the Constraint
Satisfaction Problem
Version:
Description:
This directory contains Patrick Prosser's hybrid algorithms for the
binary constraint satisfaction problem. Search algorithms include
chronological backtracking, backmarking, backjumping, forward
checking, graph-based backjumping, conflict-directed backjumping,
backjumping with directed 2-consistency, forward checking with
directed 2-consistency, conflict directed backjumping with directed
k-consistency, forward checking with conflict-directed backjumping,
with directed k-consistency, and various combinations.
===========================================================================
Topic: lang/lisp/code/db/
Summary: Database programs implemented in Lisp.
Description:
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Database Package for Lisp, Lisp!Databases
Contains:
edb/ EDB: A database program written in Emacs Lisp for GNU Emacs.
See Also: ?
===========================================================================
Package: lang/lisp/code/db/edb/
Name: EDB
Summary: A database program written in Emacs Lisp for GNU Emacs.
Version: 1.18
Description:
Simple database package written in Emacs Lisp. EDB is extensible
and customizable, uses Emacs editing commands, and works well with
other Emacs applications.
===========================================================================
Topic: lang/lisp/code/ext/
Name: Lisp Code Extensions
Summary: Collection of miscellaneous Lisp code.
Description:
This directory contains a variety of extensions to Common Lisp and
miscellaneous Lisp code.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Extensions
Contains:
alerts/ ALERTS: A convenient debugging status indicator
autoload/ AUTOLOAD: Loads function definition from file upon function
call
complete/ COMPLETION: Code for completing a string against a dictionary.
copy_obj/ Copy Objects: Code for copying CLOS/PCL objects
enum/ ENUMS: C-style ENUMs for Lisp
errors/ WITHOUT-ERRORS: Catches all error signals in a running program
init/ Initializations: Like the initializations features of Lisp
machines.
library/ Library of miscellaneous small extensions to Common Lisp
lp/ Logical Pathnames: Portable logical pathnames implementation
memoize/ MEMOIZE: The Automatic Memoization Facility
packages/ Code related to Lisp PACKAGE definitions
resource/ RESOURCES: Portable implementation of resources.
save_obj/ SAVE-OBJECT: Saves ASCII representations of Lisp objects to a
file.
screamer/ SCREAMER: Adds backtracking and constraint satisfaction to
Common Lisp.
tables/ DEFTABLE: Unifies interface to Common Lisp's table-like data
structures.
trees/ TREES: Lisp data structures, including Binary Search Trees,
Priority Queues, and Red-Black Trees
types/ Type Simplifier: A simple type simplifier
wood/ WOOD: William's Object Oriented Database
See Also: ?
===========================================================================
Package: lang/lisp/code/ext/alerts/
Name: ALERTS
Summary: A convenient debugging status indicator
Version:
Description:
===========================================================================
Package: lang/lisp/code/ext/autoload/
Name: AUTOLOAD
Summary: Loads function definition from file upon function call
Version:
Description:
Autoload defines a function to autoload a file when the function is
invoked.
===========================================================================
Package: lang/lisp/code/ext/complete/
Name: COMPLETION
Summary: Code for completing a string against a dictionary.
Version: 10/08/92 12:15:19
Description:
===========================================================================
Package: lang/lisp/code/ext/copy_obj/
Name: Copy Objects
Summary: Code for copying CLOS/PCL objects
Version: 09/18/92 14:33:57
Description:
===========================================================================
Package: lang/lisp/code/ext/enum/
Name: ENUMS
Summary: C-style ENUMs for Lisp
Version:
Description:
In C, enums allow a compiler to optimize a switch statement by
using the enums as array indices. One can achieve the same effect
in Lisp case statements, if the keys are consecutive numbers. To avoid
losing readability, one must use constants with #. to evaluate them at
execution time.
===========================================================================
Package: lang/lisp/code/ext/errors/
Name: WITHOUT-ERRORS
Summary: Catches all error signals in a running program
Version:
Description:
This code provides a simple mechanism to catch all errors. Code
enclosed within the macros provided by this package will never error.
Instead, the error message will be written to *error-output* or a file.
===========================================================================
Package: lang/lisp/code/ext/init/
Name: Initializations
Summary: Like the initializations features of Lisp machines.
Version: March 1991
Description:
Mimics the initializations features of the TI Explorer and
Symbolics Lisp machines. Provides for functions to be run when the
world is first booted, before and after GC, before a non-checkpointed
disk save, and after a non-checkpointed world is first booted.
===========================================================================
Package: lang/lisp/code/ext/library/
Name:
Summary: Library of miscellaneous small extensions to Common Lisp
Version: 2/15/93
Description:
Collection of small extensions to Common Lisp. It is a combination
of the CL-LIB package by Brad Miller and a
similar package by Mark Kantrowitz , with contributions
by , , Barry Margolin,
Kerry Koitzsch, Larry Stead, Vincent Keunen, Fernando D. Mato Mira,
and Tom Kramer.
===========================================================================
Package: lang/lisp/code/ext/lp/
Name: Logical Pathnames
Summary: Portable logical pathnames implementation
Version: Tue Apr 9 19:17:01 1991
Description:
A portable implementation of the X3J13 June 1989 specification for
logical pathnames, as documented in Guy Steele's "Common Lisp: the
Language" (2nd Edition), section 23.1.5 "Logical Pathnames".
Logical Pathnames provide a facility for referring to pathnames in a
portable manner. Logical pathnames are mapped to physical pathnames by
a set of implementation dependent and site-dependent rules.
Written by Mark Kantrowitz, July 1990.
===========================================================================
Package: lang/lisp/code/ext/memoize/
Name: MEMOIZE
Summary: The Automatic Memoization Facility
Version: 1.0
Description:
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 includes an overview of memoization and its applications,
and a PostScript version of a paper on the subject that appeared in
the Sixth International Symposium on AI, Monterrey Mexico,
September 1993.
===========================================================================
Package: lang/lisp/code/ext/packages/
Name:
Summary: Code related to Lisp PACKAGE definitions
Version:
Description:
This directory contains code related to Common Lisp packages.
DEFPACKAGE defines a portable implementation of the Common Lisp
function of the same name. MAKE-DEFPACKAGE creates a defpackage
form that could recreate the current state of a package, more or less.
===========================================================================
Package: lang/lisp/code/ext/resource/
Name: RESOURCES
Summary: Portable implementation of resources.
Version: February 1992
Description:
Resources are useful for avoid excessive consing and GCing by explicitly
maintaining pools of objects for reuse, instead of creating them when
needed and relying on the garbage collector to flush them when they are
no longer needed. When an object is no longer needed, it is returned
to the pool of objects of that type, and recycled when a new object
of that type is needed. Using resources might wind up recycling objects
faster than incremental GC, but it isn't clear whether there are
any real time/space savings.
===========================================================================
Package: lang/lisp/code/ext/save_obj/
Name: SAVE-OBJECT
Summary: Saves ASCII representations of Lisp objects to a file.
Version: 9X2 (10-JUN-94)
Description:
SAVE-OBJECT is a recursive function which writes an ASCII
representation of a LISP object to a designated file. SAVE-OBJECT can
handle complicated objects, even those that include recursive
references and circular list structure. The resulting file can be
loaded with the standard LOAD function.
===========================================================================
Package: lang/lisp/code/ext/screamer/
Name: SCREAMER
Summary: Adds backtracking and constraint satisfaction to Common Lisp.
Version: 3.12
Description:
Screamer is an extension of Common Lisp that adds support for
nondeterministic programming. Screamer consists of two levels. The
basic nondeterministic level adds support for backtracking and
undoable side effects. On top of this nondeterministic substrate,
Screamer provides a comprehensive constraint programming language in
which one can formulate and solve mixed systems of numeric and
symbolic constraints. Together, these two levels augment Common Lisp
with practically all of the functionality of both Prolog and
constraint logic programming languages such as CHiP and CLP(R).
Furthermore, Screamer is fully integrated with Common Lisp. Screamer
programs can coexist and interoperate with other extensions to Common
Lisp such as CLOS, CLIM and Iterate.
In several ways Screamer is more efficient than other implementations
of backtracking languages. First, Screamer code is transformed into
Common Lisp which can be compiled by the underlying Common Lisp
system. Many competing implementations of nondeterministic Lisp are
interpreters and thus are far less efficient than Screamer. Second,
the backtracking primitives require fairly low overhead in Screamer.
Finally, this overhead to support backtracking is only paid for those
portions of the program which use the backtracking primitives.
Deterministic portions of user programs pass through the
Screamer-to-Common-Lisp transformation unchanged. Since in practise,
only small portions of typical programs utilize the backtracking
primitives, Screamer can produce more efficient code than compilers
for languages in which backtracking is more pervasive.
The Screamer user-contributed code includes a pedagogical
implementation of the SNLP planning algorithm in Screamer and code to
add a layer on top of Screamer to permit the retraction of assertions.
===========================================================================
Package: lang/lisp/code/ext/tables/
Name: DEFTABLE
Summary: Unifies interface to Common Lisp's table-like data structures.
Version: 1992
Description:
The DEFTABLE macro unifies the interface to Common Lisp's table-like
data structures (e.g., association lists, property lists, and hash
tables, vectors), providing a concise, lightweight syntax. Later, when
it's time to tune the performance of your program, you can specify how
each table type will be implemented. For the purpose of this program,
a table is anything you can put key/value pairs into and subsequently
retrieve the value using the key.
===========================================================================
Package: lang/lisp/code/ext/trees/
Name: TREES
Summary: Lisp data structures, including Binary Search Trees, Priority
Queues, and Red-Black Trees
Version: 1.0 beta, 12/26/1992
Description:
Implementation of several tree-based data structures in Common Lisp,
including Binary Search Trees, Priority Queues, and Red-Black Trees.
The file btree.hqx (binhexed stuffit file) contains an
implementation of binary (2,4) trees from Knuth, volume 3, for MCL.
===========================================================================
Package: lang/lisp/code/ext/types/
Name: Type Simplifier
Summary: A simple type simplifier
Version: 19-NOV-93 22:07:56
Description:
A simple type simplifier originally developed to work around a
coerce bug in Allegro CL. [(coerce 0 '(AND T FLOAT) raises an error]
===========================================================================
Package: lang/lisp/code/ext/wood/
Name: WOOD
Summary: William's Object Oriented Database
Version: 0.6
Description:
WOOD (William's Object Oriented Database) is a simple persistent
object store for MCL 2.0. Its goal is to provide a way to
save/restore Lisp objects to/from disk.
===========================================================================
Package: lang/lisp/code/fun/
Name:
Summary: Some random fun programs written in Lisp, including
Life and sunrise/sunset calculations.
Version:
Description:
A variety of Lisp programs that do fun things:
CONX. Creates a word-frequency trigram database from a file of text
and then uses it to produce random sentences. Version 1.3, 24-APR-91.
Written by Skef Wholey and Jamie Zawinski
.
LIFE. An implementation of Conway's Game of Life. Author
unknown. Ported and bugs fixed by Mark Kantrowitz.
SOUNDEX. A program for encoding words and names in a compact manner
that includes a notion of phonemic similarity. Written by Norman R.
Stewart Jr., .
SUNSET. A program that calculates the time of sunrise and sunset given
the date, longitude and latitude. Written by Mark Kantrowitz,
.
TETRIS. Tetris ported to the Symbolics by Claus Reimann
. ftp.gmd.de/languages/lisp/
===========================================================================
Package: lang/lisp/code/ilu/
Name: ILU
Summary: Xerox PARC Inter-Language Unification
Version: 1.6.4 (18-JUN-94)
Description:
ILU (pronounced eye'-loo) is a system that promotes software
interoperability via interfaces. Interfaces between what? Whatever
units of program structure are desired; we call them by the generic
term "modules". They could be parts of one process, all written in
the same language; they could be parts written in different languages,
sharing runtime support in one memory image; they could be parts
running in different memory images on different machines (on different
sides of the planet). A module could even be a distributed system
implemented by many programs on many machines. Calls across ILU
interfaces involve only as much mechanism as necessary for the calling
and called modules to interact. In particular, when the two modules
are in the same memory image and use the same data representations,
the calls are direct local procedure calls -- no stubs or other RPC
mechanisms are involved.
ILU modules are known by their interfaces. A module interface is
specified once in ILU's object-oriented Interface Specification
Language (called, simply, ISL). For each of the particular
programming languages supported by ILU (currently Common Lisp, ANSI C,
C++, and Modula-3; Python, Tcl, and GNU Emacs-Lisp are in the works),
a version of the interface in that particular programming language can
be generated. The ILU kernel library provides services which may be
used by the language-specific interface to overcome intermodule
language or address space differences.
Many existing RPC systems, such as Xerox XNS Courier, ONC RPC, and OSF
DCE RPC, have strong notions of interfaces. ILU allows binding to
such services provided by such systems if their interfaces can be
described in ISL. ISL has been designed to facilitate such
description (currently, only for ONC RPC; Courier and DCE RPC are in
progress). The binding to such RPC services is done in such a way as
to be indistinguishable from binding to other ILU modules. In fact,
properly constructed ILU modules can appear as native RPC services,
and can be manipulated by non-ILU tools designed to work with those
RPC services.
Similarly, the Object Management Group's (OMG) Common Object Request
Broker Architecture (CORBA) defines modules with explicit interfaces.
ILU allows modules that can be described with a safe subset of OMG
CORBA IDL to be used as ILU modules, as well, though the ILU object
model is not quite the same as the OMG CORBA object model. In fact,
people wishing to experiment with CORBA may find ILU a useful
experimental platform, as it does allow module specification with OMG
IDL, and does generate ANSI C support as specified in Draft 1.2 of the
OMG CORBA specification. As the OMG specification for a C++ mapping
is agreed upon, we intend to provide that mapping for our C++ support,
as well.
Release 1.6.4 is intended as a beta release. Major efficiency
improvements and some usability improvements are planned for the next
release. It has been tested lightly on SunOS 4.1.3, Sun's Solaris
2.3, and SGI's IRIX 5.2. It is designed to be highly portable, and a
port to the Macintosh has been done (but is not included in this
release).
===========================================================================
Topic: lang/lisp/code/impdep/
Summary: Collections of Implementation-Dependent Lisp Code
Description:
Lisp code specific to particular Lisp implementations:
TI Explorer
Macintosh Common Lisp
Xerox Medley
Symbolics
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Impl. Dependent Code
Contains:
explorer/ TI Explorer Lisp Code
mcl2/ Code that runs only in Macintosh Common Lisp.
medley/ Code that runs only under Xerox Medley.
symbolic/ Code that runs only on Symbolics Lisp Machines.
See Also: ?
===========================================================================
Package: lang/lisp/code/impdep/explorer/
Name:
Summary: TI Explorer Lisp Code
Version:
Description:
The Stanford Knowledge Systems Lab's set of Explorer patches and
tools. It includes the following:
en.tgz News reader for Explorer. Talks to the NNTP daemon.
Written by keith@csc.ti.com.
images.tgz Bitmaps of pictures. Set up a logical
directory IMAGES:IMAGES; for them to help
some of the code in the Window Systems Additions tool.
jwz.tgz A set of tools written and collected by Jamie
Zawinski. See the file "_readme.txt" in that
directory for info.
site.tgz The KSL SYS:SITE; directory containing the
.SYSTEM files.
sys_fix.tgz Patches to the Explorer system.
tools.tgz Various extensions. See defsystems.lisp and
tools.lisp for info.
===========================================================================
Package: lang/lisp/code/impdep/mcl2/
Name:
Summary: Code that runs only in Macintosh Common Lisp.
Version:
Description:
A collection of code that runs only under Macintosh Common Lisp.
This is the contents of the Apple FTP site's public code, with some
programs removed to avoid duplication elsewhere in the repository.
===========================================================================
Package: lang/lisp/code/impdep/medley/
Name:
Summary: Code that runs only under Xerox Medley.
Version:
Description:
A large collection of random programs that run only under Xerox Medley.
===========================================================================
Package: lang/lisp/code/impdep/symbolic/
Name:
Summary: Code that runs only on Symbolics Lisp Machines.
Version:
Description:
BOXER. Zetalisp implementation of the Boxer programming environment
written by Andy diSessa.
TETRIS. An implementation of the game "Tetris" for the Symbolics by
Claus Riemann.
===========================================================================
Topic: lang/lisp/code/io/
Name: IO
Summary: Lisp code dealing with input and output routines.
Description:
A variety of programs and notes dealing with input and output
operations in Lisp. Includes code for
dealing with rpc and sockets in Lisp
fast file i/o
pretty printing lisp expressions
printing formatted dates
querying the user
top-level loop
turning on CBREAK mode in Lisp
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
IO, Input, Lisp!IO, Lisp!Sockets, Output, Sockets
Contains:
cbrk/ CBREAK: Turns CBREAK mode on and off to allow Lisp to read the
input character by character.
dates/ Date Formatter: Lisp code for formatting dates and times
nicely.
fast_io/ Fast_IO: Code and discussion of fast file IO in Lisp.
plisp/ PLISP: Lisp-to-PostScript compiler.
query/ QUERY: Lisp code for querying the user.
rpc/ RPC: Common Lisp implementation of SUN RPC.
sockets/ SOCKETS: Using UNIX sockets from Lisp.
tl/ TL: Support for Top-Level interaction loops in Lisp.
xp/ XP: XP Common Lisp pretty printer
See Also: ?
===========================================================================
Package: lang/lisp/code/io/cbrk/
Name: CBREAK
Summary: Turns CBREAK mode on and off to allow Lisp to read the
input character by character.
Version:
Description:
Most UNIX-based Lisp implementations buffer the input until a
carriage return is seen. This means that functions like
READ-CHAR, LISTEN and READ-CHAR-NO-HANG don't work as the
programmer might expect. For example to reply to Y-OR-N-P, one not
only has to type a Y or N, but hit the return key as well.
This package contains example code that shows how to turn CBREAK
mode on and off from within Lisp.
===========================================================================
Package: lang/lisp/code/io/dates/
Name: Date Formatter
Summary: Lisp code for formatting dates and times nicely.
Version:
Description:
Provides a set of functions for formatting dates and times nicely
in Lisp.
===========================================================================
Package: lang/lisp/code/io/fast_io/
Name: Fast_IO
Summary: Code and discussion of fast file IO in Lisp.
Version:
Description:
A common complaint about Lisp implementations is that the file I/O
is slow. Although the Lisp standard does not provide primitives for
reading and writing blocks of data, it is possible to do this in most
Lisp implementations. This package gives an example of how to do this.
When data is read and written in this manner, the speed of file i/o
approaches that of C programs.
===========================================================================
Package: lang/lisp/code/io/plisp/
Name: PLISP
Summary: Lisp-to-PostScript compiler.
Version: 1987
Description:
PostScript is a programming language for the description of images on
a printed page. Many laser printers now use PostScript. A very rich
set of graphic operations which allow complex images to be described
in a simple and concise manner are provided by the PostScript
language.
While many systems, such as Tex, pic, or MacDraw, generate PostScript
code, none of these allow the user access to the full power of the
PostScript language. However, programming directly in PostScript can
be difficult. Both the syntax and semantics of the language are
oriented more toward simplicity of execution rather than ease of
programming. The purpose of this compiler is to take the basic
structure of Common Lisp and use it as an alternative representation
of a PostScript program. While the basic graphic operators of
PostScript are retained, Lisp-like function definition, control flow,
and variable binding become available. Macros, defined constants, and
function libraries have also been provided. The PLisp compiler
generates PostScript code which is guaranteed not to contain errors in
stack usage.
===========================================================================
Package: lang/lisp/code/io/query/
Name: QUERY
Summary: Lisp code for querying the user.
Version:
Description:
The QUERY package generalizes the capabilities of the Lisp
functions Y-OR-N-P and YES-OR-NO-P, and is similar in many ways to
the Symbolics FQUERY function. There are several major differences,
one of which is QUERY's ability to timeout with a default value. In
addition to redefining Y-OR-N-P and YES-OR-NO-P in terms of QUERY,
this package defines Y-OR-N-P-WAIT and YES-OR-NO-P-WAIT to illustrate
the timeout capability. More complicated queries are possible using
the QUERY function.
===========================================================================
Package: lang/lisp/code/io/rpc/
Name: RPC
Summary: Common Lisp implementation of SUN RPC.
Version:
Description:
Common Lisp implementation of SUN RPC that currently runs only in
Xerox Common Lisp, but was written with portability in mind. It has
been the basis of many robust clients (including NFS) but includes
little support for the implementation of network services. The code
was originally written by Jeff Finger while at Stanford, and has been
subsequently revised at Xerox by Bill van Melle.
The authors hope that someone will be enticed to:
(1) port the code other Common Lisp implementations; and further
(2) extend the system to support implementation of servers
Both of these are significant programming efforts, requiring
familiarity with both SUN RPC and the foreign function interface of
the target Lisp. The first task also requires some familiarity with
Interlisp-D.
===========================================================================
Package: lang/lisp/code/io/sockets/
Name: SOCKETS
Summary: Using UNIX sockets from Lisp.
Version:
Description:
This package contains posts and email about socket communication in
Lisp. They include code written by Vince Baker for socket communication
in AKCL and by Joe Konstan for Allegro and Lucid. The LSP_SCKT package
is a stream-based socket interface for Allegro and Lucid written by
Mark Kantrowitz.
The contents is as follows:
andreasg/ Lets Lisp use the termcap file and execute
termcap functions
baker.txt Code for socket communication in AKCL.
hines.txt Buggy sockets example for Allegro.
konstan.txt Code for non-blocking socket communication in
Allegro & Lucid
stark.txt Summary of replies to a query about sockets.
lsp_sckt Stream-based interface to sockets.
===========================================================================
Package: lang/lisp/code/io/tl/
Name: TL
Summary: Support for Top-Level interaction loops in Lisp.
Version:
Description:
This package implements a few general purpose support routines for "top
level" interaction in Lisp. The function Top-Level implements a lisp
listener and command interpreter similar in behavior to the alias
command feature in Franz or the command prompt in Symbolics'
Genera. Top-level is completely generic. You create your own
interpreters or applications by defining new command tables. A sample
application called TL is provided that implements an interpreter that
supports a few commands for general lisp interaction, such as Package,
Cload, Macroexpand etc. The function Ask-User is a general purpose
user-query facility. The function Edit-Object supports interactive
clos object editing by dynamically defining a command table appropriate
to the object and invoking a Top-Level loop to implement editing
commands.
TL is part of the Common Music (CM) music composition language, but is
generic enough and portable enough to be of use in other applications.
CM itself is available by anonymous ftp from ccrma-ftp.stanford.edu
[36.49.0.93] and ftp.zkm.de [192.101.28.17] in the files pub/cm.tar.Z.
===========================================================================
Package: lang/lisp/code/io/xp/
Name: XP
Summary: XP Common Lisp pretty printer
Version:
Description:
XP provides efficient and flexible support for pretty printing
in Common Lisp. Its single greatest advantage is that it allows the
full benefits of pretty printing to be obtained when printing
data structures, as well as when printing program code.
XP is efficient, because it is based on a linear time algorithm that
uses only a small fixed amount of storage. XP is flexible, because
users can control the exact form of the output via a set of special
FORMAT directives. XP can operate on arbitrary data structures,
because facilities are provided for specifying pretty printing methods
for any type of object.
Note: This will be part of the new Common Lisp standard, so
distributing it separately will be unnecessary in a few years
once all implementations support the new standard.
===========================================================================
Topic: lang/lisp/code/iter/
Name: ITER
Summary: Macro packages for iteration in Common Lisp.
Description:
This directory contains several of the most widely used macro
packages for iteration in Common Lisp, including the Loop macro
(several implementations), Jonathan Amsterdam's Iterate macro,
Dick Water's Series, the Xerox FOR macro, and the SLOOP and YLOOP
macros.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
FOR Macro, Iteration, LOOP Macro, Lisp!Iteration, SERIES
Contains:
for/ FOR: A Common Lisp implementation of the Interlisp FOR Macro.
iterate/ Iterate: An iteration macro for Lisp.
loop/ LOOP: A variety of Loop macros.
series/ SERIES: Common Lisp looping macro package
See Also: ?
===========================================================================
Package: lang/lisp/code/iter/for/
Name: FOR
Summary: A Common Lisp implementation of the Interlisp FOR Macro.
Version: 7-JAN-88
Description:
===========================================================================
Package: lang/lisp/code/iter/iterate/
Name: Iterate
Summary: An iteration macro for Lisp.
Version: 1.2, 7/26/91
Description:
Iterate is Jonathan Amsterdam's alternative to SERIES and the LOOP
macro. It provides a superset of LOOP's features in a much more
pleasant, Lisp-like syntax. Iterate is also extensible, has better
support for nested loops, and generates inline code.
===========================================================================
Topic: lang/lisp/code/iter/loop/
Name: LOOP
Summary: A variety of Loop macros.
Description:
This directory contains five different implementations of Loop
macros. The mit/, cmu/ and symbolics/ directories contain various
implementations of "the" Loop macro, as discussed in the various
editions of CLtL and the draft ANSI Common Lisp specification.
The MIT implementation is from the CLtL1 era. The CMU implementation
conforms to CLtL2, but is slightly buggy. The Symbolics
implementation is an updated (1991) version of the MIT Loop macro. It
claims ANSI Loop conformance, and includes a test suite.
In addition, there is SLOOP and YLOOP. SLOOP is William Schelter's
loop macro (doesn't implement the CLtL specs). YLOOP is Frank Ritter
and Jim Panagos' implementation of the Yale loop macro described in
McDermont, Charniak and Riesbeck's AI programming book.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
CMU LOOP Macro, Iteration!LOOP Macro, LOOP Macro, Lisp!Iteration,
MIT LOOP Macro, SLOOP Macro, Symbolics LOOP Macro, YLOOP Macro
Contains:
cmu/ CMU LOOP: CMU Implementation of ANSI Loop Macro
mit/ MIT LOOP: The original MIT Loop macro implementation.
sloop/ SLOOP: William Schelter's SLOOP iteration facility.
symbolix/ Symbolics ANSI LOOP: Symbolics update of the MIT LOOP for ANSI
conformance.
yloop/ YLOOP: Portable implementation of the Yale LOOP macro.
See Also: ?
===========================================================================
Package: lang/lisp/code/iter/loop/cmu/
Name: CMU LOOP
Summary: CMU Implementation of ANSI Loop Macro
Version: 1.8 5/24/91 19:37:33 wlott, with bug fixes by mkant
Description:
CMU CLtL2-compatible Loop Macro. Please note that it uses the
WITH-HASH-TABLE-ITERATOR feature added by X3J13, which may not be
available in all "CLtL2-compatible" lisps. Also, since the macro was
implemented from scratch, it adheres to the (rather vague) word of the
specification, but not necessarily to historical precedent (e.g., loop
variables are not bound in FINALLY clauses, etc.).
Some bug fixes and portability enhancements by mkant, but still
slightly buggy.
===========================================================================
Package: lang/lisp/code/iter/loop/mit/
Name: MIT LOOP
Summary: The original MIT Loop macro implementation.
Version:
Description:
This is a copy of the "officially sanctioned" MIT LOOP macro for
running in Common Lisp. There are several differences between this
LOOP macro and the macro incorporated into the ANSI Common Lisp
specification. Some small changes have been made to the file to bring
it closer to the specification, but for better conformance, see the
Symbolics 1991 update. The original unaltered file is in the original/
directory.
The LOOP Iteration Macro is a conversion of LOOP 829, which is fairly
close to that released with Symbolics Release 6.1 (803). This
conversion was made by Glenn Burke (one of the original author/maintainers);
the work was performed at Palladian Software, in Cambridge MA, April 1986.
===========================================================================
Package: lang/lisp/code/iter/loop/sloop/
Name: SLOOP
Summary: William Schelter's SLOOP iteration facility.
Version:
Description:
SLOOP is a Common Lisp portable iteration facility written by William
Schelter. SLOOP is extremely user extensible, allowing one to easily
redefine the behavior and add additional collections and iteration
paths. There is a significant amount of backwards compatibility with
the original MIT loop macro.
The file includes several examples of extensions, such as
.. FOR v IN-FRINGE x .. (iterate through the fringe of a tree x)
.. SUM v .. (add the v)
.. AVERAGING v ..
.. FOR sym IN-PACKAGE y (iterate through symbols in a package y)
.. COLLATE v .. (for collecting X into an ordered list),
.. FOR (elt i) IN-ARRAY ar (iterate through array ar, with index i)
.. FOR (key elt) IN-TABLE foo.. (if foo is a hash table)
===========================================================================
Package: lang/lisp/code/iter/loop/symbolix/
Name: Symbolics ANSI LOOP
Summary: Symbolics update of the MIT LOOP for ANSI conformance.
Version:
Description:
This package contains the Symbolics update of the MIT LOOP macro
for ANSI conformance. It includes a test suite and is extendible.
===========================================================================
Package: lang/lisp/code/iter/loop/yloop/
Name: YLOOP
Summary: Portable implementation of the Yale LOOP macro.
Version:
Description:
This package contains YLOOP, Frank Ritter and Jim Panagos'
implementation of the Yale loop macro as described in McDermot,
Charniak and Riesbeck's AI programming book.
===========================================================================
Package: lang/lisp/code/iter/series/
Name: SERIES
Summary: Common Lisp looping macro package
Version: November 26, 1991
Description:
The benefits of programming in a functional style are well known. In
particular, algorithms that are expressed as compositions of functions
operating on series/vectors/streams of data elements are much easier
to understand and modify than equivalent algorithms expressed as
loops. Unfortunately, many programmers hesitate to use series
expressions. In part, this is due to the fact that series expressions
are typically implemented very inefficiently.
The Common Lisp Series macro package evaluates a wide class of series
expressions very efficiently by transforming them into iterative
loops. When using this class of series expressions, programmers can
obtain the advantages of expressing computations as series expressions
without incurring any run-time overhead.
===========================================================================
Topic: lang/lisp/code/match/
Summary: Pattern matching code, unifiers, regular expression matchers.
Description:
Various pattern matching code, including unifiers and regular
expression matchers.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Matchers, Matchers
Contains:
matcher/ Matcher: Regular expression style pattern matcher.
miranda/ Select Match
nregex/ NREGEX: Lisp-based regular expression parser.
regexp/ RegExp: Lisp interface to a C regular expression search
package.
unifier/ Unifier: Interlisp and Common Lisp unification code.
unify/ UNIFY: Portable recursive and iterative unification
implementations.
See Also: ?
===========================================================================
Package: lang/lisp/code/match/matcher/
Name: Matcher
Summary: Regular expression style pattern matcher.
Version: 21-JAN-91
Description:
Simple regular expression style matching of a pattern against a
list expression. Note that this is not a full regular expression
matcher.
Examples of use include:
(match-p '((:star :wild) b :wild d) '(a b c d)) ==> t
(match-p '(b (:star :wild) d (:star :wild)) '(a b c d)) ==> nil
(match-p '(:wild b :wild d) '(a b c d)) ==> t
===========================================================================
Package: lang/lisp/code/match/miranda/
Name:
Summary: Select Match
Version:
Description:
The SELECT-MATCH macro is useful for implementing interpreters,
(defun eval-expr (x)
(select-match x
('add x y) => (+ x y)
('sub x y) => (- x y)
('mul x y) => (* x y)
('div x y) => (/ x y)))
and also for programs in general,
(defun my-append (a b)
(select-match a
'nil => b
(hd . tl) => (cons hd (my-append tl b))))
(defun fact (n)
(select-match n
'0 => 1
n => (* n (fact (1- n)))))
===========================================================================
Package: lang/lisp/code/match/nregex/
Name: NREGEX
Summary: Lisp-based regular expression parser.
Version: 4/8/92
Description:
This regular expression parser operates by taking a regular expression
and breaking it down into a list consisting of lisp expressions and
flags. The list of lisp expressions is then taken in turned into a
lambda expression that can be later applied to a string argument for
parsing.
===========================================================================
Package: lang/lisp/code/match/regexp/
Name: RegExp
Summary: Lisp interface to a C regular expression search package.
Version:
Description:
A Franz Allegro CL foreign-function call interface to a
C-language regular-expression search package.
===========================================================================
Package: lang/lisp/code/match/unifier/
Name: Unifier
Summary: Interlisp and Common Lisp unification code.
Version: 1-AUG-88
Description:
Probably not completely portable, but a good start for somebody who
wants to implement a portable Common Lisp implementation.
===========================================================================
Package: lang/lisp/code/match/unify/
Name: UNIFY
Summary: Portable recursive and iterative unification implementations.
Version: 15-OCT-90
Description:
Two portable implementations of unification, one recursive and one
iterative.
===========================================================================
Topic: lang/lisp/code/math/
Name: Math Library
Summary: Lisp code for various mathematical functions.
Description:
A variety of mathematical functions implemented in Lisp.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Math, Math
Contains:
bell/ Bell's number: Lisp code for a function thar return's Bell's
number.
clasp/ CLASP and CLIP: Common Lisp Analytical Statistics Package
clmath/ CLMath: Common Lisp library of mathematical functions.
hist/ HIST: Simple histogram facility using Format strings for
output.
isqrt/ ISQRT: Code for efficient calculation of integer square roots.
matrix/ Matrix: Matrix routines for Common Lisp.
maxima/ MAXIMA: Information about MAXIMA for Common Lisp
mma/ MockMma: Mathematica-style parser written in Common Lisp.
quine/ QUINE: Quine Tree algorithm for satisfiability
random/ Pseudo-random number generator implemented in Common Lisp.
sapa/ SAPA: Library of Lisp functions for spectral analysis and
statistics
simplex/ SIMPLEX: Common Lisp implementation of the Simplex algorithm.
See Also: ?
===========================================================================
Package: lang/lisp/code/math/bell/
Name: Bell's number
Summary: Lisp code for a function thar return's Bell's number.
Version:
Description:
Lisp code for a function returning Bell's number, the number of
partitions of an n-element set.
===========================================================================
Package: lang/lisp/code/math/clasp/
Name: CLASP and CLIP
Summary: Common Lisp Analytical Statistics Package
Version: CLASP 1.3.2 (4-FEB-94); CLIP 1.4 (4-FEB-94)
Description:
CLASP (Common Lisp Analytical Statistics Package) provides the basic
functionality of a statistics package. The CLIM interface includes a
"notebook" that is both a "desktop" for icons and a Lisp interactor
pane, and uses BBN's SciGraph package for plotting. The Common Lisp
Instrumentation Package (CLIP) is available along with CLASP. CLIP is
designed to allow AI system developers and evaluators a portable way to
define and manage "alligator clips" for instrumenting their programs.
CLIP produces data about program behavior in CLASP format, as well as
other commonly used data formats. It currently has facilities to
support experiment design, such as scenario scripting and factorial
combination of independent variables, and can collect data in
summary form (at the end of each trial) or based upon the occurrence of
specific events (both periodic and non-periodic).
Using CLIP/CLASP the experimenter can:
- collect and filter data while a program runs
- define and automatically run experiments to evaluate a program's
behavior in different conditions
- transform, filter and partition data in powerful ways
- examine data graphically and statistically
- run parametric and computer-intensive tests
===========================================================================
Package: lang/lisp/code/math/clmath/
Name: CLMath
Summary: Common Lisp library of mathematical functions.
Version: 1989
Description:
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.
===========================================================================
Package: lang/lisp/code/math/hist/
Name: HIST
Summary: Simple histogram facility using Format strings for output.
Version: 28-JUN-90
Description:
Hist is a macro of form (HIST (min max [bucket-size]) . body)
Creates a histogram with buckets of the specified size (defaults to
1), spanning the range from Low (inclusive) to High (exclusive), with
two additional buckets to catch values below and above this range.
The body is executed as a progn, and every call to Hist-Record within
the body provides a value for the histogram to count. When Body
exits, the histogram is printed out and Hist returns NIL.
A simple example:
(hist (0 10) (dotimes (i 1000) (random 10)))
This example may make the RANDOM distribution look more normal:
(hist (0 10 2) (dotimes (i 1000) (random 10)))
This example will show you overflow buckets:
(hist (2 12) (dotimes (i 1000) (random 15)))
===========================================================================
Package: lang/lisp/code/math/isqrt/
Name: ISQRT
Summary: Code for efficient calculation of integer square roots.
Version:
Description:
Contains discussion of the speed of the Common Lisp function ISQRT
for extremely large bignums, the results of timing tests, and code
for a more efficient implementation.
===========================================================================
Package: lang/lisp/code/math/matrix/
Name: Matrix
Summary: Matrix routines for Common Lisp.
Version: 21-OCT-93
Description:
A set of routines for matrix manipulation in Common Lisp, including
transposition, multiplication, addition, subtraction, and inversion.
===========================================================================
Package: lang/lisp/code/math/maxima/
Name: MAXIMA
Summary: Information about MAXIMA for Common Lisp
Version: 4-155, 13-DEC-89
Description:
Maxima is a Common Lisp version by William Schelter based on the
original Macsyma implemented at MIT. It is based on the release
from MIT to the DOE of the original MACSYMA.
We have not included MAXIMA in the repository because of concerns
about the copyright status of the code. Although the changes made
by William Schelter to port Maxima to Common Lisp are free, the
original Macsyma isn't. One previously was able to obtain a license
for MAXIMA from
National Energy Software Center (NESC)
Argonne National Laboratory
9700 South Cass Avenue
Argonne, IL 60439
Tel: 615-576-2606, 708-972-7250
for fees ranging from $1300 to $2800, with the cheaper licenses for
universities. However, the NESC doesn't seem to exist any more,
so the status of the code is unclear.
A copy of a message from Richard Petti, President of Macsyma Inc.,
on this issue is included in this directory.
===========================================================================
Package: lang/lisp/code/math/mma/
Name: MockMma
Summary: Mathematica-style parser written in Common Lisp.
Version: 1.5, 19 Nov 1992
Description:
This program is a rough shell that has only rudimentary (but fast)
parsing, display, numeric evaluation, polynomial/rational
simplification, integration, and some pattern matching. It is not a
substitute for Mathematica (r), Maple (r), etc., and is not intended
to compete with such commercial systems. This system can be used for
experimentation, such as inserting an entirely different evaluation
strategy or an entirely different numeric system, and re-run your
"Mathematica(r) source code" through it. Or hook it up to your
favorite other semantics for solve, integrate, and so on (e.g. JACAL,
Reduce, Macsyma, Maple, ...).
===========================================================================
Package: lang/lisp/code/math/quine/
Name: QUINE
Summary: Quine Tree algorithm for satisfiability
Version: 1-DEC-92
Description:
A satisfiability program implemented in Common Lisp. It is supposed
to work on any boolean expression, but was mainly designed for 3sat.
If you use a propositional inference engine in your work, this
program is probably faster in a majority of cases.
On Mitchell, Selman, Levesque hard spot problems, the program takes
from 1 minute to 15 minutes on 150 variable instances, including
unsatisfiable instances, averaging under 10 minutes. The program
appears to run in time N*2^(N/22) on MSL hard spot instances.
===========================================================================
Package: lang/lisp/code/math/random/
Name:
Summary: Pseudo-random number generator implemented in Common Lisp.
Version: 17-MAY-93
Description:
This is a portable pseudo-random number generator for Common LISP. It
is seedable, has a periord of 10^30 passes all of the statistical
tests and is four times faster than the built-in ones provided in
Allegro and Lucid.
The program was converted from a C program that was converted from a
FORTRAN program. The correctness of the generator can be verified by
the TEST function at the end of the file.
The FORTRAN version was written by George Marsaglia and Arif Zaman of
Florida State University. George Marsaglia originally proposed this
algorithm (see reference below). The C port was performed by Karl-L.
Noell and Helmut Weber of
the FHW (Fachhochschule Wiesbaden, W. Germany) Department of Computer
Science in April 1989.
===========================================================================
Package: lang/lisp/code/math/sapa/
Name: SAPA
Summary: Library of Lisp functions for spectral analysis and statistics
Version: 1.0 (21-JUL-93)
Description:
Sapaclisp is a collection of Common Lisp functions that can be used to
carry out many of the computations described in the SAPA book
Donald B. Percival and Andrew T. Walden, "Spectral Analysis for
Physical Applications: Multitaper and Conventional Univariate
Techniques", Cambridge University Press, Cambridge, England, 1993.
The SAPA book uses a number of time series as examples
of various spectral analysis techniques. The most important of
these series are also available from StatLib by sending the command
send sapa from datasets
to the Internet address
statlib@lib.stat.cmu.edu
Sapaclisp features functions for converting to/from decibels, the
Fortran sign function, log of the gamma function, manipulating
polynomials, root finding, simple numerical integration, matrix
functions, Cholesky and modified Gram-Schmidt (i.e., Q-R) matrix
decompositions, sample means and variances, sample medians,
computation of quantiles from various distributions, linear least
squares, discrete Fourier transform, fast Fourier transform, chirp
transform, low-pass filters, high-pass filters, band-pass filters,
sample autocovariance sequence, autoregressive spectral estimates,
least squares, forward/backward least squares, Burg's algorithm, the
Yule-Walker method, periodogram, direct spectral estimates, lag window
spectral estimates, WOSA spectral estimates, sample cepstrum, time
series bandwidth, cumulative periodogram test statistic for white
noise, and Fisher's g statistic.
===========================================================================
Package: lang/lisp/code/math/simplex/
Name: SIMPLEX
Summary: Common Lisp implementation of the Simplex algorithm.
Version: 22-APR-92
Description:
A Common Lisp implementation of the Simplex algorithm. Includes
some examples.
===========================================================================
Topic: lang/lisp/code/parsing/
Summary: Collection of Lisp code for parsing.
Description:
Various parsing-related code for Common Lisp. The emphasis is more
on code-related parsing, such as LALR parsers, than on natural
language parsing. (Although some of the parsers can serve dual purposes.)
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Parsing, Parsing
Contains:
lalr/ LALR: A LALR(1) parser-generator for Lisp.
taylor/ Taylor: A Lisp lexer implemented in C.
time/ PARSE-TIME: Parsing routines for time and date strings.
tree_fmt/ PNODE and GNODE: Formatting of Parse Trees for Display
zebu/ ZEBU: Zebu parser generator for Common Lisp
See Also:
areas/nlp/parsing/
===========================================================================
Package: lang/lisp/code/parsing/lalr/
Name: LALR
Summary: A LALR(1) parser-generator for Lisp.
Version:
Description:
LALR is a parser generator for Common Lisp (a Lisp version of YACC).
Given a CFG grammar, a list of lexical or terminal categories, and
an atomic end marker, produces Lisp code for a LALR(1) parser for
the grammar. The Lisp code defines a function LALR-PARSER that may
be used to parse input.
Includes a sample grammar.
===========================================================================
Package: lang/lisp/code/parsing/taylor/
Name: Taylor
Summary: A Lisp lexer implemented in C.
Version: 1-MAR-94
Description:
This directory contains a minimalist C lexer for reading Lisp code. It
was written in C, not with a lexer generator.
===========================================================================
Package: lang/lisp/code/parsing/time/
Name: PARSE-TIME
Summary: Parsing routines for time and date strings.
Version: 1.3 91/07/26 11:35:16
Description:
Contains parsing routines for time and date strings. PARSE-TIME
returns the universal time integer for the time and/or date given in
the string.
===========================================================================
Package: lang/lisp/code/parsing/tree_fmt/
Name: PNODE and GNODE
Summary: Formatting of Parse Trees for Display
Version:
Description:
This directory contains two programs for formatting parse trees for
display.
The first is a simple portable tree indenter designed for natural
language parse trees. It includes primitive facilities for printing
subscripts, and is smart about breaking up long lines, such as
formatting
(s (np (det The) (noun cat)) (vp (verb chased) (np (det the) (noun mouse))))
as
(s (np (det The) (noun cat))
(vp (verb chased)
(np (det the) (noun mouse))))
The second is a Macintosh Common Lisp program that draws parse trees
in two dimensions, each tree in its own window. The code uses MCL
extensions to Common Lisp to create windows and draw graphics in them.
(The result looks something like the example below, but with real
graphics and in a real window, of course, not as ASCII art). The code
supports all sorts of nifty features like sub- and superscripts at
left and right, boldface and italics, different line shapes, weights,
and fills, arbitrary connections between nodes, and more.
=[]========The cat chased the mouse============
| |
| s |
| / \ |
| / \ |
| / \ |
| np vp |
| / \ / \ |
| / \ / \ |
| det noun verb np |
| | | | | \ |
| The cat chased | \ |
| det noun |
| | | |
| the mouse |
| |
|_____________________________________________|
===========================================================================
Package: lang/lisp/code/parsing/zebu/
Name: ZEBU
Summary: Zebu parser generator for Common Lisp
Version: 2.9
Description:
Zebu is a parser generator for Common Lisp. It is an extension written
in Common Lisp of the Scheme version. (Scheme version originally
implemented by William M. Wells III.) 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, capabilities to define and use
meta-grammars (grammars to express a grammar in), 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.
The current version can also produce a generator using a
'reversible grammar' notation, in addition to a parser.
Documentation is included with the distribution.
===========================================================================
Topic: lang/lisp/code/search/
Summary: Lisp code for searching.
Description:
Lisp code for searching. Includes code based on alpha-beta minimax
and a queue-based implementation of generic search.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Search, Search
Contains:
minimax/ MINIMAX: Lisp code for alpha beta minimax search.
queues/ Queue Search: Queue-based implementation of generic search.
See Also: ?
===========================================================================
Package: lang/lisp/code/search/minimax/
Name: MINIMAX
Summary: Lisp code for alpha beta minimax search.
Version:
Description:
Common Lisp implementation of alpha-beta minimax search by Mark
Kantrowitz (18-NOV-90). Includes a NEG-MAX implementation.
A simple implementation of alpha-beta search for tic-tac-toe by
Marco Zagha at Carnegie Mellon University for "AI: Representation and
Problem Solving" (15-381), Spring 1990.
===========================================================================
Package: lang/lisp/code/search/queues/
Name: Queue Search
Summary: Queue-based implementation of generic search.
Version: 7-AUG-90
Description:
Queue-based implementation of a generic framework for search. It is
intended as a pedagological tool for teaching students about the
variety of forms of search as discussed in the AI literature,
including depth-first search, hill climbing search, breadth-first
search, beam search, best-first search, branch and bound, branch and
bound with underestimates, and A* search.
When learning about some types of search commonly used in AI systems,
it often helps to think in terms of a queue of nodes to be searched.
Given a function which tests for the goal node, a function which finds
the node's children, a function which dequeues a node for testing, and
a function which merges the children into the queue, one can implement
a wide variety of search functions. Comparing the functions used can
help the student understand the difference between the various types
of search.
===========================================================================
Topic: lang/lisp/code/syntax/
Summary: Code related to changing or translating to/from Lisp syntax.
Description:
Programs that provide an alternate syntax for Lisp, translate from
one version of Lisp to another, or provide a syntax extension to Lisp.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Syntax, Syntax
Contains:
cgol/ CGOL: Algol-like language that compiles into Common Lisp.
fontstrp/ Font Stripper: Strips Symbolics font information from a text
file.
glisp/ GLISP: Alternate syntaxes for Common Lisp
haskell/ HASKELL: Yake Haskell system.
infix/ INFIX: Infix reader macro for Common Lisp.
measures/ MEASURES: Handles engineering numbers and measures in Lisp.
name_spc/ One Name Space (ONS): Provides for a single Lisp name space for
functions and variables
parcil/ PARCIL: A Parser for C syntax In Lisp
trans/ Code for translating one Lisp syntax to another.
See Also: ?
===========================================================================
Package: lang/lisp/code/syntax/cgol/
Name: CGOL
Summary: Algol-like language that compiles into Common Lisp.
Version: 1
Description:
CGOL is algol-like language developed originally by Vaughn Pratt.
This program is a Common Lisp implementation of CGOL that is
translated into Lisp before execution. 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).
===========================================================================
Package: lang/lisp/code/syntax/fontstrp/
Name: Font Stripper
Summary: Strips Symbolics font information from a text file.
Version: 7/24/87
Description:
This program will strip Symbolics font information from a text file.
The syntax is "font-stripper filename" or "font-stripper in-filename
out-filename". If only a single filename is given, then the
font-stripper replaces the source file with the font stripped output.
With two filenames, the output file gets the font-stripped output.
Warning: The program doesn't correctly deal with the case where
in-filename is the same as out-filename.
===========================================================================
Package: lang/lisp/code/syntax/glisp/
Name: GLISP
Summary: Alternate syntaxes for Common Lisp
Version: 1.2
Description:
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.
===========================================================================
Package: lang/lisp/code/syntax/haskell/
Name: HASKELL
Summary: Yake Haskell system.
Version: 2.05
Description:
Includes X Windows support.
===========================================================================
Package: lang/lisp/code/syntax/infix/
Name: INFIX
Summary: Infix reader macro for Common Lisp.
Version: 14-OCT-93
Description:
This is an implementation of an infix reader macro. It allows the
user to type arithmetic expressions in the traditional way (e.g., 1+2)
when writing Lisp programs instead of using the normal Lisp syntax
(e.g., (+ 1 2)). It is not intended to be a full replacement for the
normal Lisp syntax. If you want a more complete alternate syntax for
Lisp, get a copy Apple's MLisp or Pratt's CGOL.
Although similar in concept to the Symbolics infix reader (#),
no real effort has been made to ensure compatibility beyond coverage
of at least the same set of basic arithmetic operators. There are several
differences in the syntax beyond just the choice of #I as the macro
character. (Our syntax is a little bit more C-like than the Symbolics
macro in addition to some more subtle differences.)
We initially chose $ as a macro character because of its association
with mathematics in LaTeX, but unfortunately that character is already
used in MCL. We switched to #I() because it was one of the few options
remaining.
Documentation included at the top of the source file. Examples and
testing routines at the end.
===========================================================================
Package: lang/lisp/code/syntax/measures/
Name: MEASURES
Summary: Handles engineering numbers and measures in Lisp.
Version: 2.0
Description:
MEASURES is a system to handle engineering numbers and measures in
Common Lisp. Some documentation can be found in the file
measures.doc and examples in measures-example.lisp in the distribution.
===========================================================================
Package: lang/lisp/code/syntax/name_spc/
Name: One Name Space (ONS)
Summary: Provides for a single Lisp name space for functions and variables
Version:
Description:
ONS (One Name Space) provides a buggy reader macro for providing a
single Lisp syntax for functions and variables. It bypasses the
function-bindings of symbols and uses the value-bindings for everything.
ONS also provides for currying function-calls automatically.
The user of this module writes code that looks like this:
[if [> x y]
[print x]
[print y]]
and the bracket readmacro converts it into this:
(if (funcall > x y)
(funcall print x)
(funcall print y))
===========================================================================
Package: lang/lisp/code/syntax/parcil/
Name: PARCIL
Summary: A Parser for C syntax In Lisp
Version: 0.1a
Description:
PARCIL is a parser for a subset of the syntax for the C programming
language. PARCIL is written in Common Lisp, making it potentially
a useful building block for user interfaces for people who do not
like prefix syntax.
PARCIL is a recursive descent parser optimized to parse C. This makes it
fairly brittle and difficult to modify. However, it does make it fairly
fast, and it also allows the parser to deal with lots of C idiosyncrasies
which are difficult to implement in general-purpose parsers, such as
operator precedence and prefix and postfix operators.
NOTE: PARCIL is incomplete, providing no support for high-level C
constructs, and does very little error checking.
===========================================================================
Topic: lang/lisp/code/syntax/trans/
Summary: Code for translating one Lisp syntax to another.
Description:
Contains programs for porting one Lisp syntax (e.g., Interlisp,
Franz Lisp) to Common Lisp.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Syntax, Porting Lisp
Contains:
franz/ Translisp: Code for translating Franz Lisp to Common Lisp.
ilisp/ LTRAN: Code for translating Interlisp to Common Lisp.
See Also: ?
===========================================================================
Package: lang/lisp/code/syntax/trans/franz/
Name: Translisp
Summary: Code for translating Franz Lisp to Common Lisp.
Version: 20-JAN-87 17:22:52
Description:
Rule-based transformation system for porting Franz Lisp to Common Lisp.
===========================================================================
Package: lang/lisp/code/syntax/trans/ilisp/
Name: LTRAN
Summary: Code for translating Interlisp to Common Lisp.
Version: 9-JAN-92
Description:
This package translates Lisp programs written in Interlisp to several
other dialects of Lisp. This package was originally written in
Interlisp by Gordon Novak, and was ported to Common Lisp by
itself with some help from Peter Karp. This package should only be
considered an AID to the process of porting a program from Interlisp
to another dialect. The package will perform approximately 95% of the
translation process, but it is very likely to miss certain constructs
in the translation process, which must be translated by hand. Use
this package at your own risk; its performance is not warrantied in
any way.
Note that there are two versions of this translator: an Interlisp
version and a Common Lisp version. The Interlisp version is a single
standalone file; the Common Lisp version includes a shell script that
uses several Unix utilities to preprocess the Interlisp source file,
plus a Common Lisp program that does the higher-level translation.
===========================================================================
Topic: lang/lisp/code/testing/
Summary: Lisp programs for testing Lisp programs.
Description:
Contains Lisp programs that are useful in testing other Lisp
programs for compliance to a standard or test suite.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Testing, Testing
Contains:
cover/ COVER: Common Lisp test case coverage determination tool
rt/ RT: Common Lisp regression tester
See Also: ?
===========================================================================
Package: lang/lisp/code/testing/cover/
Name: COVER
Summary: Common Lisp test case coverage determination tool
Version: 15-SEP-91
Description:
The COVER Common Lisp test case coverage determination tool can help
assess the coverage of a suite of test cases. When a suite of test
cases for a program is run in conjunction with COVER, statistics are
kept on which conditions in the code for the program are exercised and
which are not. Based on this information, COVER can print a report of
what has been missed. By devising tests that exercise these
conditions, a programmer can extend the test suite so that it has more
complete coverage.
===========================================================================
Package: lang/lisp/code/testing/rt/
Name: RT
Summary: Common Lisp regression tester
Version: 19-DEC-90
Description:
Everyone knows that it is important to test a system thoroughly
whenever it is changed. However, it is far from easy to come up with
good tests and irritatingly laborious to keep track of a lot of tests
and run them time and again. The RT Common Lisp regression tester
automates part of this task.
Using RT, the programmer still has to come up with tests. However, RT
maintains a database of these tests and automatically runs them when
requested. This can take a lot of computer time, but does not take
any of the programmer's time. As a result, any bugs found by running
the tests---and this is a lot more bugs than you might think---are
essentially found for free.
===========================================================================
Topic: lang/lisp/code/tools/
Name: Lisp Utilities
Summary: Collection of miscellaneous Lisp tools.
Description:
Lisp programming utilities.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Tools, Tools
Contains:
defsys/ Defsystem: MAKE for Common Lisp
lint/ LINT: Lint for Common Lisp.
metering/ Metering: Portable Code Profiling Tool
psgraph/ PSGRAPH: PostScript DAG Grapher
sequel/ SEQUEL: For generating type-secure and efficient Lisp programs.
src_cmp/ Programs for comparing versions of source code.
step/ Step: Stepper/Debugger for Common Lisp
user_man/ User Manual: Automatical User Manual Creation
xref/ XREF: Static analysis cross-referencing tool for Common Lisp.
See Also: ?
===========================================================================
Package: lang/lisp/code/tools/defsys/
Name: Defsystem
Summary: MAKE for Common Lisp
Version:
Description:
Contains two programs for managing large systems of Lisp source files.
Mark Kantrowitz's DEFSYSTEM takes a structural approach, while
Joachim Laubsch's DEFSYS takes the procedural approach of the original
Symbolics defsystem.
===========================================================================
Package: lang/lisp/code/tools/defsys/laubsch/
Name: DEFSYS
Summary: A Portable System Definition Facility for Common Lisp
Version: 5.0, 11-AUG-92
Description:
In order to maintain a large system of modules with complex load and
compile time dependencies, a declarative and central representation of
a system, its subsystems and modules is preferable to one where these
dependencies are associated with a particular module (e.g. by REQUIRE
and PROVIDE).
Since in Lisp the definition of other languages is a frequently used
programming technique, the load and compile time dependencies are also
parameterized by the compiler or loader to be used for a module or
system. The Portable System Definition Facility is intended to meet
this need.
Laubsch's DEFSYS is an extended version of the portable defsystem
facility originally written by Douglas Rand .
[Note: Laubsch's DEFSYS takes the procedural approach to system
definition. This is the same approach used by the original
Symbolics defsystem.]
===========================================================================
Package: lang/lisp/code/tools/defsys/mkant/
Name: DEFSYSTEM
Summary: Portable and flexible system definition facility for Common Lisp
Version: 2.5 8-JAN-92
Description:
This is a portable system definition facility for Common Lisp.
Though home-grown, the syntax was inspired by fond memories of the
defsystem facility on Symbolics 3600's. However, rather than follow in
the Symbolic procedural approach, where the system definition
intermixes compilation and other instructions in the definition, we
took a structural approach. The system definition defines only the
structure of the system. The order of files for compilation is
computed using a topological sort of the file-dependency constraints.
This divorces the actual operation from the structure of the system,
permitting one to define other operations on the system. For example,
Alex Repenning has implemented an efficient
Boyer Moore string search over the files in the system (see
search-systems.lisp in the distribution).
===========================================================================
Package: lang/lisp/code/tools/lint/
Name: LINT
Summary: Lint for Common Lisp.
Version: 6/13/89 11:26:40
Description:
Implements a set of compiler style checkers that warn when a function
does not conform to Common Lisp.
===========================================================================
Package: lang/lisp/code/tools/metering/
Name: Metering
Summary: Portable Code Profiling Tool
Version: v2.1 (25-JAN-94)
Description:
METERING is a portable code profiling tool, for gathering timing and
consing statistics while a program is running. This is a combination
of the Monitor package written by Chris McConnell and the Profile
package written by Skef Wholey and Rob MacLachlan, with several
extensions. Monitors the use of functions and macros: calls, CPU
time, clock time, and storage use.
===========================================================================
Package: lang/lisp/code/tools/psgraph/
Name: PSGRAPH
Summary: PostScript DAG Grapher
Version: Jan-92
Description:
The PSGrapher is a set of Lisp routines that can be called to produce
PostScript commands to display a directed acyclic graph. It uses the
same basic algorithm as the ISI Grapher. It is slower than the ISI
grapher, but produces much prettier output than using Xdump to copy an
ISI Grapher screen image to a PostScript printer. It also allows
arbitrary information to be displayed with a node, and can print as
many output pages as are necessary to accommodate large graphs (subject
to PostScript printer limits, typically one or two thousand nodes).
The PSgrapher is small enough and easy enough to use to be included
in other systems without pain.
===========================================================================
Package: lang/lisp/code/tools/sequel/
Name: SEQUEL
Summary: For generating type-secure and efficient Lisp programs.
Version: 7.0 (1-FEB-94)
Description:
SEQUEL (SEQUEnt processing Language) is designed both as a general
purpose AI language for generating type-secure and efficient Lisp
programs and as a very high level specification language for
implementing logics on the computer. Designed at the University of
Leeds, SEQUEL compiles sequent-calculus specifications of arbitrary
logics to working proof assistants. The sequent calculus
specifications are compiled into Horn clauses and from Horn clauses
into virtual machine instructions of an abstract machine SLAM (SequeL
Abstract Machine) which then translates these instructions into
efficient Lisp code using WAM-style compilation techniques. Although
a functional programming language, SEQUEL includes facilities for
backtracking usually associated with logic programming, and supports a
pattern-matching method of building functions based on Prolog
notation. The Lisp code generated from SEQUEL functions is completely
portable and runs in most Common Lisp implementations. It is
comparable in efficiency with hand-written code. SEQUEL also supports
optional static type-checking in the manner of SML and similar
languages. With type-checking enabled, all inputs and loaded files
are type-checked and the resulting Lisp programs are type-secure. The
SEQUEL compiler uses the information gleaned from type-checking to add
compiler directives within the generated Lisp functions to produce
optimized Lisp programs. SEQUEL includes a UNIX-style top level with
its own trace package and type-checking debugger. SEQUEL is also of
interest to automated reasoning researchers. It provides a very
powerful means of generating proof assistants and theorem provers that
have a very fast performance using WAM-derived compilation techniques.
The theorem provers are automatically verified. It includes a facility
for Datalog and an efficient occurs-check Horn-clause-to-Lisp
compiler, a mouse driven graphical interface for all proof assistants
and theorem provers built under SEQUEL (currently available only under
Lucid). Several demonstration theorem provers for different logics,
including FOL, Clarke's logic of space, partial evaluation, set
theory, and constructive type theory are available.
===========================================================================
Topic: lang/lisp/code/tools/src_cmp/
Summary: Programs for comparing versions of source code.
Description:
Programs for comparing different versions of source code and
identifying the differences.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Tools, Source Comparison
Contains:
ilisp/ COMPARE: InterLisp Source Comparison Tool
mkant/ Source Compare (SC): A 'diff' program for Common Lisp
See Also: ?
===========================================================================
Package: lang/lisp/code/tools/src_cmp/ilisp/
Name: COMPARE
Summary: InterLisp Source Comparison Tool
Version: 15-APR-88
Description:
COMPARESOURCES is an Interlisp program for comparing two versions of a Lisp
source file for differences. The comparison is completely
brute-force: COMPARESOURCES reads the complete contents of both files,
and compares all the expressions for differences.
Note that this code is very much dependent on Interlisp, since it uses
the DWIMIFY function for cleaning up the functions before comparison.
On the other hand, it does provide a Lispish form-by-form comparison
that avoids differences in indentation. So it might be useful to
port this code to Common Lisp someday. In its current form, it really
isn't usable.
===========================================================================
Package: lang/lisp/code/tools/src_cmp/mkant/
Name: Source Compare (SC)
Summary: A 'diff' program for Common Lisp
Version: 24-JAN-91
Description:
Source Compare is a portable tool for comparing Common Lisp source
files, similar to the UNIX program 'diff'. Like diff it can ignore
case, whitespace, and blank lines. In addition, it can also ignore
certain classes of Lisp comments. It uses a greedy algorithm that runs
in average-case O(m+n) time.
===========================================================================
Package: lang/lisp/code/tools/step/
Name: Step
Summary: Stepper/Debugger for Common Lisp
Version: 12-JUN-94
Description:
This directory contains a stepper/debugger for Common Lisp.
===========================================================================
Package: lang/lisp/code/tools/user_man/
Name: User Manual
Summary: Automatical User Manual Creation
Version: 5-JAN-93
Description:
The Automatic User Manual Creation system is a portable system for
automatically generating user's guides from the source definitions and
their documentation strings. It uses several heuristics for formatting
the documentation segments nicely. It can produce text (ASCII),
Scribe, and LaTeX output. If Waters' XP pretty printer is available,
it uses that instead to format the argument lists.
===========================================================================
Package: lang/lisp/code/tools/xref/
Name: XREF
Summary: Static analysis cross-referencing tool for Common Lisp.
Version: 27-FEB-91
Description:
XREF is a portable static analysis cross referencing tool for Common
Lisp. It determines the callers of functions and variables and is
useful for mapping out the structure of a program. XREF is similar to
the Symbolics Who-Calls and Xerox Masterscope programs. It includes an
interface to Joe Bates' PostScript graphing tool (psgraph.lisp).
When you change a function or variable definition, it can be useful to
know its callers, in order to update each of them to the new
definition. Similarly, having a graphic display of the structure
(e.g., call graph) of a program can help make undocumented code more
understandable. This static code analyzer facilitates both
capabilities. The database compiled by xref is suitable for viewing
by a graphical browser. (Note: the reference graph is not necessarily
a DAG. Since many graphical browsers assume a DAG, this will lead to
infinite loops. Some code which is useful in working around this
problem is included, as well as a sample text-indenting outliner and
an interface to Bates' PSGraph PostScript Graphing facility.)
===========================================================================
Topic: lang/lisp/doc/
Summary: Documentation, including standards and proposals
Description:
Contains documents such as introductions to Lisp and CLOS, copies
of the standards, a history of the evolution of Lisp, and random notes
on the language.
Copying: Free use, copying, distribution
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: none
Keywords:
Lisp!Documents
Contains:
bib/ Bibliography: BibTeX bibliographies of work in Common Lisp
history/ History: Files related to the history of the Lisp programming
language.
intro/ Introductions and Tutorials for Lisp and CLOS
notes/ Lisp Notes: Summaries and interesting notes about Lisp-related
stuff.
standard/ Lisp Standards: Lisp standards documents and test suites
See Also: ?
===========================================================================
Package: lang/lisp/doc/bib/
Name: Bibliography
Summary: BibTeX bibliographies of work in Common Lisp
Version:
Description:
No files yet.
===========================================================================
Package: lang/lisp/doc/history/
Name: History
Summary: Files related to the history of the Lisp programming language.
Version:
Description:
PostScript version of Gabriel and Steele's "The Evolution of Lisp"
from the 1993 ACM History of Programming Languages conference.
===========================================================================
Package: lang/lisp/doc/intro/
Name:
Summary: Introductions and Tutorials for Lisp and CLOS
Version:
Description:
Jeff Dalton's "Brief Guide to CLOS"
Geoffrey Gordon's "Common LISP Hints"
===========================================================================
Package: lang/lisp/doc/notes/
Name: Lisp Notes
Summary: Summaries and interesting notes about Lisp-related stuff.
Version:
Description:
database.txt Notes about Lisp/database interfaces.
lisp.bnf BNF grammar for Lisp
lispm.txt Notes about the architecture Lisp Machines
mirror.txt Elegant implementation of MIRROR.
permute.txt Computing Permutations
precednc.txt Notes about computing the class precedence list.
restarts.txt Notes about restarts and condition handlers.
set_part.txt Computing Partitions of a Set
===========================================================================
Topic: lang/lisp/doc/standard/
Name: Lisp Standards
Summary: Lisp standards documents and test suites
Description:
Copying: Free use, copying, distribution
Updated: 9/23/93
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
ANSI Lisp, ISO Lisp, Lisp!Standards, Standards!Lisp
Contains:
ansi/ dpANSI CL: Draft ANSI Standard for Common Lisp
iso/ ISO: Draft Standard for ISO Lisp
tests/ CL-Testsuite: Tests Common Lisp (CLtL1) implementations.
See Also: ?
===========================================================================
Package: lang/lisp/doc/standard/ansi/
Name: dpANSI CL
Summary: Draft ANSI Standard for Common Lisp
Version:
Description:
TeX sources and Unix-compressed DVI files for the draft proposed
American National Standard for Common Lisp. Note that the document is
approximately 1,300 pages long when printed out.
Hard copies of the draft may be purchased from
Global Engineering Documents, Inc.
2805 McGaw Avenue
Irvine, CA 92714
1-800-854-7179
714-261-1455
for a single copy price of $80 ($104 international).
===========================================================================
Package: lang/lisp/doc/standard/ansi/clos/
Name: CLOS SPEC
Summary: Common Lisp Object System Specification
Version: 15-JUN-88 draft
Description:
TeX sources and DVI files for the CLOS Specification.
===========================================================================
Package: lang/lisp/doc/standard/ansi/mop/
Name: MOP
Summary: Specification for the CLOS Metaobject Protocol
Version:
Description:
Contains the CLOS Metaobject Protocol specification, which appears
as chapters 5 and 6 of the book
Gregor Kiczales, Jim des Rivieres, and Daniel G. Bobrow, "The
Art of the Metaobject Protocol", MIT Press, 1991. 335 pages.
ISBN 0-262-61074-4
We recommend buying a copy of the book, which contains a lot of
additional useful explanatory material beyond the specification.
===========================================================================
Package: lang/lisp/doc/standard/iso/
Name: ISO
Summary: Draft Standard for ISO Lisp
Version:
Description:
ISO Lisp draft standard, as submitted to SC-22, in DVI and
PostScript formats.
===========================================================================
Package: lang/lisp/doc/standard/tests/
Name: CL-Testsuite
Summary: Tests Common Lisp (CLtL1) implementations.
Version:
Description:
Two test suites for testing Common Lisp implementations for
conformance to the first edition of Guy Steele's "Common Lisp
the Language". The original version, in xcltest.tar.gz
(xcl-testsuite.tar), was built by researchers at ISST of FhG
for their Common Lisp implementation named XCL. The file
testcl.tar.gz (testsuite.tar) was adapted to CLISP by Brune
Haible. The test suite is not complete in any sense, but may
be useful in uncovering bugs in an implementation.
===========================================================================
Package: lang/lisp/faq/
Name: Lisp and CLOS FAQs
Summary: Frequently Asked Questions (FAQ) postings for
comp.lang.lisp and comp.lang.clos newsgroups
Version:
Description:
A compendium of answers to frequently asked questions about
Lisp and related topics. Posted monthly to the comp.lang.lisp
and comp.lang.clos newsgroups.
===========================================================================
Topic: lang/lisp/gui/
Summary: Graphical User Interfaces (GUI) for Lisp and other graphics
code.
Description:
Sources for all the free Lisp graphical user interfaces (GUI)
and information about several of the commercial interfaces.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
GUI!Lisp, Graphics, HCI
Contains:
clim/ CLIM Library: Common Lisp Interface Manager code and
documentation library
clm/ CLM, GINA, and IB: Common Lisp Motif, Generic INteractive
Application, and Interface Builder
clue/ CLUE and CLIO: Common Lisp User-Interface Environment and
Common Lisp Interactive Objects
clx/ CLX: Common Lisp X binding
cw/ Common Windows: Information about Allegro Common Windows
ew/ EW: Express Windows
garnet/ GARNET: One of the biggest and best GUIs for Lisp.
graphers/ Graphers: Simple grapher that runs in most of the GUIs
lispview/ LispView: A GUI that doesn't use CLX.
lispwork/ Information about Lispworks Toolkit
lsp2wish/ LISP2WISH: Simple demo of synchronous communication between
Lisp and Tcl/Tk
picasso/ Picasso: Graphical User Interface Development System
winterp/ WINTERP: Widget INTERPreter
xit/ XIT: X User Interface Toolkit
xwin/ XWIN: Simple X windows for text output from LISP
yy/ YY: Network oriented window toolkit for Common Lisp.
See Also: ?
===========================================================================
Topic: lang/lisp/gui/clim/
Name: CLIM Library
Summary: Common Lisp Interface Manager code and documentation library
Description:
CLIM is *not* free, so we are unable to provide a copy of the code.
However, we have provided a (reorganized) version of the library of
user contributed CLIM code maintained by Vincent Keunen, with some
additions. The library includes CLIM utilities (browsers, ...),
example code, and patches.
The structure of the library is as follows:
clib/ CLIM Interface Builder
clim_1/ Contributed code that runs under CLIM 1.0
clim_2/ Contributed code that runs under CLIM 2.0
general/ Contributed code that runs under CLIM 1.0 and 2.0
impl_dep/ Platform-specific CLIM code and patches
mail/ Copy of archives of the CLIM mailing list
papers/ Papers about CLIM and its add-ons
CLIM (Common Lisp Interface Manager) is a portable, graphical user
interface toolkit originally developed by International Lisp
Associates, Symbolics, and Xerox PARC, 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. CLIM includes a general
purpose grapher. It runs on Symbolics Lisp Machines; Allegro, Lucid,
and Harlequin on several Unix platforms; Symbolics CLOE on 386/486 IBM
PCs running Windows; and MCL on Apple Macintoshes. 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: Dennis Doughty or Bill York .
Illidium has signed a distribution agreement for MCL CLIM with
Lucid, so you can also get it from Lucid at sales@lucid.com,
415-329-8400. (Lucid also has a license to distribute MCL itself.)
Origin: cambridge.apple.com:/pub/clim [134.149.2.3] CLIM Library
ftp.uu.net:vendor/franz/clim/clim.ps.Z CLIM 2.0 Spec
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: clim-request@bbn.com
Contact: Vincent Keunen CLIM Library
Network Research Belgium
Parc Industriel des Hauts-Sarts
2e Avenue, 65
B-4040 Herstal, BELGIUM
Tel: +32 41 407282
Fax: +32 41 481170
(Please cc mail to lisp-utilities@cs.cmu.edu.)
Keywords:
CLIM Library, GUI!Lisp, Graphics, HCI
Contains:
clib/ CLIB: CLIM Interface Builder
clim_1/ CLIM-1: Contributed code that runs under CLIM 1.0
clim_2/ CLIM-2: Contributed code that runs under CLIM 2.0
general/ Contributed code that runs under both CLIM 1.0 and 2.0
impl_dep/ Platform-specific CLIM code and patches
mail/ Archives of the CLIM mailing list, {\tt clim-request@bbn.com}.
papers/ CLIM Papers and Specifications: Papers about CLIM and its
add-ons.
See Also: ?
===========================================================================
Package: lang/lisp/gui/clim/clib/
Name: CLIB
Summary: CLIM Interface Builder
Version:
Description:
Prototype implementation of CLIB, the CLIM Interface Builder. CLIB
allows the programmer to generate code for CLIM (the Common Lisp
Interface Manager) interactively. This speeds up the development
process and reduces the possibility of errors. This kind of
interactive rapid prototyping can significantly reduce the costs of a
specification phase.
A prototype of a CLIM Interface Builder is being developed within a joint
effort of Forschungszentrum Informatik (FZI) and Symbolics Systemhaus GmbH.
Contents include a postscript tech report describing the
preliminary version of CLIB, and binaries for the Allegro implementation.
===========================================================================
Topic: lang/lisp/gui/clim/clim_1/
Name: CLIM-1
Summary: Contributed code that runs under CLIM 1.0
Description:
Contains user-contributed code that runs under CLIM 1.0. Some may
work under CLIM 2.0.
The directory structure is as follows:
browsers/ Inspectors, browsers, managers
examples/ Examples of how to do various things in CLIM
icon_etc/ Icons, Mice, and Cursors
menus/ Various implementations of menus
misc/ Miscellaneous extensions to CLIM (e.g., bitblt)
patches/ Implementation-independent patches for CLIM 1.0
printing/ Printing and postscript-related code
testing/ Code for testing CLIM code
toys/ Toy (small) example applications
Origin: cambridge.apple.com:/pub/clim [134.149.2.3] CLIM Library
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: clim-request@bbn.com
Contact: Vincent Keunen CLIM Library
Network Research Belgium
Parc Industriel des Hauts-Sarts
2e Avenue, 65
B-4040 Herstal, BELGIUM
Tel: +32 41 407282
Fax: +32 41 481170
(Please cc mail to lisp-utilities@cs.cmu.edu.)
Keywords:
CLIM Library, GUI!Lisp, Graphics, HCI
Contains:
browsers/ Inspectors, browers, and managers for CLIM 1.0
examples/ Examples of how to do various things in CLIM 1.0
icon_etc/ Icons, Mice, and Cursors in CLIM 1.0
menus/ Various implementations of menus in CLIM 1.0
misc/ Miscellaneous extensions to CLIM 1.0
patches/ Implementation-independent patches for CLIM 1.0
printing/ Printing and PostScript-related code for CLIM 1.0
testing/ Code for testing CLIM 1.0 code
toys/ Toy (small) example applications for CLIM 1.0
See Also: ?
===========================================================================
Package: lang/lisp/gui/clim/clim_1/browsers/
Name:
Summary: Inspectors, browers, and managers for CLIM 1.0
Version:
Description:
inspect.tar A simple CLOS inspector/browser
dir_mgr.tar A directory manager
Contact: Clint Hyde
Advanced Decision Systems/BAH
1953 Gallows Rd, Suite 600
Vienna, VA 22182-3934
703-902-7130
===========================================================================
Package: lang/lisp/gui/clim/clim_1/examples/
Name:
Summary: Examples of how to do various things in CLIM 1.0
Version:
Description:
accept-multiple-fields-swm.text
A commented example of how to accept multiple fields by
Scott McKay
drag-and-drop.lisp
Drag and Drop translators by
Scott McKay
dragging-output.lisp
Simple example of dragging-output-record by
John Aspinall
incremental-redisplay-swm.text
A commented example of incremental redisplay by
Scott McKay
inter-lists-exchange.lisp
How accepting-values can be used to interchange elements of two
lists, by William M. York . (Please don't
bother the author about the code; contact Vincent instead.)
===========================================================================
Package: lang/lisp/gui/clim/clim_1/icon_etc/
Name:
Summary: Icons, Mice, and Cursors in CLIM 1.0
Version:
Description:
change-mouse-glyph.lisp
For changing the mouse-pointer-glyph to a bitmap or a spinning ball.
icon-examples.lisp
Various examples to manage icons by Erik Eilerts
icons-stuff-from-j-close.lisp
Stationary icons, mouse-movability, command-icons & dragged
icons by Jeff Close
picture-buttons.lisp
A simple implementation of picture icons by
Clint Hyde
working-cursor.lisp
Spinning cursor for busy applications
===========================================================================
Package: lang/lisp/gui/clim/clim_1/menus/
Name:
Summary: Various implementations of menus in CLIM 1.0
Version:
Description:
ctv_menu.tar
CLIM Emulation of Symbolics Menu Functions, including
TV:MENU-CHOOSE, TV:CHOOSE-VARIABLE-VALUES,
TV:MENU-MULTIPLE-CHOOSE, and TV:MULTIPLE-CHOOSE.
Written by Peter Karp , Mabry Tyson, David
Wilkins, and Scott McKay.
multiple-menus.lisp
A facility analogous to tv:MULTIPLE-MENU-CHOOSE on the Lisp
Machine by Scott McKay
ordered-menu-items.lisp
Provides the ability to define the layout of menu items in a
command menu pane by Brian H. Anderson
===========================================================================
Package: lang/lisp/gui/clim/clim_1/misc/
Name:
Summary: Miscellaneous extensions to CLIM 1.0
Version:
Description:
bitblt.cl
Pixmaps, bitblt, and rotated-strings for clim 1 by ncramer@bbn.com
color.tar
A presentation type with present, accept... for colors by
curt@eraserhead.jpl.nasa.gov
pathnames.tar
Pathname completion facility.
records.tar
Hacks for efficiently drawing really big scientific graphs by
Jeff Morrill with help from Scott McKay.
recycle-presentations-and-output-records.lisp
Allows you to recycle either presentations or output-records by
curt@eraserhead.jpl.nasa.gov
root_win.tar
How to create a root window on most clim platforms, by Vincent
Keunen, Oliver Christ, Meir Laker, and Koenraad de Smedt.
tables.tar
Fast display tables using home-grown incremental redisplay by
Philip L. Stubblefield, Rockwell International.
===========================================================================
Package: lang/lisp/gui/clim/clim_1/patches/
Name:
Summary: Implementation-independent patches for CLIM 1.0
Version:
Description:
input.tar
Various patches to correct the input editor bugs.
Written by Scott McKay.
===========================================================================
Package: lang/lisp/gui/clim/clim_1/printing/
Name:
Summary: Printing and PostScript-related code for CLIM 1.0
Version:
Description:
page.tar
Utilities and preview to generate Laserwriter pages.
ps.tar
Enhancements for postscript printing (wysi more wyg) by Erik
Eilerts . Provides a means for storing
drawings in PostScript format. Unlike the CLIM facility, it can
accurately calculate the size of text strings as they appear on the
printed page.
===========================================================================
Package: lang/lisp/gui/clim/clim_1/testing/
Name:
Summary: Code for testing CLIM 1.0 code
Version:
Description:
test_frm.tar
A simple framework that is used by other files for testing clim code
===========================================================================
Package: lang/lisp/gui/clim/clim_1/toys/
Name:
Summary: Toy (small) example applications for CLIM 1.0
Version:
Description:
bboard-pane.lisp
Simple application with one main "bulletin board" pane, in which
inferior panes are created.
ed.tar
Small text editor + application frame by Hallvard Traetteberg,
.
kytron.cl
A toy simulation demonstrating various clim aspects by
rm@cast.uni-linz.ac.at and available by anonymous ftp from
ftp.cast.uni-linz.ac.at.
peek.cl
A simple peek-frame for watching Lisp processes by
Ken Anderson , Jeff Morrill ,
with initial help from Dennis Doughty .
===========================================================================
Topic: lang/lisp/gui/clim/clim_2/
Name: CLIM-2
Summary: Contributed code that runs under CLIM 2.0
Description:
Contains user-contributed code that runs under CLIM 2.0.
The directory structure is as follows:
browsers/ Inspectors, graphers, browsers, managers
examples/ Examples of how to do various things in CLIM
luv93tut/ LUV 93 tutorials
menus/ Various implementations of menus
misc/ Miscellaneous extensions to CLIM
patches/ Implementation-independent patches for CLIM 2.0
Origin: cambridge.apple.com:/pub/clim [134.149.2.3] CLIM Library
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: clim-request@bbn.com
Contact: Vincent Keunen CLIM Library
Network Research Belgium
Parc Industriel des Hauts-Sarts
2e Avenue, 65
B-4040 Herstal, BELGIUM
Tel: +32 41 407282
Fax: +32 41 481170
(Please cc mail to lisp-utilities@cs.cmu.edu.)
Keywords:
CLIM Library, GUI!Lisp, Graphics, HCI
Contains:
browsers/ Inspectors, graphers, browsers, and managers for CLIM 2.0
examples/ Examples of how to do various things in CLIM 2.0
luv93tut/ CLIM 2.0 tutorials from the LUV-93 conference
menus/ Various implementations of menus for CLIM 2.0
misc/ Miscellaneous extensions to CLIM 2.0
patches/ Implementation-independent patches for CLIM 2.0
See Also: ?
===========================================================================
Package: lang/lisp/gui/clim/clim_2/browsers/
Name:
Summary: Inspectors, graphers, browsers, and managers for CLIM 2.0
Version:
Description:
indented-lists
Display tree structure as indented lists analogous to Mac
System-7 directories. Written by Jeff Morrill .
patch-layout.lisp
Implementations of parts of the ISI grapher algorithm. Written
by Bryan M. Kramer.
simple-graphedit.lisp
A toy graph editor, written by John Aspinall .
===========================================================================
Package: lang/lisp/gui/clim/clim_2/examples/
Name:
Summary: Examples of how to do various things in CLIM 2.0
Version:
Description:
dragging.cl (was dragging-output.lisp)
Simple example of dragging-output-record by Scott McKay.
gadget.cl (was custom-gadget.lisp)
Examples of implementing your own gadget classes by
Jeff Morrill .
===========================================================================
Package: lang/lisp/gui/clim/clim_2/luv93tut/
Name:
Summary: CLIM 2.0 tutorials from the LUV-93 conference
Version:
Description:
Contains code and slides from the LUV-93 tutorials on CLIM.
===========================================================================
Package: lang/lisp/gui/clim/clim_2/menus/
Name:
Summary: Various implementations of menus for CLIM 2.0
Version:
Description:
menu-debugger.lisp
On error, exposes a menu of restarts. Written by Jeff Morrill
.
multiple-menus.lisp
A facility analogous to tv:MULTIPLE-MENU-CHOOSE on the Lisp
Machine by Scott McKay
===========================================================================
Package: lang/lisp/gui/clim/clim_2/misc/
Name:
Summary: Miscellaneous extensions to CLIM 2.0
Version:
Description:
chooser.cl
This package contains a set of modal dialogs that return a value.
[Note: The file was empty in the original CLIM Library as well.]
xprint.cl (was xhardcopy.lisp)
Programmatically print a CLIM window using X utilities. Written
by Jeff Morrill .
===========================================================================
Package: lang/lisp/gui/clim/clim_2/patches/
Name:
Summary: Implementation-independent patches for CLIM 2.0
Version:
Description:
None at present.
===========================================================================
Topic: lang/lisp/gui/clim/general/
Summary: Contributed code that runs under both CLIM 1.0 and 2.0
Description:
This directory contains code that runs under both CLIM 1.0 and CLIM 2.0.
Origin: cambridge.apple.com:/pub/clim [134.149.2.3] CLIM Library
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: clim-request@bbn.com
Contact: Vincent Keunen CLIM Library
Network Research Belgium
Parc Industriel des Hauts-Sarts
2e Avenue, 65
B-4040 Herstal, BELGIUM
Tel: +32 41 407282
Fax: +32 41 481170
(Please cc mail to lisp-utilities@cs.cmu.edu.)
Keywords:
CLIM Library, GUI!Lisp, Graphics, HCI
Contains:
scigraph/ SciGraph: BBN's Scientific Graphing Package
See Also: ?
===========================================================================
Package: lang/lisp/gui/clim/general/scigraph/
Name: SciGraph
Summary: BBN's Scientific Graphing Package
Version:
Description:
Scigraph (Scientific Graphing Package) is a an object-oriented library
for doing x-vs-y plots. It can be embedded in other applications.
Scigraph's functionality includes scatter plots, linear plots, bar
charts, contour plots, and symbolic equations. Scatter, linear, and
bar plots are fast and reliable. Graphs and data points are
mouse-sensitive. You may either interactively or programmatically
control zooming, annotating, setting colors and symbols, and the usual
features you would expect.
===========================================================================
Topic: lang/lisp/gui/clim/impl_dep/
Summary: Platform-specific CLIM code and patches
Description:
allegro/ Allegro CL specific CLIM code
lispworks/ Harlequin Lispworks
lucid/ Lucid CL specific CLIM code
mcl/ MCL specific CLIM code
symbolics/ Symbolics specific CLIM code
Origin: cambridge.apple.com:/pub/clim [134.149.2.3] CLIM Library
ftp.uu.net:vendor/franz/clim/clim.ps.Z CLIM 2.0 Spec
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: clim-request@bbn.com
Contact: Vincent Keunen CLIM Library
Network Research Belgium
Parc Industriel des Hauts-Sarts
2e Avenue, 65
B-4040 Herstal, BELGIUM
Tel: +32 41 407282
Fax: +32 41 481170
(Please cc mail to lisp-utilities@cs.cmu.edu.)
Keywords:
CLIM Library, CLIM!Impl. Dep. Code, GUI!Lisp, Graphics, HCI
Contains:
allegro/ CLIM Implementation-Dependent Code for Allegro CL
lispworx/ CLIM Implementation-Dependent Code for Harlequin Lispworks
lucid/ CLIM Implementation-Dependent Code for Lucid CL
mcl/ CLIM Implementation-Dependent Code for MCL
symbolix/ CLIM Implementation-Dependent Code for Symbolics Genera
See Also: ?
===========================================================================
Package: lang/lisp/gui/clim/impl_dep/allegro/
Name:
Summary: CLIM Implementation-Dependent Code for Allegro CL
Version:
Description:
patches/ CLIM patches for Allegro CL
===========================================================================
Package: lang/lisp/gui/clim/impl_dep/lispworx/
Name:
Summary: CLIM Implementation-Dependent Code for Harlequin Lispworks
Version:
Description:
patches/ Patch directory.
===========================================================================
Package: lang/lisp/gui/clim/impl_dep/lucid/
Name:
Summary: CLIM Implementation-Dependent Code for Lucid CL
Version:
Description:
patches/ Lucid CL CLIM patches
===========================================================================
Package: lang/lisp/gui/clim/impl_dep/mcl/
Name:
Summary: CLIM Implementation-Dependent Code for MCL
Version:
Description:
demo/clim-demo.sit.hqx
Demo version of CLIM 1.0 for Mac Common Lisp 2.0 (MCL)
listener/lisp-listener-hint.text
Hint to augment the Lisp Listener provided in the CLIM demo directory.
patches/
MCL CLIM patches
ps/postscript-file-downloading.sea.hqx
Everything to download a ps file to a LW (via AppleEvents)
settings.cl (was clim-mac-settings.lisp)
CLIM settings customized for MCL.
===========================================================================
Package: lang/lisp/gui/clim/impl_dep/symbolix/
Name:
Summary: CLIM Implementation-Dependent Code for Symbolics Genera
Version:
Description:
patches/ Symbolics CLIM patches
===========================================================================
Package: lang/lisp/gui/clim/mail/
Name:
Summary: Archives of the CLIM mailing list, {\tt clim-request@bbn.com}.
Version:
Description:
Contains archives of the CLIM mailing list from 1990 on.
===========================================================================
Package: lang/lisp/gui/clim/papers/
Name: CLIM Papers and Specifications
Summary: Papers about CLIM and its add-ons.
Version:
Description:
spec0592.tar May 6, 1992 version of the CLIM 2.0 specification
spec1093.tar October 26, 1993 version of the CLIM 2.0 specification
Comments on the CLIM specification should be sent to
CLIM-Spec@Riverside.SCRC.Symbolics.COM. Please include appropriate
page numbers with each comment.
===========================================================================
Package: lang/lisp/gui/clm/
Name: CLM, GINA, and IB
Summary: Common Lisp Motif, Generic INteractive Application, and
Interface Builder
Version: 2.2, 11-NOV-92
Description:
CLM (Common Lisp Motif) runs OSF/Motif widgets in a separate C process,
with minimal work on the Lisp side and communicates between C and Lisp
using TCP sockets. When CLX is loaded before compiling CLM, client
programs can also use the CLX graphics functions to draw into Motif
widgets, especially into widgets of classes XmDrawingArea and
XmDrawnButton.
GINA (Generic INteractive Application) is an application framework
based on Common Lisp and OSF/Motif to simplify the construction of
graphical interactive applications. It is a class library
implemented in CLOS.
IB (Interface Builder) is an interactive tool implemented with GINA
to design Motif windows. It generates Lisp code to be used with GINA.
===========================================================================
Package: lang/lisp/gui/clue/
Name: CLUE and CLIO
Summary: Common Lisp User-Interface Environment and
Common Lisp Interactive Objects
Version: 7-1 (24-JAN-90), 7-20 (31-JUL-90)
Description:
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). Examples include a simple pop-up menu.
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.
PICTURES is an object-oriented graphics package built on CLX, CLUE,
and CLOS. It provides a set of classes for creating, transforming, and
interacting with hierarchical structures of 2D graphical primitives.
===========================================================================
Package: lang/lisp/gui/clx/
Name: CLX
Summary: Common Lisp X binding
Version: R6 (17-APR-94); R5.02 (3-SEP-92)
Description:
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. It does *not* depend on CLOS.
[Note: The R6 version is clearly different from the R5 version, and
it is distributed with X11R6, so we're just going to assume that it
is indeed the R6 version of CLX.]
===========================================================================
Package: lang/lisp/gui/cw/
Name: Common Windows
Summary: Information about Allegro Common Windows
Version:
Description:
Allegro Common Windows provides a front end to CLX. It is *not* free.
Contact info@franz.com for more information.
Intellicorp's KEE4.0 also comes with an implementation of Common Windows.
They've implemented the CW spec to run on Lucid 4.0 on Sparcs, HP300/400s,
HP700/800s, and IBM RS6000s. Contact tait@intellicorp.com for more
information.
===========================================================================
Package: lang/lisp/gui/ew/
Name: EW
Summary: Express Windows
Version: Original (2-APR-90); Goodwill (30-AUG-91)
Description:
EW (Express Windows) is intended to mimic Symbolics' Dynamic Windows user
and programmer interfaces.
Note: EW is no longer under active development.
The original version is in the original/ subdirectory. The Goodwill
version is in the goodwill/ subdirectory. An archive of mail to the
mailing list is kept in the mail/ subdirectory.
===========================================================================
Package: lang/lisp/gui/garnet/
Name: GARNET
Summary: One of the biggest and best GUIs for Lisp.
Version: 2.2 (15-OCT-93)
Description:
Garnet is a large and flexible GUI that includes lots of high-level
features. It does *not* depend on CLOS, but uses its own custom
object system (called KR) instead. 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.
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.
Garnet helps implement highly-interactive, graphical, direct
manipulation programs for X11 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.
===========================================================================
Package: lang/lisp/gui/graphers/
Name: Graphers
Summary: Simple grapher that runs in most of the GUIs
Version: 11-MAR-91
Description:
This directory contains a simple grapher like the one described in
"Lisp Lore" by Bromeley and Lamson. It has versions for most of the
GUI toolkits. Several implementations have a mouse sensitivity
feature and others have implementation-specific features.
===========================================================================
Package: lang/lisp/gui/lispview/
Name: LispView
Summary: A GUI that doesn't use CLX.
Version: 1.1 (8-NOV-91); Fixes 13-JAN-92
Description:
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. LispView includes a general-purpose 2D
grapher library, an interface to Sun's XGL 2.0 3D graphics library,
and a generic scrollable list package.
In addition to the usual X-Windows output functions for windows,
LispView supports a sophisticated input model for handling events.
LispView can also translate an interface developed with the OpenWindows(TM)
Developers' Guide (Devguide) Interface Builder.
The manual is in the doc/ subdirectory in PostScript (ps.tar.gz)
or FrameMaker (frame.tar.gz) formats.
The source code is in source.tar.gz and includes the generic source
interface to the XView(TM) 2.0 libraries. The XView 2.0 libraries
(with a patched libolgx) are in xview-libs.tar.gz. A LispView module
built from the sources can be found in lispview-user.tar.gz. Demos,
translators to/from Devguide, and some test files can be found in
guide-etc.tar.gz. Utilities are in util.tar.gz.
===========================================================================
Package: lang/lisp/gui/lispwork/
Name:
Summary: Information about Lispworks Toolkit
Version:
Description:
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.
(Since this is part of LispWorks, it isn't free. Send mail to the
contact address below for more information.)
===========================================================================
Package: lang/lisp/gui/lsp2wish/
Name: LISP2WISH
Summary: Simple demo of synchronous communication between Lisp
and Tcl/Tk
Version: 6 (13-JUL-94)
Description:
LISP2WISH is a very simple demonstration of how to connect and
communicate SYNCHRONOUSLY between a lisp process and a C process
running a Tcl/Tk executable. The demo uses the vanilla 'wish'
executable that is included with the Tcl/Tk distribution.
Tcl/Tk is a very flexible system for building Graphical User
Interfaces (GUIs), with the look-and-feel of Motif. One writes
scripts in a high-level, C-like language, and an interpreter evaluates
the commands and passes execution either to a built-in function (and
there are many), or to your own C routines. Tcl/Tk is becoming
increasingly popular because of its ease of use, and because it is
freely distributable (even commercially, I believe). For more
information on Tcl/Tk, look on the USENET newsgroup comp.lang.tcl, or
get the distribution from the archive (listed below) or
ftp.cs.berkeley.edu. The Tcl/Tk archive also has many
user-contributed extensions which make Tcl/Tk even more desirable.
Tcl/Tk was originally written by Dr. John Ousterhout, at Berkeley.
LISP2WISH lets you make a window/menu/drawing interface for your lisp
routines, where you can take advantage of all the stuff written for
Tcl/Tk (and build your own!).
===========================================================================
Package: lang/lisp/gui/picasso/
Name: Picasso
Summary: Graphical User Interface Development System
Version: 2.0 (12-MAR-93); 2.1 (sort of 8-JUN-93)
Description:
Picasso is a CLOS based GUI.
Note: Picasso is no longer an actively supported system.
===========================================================================
Package: lang/lisp/gui/winterp/
Name: WINTERP
Summary: Widget INTERPreter
Version: 2.02 (14-JUN-94)
Description:
WINTERP (Widget INTERPreter) is an application development environment
developed at HP. It enables the rapid prototyping of graphical
user-interfaces through direct manipulation of user interface objects
and their attached actions. WINTERP provides an interface to the X11
toolkit (Xt) and the OSF/Motif widget set and a built-in RPC mechanism
for inter-application communication. It includes an object-oriented
2.5D graphics and animation widget based on the Xtango path transition
animation system, the XmGraph graph browser (with graph nodes as
arbitrary WINTERP widgets), and GIF image support. The interpreter is
based on David Betz's XLISP interpreter, which implements a small
subset of Common Lisp and runs on PCs, Decstation 3100s, HP9000s,
Sun3, Sparcs, SGI, and NeXT. XLISP provides a simple Smalltalk-like
object system, with OSF/Motif widgets as real XLISP objects -- they
can be specialized via subclassing, methods added or altered, etc.
WINTERP includes an interface to GNU-Emacs which allows code to be
developed and tested without leaving the editor. WINTERP is a
free-standing Lisp-based tool for setting up window applications.
===========================================================================
Package: lang/lisp/gui/xit/
Name: XIT
Summary: X User Interface Toolkit
Version: 5.9.4 (21-JUL-93)
Description:
XIT (X User Interface Toolkit) is an object-oriented user interface
development environment 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 (druid@informatik.uni-stuttgart.de) as a framework for
Common Lisp/CLOS applications with graphical user interfaces for the X
Window System. XIT contains user interface toolkits, including
general building blocks and mechanisms for building arbitrary user
interface elements and a set of predefined common elements (widgets),
as well as high-level interactive tools for constructing, inspecting,
and modifying user interfaces by means of direct manipulation.
Although the system kernel is quite stable, XIT is still under active
development.
===========================================================================
Package: lang/lisp/gui/xwin/
Name: XWIN
Summary: Simple X windows for text output from LISP
Version: 30-DEC-91
Description:
XWIN is a simple hack for getting X-window text output from a LISP
program. Rather than be tied into a LISP graphics package, it uses a
shellscript to do the windows stuff, and drives the shell script from
Lisp. This makes refresh run quite quickly.
The code is short -- a page or two of Lisp code including comments --
but lets you manage several X windows by name.
On the LISP end the program refers to the X windows by name (a symbol
or other EQ-able object). It would have been even easier to just pass
back the streams and let the program output to them directly, but that
would require that the program pass them around or store them globally
somewhere. It also puts the need to do FORCE-OUTPUTs in the hands of
the main program. So XWIN lets the interface to maintain the list of
streams.
===========================================================================
Package: lang/lisp/gui/yy/
Name: YY
Summary: Network oriented window toolkit for Common Lisp.
Version: 1.3a (19-MAR-91), 1.5a3 (5-NOV-92)
Description:
YY is a network oriented window toolkit for Common Lisp.
YYonX is a port of the YY system to X windows. YYonX supports kanjii.
===========================================================================
Topic: lang/lisp/impl/
Summary: Free/Shareware Common Lisp implementations
Description:
Sources for a large collection of Common Lisp implementations.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Implementations, Programming Languages!Lisp
Contains:
allegro/ Allegro CL: Information about Allegro Common Lisp.
alsp/ Lisp-like data structures for ADA
awk/ AWK Lisp: Lisp implemented in AWK
bbn/ BBN: BBN Butterfly Common Lisp and BBN Butterfly Scheme
clicc/ CLiCC: Common Lisp to C Compiler
clisp/ CLISP: Common Lisp implementation from Germany
cmucl/ CMU CL: CMU Common Lisp
ecolisp/ ECoLisp: Compiles Lisp into C
el_cl/ CL.EL: Common Lisp compatibility package for GNU-Emacs Lisp
elisp/ ELISP: GNU Emacs Lisp manual
gcl/ GCL: GNU Common Lisp
kamin/ Kamin: Tim Budd's C++ Implementation of the Kamin Interpreters
kcl/ KCL: Kyoto Common Lisp
lily/ LILY: C++ Class Library for writing Lisp-style C++ code
mcl/ MCL: Information about Macintosh Common Lisp
pearl/ Pearl: Information about Pearl Lisp
powerlsp/ PowerLisp: Shareware Common Lisp for the Macintosh
reflisp/ RefLisp: Reference-counting Lisp Interpreter
starlisp/ STARSIM: Thinking Machines' *Lisp Simulator
wcl/ WCL: Wade's CL, a shared library implementation of Common Lisp
xlisp/ XLISP: XLISP programming language
xlspstat/ XLISP-Stat: Statistical version of XLISP
See Also: ?
===========================================================================
Package: lang/lisp/impl/allegro/
Name: Allegro CL
Summary: Information about Allegro Common Lisp.
Version: 4.1
Description:
Allegro Common Lisp 4.1 is a high performance commercial Common Lisp
implementation. It includes native CLOS, X-windows support, Unix
interface, incremental compilation, generational garbage collection,
and a foreign function interface. Options include Allegro Composer
(development environment, including debugger, inspector, object
browser, time/space code profiler, and a graphical user interface,
$1,500), Common LISP Interface Manager (CLIM 2.0 is a portable
high-level user interface management system. CLIM 2.0 for Allegro CL
supports both Motif and Openlook, $1,000) and Allegro CLIP (a parallel
version of Lisp for the Sequent).
Franz also markets Allegro CL\PC for Windows 3.1. Allegro CL\PC
provides 32-bit compilation, complete CLOS, an integrated development
environment, interface to the Windows API, DLL support, and free
runtime delivery.
Included in this directory is a copy of the Allegro CL FAQ dated 7/28/93.
===========================================================================
Package: lang/lisp/impl/alsp/
Name:
Summary: Lisp-like data structures for ADA
Version: 1.0 (17-MAR-86)
Description:
ALSP is a package of types, objects, and functions that emulate the
important capabilities of Lisp which are not directly available in
Ada. These capabilities are represented in Ada in a relatively
straightforward manner without changing the Ada language definition.
===========================================================================
Package: lang/lisp/impl/awk/
Name: AWK Lisp
Summary: Lisp implemented in AWK
Version: 23-JUL-90
Description:
A Lisp interpreter implemented in Awk.
It provides intrinsic versions of the basic functions on
s-expressions, and many others written in LISP.
The interpreter has thirteen built-in functions: car, cdr, cons, eq,
atom, set, eval, error, quote, cond, and, or, list. These include the
five elementary functions on s-expressions defined by McCarthy; some
conditional expression operators; an assignment operator, and some
functions to control the evaluation process.
===========================================================================
Package: lang/lisp/impl/bbn/
Name: BBN
Summary: BBN Butterfly Common Lisp and BBN Butterfly Scheme
Version: 2.00 (6-APR-90); 4-FEB-93
Description:
This directory contains the sources and binaries for BBN Butterfly
Common Lisp and BBN Butterfly Scheme. These programs have been
publicly released by BBN for the use of the programming community.
This software is unlikely to run on any machine other than the
butterfly without significant work; but it might make a good starting
point for a free implementation of Common Lisp.
The file "bbn-cl.tv" is a listing of the tar file's contents.
===========================================================================
Package: lang/lisp/impl/clicc/
Name: CLiCC
Summary: Common Lisp to C Compiler
Version: 0.6.4 (23-JUN-94); 0.6.2 (3-JAN-94); 0.6.1 (30-JUL-93)
Description:
CLiCC (Common Lisp to C Compiler) generates C-executables from Common
Lisp application programs. CLiCC is not a Common Lisp system, and
hence does not include any program development or debugging support.
CLiCC is intended to be used as an add-on to existing Common Lisp
systems for generating portable applications. CLiCC (version 0.6.2)
can now compile itself to get a standalone compiler that may be used
without a Lisp system. CLiCC supports CL_0, a subset of Common Lisp +
CLOS, which excludes EVAL and related functions. At present CL_0 is
based on CLtL1, but is headed towards CLtL2 and ANSI-CL. The generated
C code (ANSI-C or K&R-C compatible) may be compiled using a
conventional C compiler on the target machine, and must be linked with
the CLiCC runtime library in order to generate executables. CLiCC
has a foreign function interface.
The generated C code is not readable in the sense of hand written C
code. It results from a direct translation of abstract machine code
to corresponding C constructs.
The file CL0.ps.gz contains the report documenting the CommonLisp0
and CLOS0 language (translated from German to English).
The authors welcome suggestions and improvements and would appreciate
receiving email even if you just used CLiCC successfully.
===========================================================================
Package: lang/lisp/impl/clisp/
Name: CLISP
Summary: Common Lisp implementation from Germany
Version: 1993-11-08
Description:
CLISP is a Common Lisp (CLtL1 + parts of CLtL2) implementation by
Bruno Haible of Karlsruhe University and Michael Stoll of Munich
University, both in Germany. It runs on microcomputers as well as
on Unix workstations and needs only 1.5 MB of RAM.
German and English versions are available, French coming soon. CLISP
includes an interpreter, a compiler, a subset of CLOS and, for some
machines, a screen editor. Packages running in CLISP include PCL and,
on Unix machines, CLX and Garnet.
The structure of the distribution is as follows:
source/ source of CLISP
binaries/ binaries for several platforms
packages/ application packages ported to CLISP:
PCL (another CLOS subset), CLX, Garnet, and Maxima.
mail/ archives of the mailing list
sybase/ the Sybase SQL interface
The Sybase SQL interface for CLIPS is available by anonymous ftp from
wuarchive.wustl.edu:packages/clips2sybase/
For more information on the SQL interface, write to Sherry Steib
.
===========================================================================
Package: lang/lisp/impl/cmucl/
Name: CMU CL
Summary: CMU Common Lisp
Version: 17e (11-MAR-94); 17c (19-SEP-93)
Description:
CMU Common Lisp (CMU CL) is a high quality public domain Lisp system.
It includes an incremental compiler, Hemlock emacs-style editor,
source-code level debugger, code profiler and is mostly X3J13
compatible, including the new loop macro.
The new CMU CL compiler (Python) is more sophisticated than other
Common Lisp compilers. It both produces better code and is easier to
use. Python does many optimizations that are absent or less general in
other Common Lisp compilers, and is particularly good at number
crunching.
See SUPPORT for important information regarding the support status of
CMU CL. (In short, the CMU CL project is no longer funded by Arpa,
so future support will be minimal. They'll fix bugs, especially
those that affect the use of CMU CL as a cross-development vehicle
for their Dylan work, but they won't be adding any major new features.
Continuing the same level of support is not an option without ARPA
or industrial financial support.)
===========================================================================
Package: lang/lisp/impl/ecolisp/
Name: ECoLisp
Summary: Compiles Lisp into C
Version: 0.12 (3-JUL-94); 0.11 (29-JUN-94); 0.10 (22-NOV-93)
Description:
ECoLisp (ECL, Eco Common Lisp) is a Common Lisp implementation which
compiles Lisp functions into C functions that use the C stack and
standard procedure call conventions. This lets Lisp and C code be
easily mixed. It is designed to be used as a C library from any C
application. ECL also includes MTCL, a multithread facility, and CLOS.
This is an alpha release.
The sources are in ecl.tar.gz. The compiler requires that the file
dcl.h be present under /usr/local/include/.
===========================================================================
Package: lang/lisp/impl/el_cl/
Name: CL.EL
Summary: Common Lisp compatibility package for GNU-Emacs Lisp
Version: 3.0 (7-FEB-93)
Description:
A collection of extensions to Emacs Lisp that provide a little
compatibility with Common Lisp.
===========================================================================
Package: lang/lisp/impl/elisp/
Name: ELISP
Summary: GNU Emacs Lisp manual
Version: 6-DEC-93
Description:
Manual for the Emacs-Lisp programming language.
===========================================================================
Package: lang/lisp/impl/gcl/
Name: GCL
Summary: GNU Common Lisp
Version: 1.0 (10-MAY-94)
Description:
GNU Common Lisp (GCL) is a highly portable implementation of
Common Lisp originally based on Austin Kyoto Common Lisp (AKCL), a
Common Lisp (CLtL1) implementation developed at Kyoto University in
Japan and extended by Bill Schelter of UT/Austin. GCL is intended
to eventually support the ANSI Standard for Common Lisp. GCL
generates C code which it compiles with the local optimizing C
compiler (e.g., GCC).
GCL has a source level debugger for interpreted code, profiling
tools based on the C profiling tools, and supports CLX, and PCL.
Versions 1.0 and above of GCL (aka versions 1-625 and above of
AKCL) no longer require the kcl.tar file, and are covered by the
GNU General Public Library License.
Commercial versions of {A}KCL are available from Austin Code Works,
11100 Leafwood Lane, Austin, TX 78750-3409, Tel. 512-258-0785, Fax
512-258-1342, E-mail guthery@acw.com, including a CLOS for AKCL.
Ibuki Common Lisp is a commercialized and improved version of Kyoto
Common Lisp. It runs on over 30 platforms, including Sun3, Sparc, Dec
(Ultrix), Apollo, HP 9000, IBM RS/6000, Silicon Graphics and IBM PCs.
It includes an incremental compiler, interpreter, foreign function
interface. It generates C code from the Lisp and compiles it using the
local C compiler. Image size is about 3mb. Cost is $2800
(workstations), $3500 (servers), $700 (IBM PCs). Supports CLOS and CLX
($200 extra). Source code is available at twice the cost. Ibuki now
also has a product called CONS which compiles Lisp functions into
linkable Unix libraries. Write to: Ibuki Inc., PO Box 1627, Los
Altos, CA 94022, or call 415-961-4996, fax 415-961-8016, or send email
to Richard Weyhrauch, rww@ibuki.com or support@ibuki.com.
The X-Windows interface for AKCL is in the file xakcl-1.tar.gz and
includes the dwindow interface, which is built on top of XAKCL. XAKCL
was written by Hiep Huu Nguyen and dwindow by Gordon Novak
.
===========================================================================
Package: lang/lisp/impl/kamin/
Name: Kamin
Summary: Tim Budd's C++ Implementation of the Kamin Interpreters
Version: 11-SEP-91
Description:
This directory contains Tim Budd's implementation in C++ of the
interpreters discussed in Kamin's book, including Pascal, Lisp, APL,
Scheme, SASL, CLU, Smalltalk and Prolog. The implementations center
around a common core that remains unchanged from language to language.
Tim Budd's implementation represents a complete rewrite,
not a translation of Kamin's Pascal versions.
===========================================================================
Package: lang/lisp/impl/kcl/
Name: KCL
Summary: Kyoto Common Lisp
Version: KCL (10-JUN-87); AKCL 1-615 (28-APR-92)
Description:
Kyoto Common Lisp (KCL) is a highly portable and implementation of
Common Lisp originally developed at Kyoto University in Japan. KCL
conforms to CLtL1. Austin Kyoto Common Lisp (AKCL) is a collection of
ports, bug fixes and improvements to KCL written by Bill Schelter.
{A}KCL generates C code which it compiles with the local C compiler.
It is recommended that you use AKCL and not try to compile KCL, since
KCL is unlikely to work with current operating systems.
Commercial versions of {A}KCL are available from Austin Code Works,
11100 Leafwood Lane, Austin, TX 78750-3409, Tel. 512-258-0785, Fax
512-258-1342, E-mail guthery@acw.com, including a CLOS for AKCL.
Ibuki Common Lisp is a commercialized and improved version of Kyoto
Common Lisp. It runs on over 30 platforms, including Sun3, Sparc, Dec
(Ultrix), Apollo, HP 9000, IBM RS/6000, Silicon Graphics and IBM PCs.
It includes an incremental compiler, interpreter, foreign function
interface. It generates C code from the Lisp and compiles it using the
local C compiler. Image size is about 3mb. Cost is $2800
(workstations), $3500 (servers), $700 (IBM PCs). Supports CLOS and CLX
($200 extra). Source code is available at twice the cost. Ibuki now
also has a product called CONS which compiles Lisp functions into
linkable Unix libraries. Write to: Ibuki Inc., PO Box 1627, Los
Altos, CA 94022, or call 415-961-4996, fax 415-961-8016, or send email
to Richard Weyhrauch, rww@ibuki.com or support@ibuki.com.
The X-Windows interface for AKCL is in the file xakcl-1.tar.gz and
includes the dwindow interface, which is built on top of XAKCL. XAKCL
was written by Hiep Huu Nguyen and dwindow by Gordon Novak
.
The directory structure is as follows:
kcl/ KCL release, including the license.txt file and the KCL Report
akcl/ The AKCL release, including the dos beta version,
the NeXT version, PCL, CLX, and XAKCL
kcl.faq The KCL Frequently Asked Questions file.
mail/ Archives of the KCL mailing list.
===========================================================================
Package: lang/lisp/impl/lily/
Name: LILY
Summary: C++ Class Library for writing Lisp-style C++ code
Version: 0.1 (November 1993)
Description:
Lily (LIsp LibrarY) is a C++ class library that lets C++ programmers
write LISP-style code. Includes some example programs from Winston's
Lisp book recoded in Lily. Most or all of chapters 17 (Symbolic
Pattern Matching), 18 (Expert Problem Solving), and 23 (Lisp in Lisp)
are implemented in the examples.
This package is mainly useful in academia for instructors who wish
to teach AI techniques in C++. The garbage collection mechanism is
rather slow, making it unattractive for industrial use.
===========================================================================
Package: lang/lisp/impl/mcl/
Name: MCL
Summary: Information about Macintosh Common Lisp
Version: 2.0
Description:
Macintosh Common Lisp is a commercial Common Lisp implementation for
the Apple Macintosh. It includes a native CLOS, Macintosh
Toolbox/interface toolkit, ephemeral garbage collection, incremental
compiler, window-based debugger, source-code stepper, object
inspector, emacs-style editor, and a foreign function interface.
With MCL version 2.0, Apple has started distributing a CD-ROM which
contains, among other things, a large collection of Lisp code,
complete MCL manuals in an online-browser format, the CLIM 1.0 manual
in TeX and postscript, and copies of Gambit 1.8 Scheme, SIOD 2.8
Scheme, Pixie Scheme, and a demo version of MacScheme.
MCL is available from APDA for $495. For more information, contact
APDA
Apple Computer Inc.
20525 Mariani Avenue, MS 33-G
Cupertino, CA 95014-6299
Tel: 1-800-282-2732 (US), 1-800-637-0029 (Canada), 1-408-562-3910
Fax: 1-408-562-3971
Telex:171-576
E-mail:APDA@applelink.apple.com or 76666.2405@compuserve.com.
CLIM for MCL is available for $495 as a separate product from
Lucid, Inc.
707 Laurel Street
Menlo Park, CA 94025
Tel: 415-329-8400
Fax: 415-329-8480
E-mail: sales@lucid.com
Included in this directory is a copy of the MCL FAQ posting from 22-SEP-93.
===========================================================================
Package: lang/lisp/impl/pearl/
Name: Pearl
Summary: Information about Pearl Lisp
Version:
Description:
When Apple Computer acquired Coral Software in January 1989, they
re-released Coral's Allegro Common Lisp and its optional modules as
Macintosh Allegro Common Lisp (now just Macintosh Common Lisp).
Coral's other product, Pearl Lisp, was discontinued at that time.
Pearl Lisp provides a subset of the functionality of MACL 1.3 and is
not even fully CLtL1-compatible (e.g., the implementation of defstruct is
different).
Despite rumors to the contrary, Pearl Lisp is not and never was public
domain. Nevertheless, Pearl Lisp and its documentation were placed in
the "Moof:Goodies:Pearl Lisp" folder on the first pressing of "Phil
and Dave's Excellent CD", the precursor to the current Apple
Developer's CD-ROM series. Apple removed Pearl from later versions of
the developer CD-ROM distribution because of complaints from other
Lisp vendors. If you own a copy of Pearl Lisp or a copy of this
CD-ROM, you can make it runnable under System 7 with some slight
modifications using ResEdit. To repeat, Pearl Lisp is NOT public
domain, so you must own a copy to use it.
To make it runnable, one needs to use ResEdit to make changes to the
BNDL and FREF resources so that it will connect to its icons properly.
This will make it respond to double-clicks in the normal manner and
make it be properly linked to its files.
Detailed instructions for modifying Pearl Lisp using ResEdit
are included in this directory.
After you've made the changes, it will run under System 7 on 68000s
and 68030s if you turn off 32-bit addressing. It seems to bomb on a
Quadra.
If you need a more powerful Lisp or one that is compatible with the
standard for Common Lisp, consider purchasing Macintosh Common Lisp.
===========================================================================
Package: lang/lisp/impl/powerlsp/
Name: PowerLisp
Summary: Shareware Common Lisp for the Macintosh
Version: 1.10 () ; 1.01 (6-SEP-93)
Description:
PowerLisp is a Common Lisp development environment for the Macintosh.
It consists of a Common Lisp interpreter, native-code 680x0 compiler,
680x0 macro assembler, disassembler, incremental linker and
multi-window text editor.
PowerLisp has the ability to run in the background. While executing a
Common Lisp program, the user may switch to another application as it
continues to run. You can also edit programs while a Common Lisp
program is running.
PowerLisp is targeted to be compatible with CTLTL2 without CLOS
(for now) but some Common Lisp functions are not yet implemented.
Upcoming versions should include the remaining language features.
Documentation in Word and MacWrite format and sample programs/source
included.
The file is encoded with BinHex4.0 and StuffIt 3.07.
===========================================================================
Package: lang/lisp/impl/reflisp/
Name: RefLisp
Summary: Reference-counting Lisp Interpreter
Version: 2.67 (27-FEB-93)
Description:
RefLisp is a small Lisp interpreter. Versions exist for MS-DOS and
UNIX (AIX). The MS-DOS version supports CGA/EGA/VGA graphics and the
Microsoft Mouse. The interpreter is a shallow-binding (i.e.,
everything has dynamic scope), reference counting design making it
suitable for experimenting with real-time and graphic user interface
programming. Common Lisp compatibility macros are provided, and most
of the examples in "Lisp" by Winston & Horn have been run on RefLisp.
RefLisp makes no distinction between symbol-values and
function-values, so a symbol can be either but not both. RefLisp
comes with an ASCII manual and many demonstration programs, including
an analogue clock which never stops for garbage collection. There is
also a program profiler.
===========================================================================
Package: lang/lisp/impl/starlisp/
Name: STARSIM
Summary: Thinking Machines' *Lisp Simulator
Version: F19.0
Description:
STARSIM simulates *Lisp (StarLisp), a parallel implementation of
Lisp for the Connection Machine.
===========================================================================
Package: lang/lisp/impl/starlisp/tutorial/
Name: StarLisp Tutorial
Summary: Tutorial for CM5 *Lisp
Version: 23-JAN-94
Description:
The "CM5 *Lisp tutorial" in Andrew "ez" and PostScript formats.
It is aimed at students who don't have an earlier exposure to Lisp.
*Lisp examples used in the tutorial are a simple Laplace solver combined
with *Graphics, and a somewhat more complicated Particle in Cell code.
The latter is based on using segmented scans and the router rather than
on NEWS operations.
===========================================================================
Package: lang/lisp/impl/wcl/
Name: WCL
Summary: Wade's CL, a shared library implementation of Common Lisp
Version: 2.14
Description:
WCL is an implementation of Common Lisp for Sparc based workstations. WCL
provides a large subset of Common Lisp as a Unix shared library that
can be linked with Lisp and C code to produce efficient and small
applications. For example, the executable for a Lisp version of the
canonical ``Hello World!'' program requires only 40k bytes under
SunOS 4.1 for SPARC. WCL provides CLX R5 as a shared library, and
comes with PCL and a few other utilities.
===========================================================================
Package: lang/lisp/impl/xlisp/
Name: XLISP
Summary: XLISP programming language
Version: 2.1e3; 2.1g bc (bytecode version)
Description:
XLISP 2.0 is an experimental programming language written by David Betz
combining some of the features of LISP with an object-oriented
extension capability. Tom Almy extended XLISP to bring it into closer
conformance with Common Lisp (version 2.1e).
Files include:
ufg.arc Universal game playing functions for XLISP
xlispdoc.arc XLISP v2.0 docs & note on XLISP-PC extensions
xmath.arc X-Lisp math functions to accompany X-Lisp
===========================================================================
Package: lang/lisp/impl/xlspstat/
Name: XLISP-Stat
Summary: Statistical version of XLISP
Version: 2.1 R2
Description:
XLISP-STAT is an extensible statistics package which runs in XLISP.
It has recently been ported to Common Lisp. The CL port does not yet
include the lisp-stat dynamic graphics package, only the numerics.
===========================================================================
Package: lang/lisp/mail/
Name:
Summary: Mail archives for the {\tt lisp-utilities@cs.cmu.edu} list.
Version:
Description:
The lisp-utilities@cs.cmu.edu mailing list is a low-volume mailing
list for notification of updates to the CMU Lisp Repository. To be
added to the mailing list, send mail to
lisp-utilities-request@cs.cmu.edu
with your name, email address, and company or other affiliation.
This directory contains the following files:
INTRO the standard mail message sent to new members of the list
archive.txt archive of messages to the mailing list
===========================================================================
Topic: lang/lisp/oop/
Name: OOP
Summary: Code related to object-oriented programming.
Description:
Contains code and other materials related to object-oriented
programming in Common Lisp.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Code, OOP!Lisp
Contains:
clos/ CLOS: Code related to the Common Lisp Object System
non_clos/ Object-oriented programming systems not related to CLOS.
See Also: ?
===========================================================================
Topic: lang/lisp/oop/clos/
Name: CLOS
Summary: Code related to the Common Lisp Object System
Description:
Contains code and other materials related to the Common Lisp Object System.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
CLOS, Lisp!Code, OOP!Lisp
Contains:
closette/ CLOSETTE: Implements subset of CLOS with a metaobject protocol.
code/ CLOS Code Library: User contributed CLOS code.
kee/ KEE CLOS: Subset of CLOS implemented in IntelliCorp's KEE
system.
pcl/ PCL: Portable implementation of CLOS.
See Also: ?
===========================================================================
Package: lang/lisp/oop/clos/closette/
Name: CLOSETTE
Summary: Implements subset of CLOS with a metaobject protocol.
Version: 1.0 (10-FEB-91)
Description:
Closette is an implementation of a subset of CLOS with a metaobject
protocol as described in the book
Gregor Kiczales, Jim des Rivieres, and Daniel G. Bobrow, "The
Art of the Metaobject Protocol", MIT Press, 1991. 335 pages.
ISBN 0-262-61074-4
We recommend buying a copy of the book, which contains a lot of
additional useful explanatory material.
===========================================================================
Package: lang/lisp/oop/clos/code/
Name: CLOS Code Library
Summary: User contributed CLOS code.
Version:
Description:
Contains user-contributed CLOS code, including:
3d_geom.tar
3D Geometry classes, Version 0.5.
Defines classes and methods for Line, Plane, Implicit-Plane,
Explicit-Plane, and Sphere. Also defines functions for common
vector operations. Written by Daniel LaLiberte
CORBA
Information about the Common Object Request Broker
Architecture Specification (CORBA).
dag.cl
Classes for directed acyclic graph structures. Version 1.0, Oct 1992.
Written by Daniel LaLiberte .
flavors.tar (artificial-flavors.lisp)
A straightforward partial implementation of Symbolics New
Flavors in PCL. Updated for "5/22/89 Victoria PCL", 13 September 89,
CLOS version 24 Aug 90. Written by Michael Travers 8 Dec 88.
util.tar
A set of CLOS utilities, including a CLOS class-defining macro
and utilities to keep track of instances based on names.
Written by Marty Hall or
410-792-6000 x3440.
ftp.cs.umbc.edu:/pub/Memoization/CLOS-Utilities.lisp [130.85.100.53]
===========================================================================
Package: lang/lisp/oop/clos/kee/
Name: KEE CLOS
Summary: Subset of CLOS implemented in IntelliCorp's KEE system.
Version: October 11, 1990
Description:
This directory contains KEE CLOS, an implementation of a subset of the
Common Lisp Object System using the object system features of the KEE
system from IntelliCorp. KEE (IntelliCorp's Knowledge Engineering
Environment) is a popular AI shell that uses a message-passing style
of object-oriented program. KEE CLOS uses the CLOS style of
programming to construct and manipulate KEE objects.
Documentation is included.
===========================================================================
Package: lang/lisp/oop/clos/pcl/
Name: PCL
Summary: Portable implementation of CLOS.
Version: JUL-92-1d, 16-SEP-92-f
Description:
CLOS (Common Lisp Object System) is the object-oriented programming
standard for Common Lisp. It is the successor to Symbolics FLAVORS and
Xerox LOOPS (Lisp Object Oriented Programming System). The acronym
CLOS is pronouned either as "See-Loss" or "Closs", depending on taste.
PCL (Portable Common Loops) is a portable CLOS implementation. It
is not complete, but the differences won't affect most users. A key
difference is PCL doesn't support the :METHOD option to DEFGENERIC.
We've included a file called pclfixes.cl (originally
ags/prog/pcl-fixes.lisp) from the KEIM theorem prover that adds
this capability.
Most Common Lisp implementations now include their own CLOS
implementations. Common Lisp implementations with native CLOS include:
MCL, {A}KCL, Allegro CL (including Allegro CL\PC), Ibuki, Lucid,
Medley, Symbolics Genera, CLOE, Harlequin Lispworks, and CLISP (SEP-93
or newer). CMU CL uses a customized version of PCL as their CLOS.
However, not all native CLOS implementations have as detailed a
meta-object protocol as PCL. For example, MCL 2.0 users sometimes use
the july-1d version of PCL instead of the native CLOS for precisely
this reason.
===========================================================================
Topic: lang/lisp/oop/non_clos/
Summary: Object-oriented programming systems not related to CLOS.
Description:
Contains code and other materials related to object-oriented
programming in Common Lisp other than CLOS.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Code, OOP!Lisp
Contains:
cool/ COOL: Implementation of HP's CommonObjects on top of the PCL
metaclass kernel.
corbit/ CORBIT and BOOPS: Object-oriented extension of Common Lisp
based on a prototype (classless) model of OOP.
mcs/ MCS: Meta Class System, a portable object-oriented extension to
Common Lisp.
See Also:
areas/kr/
===========================================================================
Package: lang/lisp/oop/non_clos/cool/
Name: COOL
Summary: Implementation of HP's CommonObjects on top of the PCL
metaclass kernel.
Version: 10-MAY-87
Description:
COOL is an implementation of HP's CommonObjects on the Portable
CommonLoops (PCL) metaclass kernel. As such, it provides a portable
implementation of CommonObjects. It should be of particular interest
to people who want to program in the mixin style supported by PCL but
are also interested in trying the encapsulation style of Smalltalk,
which CommonObjects supports.
This version of COOL is guaranteed to work with Portable CommonLoops
system date 2-24-87. A copy of this version of Portable CommonLoops is
distributed along with COOL.
===========================================================================
Package: lang/lisp/oop/non_clos/corbit/
Name: CORBIT and BOOPS
Summary: Object-oriented extension of Common Lisp based on a
prototype (classless) model of OOP.
Version: 21-JAN-93
Description:
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.
BOOPS (Beginner's Object-Oriented Programming System) is a
stripped-down version of CORBIT. It is very small,
efficient and simple and intended for classroom use.
Documentation (postscript, MSWord, Ascii) is included.
===========================================================================
Package: lang/lisp/oop/non_clos/mcs/
Name: MCS
Summary: Meta Class System, a portable object-oriented extension
to Common Lisp.
Version: 1.3.1 (13-MAY-91); 1.4.1 (16-NOV-92)
Description:
MCS (Meta Class System) is a portable object-oriented extension to
Common Lisp. It 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.
MCS has been used successfully for the development of the commercial
software product Babylon, an expert system development workbench that
includes a hybrid knowledge representation language and many tools
like editors and browsers.
If you use MCS, send Juergen a short email message, so that you
will be notified when updates are available.
===========================================================================
Topic: lang/lisp/txt/
Summary: Online Lisp-related tech reports and papers.
Description:
This directory contains machine readable forms of various
lisp-related texh reports, conference papers, etc.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Papers, Lisp!Tech Reports
Contains:
gabriel/ Article by Richard P. Gabriel on Lisp.
garbage/ Papers about garbage collection, persistence, and memory
hierarchy implementation.
style/ Lisp Style Guides
See Also: ?
===========================================================================
Package: lang/lisp/txt/gabriel/
Name:
Summary: Article by Richard P. Gabriel on Lisp.
Version:
Description:
gabriel.tar.gz
"Lisp: Good News, Bad News, How to Win Big", by Richard P.
Gabriel of Lucid, Inc.
===========================================================================
Package: lang/lisp/txt/garbage/
Name:
Summary: Papers about garbage collection, persistence, and
memory hierarchy implementation.
Version:
Description:
surveys.tar.gz
gcsurvey.ps
Wilson, Paul R., "Uniprocessor Garbage Collection Techniques"
Proceedings of the 1992 International Workshop on Memory Management,
St. Malo, France, September 1992, Springer Lecture Notes in
Computer Science #637. [Surveys garbage collection techniques.
Includes an excellent bibliography.]
heaps.bib
BibTeX bibliography of garbage collection and (to lesser degrees)
memory hierarchies and other aspects of heap management (like
persistence).
dgcsurvey.ps
"Collection Schemes for Distributed Garbage" by Abdullahi,
Miranda, and Ringwood. Also appears in the 1992 IWMM proceedings.
papers.tar.gz
cache.ps
"Caching Considerations for Generational Garbage Collection",
by Wilson, Lam, and Moher, 1992 ACM Symposium on Lisp and
Functional Programming, San Francisco, California, June 1992.
rtgcdraf.ps
Old draft of a paper about Wilson's non-copying hard
real-time incremental garbage collection. (A shorter and
more up-to-date paper about the same system is in GC93/wilson.ps.)
GC90.tar.gz
Papers from the first (1990) OOPSLA GC workshop, organized
by Eric Jul and Niels-Christian Juul.
GC91.tar.gz
Most of the papers from the 1991 OOPSLA Workshop on Garbage
Collection in Object-Oriented Systems, organized by Wilson and Hayes.
Henry Baker's Treadmill paper is not included; an improved
version was published in SIGPLAN Notices a few months after the
workshop.
GC93.tar.gz
Papers from the 1993 OOPSLA workshop on Memory Management and
Garbage Collection, organized by Eliot Moss, Paul Wilson, and Ben Zorn.
===========================================================================
Package: lang/lisp/txt/style/
Name:
Summary: Lisp Style Guides
Version:
Description:
ht_guide.txt
A Lisp style guide written by Hallvard Traetteberg .
mkant.tar
A Lisp style guide written by Mark Kantrowitz for
CMU Course 15-381.
===========================================================================
Topic: lang/lisp/util/
Summary: Utilities for programming in Lisp.
Description:
Contains a variety of utilities for programming in Lisp, such as
Emacs-Lisp interfaces and TeX macros for including Lisp code in documents.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lisp!Utilities
Contains:
emacs/ Emacs-related utilities for programming in Lisp.
sgml/ SGML2Lisp: SGML output formatting tool
tags/ Lisp TAGS: Creates a tagfile from Lisp source for use with {\tt
vi}
tex/ CLtL2-TeX: TeX style macros for formatting Lisp code.
vgrind/ VGRIND: VGrind/TGrind entries for Common Lisp.
See Also: ?
===========================================================================
Topic: lang/lisp/util/emacs/
Summary: Emacs-related utilities for programming in Lisp.
Description:
Contains a variety of utilities for programming in Lisp, such as
Emacs-Lisp interfaces.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Emacs-Lisp Interfaces, Lisp!Utilities
Contains:
cl_shell/ CL Shell: Running Common Lisp as an Emacs subprocess.
edebug/ Edebug: Source level debugger for Emacs Lisp.
franz/ ELI: Franz's Emacs-Lisp interface
ilisp/ ILISP: Powerful dialect independent GNU-Emacs/Lisp interface.
refcard/ Reference card for Allegro CL and Franz's Emacs interface.
See Also: ?
===========================================================================
Package: lang/lisp/util/emacs/cl_shell/
Name: CL Shell
Summary: Running Common Lisp as an Emacs subprocess.
Version: 18-OCT-93
Description:
The cl-shell package provides a major mode (cl-shell-mode) for running
Common Lisp (CL) as an Emacs subprocess. It provides a general
mechanism for communication between CL and Emacs which does not rely
on extra processes, and should therefore be easily portable to any
version of CL. Features include direct (i.e., not through a temp file)
evaluation and in-package compilation of forms from lisp-mode buffers,
type-ahead and a history mechanism for the cl-shell buffer, and pop-up
help facilities for the CL functions documentation, macroexpand and
describe. Extensions for Lucid Common Lisp provide pop-up arglists
and source file editing. Other extensions are provided to allow
editing source files of CLOS or Flavors methods.
===========================================================================
Package: lang/lisp/util/emacs/edebug/
Name: Edebug
Summary: Source level debugger for Emacs Lisp.
Version: 3.4 (23-MAR-94)
Description:
This directory contains Edebug, a debugger for Emacs Lisp, and some
utilities for Common Lisp debugging (Dave Gillespie's version of cl.el).
Also includes cl-read.el, a CL readmacro package for Emacs Lisp.
===========================================================================
Package: lang/lisp/util/emacs/franz/
Name: ELI
Summary: Franz's Emacs-Lisp interface
Version: 2.0.11
Description:
This directory contains ELI, Franz Inc.'s GNU-Emacs/Lisp interface.
The interface consists of the following files:
eli_2011.tar.gz (was eli-2.0.11.tar.gz)
The source code to the interface.
An online Common Lisp reference manual is available by license from
Franz Inc. Contact info@franz.com for more information.
===========================================================================
Package: lang/lisp/util/emacs/ilisp/
Name: ILISP
Summary: Powerful dialect independent GNU-Emacs/Lisp interface.
Version: 5.5 (2-SEP-93)
Description:
ILISP is a powerful GNU-Emacs interface to many dialects of Lisp.
===========================================================================
Package: lang/lisp/util/emacs/refcard/
Name:
Summary: Reference card for Allegro CL and Franz's Emacs interface.
Version: 1.0 (9-APR-92)
Description:
This directory contains TeX source for a quick and dirty Franz+Emacs
reference card, closely modeled on the GNU Emacs reference card.
It summarizes function and variable names in Franz Allegro 4.1, and
key bindings for the emacs interface.
===========================================================================
Package: lang/lisp/util/sgml/
Name: SGML2Lisp
Summary: SGML output formatting tool
Version:
Description:
Generates a lisp program that acts as a filter in converting SGML text
to any user-specified format. The generated converter operates on the
output of the SGML parser SGMLS (copyleft by J. Clarke) and performs
the same task as SGMLSASP.
===========================================================================
Package: lang/lisp/util/tags/
Name: Lisp TAGS
Summary: Creates a tagfile from Lisp source for use with {\tt vi}
Version: 1.5, 22-APR-93
Description:
This program generates a tagfile from Lisp source files suitable
for use with vi. This is the equivalent of ctags for Lisp.
===========================================================================
Package: lang/lisp/util/tex/
Name: CLtL2-TeX
Summary: TeX style macros for formatting Lisp code.
Version: 20-May-93
Description:
TeX macros used for formatting Guy Steele's "Common Lisp the
Language" first and second editions. Useful for formatting Lisp code.
Also included in the distribution is a simple shell script by
Nicolas Rouquette that is useful for including Lisp code in TeX files.
===========================================================================
Package: lang/lisp/util/vgrind/
Name: VGRIND
Summary: VGrind/TGrind entries for Common Lisp.
Version: 16-DEC-93
Description:
VGrind and TGrind are programs for formatting code for many programming
languages. This file contains a [vt]grind entry for Common Lisp
It has some bugs; improvements are welcome.
===========================================================================
Topic: lang/others/
Summary: Other programming languages of interest to AI folks, including
Standard ML, Dylan, and Lisp dialects besides Scheme and Common
Lisp.
Description:
This directory contains implementations, code and other materials
related to various programming languages of interest to AI
researchers, students, and practitioners.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Programming Languages!Others
Contains:
dylan/ Dylan: Apple's new Object-Oriented Dynamic Language.
eulisp/ EuLisp: EuLisp language implementations.
franzlsp/ Free implementations of Franz Lisp.
kalypso/ Kalypso: A portable Unix Lisp interpreter.
ml/ Free implementations of the Standard ML language
See Also: ?
===========================================================================
Topic: lang/others/dylan/
Name: Dylan
Summary: Apple's new Object-Oriented Dynamic Language.
Description:
Dylan is a new Object-Oriented Dynamic Language (OODL), based on
Scheme, CLOS, and Smalltalk. The purpose of the language is to retain
the benefits of OODLs and also allow efficient application delivery.
The design stressed keeping Dylan small and consistent, while
allowing a high degree of expressiveness. Dylan is consistently
object-oriented; it is not a procedural language with an
object-oriented extension.
A manual/specification for the language is available from Apple
Computer. Send email to dylan-manual-request@cambridge.apple.com or
write to Apple Computer, 1 Main Street, Cambridge, MA 02142. Include
your complete address and also a phone number (the phone number is
especially important for anyone outside the US).
Apple hasn't announced plans to release Dylan as a product.
Origin: cambridge.apple.com:pub/dylan
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: info-dylan@cambridge.apple.com (gatewayed to comp.lang.dylan)
announce-dylan@cambridge.apple.com
The INFO-DYLAN mailing list is for any and all discussions
of Dylan, including language design issues, implementation
issues, marketing issues, syntax issues, etc.
The ANNOUNCE-DYLAN mailing list is for major announcements
about Dylan, such as the availability of new
implementations, new versions of the manual, etc. This
mailing list should be *MUCH* lower volume than INFO-DYLAN.
Everything sent to this list is also sent to INFO-DYLAN.
TO SUBSCRIBE: Send mail to the -request version of the list
to be added to it. You can also send an email message to
majordomo@cambridge.apple.com with "subscribe info-dylan" or
"unsubscribe info-dylan" in the body, and likewise for the
other lists, mutatis mutandis.
Contact: Apple Computer
1 Main Street
Cambridge, MA 02142
Keywords:
Apple Computer, Dylan, OODL, OOP!Dylan, Programming Languages!Dylan
Contains:
code/ Library of Dylan code.
doc/ Documentation and papers about Dylan
faq/ Dylan FAQ: Frequently Asked Questions (FAQ) about Dylan
impl/ Free implementations of Dylan
mail/ Dylan Mail: Mail archives for the INFO-DYLAN mailing list.
See Also: ?
===========================================================================
Topic: lang/others/dylan/code/
Summary: Library of Dylan code.
Description:
This directory contains a library of Dylan code contributed by
Dylan users and examples of Dylan code from the manual.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Dylan, Dylan!Code, OODL, OOP!Dylan, Programming Languages!Dylan
Contains:
bnf/ YACC version of the BNF grammar for Dylan from Design Note 22.
manual/ Code from the Dylan Manual
See Also: ?
===========================================================================
Package: lang/others/dylan/code/bnf/
Name:
Summary: YACC version of the BNF grammar for Dylan from Design
Note 22.
Version: 7-FEB-94
Description:
An untested YACC parser for the infix Dylan phrase grammar from Apple's
Design Note #22.
===========================================================================
Topic: lang/others/dylan/doc/
Summary: Documentation and papers about Dylan
Description:
This directory contains the Dylan Design Notes and some papers
about Dylan.
Origin: cambridge.apple.com:pub/dylan/design-notes/
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Dylan, Dylan!Documents, OODL, OOP!Dylan, Programming Languages!Dylan
Contains:
design/ Design Notes for Dylan
manual/ DIRM: Dyland Interim Reference Manual
poetry/ Dylan Thomas's poem
semantic/ Dylan's Semantics: Incomplete denotational semantics of Dylan
See Also: ?
===========================================================================
Package: lang/others/dylan/doc/design/
Name:
Summary: Design Notes for Dylan
Version:
Description:
This directory contains text and postscript versions of the Dylan
Design Notes.
===========================================================================
Package: lang/others/dylan/doc/manual/
Name: DIRM
Summary: Dyland Interim Reference Manual
Version:
Description:
This directory contains the interim Dylan reference manual, which
combines the original Dylan book, the previously published design
notes, and some additional previously unpublished design decisions as
of May 1994.
===========================================================================
Package: lang/others/dylan/doc/poetry/
Name:
Summary: Dylan Thomas's poem
Version:
Description:
This directory contains Dylan Thomas's poem, "Do Not Go Gentle Into
That Good Night", 1952.
===========================================================================
Package: lang/others/dylan/doc/semantic/
Name: Dylan's Semantics
Summary: Incomplete denotational semantics of Dylan
Version: 12-MAY-93
Description:
This directory contains
Tamme D. Bowen and Kelly M. Hall, "Towards a Better Understanding
of Dylan", Laboratory for Applied Logic, University of Idaho
in DVI and PostScript formats.
===========================================================================
Package: lang/others/dylan/faq/
Name: Dylan FAQ
Summary: Frequently Asked Questions (FAQ) about Dylan
Version:
Description:
A compendium of answers to frequently asked questions about Dylan.
===========================================================================
Topic: lang/others/dylan/impl/
Summary: Free implementations of Dylan
Description:
This directory contains sources for various implementations of Dylan.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Dylan, OODL, OOP!Dylan, Programming Languages!Dylan
Contains:
gwydion/ Gwydion: Information about the CMU Gwydion compiler
marlais/ Marlais: Interpreter for a Dylan-like language.
mindy/ Mindy: Mindy Is Not Dylan Yet
thomas/ Thomas: Compiler for a Dylan-like language.
See Also: ?
===========================================================================
Package: lang/others/dylan/impl/gwydion/
Name: Gwydion
Summary: Information about the CMU Gwydion compiler
Version:
Description:
This directory contains a description of the Gwydion Project at
Carnegie Mellon University. This project is developing an innovative
new software development environment based on the Dylan language (and,
in the process, will make available a very high-quality implementation
of Dylan). This project includes many of the same people responsible
for CMU Common Lisp.
In Welsh mythology, Gwydion is the uncle of Dylan and nephew of Math.
===========================================================================
Package: lang/others/dylan/impl/marlais/
Name: Marlais
Summary: Interpreter for a Dylan-like language.
Version: 0.4 (13-JUL-94)
Description:
Marlais is a simple interpreter for a language strongly resembling
Dylan. It is not intended as a final release, but rather
to fill a perceived void where Dylan implementations are concerned.
This is a "hackers release" and is intended as a vehicle for
education, experimentation and also to encourage people to port it to
different architectures, add features, and fix bugs. Marlais is alpha
software and should not be used by people desiring reliability!!!
===========================================================================
Package: lang/others/dylan/impl/mindy/
Name: Mindy
Summary: Mindy Is Not Dylan Yet
Version: 1.0 (30-JUN-94)
Description:
Mindy (Mindy Is Not Dylan Yet) is a Dylan-like language. Mindy is
incomplete, in that it does not implement everything in the Dylan
Interim Reference Manual (DIRM) and the DIRM itself is yet
incomplete. But Mindy does implement most of what the authors feel
Dylan will be.
Mindy was developed by the Gwydion Project at Carnegie Mellon
University for internal use as a development tool while work on the
"real" high-performance Dylan implementation progresses. Mindy has
been made available as a courtesy to people who want to learn about Dylan.
However, the amount of effort that will be put into maintaining Mindy
is strictly limited, since Mindy isn't intended to be an industrial
strength implementation.
===========================================================================
Package: lang/others/dylan/impl/thomas/
Name: Thomas
Summary: Compiler for a Dylan-like language.
Version: 1.1 (25-SEP-92)
Description:
Thomas is a compiler for a language that is compatible with the
language described in the book "Dylan(TM) an object-oriented dynamic
language" by Apple Computer Eastern Research and Technology, April
1992. Thomas was written at Digital Equipment Corporation's Cambridge
Research Laboratory. Thomas is NOT Dylan(TM) and was built with no
direct input, aid, assistance or discussion with Apple.
The Thomas system is written in Scheme and generates IEEE
compatible Scheme code.
DEC CRL's goals in building Thomas were to learn about Dylan by
building an implementation, and to build a system they could use to
write small Dylan programs. As such, Thomas has no optimizations of
any kind and does not perform well.
===========================================================================
Package: lang/others/dylan/impl/thomas/mac/
Name:
Summary: Thomas on top of MacGambit 2.0
Version: 1.1 (25-SEP-92)
Description:
MacGambit is the Mac implementation of the Gambit Scheme
interpreter and compiler, written by Marc Feeley. This directory
contains a version of Gambit customized as a Thomas interpreter.
===========================================================================
Package: lang/others/dylan/impl/thomas/sparc/
Name:
Summary: Sparc patches for Thomas.
Version: 21-JAN-93
Description:
This directory contains patches for Thomas to run under SunOS 4.1.2.
It's basically the MCC02 patches from gatekeeper.dec.com applied to
the scc-files that thomas uses plus some small manual changes.
===========================================================================
Package: lang/others/dylan/mail/
Name: Dylan Mail
Summary: Mail archives for the INFO-DYLAN mailing list.
Version:
Description:
This directory contains the archives of the INFO-DYLAN mailing list.
===========================================================================
Topic: lang/others/eulisp/
Name: EuLisp
Summary: EuLisp language implementations.
Description:
This directory contains implementations of EuLisp. EuLisp is an
Scheme-like language with a tightly integrated object system substrate.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
EuLisp, Programming Languages!EuLisp
Contains:
eu2c/ Apply/Eu2C: EuLisp->C compiler
feel/ FEEL: Initial implementation of the EuLisp language.
See Also: ?
===========================================================================
Package: lang/others/eulisp/eu2c/
Name: Apply/Eu2C
Summary: EuLisp->C compiler
Version: 94-02 (9-FEB-94)
Description:
Apply/Eu2C is an EuLisp->C compiler available from ISST. Eu2C runs on
top of Franz Allegro CL 4.1 and compiles EuLisp-Modules into C source
code which then must be compiled by an ANSI C-compiler (currently only
GCC is supported). The Eu2C implementation provides EuLisp 0.99
level-0, with the exception of concurrency. Future versions of Eu2C
will include a C interface and straight module compilation.
The development of Apply/Eu2C was supported by the German Federal
Ministry for Research and Technology (BMFT) within the joint project
APPLY. The partners of this project are the Christian Albrechts
University Kiel, the Fraunhofer Institute for Software Engineering and
Systems Engineering (ISST), the German National Research Center for
Computer Science(GMD), and VW-Gedas.
The main goal of APPLY project is to develop a Lisp system which
consistently supports the efficient execution of applications and
simplifies their integration into current software environments.
Towards that end, ISST is investigating strategies for the compilation
of EuLisp-Modules into efficient stand-alone C-Programs. The Eu2C
compiler is the first step along this path.
===========================================================================
Package: lang/others/eulisp/feel/
Name: FEEL
Summary: Initial implementation of the EuLisp language.
Version: Feel 0.90 (23-NOV-93); Defn 0.99 (31-JUL-93);
Comp 0.89 (31-JUL-93)
Description:
Feel (Free and Eventually Eulisp) is an initial implementation of the
EuLisp language from the University of Bath, UK. EuLisp is sort of
like an extended Scheme. It includes an integrated object system, a
module system, and support for parallelism. Feel is partly a C-based
interpreter and partly a bytecode interpreter/compiler. An
out-of-core compiler system is also available. The distribution
includes an interface to the PVM library, support for TCP/IP sockets,
and libraries for futures, Linda, and CSP.
This directory contains the EuLisp language definition, the Feel
implementation, and implementations of the EuLisp object system
in Common Lisp (Telos) and Scheme (Telosis).
===========================================================================
Package: lang/others/eulisp/feel/telos/
Name: Telos
Summary: Implementation of the EuLisp Object System
Version: Telos 3.1 (17-DEC-93); Telosis 1.00f (7-SEP-93)
Description:
This directory contains implementations of the EuLisp object system
in Common Lisp (Telos) and Scheme (Telosis).
===========================================================================
Topic: lang/others/franzlsp/
Summary: Free implementations of Franz Lisp.
Description:
This directory contains several free versions of Franz Lisp:
pclisp/ Franz Lisp implementation for IBM PCs.
op38_93b/ This is the official version of Franz Lisp Opus 38.93b
originally from the ucbvax ftp site.
op38_bs/ A version of Opus 38.92 modified by Barry Schein for
the Sun3. The sources should work on the Sun-2 and
other machines as well.
op38_jd/ A version of Opus 38.92 modified by Jeff Dalton for
386/486 machines running NetBSD 0.9
op38_ucd/ A version of Opus 38.92 hacked at UC Davis to run
under SunOS 3.5 and 4.0.3.
Origin: With the demise of UCBVAX, the AI Repository has become
the official archive site for the public domain version
of Franz Lisp.
Copying: Public Domain.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Bug Reports: franz-bugs@cs.berkeley.edu, ai+franzlsp@cs.cmu.edu
Mailing List: Discussion of Franz Lisp occurs in the newsgroup
comp.lang.lisp.franz
There is also a mailing list, franz-friends@csberkeley.edu;
to join the mailing list, send mail to
franz-friends-request@cs.berkeley.edu.
Contact: Maintainers of Franz Lisp
Please include ai+franzlsp@cs.cmu.edu on any messages.
Keywords:
Frames, Franz Lisp, Pearl, Programming Languages!Franz Lisp, Public Domain
Contains:
op38_93b/ Public domain version of Franz Lisp.
op38_bs/ Public domain version of Franz Lisp.
op38_jd/ 386/486 port Franz Lisp.
op38_ucd/ Public domain version of Franz Lisp.
pclisp/ PCLisp: Franz Lisp interpreter for IBM PCs
See Also: ?
===========================================================================
Package: lang/others/franzlsp/op38_93b/
Name:
Summary: Public domain version of Franz Lisp.
Version: Opus 38.93b
Description:
This directory contains Franz Lisp Opus 38.93b, the last public
domain release available from the ucbvax ftp site before its demise.
The distribution includes the interpreter, compiler, cross
reference program, a lisp library, on-line manual, and a troff manual.
Also included is PEARL (Package for Efficient Access to Representations
in Lisp), an AI programming language implemented on top of Franz Lisp
by Joseph Faletti and Michael Deering under the direction of Robert
Wilensky at the Berkeley AI Research Project (BAIR).
===========================================================================
Package: lang/others/franzlsp/op38_bs/
Name:
Summary: Public domain version of Franz Lisp.
Version: Opus 38.92 (Barry Schein, 24-JUL-87)
Description:
This directory contains Franz Lisp Opus 38.92, as modified by Barry
Schein for the Sun-3. The sources should work on the Sun-2 and
other machines as well.
The distribution includes the interpreter, compiler, cross
reference program, a lisp library, on-line manual, and a troff manual.
Also include is PEARL (Package for Efficient Access to Representations
in Lisp), an AI programming language implemented on top of Franz Lisp
by Joseph Faletti and Michael Deering under the direction of Robert
Wilensky at the Berkeley AI Research Project (BAIR).
===========================================================================
Package: lang/others/franzlsp/op38_jd/
Name:
Summary: 386/486 port Franz Lisp.
Version: Opus 38.92 (Jeff Dalton, 16-MAR-94)
Description:
This directory contains a port by Jeff Dalton of Franz Lisp Opus 38.92
to 386/486 machines running NetBSD 0.9.
The distribution includes the interpreter, compiler, and on-line manual
===========================================================================
Package: lang/others/franzlsp/op38_ucd/
Name:
Summary: Public domain version of Franz Lisp.
Version: Opus 38.92 (UC Davis, 20-DEC-89)
Description:
This directory contains Franz Lisp Opus 38, as hacked at UC Davis
to run under SunOS 3.5 and 4.0.3.
The distribution includes the interpreter, compiler, cross
reference program, a lisp library, on-line manual, and a troff manual.
Also include is PEARL (Package for Efficient Access to Representations
in Lisp), an AI programming language implemented on top of Franz Lisp
by Joseph Faletti and Michael Deering under the direction of Robert
Wilensky at the Berkeley AI Research Project (BAIR).
===========================================================================
Package: lang/others/franzlsp/pclisp/
Name: PCLisp
Summary: Franz Lisp interpreter for IBM PCs
Version: 3.00 (1-FEB-90)
Description:
PC LISP is a Lisp interpreter for IBM PCs (MSDOS). PC-LISP is a
Franz LISP dialect and is by no means Common LISP compatible.
This is a binary-only shareware distribution; if you like it and
use it, please send $15 to the author. (We have not verified the
author's address and phone number.) Source code (in C) is available
from the author.
===========================================================================
Package: lang/others/kalypso/
Name: Kalypso
Summary: A portable Unix Lisp interpreter.
Version: 1.0 (15-AUG-89)
Description:
Kalypso is a compact, portable Lisp interpreter written entirely in C.
It was written at Reed College by Keith Packard with the assistance
of Bart Massey during the spring and summer of 1987.
Examples include LOLA, an ll(1) parser generator; fish, a simple card
game; and arbitrary precision factorial.
===========================================================================
Topic: lang/others/ml/
Summary: Free implementations of the Standard ML language
Description:
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
ML, Programming Languages!Standard ML, Standard ML
Contains:
caml_lt/ Caml Light: Small, portable implementation of the ML language
sml_nj/ Standard ML of New Jersey: Free implementation of the Standard
ML language.
See Also: ?
===========================================================================
Package: lang/others/ml/caml_lt/
Name: Caml Light
Summary: Small, portable implementation of the ML language
Version: 0.6 (1-SEP-93)
Description:
Caml Light is a small, portable implementation of the ML language.
Caml Light implements the Caml language, a functional language from
the ML family. Caml is quite close to Standard ML, though not strictly
conformant. There are some slight differences in syntax and semantics,
and major differences in the module system (these changes were
required to support separate compilation).
Caml Light is implemented as a bytecode compiler, and fully
bootstraped. The runtime system and bytecode interpreter is written
in standard C, hence Caml Light is easy to port to almost any 32-bit
platform. The whole system is quite small: about 100K for the runtime
system, and another 100K of bytecode for the compiler. 1.2 megabyte of
memory is enough to recompile the whole system. This stands in sharp
contrast with other implementations of ML, such as SML-NJ, that
requires about ten times more memory. Performance is quite good for a
bytecoded implementation: five to ten times slower than SML-NJ.
Caml Light comes in two flavors: a classical, interactive, toplevel-based
system; and a standalone, batch-oriented compiler that produces standalone
programs, in the spirit of the Unix cc compiler. The former is good for
learning the language and testing programs. The latter integrates more
smoothly within programming environments. The generated programs are quite
small, and can be used like any other command.
===========================================================================
Package: lang/others/ml/sml_nj/
Name: Standard ML of New Jersey
Summary: Free implementation of the Standard ML language.
Version: SML-NJ 0.93 (16-FEB-93)
Description:
This directory contains Standard ML of New Jersey, version 0.93. It
is the first general public release since version 0.75.
The release features support for several new machines (i386, rs6000,
hppa), less space taken up by compilation and execution, extensive
documentation, and almost no remaining bugs.
It includes an extensive library of structures and functions with
detailed documentation (The Standard ML of New Jersey Library), a
system for multithreaded concurrent programming in an extension of
Standard ML with synchronous communication channels (the Concurrent ML
system, CML), and an elegant concurrent interface to the X Window
System (eXene). The eXene system is built on top of Concurrent ML.
The release also includes several tools written in SML: a separate
compilation and "make" facility (SourceGroup), a lexical analyzer
generator (lexgen), a LALR(1) parser generator (mlyacc), a dynamic
tree pattern matching code generator generator (mltwig), a rudimentary
tool for querying the SML environment (info), a debugger, and a profiler.
===========================================================================
Topic: lang/prolog/
Summary: CMU Prolog Repository
Description:
Welcome to the Prolog Repository.
The Prolog Repository is part of the CMU Artificial Intelligence
Repository. The goal of the Prolog Repository is to collect files and
programs of general interest to Prolog programmers. Information
files include the FAQ (Frequently Asked Questions) postings for the
comp.lang.prolog newsgroup and copies of the draft standard for prolog.
If this is the first time you have used the Repository, please read
this file and the file named readme.txt. The file readme.txt contains
important information concerning the repository and conditions on use
of the repository. By retrieving files from the repository, you
signify your agreement to these conditions.
To contribute files to the repository, first see section [7] of the
readme.txt file. Then send mail to AI.Repository@cs.cmu.edu. If
possible, please put the files in ftp.cs.cmu.edu:user/ai/new/.
Origin: ftp.cs.cmu.edu:user/ai/lang/prolog/ [128.2.206.173]
Give "anonymous" (without the quotes) at the username:
prompt and type your email address (in the form "user@host")
at the password: prompt. NOTE: There is *no* leading slash
before user/ai/lang/prolog/; just type "cd user/ai/lang/prolog/"
at the ftp> prompt.
If you will be transferring compressed files, be sure to
type the "binary" command before retrieving the files. The
"get" command is used to get a single file, and "mget" to
retrieve multiple files using wildcards. If you're using
the "mget" command, you might want to turn off prompting
first by using the "prompt" command.
The Prolog Repository is kept in the Andrew File System (AFS)
directory
/afs/cs.cmu.edu/project/ai-repository/ai/lang/prolog/
and its subdirectories. If your site runs AFS, you can
just cd to this directory and copy the files directly.
(The FTP location given above is just a link to the AFS
directory.)
Further information about AFS can be obtained by
sending email to afs-sales@transarc.com.
Updated: 4-JAN-93
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Bug Reports: AI.Repository@cs.cmu.edu
Mailing List: comp.lang.prolog newsgroup
Author(s): Maintained by Mark Kantrowitz .
Thanks to the following people for their assistance in gathering
materials for the Prolog section of the AI repository:
Michael A. Covington (ai.uga.edu prolog archive)
Jocelyn Paine (src.doc.ic.ac.uk prolog archive)
Contact: AI.Repository@cs.cmu.edu
Keywords:
Programming Languages!Prolog, Prolog
Contains:
bookcode/ Machine readable parts of various Prolog books
code/ Prolog code for benchmarking, research, education, and fun
doc/ Documentation, including standards, introductions,
bibliographies
faq/ Prolog FAQ Postings: Frequently Asked Questions (FAQ) postings
for comp.lang.prolog and comp.object.logic newsgroups
gui/ Graphical User Interfaces (GUI) for Prolog
impl/ Free/Shareware Prolog implementations
oop/ OOP: Code related to object-oriented programming in Prolog.
txt/ Online Prolog-related tech reports and papers.
util/ Utilities for programming in Prolog.
See Also: ?
===========================================================================
Topic: lang/prolog/bookcode/
Summary: Machine readable parts of various Prolog books
Description:
Contains the machine readable parts of various Prolog books.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Books!Prolog, Prolog!Code
Contains:
aitp/ AITP: Code from Shoham's book, "AI Techniques in Prolog".
aop/ AOP: Code from Sterling's book "The Art of Prolog"
ppid/ PPID: Code from Covington's book, "Prolog Programming in
Depth".
tutor/ TUTOR: Jocelyn Paine's Logic Programming Tutor
See Also: ?
===========================================================================
Package: lang/prolog/bookcode/aitp/
Name: AITP
Summary: Code from Shoham's book, "AI Techniques in Prolog".
Version: 22-JAN-93
Description:
Contains source code from the book
Yoav Shoham, "Artificial Intelligence Techniques in Prolog",
Morgan Kaufmann Publishers, 1993, 400 pages.
ISBN 1-55860-167-8 (paper) $39.95.
ISBN 1-55860-319-0 (cloth) $49.95.
Includes a lot of AI problem-solving techniques implemented in
Prolog, such as depth-first search, breadth-first search, best-first
search, alpha-beta minimax, a meta-circular interpreter, forward
chaining, production systems, some atms examples, reasoning with
uncertainty, STRIPS, version spaces, and ID3.
Documentation is not included -- buy the book.
Note: Empty lists are rendered [ ] instead of [] which may cause problems
in some prolog implementations.
===========================================================================
Package: lang/prolog/bookcode/aop/
Name: AOP
Summary: Code from Sterling's book "The Art of Prolog"
Version:
Description:
Contains source code from the book
Leon Sterling and Ehud Shapiro, "The Art of Prolog: Advanced
Programming Techniques", 2nd Edition, MIT Press, 1994. 688 pages,
ISBN 0-262-19338-8, $49.95.
Documentation is not included -- buy the book.
===========================================================================
Package: lang/prolog/bookcode/ppid/
Name: PPID
Summary: Code from Covington's book, "Prolog Programming in Depth".
Version: 24-MAY-88
Description:
Contains source code from the book
Michael A. Covington, Donald Nute and Andre Vellino,
"Prolog Programming in Depth", Scott, Foresman & Co., 1988.
ISBN 0-521-40984-5.
including examples of defeasible reasoning, natural language
understanding, sorting, fractals, object-oriented programming, forward
chaining, graphics, user interfaces, solving the missionaries &
cannibals problem, planning, and a simple expert system.
Documentation is not included -- buy the book.
Also includes a list of all the errors in the book.
===========================================================================
Package: lang/prolog/bookcode/tutor/
Name: TUTOR
Summary: Jocelyn Paine's Logic Programming Tutor
Version:
Description:
This is the program described in Jocelyn Paine's book
Jocelyn Paine, "The Logic Programming Tutor", Intellect, 1992
published by Intellect in the UK and Kluwer elsewhere. It is a
front-end designed to introduce novices to Prolog, and can accept
facts and questions in either Prolog or infix "Logic", translating
between the two. It has a simple number-editor (Basic-like), and a
portable screen-editor. It also comes with a set of eight "scripts".
These are lessons which it displays one section at a time, inviting
the student to try doing simple exercises, or to try experiments with
Prolog.
The distribution also includes some auxiliary software, including a
trading game, several example knowledge bases, a copy of Dave Bowen
and Chris Mellish's cross-referencing program, a Prolog 'lint', an
autotester, a profiler for timing goals (based on chapter 3 of "The
Craft of Prolog"), and a random number generator.
Also included is LaTeX source for the supplementary exercises and
notes from Paine's book.
===========================================================================
Topic: lang/prolog/code/
Summary: Prolog code for benchmarking, research, education, and fun
Description:
This directory contains a variety of Prolog code and algorithm
implementations. This collection is intended to facilitate
code reuse. The code included here is of a type more basic to
programming in Prolog. Software systems implemented in Prolog will appear
in the software/ directory tree.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Prolog!Code
Contains:
bench/ Prolog Benchmarking Suites
debug/ Prolog programs for debugging Prolog programs.
demo/ Demonstration packages from various Prolog implementations
ext/ Collection of miscellaneous Prolog code/extensions.
fun/ Some random fun programs written in Prolog
io/ IO: Prolog code dealing with input and output routines.
library/ Prolog Library: A collection of Prolog programs from the
defunct Prolog-Hackers mailing list.
math/ Math Library: Prolog code for various mathematical functions.
meta/ Meta-circular interpreter for Prolog
misc/ Miscellaneous uncategorized Prolog Code
parsing/ Collection of Prolog code for parsing.
syntax/ Code related to changing or translating to/from Prolog syntax.
testing/ Prolog programs for testing Prolog programs.
tools/ Prolog Utilities: Collection of miscellaneous Prolog tools.
See Also: ?
===========================================================================
Package: lang/prolog/code/bench/
Name:
Summary: Prolog Benchmarking Suites
Version:
Description:
This directory contains code for benchmarking Prolog implementation
compatibility and performance.
Naive reverse is the classical benchmark for computing LIPS (Logical
Inferences Per Second). However, the utility of small benchmark
programs like naive reverse (NREV) is questionable, since it may not
necessarily reflect overall system performance. For example, NREV
doesn't exercise the two main features of Prolog -- backtracking and
unification. In practice, performance on large programs is much more
important. Some of the benchmarks use larger programs, such as
cryptarithms, theorem provers, and chart parsing, to give a better
picture of system performance on real problems. Thus it is better
to use the Pereira or Holmer benchmarks than the NREV benchmark.
===========================================================================
Topic: lang/prolog/code/debug/
Summary: Prolog programs for debugging Prolog programs.
Description:
Contains programs that are useful in debugging Prolog programs.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Debuggers, LINT for Prolog@{{\tt lint} for Prolog}, Prolog!Code,
Prolog!Debuggers
Contains:
protest/ PROTEST: PROlog TESTer
shapiro/ SHAPIRO: Shapiro's Prolog debugger.
See Also: ?
===========================================================================
Package: lang/prolog/code/debug/protest/
Name: PROTEST
Summary: PROlog TESTer
Version: 28-OCT-88
Description:
PROTEST is a Pascal program that finds some kinds of typing errors in
Prolog programs. Source code and an IBM PC executable are included.
===========================================================================
Package: lang/prolog/code/debug/shapiro/
Name: SHAPIRO
Summary: Shapiro's Prolog debugger.
Version: 3-OCT-88
Description:
This contains E. Y. Shapiro's Prolog debugger. It is the program in
Appendix II (pages 185-213) of
E. Y. Shapiro, "Algorithmic Program Debugging", MIT Press, 1982.
For documentation of the debugger, see Shapiro's book.
Some parts of the program are useful for other purposes.
===========================================================================
Topic: lang/prolog/code/demo/
Summary: Demonstration packages from various Prolog implementations
Description:
This directory contains demo packages from various implementations
of Prolog.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Demo Version, Prolog!Code, Prolog!Demo Packages
Contains:
esl/ Demo Prolog programs from Expert Systems Ltd. (ESL), Oxford.
sics/ SICStus: Demonstration Prolog programs from Sicstus Prolog.
See Also: ?
===========================================================================
Package: lang/prolog/code/demo/esl/
Name:
Summary: Demo Prolog programs from Expert Systems Ltd. (ESL), Oxford.
Version: 6-MAY-92
Description:
This package contains a number of demonstration programs written by
Expert Systems Ltd.
The programs include:
AUTOC - a simple compiler-compiler and sample language definition
CLASSY - a classificatory expert system, which comes with a
rule-editor, and sample animals database
DBAQL - a general-purpose database program
PCED - a clause-editor, with which you can edit clauses
from inside Prolog
ROADMAP - a simple route-planner
SYMDIFF - symbolic differentiator
===========================================================================
Package: lang/prolog/code/demo/sics/
Name: SICStus
Summary: Demonstration Prolog programs from Sicstus Prolog.
Version:
Description:
This package contains a number of demonstration programs that are
included with Sicstus Prolog. There is a significant amount of
overlap with the Edinburgh Tools Library.
===========================================================================
Topic: lang/prolog/code/ext/
Summary: Collection of miscellaneous Prolog code/extensions.
Description:
This directory contains a variety of extensions to Prolog and
miscellaneous Prolog code.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Prolog!Code, Prolog!Extensions
Contains:
atn/ ATN: Prolog transition net interpreter.
cugini/ CUGINI Extensions: NBS/ICST Prolog Utility Library
dlists/ DLISTS: Prolog doubly-linked list package.
id/ Prolog Iterative Deepening Interpreter
interval/ INTERVALS: Prolog sets-as-interval predicates
jorge/ Prolog list-handling predicates.
length/ Bounded-length version of the list-length predicate
trees/ Prolog 2-3 Trees Package
vaucher/ Jean Vaucher's implementation of structures in Prolog.
See Also: ?
===========================================================================
Package: lang/prolog/code/ext/atn/
Name: ATN
Summary: Prolog transition net interpreter.
Version: 11-JAN-91
Description:
This package is for those occasions when you need to represent a
program as a network of labels and gotos. For example, it is useful
when implementing a finite state machine or other transition networks.
ATN defines predicates for loading and interpreting such networks.
Here is an example network:
go ::
to count(1).
count(10) ::
write( 'Done.' ), nl
to success.
count(N) ::
write( 'N = ' ), write( N ), write('.'), nl,
Rem is N mod 2
to odd(N) if Rem=1
to even(N).
odd(N) ::
write( 'That is even.' ), nl
to inc(N).
even(N) ::
write( 'That is odd.' ), nl
to inc(N).
inc(N) ::
Ni is N+1
to count(Ni).
To run it, you would load it, and then call
?- do_node( go ).
===========================================================================
Package: lang/prolog/code/ext/cugini/
Name: CUGINI Extensions
Summary: NBS/ICST Prolog Utility Library
Version: 30-JUL-88
Description:
This package contains various utility predicates, some commonly used,
some not. They deal with lists, structures, I/O, sets, numeric
facilities, and some extensions of logic and control.
Predicates include member; append; maplist; other list-handling
predicates; predicates for handling sets represented as lists;
type-testing predicates; sorting and merging; readline; a predicate
for getting the printable representation of a term; rational number
predicates; and meta-logical predicates for dealing with true
disjunction and negation.
===========================================================================
Package: lang/prolog/code/ext/dlists/
Name: DLISTS
Summary: Prolog doubly-linked list package.
Version: 6-DEC-87 (3-NOV-87)
Description:
This is Jocelyn Paine's revised version of a doubly-linked
list-handling package sent to the Prolog Digest by Philip Dart of
Melbourne University. The syntax has been changed slightly to run in
Edinburgh Prolog; otherwise, the predicates are the same.
Philip sent the original package as a joke:
"Following the comments [on the bulletin board] about Fortran as an
AI language, Melbourne University Department of Artificial
Intelligence has decided to convert all of its Fortran AI programs
to NU-Prolog. This package has been written as an aid to this
conversion.
Doubly-linked list package: Why use boring old single-linked lists
when doubly-linked list could make your list processing applications
run as never before.
P.S. Don't forget to turn off the occur-check in your version of
Prolog!"
However, it seems that the package might be useful in those few cases
where you really *do* need circular structures (rather than using
edge-sets to represent graphs), and Philip has agreed to let Jocelyn
redistribute his package on this basis.
Predicates defined:
test Demonstrate the predicates
dPrev(D, _) Get previous node
dNext(D, _) Get next node
dHead(D, _) Get head of list
dTail(D, _) Get tail of list
isD(D) Is this a doubly-linked list?
portray(D) Portray doubly-linked list
dAppend(X, Y, Z) Append for doubly-linked lists
dAdj(L, R) Are these adjacent nodes?
===========================================================================
Package: lang/prolog/code/ext/id/
Name:
Summary: Prolog Iterative Deepening Interpreter
Version: 11-JUL-88
Description:
This program solves Prolog goals by iterative deepening.
===========================================================================
Package: lang/prolog/code/ext/interval/
Name: INTERVALS
Summary: Prolog sets-as-interval predicates
Version: 21-DEC-87
Description:
This package defines predicates for manipulating sets of integers,
represented as lists of disjoint intervals. This is a compact way of
representing large sets, provided that they contain few gaps between
intervals.
Here are two examples of the representation:
Set Representation
{ -32768 .. 32767 } [ -32768--32767 ]
{ 1,3,4,5,9,10,11,12,15,16,100,101,102} [ 1--1, 3--5, 9--12,
15--16, 100--102 ]
The predicates in this package include ones for forming the union,
intersection, and difference of such sets, and for various operations
on single intervals.
For efficiency, the sets are kept in a canonical form. The intervals
are disjoint, and are in ascending order, and form a minimal covering
(i.e., there is no other representation of a set, using fewer
intervals). There is a predicate for converting a list of arbitrary
unordered intervals into a canonical form.
The predicates are useful when writing programs for syntax-directed
translation of character data. For example, some tag field on a line
may specify that the line is a record of type R1 if the field lies in
the set C1 of characters, or a record of type R2 if the field lies in
the set C2 of characters, and so on. Using these predicates, one can
check for ambiguous specifications by testing whether C1 and C2
overlap; and one can generate quick tests for whether some character
is in C1 or C2 by knowing that the set are represented by as few
intervals as possible.
===========================================================================
Package: lang/prolog/code/ext/jorge/
Name:
Summary: Prolog list-handling predicates.
Version: 21-DEC-87
Description:
This package contains some list-handling predicates contributed by
Jorge Forero. The predicates include: test for list-ness; test for
sublist; find element at known position, or position of known element;
remove duplicates; flatten a list; add element after known element;
and find that part of a list following a given element.
===========================================================================
Package: lang/prolog/code/ext/length/
Name:
Summary: Bounded-length version of the list-length predicate
Version: 21-AUG-93 (26-FEB-91)
Description:
Many Prologs have a built-in function length/2 that can be used either
[1] to determine the length of a given list; or
[2] to non-deterministically create longer and longer lists.
This package defines a function length_bounded/3 with the following
specification:
length_bounded(?L,?Len,+Max)
"L is a list of length Len, where Len<=Max".
Like length/2, it can bind L to successively longer lists when Len is
unbound, but subject to the constraint that Len<=Max. It uses ":-wait"
declarations and hence needs to run under Sicstus Prolog.
===========================================================================
Package: lang/prolog/code/ext/trees/
Name:
Summary: Prolog 2-3 Trees Package
Version: 21-AUG-91
Description:
This package contains a set of Prolog predicates for associating
keys with values using 2-3 trees. Because 2-3 trees are used, they
automatically rebalance after each insertion or deletion.
For example,
?-
list_to_23( [ cat-dog,
hare-rabbit,
"hair"-"fur",
king-queen,
exp(1)-2.71828,
3.141593-pi
],
Tree
),
portray_23( Tree ),
put_23( 39, Tree, steps, Tree1 ),
portray_23( Tree1 ).
gives
23 Tree{
3.141593 - pi
cat - dog
hare - rabbit
king - queen
exp(1) - 2.71828
[104, 97, 105, 114] - [102, 117, 114]
}
23 Tree{
3.141593 - pi
39 - steps
cat - dog
hare - rabbit
king - queen
exp(1) - 2.71828
[104, 97, 105, 114] - [102, 117, 114]
}
There is no routine for deleting items from a tree (you can replace
them), but it would not be hard to write one.
===========================================================================
Package: lang/prolog/code/ext/vaucher/
Name:
Summary: Jean Vaucher's implementation of structures in Prolog.
Version: 15-AUG-89
Description:
This package is taken from Vaucher's Software P&E article. It
provides a set of primitive predicates and operators that allow the
arguments of Prolog structures to be accessed by name rather than
position, like Lisp-style property lists. This improves the
readability and maintainability of Prolog programs.
Examples:
---------
?- def_record( person(name,age,address) ).
Define a template for the 'person' structure.
?- inst( person, P ),
field( P..name, 'Matthew Latner Linton' ),
field( P..name, Z ).
Create a 'person' in P, set its name, and unify that name with Z.
?- def_record( address(number,street,town) ).
Template for the 'address' structure.
?- inst( address, A ),
inst( person, P ),
field( P..address, A ),
field( P..age, 25 ),
field( P..address..street, 'St. Peter's Street' ).
field( P..address..town, 'Hanningtown' ).
Create an address A and person P, and set some fields.
?- inst( person, P ),
field( P..name, 'Fred' ), field( P..age, 25 ),
update( P..name, 'Bert', P2 ).
Create a person, and use 'update' to make a modified copy.
===========================================================================
Topic: lang/prolog/code/fun/
Summary: Some random fun programs written in Prolog
Description:
This directory contains a variety of Prolog programs that do fun things.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Prolog!Code, Prolog!Fun Programs
Contains:
life/ Conway's Game of Life implemented in Prolog
mastermd/ Prolog program that plays the Mastermind code-breaking game.
prolib/ PROLIB: Prolog programs by Carl Bredlau
rubik/ RUBIK: Prolog solution to Rubik's Cube by AMZI!
ttt/ TIC-TAC-TOE: A Prolog implementation of Noughts and Crosses
See Also: ?
===========================================================================
Package: lang/prolog/code/fun/life/
Name:
Summary: Conway's Game of Life implemented in Prolog
Version: 8-MAR-94
Description:
John Horton Conway's "Game of Life" implemented in Prolog.
This version returns successive generations in its fourth
argument, printing out the board before returning. Try the
query
life(11, 11, [[5|6],[5|7],[6|5],[6|6],[7|6]], X).
===========================================================================
Package: lang/prolog/code/fun/mastermd/
Name:
Summary: Prolog program that plays the Mastermind code-breaking game.
Version: 21-AUG-83
Description:
This program implements the game of Mastermind. Either the user or the
program tries to break a hidden color code, consisting of the colors
black, blue, red, green, yellow, white. The results of a guess (black:
a color is at the right position; or white: a color occurs in the
code) are internally represented as successors of 0. This could be
extended to handle integers. When the program is making guesses, it
uses a simple but powerful generate-and-test procedure, where the
scores for previous attempts are used as the test criterion.
===========================================================================
Package: lang/prolog/code/fun/prolib/
Name: PROLIB
Summary: Prolog programs by Carl Bredlau
Version: 7-NOV-85
Description:
prolib.tar.gz
A collection of programs written by Carl Bredlau and Paula McKerall
for ADA Prolog. Includes a residential air conditioning diagnosis
system, a symbolic differentiation system, a towers of hanoi program,
a sample network path finding algorithm, and code for sorting lists.
===========================================================================
Package: lang/prolog/code/fun/rubik/
Name: RUBIK
Summary: Prolog solution to Rubik's Cube by AMZI!
Version:
Description:
Cube Solver II is a Prolog program that solves Rubik's Cube.
It includes ready-to-run executables for 386 and 486 PCs, as well
as full Prolog source code. If you want to use the sources on Unix,
you'll need to unpc them (remove the extra carriage returns).
===========================================================================
Package: lang/prolog/code/fun/ttt/
Name: TIC-TAC-TOE
Summary: A Prolog implementation of Noughts and Crosses
Version: FEB-91
Description:
This program was written by David Green as an MSc exercise when he was
at Edinburgh University in 1991.
The most interesting thing about it is its use of a 3x3 'magic square'
to represent the playing area. This means that each position on the
noughts & crosses board is given a numerical value:
8 3 4
1 5 9
6 7 2
It is a property of this magic square that each winning line in noughts
& crosses has a total sum of 15. Thereore, 15 as a sum of three numbers
uniquely defines a particular winning position of the game. The game
state is stored as a list of the numbers which have been 'taken' so far
by the user, a list of the numbers which have similarly been taken by
the computer, and finally a list representing the current board state,
in which positions which have previously been filled by either player
are marked with an 'o' or an 'x' as is appropriate. Furthermore, this
representation makes it possible to refer to any vacant board position
by a single number from 1 to 9.
===========================================================================
Topic: lang/prolog/code/io/
Name: IO
Summary: Prolog code dealing with input and output routines.
Description:
A variety of programs dealing with input and output operations in
Prolog. Includes several graphics packages.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
IO, Prolog!Code, Prolog!IO
Contains:
pl2sql/ PL2SQL: Prolog to SQL interface
turtle/ Prolog turtle graphics.
vt100/ VT100 VT52: Prolog cursor-addressing predicates.
See Also: ?
===========================================================================
Package: lang/prolog/code/io/pl2sql/
Name: PL2SQL
Summary: Prolog to SQL interface
Version: 1.1 (21-DEC-92)
Description:
PL2SQL is a Prolog to SQL compiler. It translates database access
requests, which consist of a projection term and a database goal, to
the appropriate SQL query. This compiler may be useful in
Prolog-to-RDBMS interfaces, which often allow SQL queries as string
arguments (e.g. the Quintus Prolog Oracle interface and others).
The compiler allows negation, arithmetic, and aggregate functions.
===========================================================================
Package: lang/prolog/code/io/turtle/
Name:
Summary: Prolog turtle graphics.
Version: 12-DEC-87 (25-MAR-87)
Description:
This is a simple turtle graphics program for vt100 terminals written
by David Lau-Kee and originally posted to the Prolog Digest. A few
syntactic errors were corrected by Salleh Mustaffa, University of
Manchester. There may be some problems due to control characters in
the program not being properly transmitted through email in the
original posting.
A limited subset of turtle graphics capabilities is implemented: You
can tell the turtle to turn 90 degrees clockwise or anticlockwise, and
to move forward X steps. Backtracking over these primitives causes
them to be undone.
===========================================================================
Package: lang/prolog/code/io/vt100/
Name: VT100 VT52
Summary: Prolog cursor-addressing predicates.
Version: 21-DEC-87
Description:
This package contains Prolog cursor-addressing predicates. There
are two sets of predicates, one for vt100s and one for vt52s.
Operations supported include
move to X,Y
clear a line or page
set inverse or normal video
===========================================================================
Package: lang/prolog/code/library/
Name: Prolog Library
Summary: A collection of Prolog programs from the defunct Prolog-Hackers
mailing list.
Version: 21-AUG-90
Description:
This directory contains a collection of Prolog programs from the
now-defunct Prolog Hackers mailing list. Fernando Pereira maintained
the collection. Many of the programs are over 10 years old. The
programs were originally tested on DEC-10s and DEC-20s with the
Edinburgh Prolog system. Compatibility with modern Prologs has not
been tested, but most of the programs should run with only minor
changes. Some of the files in this package have been duplicated
elsewhere in the Prolog Repository, but we felt it was important to
retain the package intact despite the duplication.
The library includes implementations of trace, advice, macro
expansion, gensym, heaps, sorting, queues, random number generators,
set manipulation routines, splay trees, binary trees, and association
lists. There's also an implementation of Mackworth's AC-3 algorithm,
several debuggers, a Prolog parser, a top-level loop, graph processing
utilities, a metacircular interpreter for Prolog, a program for
converting formulae in FOPC to clausal form, a translator from
Definite Clause Grammars to Prolog, a compiler for Flat Concurrent
Prolog, routines for structure crunching, a rational arithmetic
package, an algebraic expression simplifier, a pretty printer,
tutorial programs, cross-referencing programs, a Prolog lint, and a
Prolog type checker. The library also includes the ECRC benchmarks,
the WGSYM (Information Processing Society of Japan) Lisp/Prolog
benchmarks, and the Tektronix/Portland State University benchmarks.
Among the documents are the user's manual for Edinburgh Prolog on the
DEC-10, the original Scribe draft manuscript for a Prolog standard
by O'Keefe, and a few bibliographies.
===========================================================================
Topic: lang/prolog/code/math/
Name: Math Library
Summary: Prolog code for various mathematical functions.
Description:
A variety of mathematical functions implemented in Prolog.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Math, Prolog!Code, Prolog!Math
Contains:
algebra/ Algebra: Computer algebra system implemented in Prolog
graph/ Prolog graph-handling routines
interval/ II: Integer arithmetic constraint system using interval
arithmetic.
See Also: ?
===========================================================================
Package: lang/prolog/code/math/algebra/
Name: Algebra
Summary: Computer algebra system implemented in Prolog
Version: 1.0 (12-APR-87)
Description:
This directory contains Sergio Vaghi's computer algebra system. It
includes Prolog programs for symbolic differentiation of algebraic
functions and for symbolic simplification of algebraic functions.
The programs run under PD Prolog version 1.90.
===========================================================================
Package: lang/prolog/code/math/graph/
Name:
Summary: Prolog graph-handling routines
Version: 12-JAN-91
Description:
This package contains two programs: one for decomposing a non-weighted
directed graph into strongly connected components; and the other for
finding simple and elementary cycles in a strongly connected component.
===========================================================================
Package: lang/prolog/code/math/interval/
Name: II
Summary: Integer arithmetic constraint system using interval arithmetic.
Version: 1.5 (23-FEB-93)
Description:
II is an integer interval arithmetic package that provides a
constraint handling system for integers. It deals correctly with
non-linear constraints and is able to solve diophantine equations.
===========================================================================
Package: lang/prolog/code/meta/
Name:
Summary: Meta-circular interpreter for Prolog
Version: 2-MAR-84
Description:
This directory contains a genuinely meta-circular interpreter for a
subset of Prolog containing cuts. It relies on the fact that
disjunction is transparent to cut just like conjunction.
If it doesn't work in your Prolog, and if you paid more than $100 for
it, take your Prolog back to the shop and insist that they fix it,
there are at least four different ways of implementing disjunction so
that it works.
===========================================================================
Package: lang/prolog/code/misc/
Name:
Summary: Miscellaneous uncategorized Prolog Code
Version:
Description:
This directory contains a variety of miscellaneous Prolog programs,
including:
unify.txt Discussion and code for a most general unifier.
===========================================================================
Topic: lang/prolog/code/parsing/
Summary: Collection of Prolog code for parsing.
Description:
This directory contains parsing-related code for Prolog. The
emphasis is more on code-related parsing than on natural language
parsing. (Although some of the parsers can serve dual purposes.)
But some systems, like ALE, serve dual purposes, so we decided
(arbitrarily) to keep them here.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Parsing, Prolog!Code, Prolog!Parsing
Contains:
ale/ ALE: Attribute Logic Engine
draw/ DRAW: Draws parse trees.
grexpand/ GREXPAND: Jocelyn Paine's Prolog grammar-rule translator
gulp/ GULP: Graph Unification and Logic Programming
lp/ LP: Parser for Prolog written in C.
See Also:
software/nlp/parsing/
===========================================================================
Package: lang/prolog/code/parsing/ale/
Name: ALE
Summary: Attribute Logic Engine
Version: 13-JAN-93 (beta)
Description:
ALE (Attribute Logic Engine) is a system implemented in Prolog that
integrates phrase structure parsing and constraint logic programming
with typed feature structures as terms. Types are arranged in an
inheritance hierarchy and specified for the features and value types
for which they are appropriate. Grammars may also interleave
unification steps with logic program goal calls (as can be done in
DCGs), thus allowing parsing to be interleaved with other system
components. While ALE was developed to handle HPSG grammars, it can
also execute PATR-II grammars, DCG grammars, Prolog, Prolog-II, and
LOGIN programs, etc. Grammars and programs are specified with a
version of Rounds-Kasper Attribute Value Logic with macros and
variables. ALE supports lexical rules and empty categories for
grammars, using a bottom-up, breadth-first dynamic chart parser. ALE
supports last call optimization, negation by failure and cuts in
definite clauses, which may be used independently or integrated into
grammars.
===========================================================================
Package: lang/prolog/code/parsing/draw/
Name: DRAW
Summary: Draws parse trees.
Version:
Description:
DRAW is a Prolog utility for drawing tree-like representations of
structures, such as parse trees. The output is an ASCII diagram of
the structure.
===========================================================================
Package: lang/prolog/code/parsing/grexpand/
Name: GREXPAND
Summary: Jocelyn Paine's Prolog grammar-rule translator
Version: 6-DEC-87
Description:
This program defines a predicate, 'grexpand', for expanding Definite
Clause Grammar Rules into Prolog clauses. These are the standard form
of DCG rules, for which a translator is built-in to many Prologs. The
translator is essentially the same as the one published in
"Programming in Prolog", by Clocksin and Mellish.
===========================================================================
Package: lang/prolog/code/parsing/gulp/
Name: GULP
Summary: Graph Unification and Logic Programming
Version:
Description:
GULP (Graph Unification Logic Programming) is a Prolog preprocessor
for unification-based grammar. It translates feature structures into
standard Prolog programs. GULP is as powerful and concise as PATR-II
and other grammar development tools, while retaining all the
versatility of Prolog.
===========================================================================
Package: lang/prolog/code/parsing/lp/
Name: LP
Summary: Parser for Prolog written in C.
Version: 31-MAR-94
Description:
LP is a parser for standard Prolog text written in C. It consists of
only three modules (tokenizer, parser, and display routine) and an
interface module to integrate it with an existing Prolog system. It is
completely deterministic and about 10 times faster than O'Keefe's
public domain parser written in Prolog.
A small demonstration program is included. This program is not optimal
at all, but shows how it can be used.
===========================================================================
Topic: lang/prolog/code/syntax/
Summary: Code related to changing or translating to/from Prolog syntax.
Description:
Programs that provide an alternate syntax for Prolog, translate from
one version of Prolog to another, or provide a syntax extension to Prolog.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Prolog!Code, Prolog!Syntax, Syntax
Contains:
asn/ ASN: Prolog abstract syntax notation translator.
compiler/ GRIPS Compiler: Grips/Prolog demonstration mini-compiler.
dctg/ DCTG: Prolog definite clause translation grammar translator.
grips/ GRIPS Translator: GRIPS -- A functional language in Prolog
See Also: ?
===========================================================================
Package: lang/prolog/code/syntax/asn/
Name: ASN
Summary: Prolog abstract syntax notation translator.
Version: 14-NOV-89 (17-JUL-89)
Description:
ASN (Abstract Syntax Notation) is a formalism for describing
language syntax. Grammars are written as Prolog terms, and compiled
into an optimized Definite Clause Grammar.
===========================================================================
Package: lang/prolog/code/syntax/compiler/
Name: GRIPS Compiler
Summary: Grips/Prolog demonstration mini-compiler.
Version: 11-JAN-91
Description:
This is a demonstration compiler, written in a functional language
(GRIPS) that can be translated into Prolog. The GRIPS translator is
available separately.
The compiler takes programs in a (very small) subset of Pascal. It
lexically analyzes them into tokens, parses the token list into a
tree, generates code from the tree, fixes up references in the code,
and then interprets the code on a stack virtual machine. It displays
the output of each stage, and the interpreter displays the machine
state as each instruction is obeyed.
The compiler is written in a functional style, using functions
(sometimes represented as sets of domain->codomain pairs) to represent
well-known concepts in programming language semantics, such as the
store and the environment.
Here is an example program that it can compile and run.
program p;
label
99, 100;
const
five = 5;
var
v : integer;
w : integer;
begin
write('Hello.');
v := 1;
w := 1;
99:
if v=five then goto 100;
v := v + 1;
w := w * v;
goto 99;
100:
write('v = ');
write(v);
write('v! = ');
write(w)
end.
===========================================================================
Package: lang/prolog/code/syntax/dctg/
Name: DCTG
Summary: Prolog definite clause translation grammar translator.
Version: 21-JUL-90
Description:
Definite Clause Translation Grammars are described in chapter 9 of
Abramson and Dahl's book "Logic Grammars". They were devised by
Abramson to overcome the defects of Definite Clause Grammars, in which
syntax and semantics are often mixed in a non-modular fashion. They
avoid also the problem with the proliferation of unnamed arguments
that afflicts Definite Clause Grammars.
In a DCTG, the syntax and semantics are separated. Each rule contains
first a syntactic part, and then an optional semantics, written as one
or more clauses. An example is given below. See Ambramson and Dahl's
book for more details. The code in this package comes from Appendix
II of the book, with a few minor changes by Jocelyn Paine.
The following example shows how to parse binary numbers with binary
points (such as 1.1 or 1001.11) when expressed as lists ([1,'.',1] or
[1,0,0,1,'.',1,1]).
bit ::= [0]
bitval( 0, _ ).
bit ::= [1]
bitval( V,Scale ) ::- V is **(2,Scale).
bitstring ::= []
length(0)
&&
value(0,_).
bitstring ::= bit^^B, bitstring^^B1
length( Length ) ::-
B1 ^^ length(Length1),
Length is Length1 + 1
&&
value( Value, ScaleB ) ::-
B ^^ bitval( VB, ScaleB ),
S1 is ScaleB - 1,
B1 ^^ value( V1, S1 ),
Value is VB + V1.
number ::= bitstring ^^ B, fraction ^^ F
value(V) ::-
B ^^ length(Length),
S is Length-1,
B ^^ value( VB, S ),
F ^^ fractional_value( VF ),
V is VB + VF.
fraction ::= ['.'], bitstring ^^ B
fractional_value( V ) ::-
S is -1,
B ^^ value( V, S ).
fraction ::= []
fractional_value(0).
test( L, V ) :-
write( 'LIST ' ), write( L ), nl,
number( Tree, L, [] ),
Tree ^^ value( V ),
write( 'VALUE ' ), write( V ), nl, nl.
?- test( [1,'.',1], V ).
/* Should set V to 1.5. */
===========================================================================
Package: lang/prolog/code/syntax/grips/
Name: GRIPS Translator
Summary: GRIPS -- A functional language in Prolog
Version: 11-JAN-91
Description:
GRIPS is a pre-processor for translating a functional version of
Prolog into Prolog. By using it, you can eliminate the tedium of
having to think up variables to pass output from one predicate to the
input of the next, and of having to flatten nested arithmetic
expressions into a sequence of machine-code-like assignments.
Here are two example definitions.
factorial(N) 0.
count( [] )
Zero or more lines of text
===========================================================================
Topic: lang/prolog/doc/
Summary: Documentation, including standards, introductions,
bibliographies
Description:
Contains documents such as introductions to Prolog, copies of the
standards, bibliographies, and random notes about Prolog.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Prolog!Documents
Contains:
bib/ Bibliographies of work in Prolog
com/ Documentation and information from vendors
intro/ Introductions to Prolog: Edinburgh (DEC-10) Prolog User's
Manual
notes/ Prolog Notes: Summaries and interesting notes about Prolog
stuff.
pl_1000/ Prolog 1000: The Prolog 1000 database of real Prolog
applications
standard/ Prolog Standards Documents
survey/ Survey papers related to logic programming.
See Also: ?
===========================================================================
Topic: lang/prolog/doc/bib/
Summary: Bibliographies of work in Prolog
Description:
Contains bibliographies related to work in Prolog.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Bibliographies, Prolog!Bibliographies, Prolog!Documents
Contains:
iandc/ IANDC: Bibliography of journal "Information and Computation"
lics/ LICS: Bibliography for the annual IEEE Symposium on Logic in
Computer Science
lp/ LP: Logic Programming Bibliographies
oolog/ OOLOG: Bibliography of work on integrating object-oriented and
logic programming.
prolog/ General bibliographies of work on Prolog
tacs/ TACS: Bibliographies of the International Conference on
Theoretical Aspects of Computer Software
See Also: ?
===========================================================================
Package: lang/prolog/doc/bib/iandc/
Name: IANDC
Summary: Bibliography of journal "Information and Computation"
Version: 1.31 (05-JAN-94)
Description:
This directory contains a BibTeX bibliography for the journal
"Information and Computation" published by Academic Press and
edited by Albert R. Meyer. It covers the years 1982 through the
present (volumes 52 through the present).
For information on ordering back issues, write to
Academic Press, Inc.
Attn: Jacquie Mahon
Journal Division/Back Volumes
1250 Sixth Avenue
San Diego, CA 92101
===========================================================================
Package: lang/prolog/doc/bib/lics/
Name: LICS
Summary: Bibliography for the annual IEEE Symposium on Logic in
Computer Science
Version: 3.00 (5-AUG-93)
Description:
This directory contains a BibTeX bibliography for the annual IEEE
Symposium on Logic in Computer Science. About 1/3 of the entries
include abstracts. It covers the years 1986 to the present.
For information on ordering back issues, write to
IEEE Computer Society Press IEEE Service Center
Customer Service Center 445 Hoes Lange
10662 Los Vaqueros Circle PO Box 1331
PO Box 3014 Piscataway, NJ 08855-1331
Los Alamitos, CA 90720-1264
IEEE Computer Society IEEE Computer Society
13, avenue de l'Aquilon Ooshima Building
B-1200 Brussels 2-19-1 Minami-Aoyama
BELGIUM Minato-ku, Tokyo 107
JAPAN
===========================================================================
Package: lang/prolog/doc/bib/lp/
Name: LP
Summary: Logic Programming Bibliographies
Version: patchlevel 14 (30-JUN-94)
Description:
This directory contains BibTeX bibliographies of Logic Programming
conferences and journals.
BibTeX entries are included for the proceedings of the following
conferences
ALP: 90, 92 (Algebraic and LP)
ALPUK: 91 (UK Conference on Logic and Programming)
CADE: 90, 92 (Itl Conference on Automated Deduction)
CTRS: 90, 92 (Conditional and Typed Rewriting Systems)
EAIA: 90 (Portuguese Advanced School in AI)
EPIA: 89, 91, 93 (Portuguese Conference on AI)
FGC: 92 (ICOT: Fifth Generation Computer Systems)
ICLP: 82, 84, 86-91, 93 (International Conference on LP)
ILPS: 91, 93 (International LP Symposium)
JICLP: 92 (Joint Itl Conference on LP)
LICS: 86-91 (IEEE Symp. on Logic in Computer Science)
LP: 88 (Logic Programming Conference)
NACLP: 89-90 (North American Conference on LP)
PEPM: 91, 93 (ACM SIGPLAN Symp. on Partial Evaluation)
PLILP: 90-92 (Programming Language Impl. and LP)
RTA: 89, 93 (Rewriting Techniques and Applications)
SLP: 84-87, 91 (Symposium on LP)
TACS: 91 (Theoretical Aspects of Computer Software)
TAPSOFT: 93 (Theory and Practice of Software Dev.)
UNIF: 89 (Itl Workshop on Unification)
and journals
FAC: 90 (Formal Aspects of Computing)
IANDC: 82-92 (Information and Computation)
JAR: 91-93 (Journal of Automated Reasoning)
JLP: 85-93 (Journal of Logic Programming)
JSC: 91-93 (Journal of Symbolic Computation)
The bibliography can be searched using either WAIS or GOPHER.
1. To search the lp-proceedings using WAIS, use the
lp-proceedings.src
WAIS source, available from the directory of servers.
2. To search the lp-proceedings using GOPHER, point the client
to
gopher.fct.unl.pt,
and follow the directories
"Research/Bibliography/Logic Programming Proceedings".
Searching should be easier than retrieving the entire package every
time you want to locate a particular article.
===========================================================================
Package: lang/prolog/doc/bib/oolog/
Name: OOLOG
Summary: Bibliography of work on integrating object-oriented
and logic programming.
Version: 27-MAR-93
Description:
This directory contains a partially annotated bibliography of work
on integrating object-oriented and logic programming.
It also contains a survey on "Mutable Object State for
Object-Oriented Logic Programming".
===========================================================================
Package: lang/prolog/doc/bib/prolog/
Name:
Summary: General bibliographies of work on Prolog
Version:
Description:
General bibliographies of work on Prolog and Logic Programming.
===========================================================================
Package: lang/prolog/doc/bib/tacs/
Name: TACS
Summary: Bibliographies of the International Conference on
Theoretical Aspects of Computer Software
Version: 1.0 (12-JUN-92)
Description:
This directory contains a BibTeX bibliography for 1991
International Conference on Theoretical Aspects of Computer
Software.
===========================================================================
Package: lang/prolog/doc/com/
Name:
Summary: Documentation and information from vendors
Version:
Description:
Contains documents provided by Prolog vendors.
===========================================================================
Package: lang/prolog/doc/intro/
Name: Introductions to Prolog
Summary: Edinburgh (DEC-10) Prolog User's Manual
Version:
Description:
This directory contains
prolog.doc
D. L. Bowen (editor), L. Byrd, F.C.N. Pereira, L.M. Pereira,
and D.H.D. Warren, "DECsystem-10 Prolog User's Manual",
Department of Artificial Intelligence, University of
Edinburgh, November 10, 1982. [For Prolog version 3.47.]
Copyright (c) 1982 University of Edinburgh
clp.tar
Thom Fruhwirth, Alexander Herold, Volker Kuchenhoff, Thierry Le
Provost, Pierre Lim, Eric Monfroy, and Mark Wallace, "Constraint
Logic Programming -- An Informal Introduction", ECRC Technical
Report ECRC-93-5, February 1993.
explore.doc
Dennis C. Merritt, "Exploring Prolog: Adventures, Objects,
Animals, and Taxes", PC AI Magazine, September/October 1993.
Reprinted with permission, 602/971-1869. A nice introduction
to Prolog. For more information, write to amzi@world.std.com.
(Amzi sells a variety of Prolog products, including online
tutorials and the Cogent Prolog interpreter/compiler.)
===========================================================================
Package: lang/prolog/doc/notes/
Name: Prolog Notes
Summary: Summaries and interesting notes about Prolog stuff.
Version:
Description:
pl_usage.txt June 1993 poll of Prolog use
cial.txt Announcement of the CIAL constraint logic
programming language.
datalog.txt Information about datalog interpreters.
condcomp.txt Notes about conditional compilation in Prolog.
===========================================================================
Package: lang/prolog/doc/pl_1000/
Name: Prolog 1000
Summary: The Prolog 1000 database of real Prolog applications
Version: v1
Description:
The Prolog 1000 is a database of real Prolog applications being
assembled in conjunction with the Association for Logic Programming
(ALP) and Prolog Vendors Group (PVG). The aim is to demonstrate how
Prolog is being used in the real world and it already contains over
500 programs with well over 2 million lines of code. The database is
in SGML format.
If you have or know about a program that might qualify for inclusion,
send an email message to any of the contacts listed below for an
electronic entry form which only takes a few minutes to complete.
(Floppy disks for PC or Mac in text form are also welcome, and paper
entries may also be sent).
They would like to know who is using the information and are cautious
about supplying ready-made address lists, so full addresses for the
authors are not included in the database. This information is
available upon request from the contacts below.
===========================================================================
Package: lang/prolog/doc/standard/
Name:
Summary: Prolog Standards Documents
Version:
Description:
This directory contains
d7.tar
December 1991 draft ISO Prolog standard
(Includes iso.sty style file and TeX source.)
d8.tar
March 1993 draft ISO Prolog standard (Committee Draft ISO/IEC 13211-1)
(PostScript only.)
summary.tar
Informal/unofficial summary of the draft by Michael Covington
(PostScript and LaTeX.)
okeefe.txt
R.A. O'Keefe's 23-JUL-84 original draft Prolog standard in Scribe.
===========================================================================
Package: lang/prolog/doc/survey/
Name:
Summary: Survey papers related to logic programming.
Version:
Description:
clp.ps
Joxan Jaffar and Michael J. Mayer, "Constraint Logic Programming:
A Survey (draft)", Journal of Logic Programming, to appear 1994.
ccp.dvi
Vijay Saraswat, "Concurrent Constraint Programming: A brief survey",
August 1992. (Addendum to PhD thesis.)
===========================================================================
Package: lang/prolog/faq/
Name: Prolog FAQ Postings
Summary: Frequently Asked Questions (FAQ) postings for
comp.lang.prolog and comp.object.logic newsgroups
Version:
Description:
This directory contains the Prolog Resource Guide (PRG) maintained by
Mark Kantrowitz and the Prolog FAQ maintained by Jamie Andrews. Both
FAQs are posted to comp.lang.prolog once a month, and are intended to
complement one another. The PRG is also posted to the
comp.object.logic newsgroup.
===========================================================================
Topic: lang/prolog/gui/
Summary: Graphical User Interfaces (GUI) for Prolog
Description:
Sources for all the free Prolog graphical user interfaces (GUI).
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
GUI!Prolog, Graphics, HCI
Contains:
pi/ PI and Ytoolkit: Prolog interfaces to X-Windows
protcl/ ProTcl: Prolog interface to Tcl/Tk.
xpce/ XPCE: Information about the XPCE object-oriented X-windows
interface toolkit.
xwip/ XWIP: X-Windows Interface for PROLOG.
See Also: ?
===========================================================================
Package: lang/prolog/gui/pi/
Name: PI and Ytoolkit
Summary: Prolog interfaces to X-Windows
Version: PI -- 1.2 (16-SEP-93); YToolkit (25-May-93)
Description:
PI (Portable Interfaces for Prolog applications) is an interface
between Prolog applications and the X Window System that aims to be
independent from the Prolog engine, provided that it has a
Quintus-style foreign function interface (such as SICStus, YAP). It
is mostly written in Prolog and is divided into two libraries:
1. Edipo, a low-level interface to the Xlib functions that allows
you to create and manage windows, use graphical primitives, and
receive events, and
2. Ytoolkit, a high-level user interface toolkit that allows you to
create and manage graphical objects, define new classes of objects,
and handle user interaction.
===========================================================================
Package: lang/prolog/gui/protcl/
Name: ProTcl
Summary: Prolog interface to Tcl/Tk.
Version: 1.0 (21-SEP-93)
Description:
ProTcl (pronounced pro-tickle) is a Prolog interface to Tcl/Tk. It has
a very simple interface, which just allows one to evaluate Tcl
expressions from Prolog.
===========================================================================
Package: lang/prolog/gui/xpce/
Name: XPCE
Summary: Information about the XPCE object-oriented X-windows
interface toolkit.
Version: 4.6.6
Description:
XPCE is an object-oriented X-window interface toolkit for symbolic
programming languages (Prolog and Lisp), offering a high level of
abstraction for communication with X11, Unix processes, Unix
networking facilities (sockets) and Unix files. XPCE's built-in
classes (about 150) are mostly written in C. The XPCE/Prolog
interface allows the user to create and manipulate instances of these
classes. The user can also create new XPCE classes from Prolog.
XPCE's window related classes provide various styles of menus,
primitive graphical objects, compound graphical objects and Emacs
oriented programmable text manipulation windows. The distribution
contains several demo programs, including a diagram drawing tool
(PceDraw), an animation demo, an Epoch-like editor (PceEmacs), a graphical
interface to Unix ispell, and an online hyper-text manual for XPCE
itself (PceManual).
This directory contains copies of the license agreement,
documentation, and a demo version. The non-demo versions (which
include source code) require signing a license agreement and
remitting a licensing fee to the University of Amsterdam (see info.txt).
===========================================================================
Package: lang/prolog/gui/xpce/linux/
Name:
Summary: Demo version of XPCE/SWI-Prolog for Linux
Version: 4.6.6
Description:
This directory contains a demo version (binaries) of XPCE/SWI-Prolog
for PC/Linux (i386). XPCE is an object-oriented X-window interface
toolkit for symbolic programming languages.
===========================================================================
Package: lang/prolog/gui/xwip/
Name: XWIP
Summary: X-Windows Interface for PROLOG.
Version: 0.6.2 (6-APR-93)
Description:
XWIP (X Window Interface for Prolog) allows Prolog to be used as a
client program for the X Windows System. The additional functions it
provides are similar in form to the Xlib C language library.
XWIP is written in Prolog and partly in the C language. XWIP uses a
foreign function interface to allow the Prolog code to call the C
code. The C code in turn calls the Xlib C language library.
[In the old/ subdirectory are versions 0.6 (X11 R5), patch1 for 0.6,
0.5 (X11 R4), and 0.4 (X11 R3).]
===========================================================================
Topic: lang/prolog/impl/
Summary: Free/Shareware Prolog implementations
Description:
Sources for a large collection of Prolog implementations.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Programming Languages!Prolog, Prolog!Implementations
Contains:
clp/ Constraint Logic Programming implementations
fp_lp/ Implementations of Functional/Logic Programming Languages
lp/ Logic programming language implementations other than Prolog.
other/ Other logic-related languages of interest.
parallel/ Free/Shareware Parallel Prolog implementations
prolog/ Free/Shareware Prolog implementations
wam/ WAM: WAM emulators and tracers.
See Also: ?
===========================================================================
Topic: lang/prolog/impl/clp/
Summary: Constraint Logic Programming implementations
Description:
Sources for a large collection of implementations of constraint
logic programming languages.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
CLP, Programming Languages!CLP, Prolog!Implementations
Contains:
clp_fd/ clp(FD): Prolog and Constraints over Finite Domains and
Booleans
cup/ cu-Prolog III: Constraint Logic Programming Language cu-Prolog
See Also: ?
===========================================================================
Package: lang/prolog/impl/clp/clp_fd/
Name: clp(FD)
Summary: Prolog and Constraints over Finite Domains and Booleans
Version: 2.1 (8-JUN-94)
Description:
clp(FD) is a constraint logic programming language over finite
domains and booleans based on the wamcc Prolog compiler.
clp(FD) provides several constraints "a la CHIP" on finite domains and
booleans and some facilities for building new constraints. clp(FD) is
4 times faster than CHIP v3.2 on average.
Examples include cryptarithms, the Ramsey problem, linear equations, and
the N-Queens problem.
===========================================================================
Package: lang/prolog/impl/clp/cup/
Name: cu-Prolog III
Summary: Constraint Logic Programming Language cu-Prolog
Version:
Description:
cu-Prolog (Constraint Unification Prolog) is an experimental
constraint logic programming language available free from Japan's
Institute for New Generation Computer Technology (ICOT). Unlike most
conventional CLP systems, cu-Prolog allows user-defined predicates as
constraints. cu-Prolog is a complete implementation of Constraint
Unification (cu), hence the name.
cu-Prolog is suitable for implementing a natural language processing
system for unification-based grammars. For example, the cu-Prolog
developers implemented a JPSG (Japanese Phrase Structure Grammar)
parser in cu-Prolog with the JPSG Working Group (headed by Prof.
Takao Gunji of Osaka University) at ICOT.
[Note: Japanese names have been rewritten in the order .]
===========================================================================
Package: lang/prolog/impl/clp/cup/icot/
Name: cu-Prolog III
Summary: Original ICOT version
Version: CUP 3.1 (22-SEP-93); JPSG 1.3 (6-JUN-92)
Description:
cu-Prolog (Constraint Unification Prolog) is an experimental
constraint logic programming language available free from Japan's
Institute for New Generation Computer Technology (ICOT). Unlike most
conventional CLP systems, cu-Prolog allows user-defined predicates as
constraints. cu-Prolog is a complete implementation of Constraint
Unification (cu), hence the name.
cu-Prolog is suitable for implementing a natural language processing
system for unification-based grammars. For example, the cu-Prolog
developers implemented a JPSG (Japanese Phrase Structure Grammar)
parser in cu-Prolog with the JPSG Working Group (headed by Prof.
Takao Gunji of Osaka University) at ICOT.
[Note: Japanese names have been rewritten in the order .]
This directory contains the original version from ICOT for UNIX
workstations.
===========================================================================
Package: lang/prolog/impl/clp/cup/jpsg/
Name: JPSG
Summary: Japanese Phrase Structure Grammar parser in CUP
Version: 1.3 (2-JUL-93)
Description:
cu-Prolog (Constraint Unification Prolog) is an experimental
constraint logic programming language available free from Japan's
Institute for New Generation Computer Technology (ICOT). Unlike most
conventional CLP systems, cu-Prolog allows user-defined predicates as
constraints. cu-Prolog is a complete implementation of Constraint
Unification (cu), hence the name.
cu-Prolog is suitable for implementing a natural language processing
system for unification-based grammars. For example, the cu-Prolog
developers implemented a JPSG (Japanese Phrase Structure Grammar)
parser in cu-Prolog with the JPSG Working Group (headed by Prof.
Takao Gunji of Osaka University) at ICOT.
[Note: Japanese names have been rewritten in the order .]
===========================================================================
Package: lang/prolog/impl/clp/cup/mac/
Name: MacCUP
Summary: Macintosh version of cu-Prolog III
Version: MacCup 080c (7-SEP-93)
Description:
cu-Prolog (Constraint Unification Prolog) is an experimental
constraint logic programming language available free from Japan's
Institute for New Generation Computer Technology (ICOT). Unlike most
conventional CLP systems, cu-Prolog allows user-defined predicates as
constraints. cu-Prolog is a complete implementation of Constraint
Unification (cu), hence the name.
cu-Prolog is suitable for implementing a natural language processing
system for unification-based grammars. For example, the cu-Prolog
developers implemented a JPSG (Japanese Phrase Structure Grammar)
parser in cu-Prolog with the JPSG Working Group (headed by Prof.
Takao Gunji of Osaka University) at ICOT.
[Note: Japanese names have been rewritten in the order .]
This directory contains MacCUP, the Apple Macintosh version of
cu-Prolog III. It was ported by Professor Hidetosi Sirai of Chukyo
University.
===========================================================================
Package: lang/prolog/impl/clp/cup/msdos/
Name: DJCup
Summary: MS-DOS version of cu-Prolog III
Version: DJCup 3.80d (7-SEP-93)
Description:
cu-Prolog (Constraint Unification Prolog) is an experimental
constraint logic programming language available free from Japan's
Institute for New Generation Computer Technology (ICOT). Unlike most
conventional CLP systems, cu-Prolog allows user-defined predicates as
constraints. cu-Prolog is a complete implementation of Constraint
Unification (cu), hence the name.
cu-Prolog is suitable for implementing a natural language processing
system for unification-based grammars. For example, the cu-Prolog
developers implemented a JPSG (Japanese Phrase Structure Grammar)
parser in cu-Prolog with the JPSG Working Group (headed by Prof.
Takao Gunji of Osaka University) at ICOT.
[Note: Japanese names have been rewritten in the order .]
This directory contains DJCup, the MS-DOS version of CU-Prolog III
compiled with DJ's gcc. It runs under the DOS-extendr (386/486 cpu)
and was compressed using LHA. DJCup was ported by Professor
Hidetosi Sirai of Chukyo University. A manual is included in the
distribution.
===========================================================================
Package: lang/prolog/impl/clp/cup/unix/
Name: cu-Prolog III
Summary: Extended UNIX version
Version: CUP extended version 3.80d (27-AUG-93)
Description:
cu-Prolog (Constraint Unification Prolog) is an experimental
constraint logic programming language available free from Japan's
Institute for New Generation Computer Technology (ICOT). Unlike most
conventional CLP systems, cu-Prolog allows user-defined predicates as
constraints. cu-Prolog is a complete implementation of Constraint
Unification (cu), hence the name.
cu-Prolog is suitable for implementing a natural language processing
system for unification-based grammars. For example, the cu-Prolog
developers implemented a JPSG (Japanese Phrase Structure Grammar)
parser in cu-Prolog with the JPSG Working Group (headed by Prof.
Takao Gunji of Osaka University) at ICOT.
[Note: Japanese names have been rewritten in the order .]
This directory contains the UNIX version extended by Professor
Hidetosi Sirai of Chukyo University.
===========================================================================
Topic: lang/prolog/impl/fp_lp/
Summary: Implementations of Functional/Logic Programming Languages
Description:
This directory contains a variety of language implementations that
integrate functional programming and logic programming.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Functional Programming, Logic Programming,
Programming Languages!Functional Programming,
Programming Languages!Logic Programming, Prolog!Implementations
Contains:
alf/ ALF: Algebraic Logic Functional programming language
aspect/ ASpecT: A functional logic programming language.
eql/ EqL: General purpose language combining functional and logic
programming
fp/ FP: A C implementation of John Backus' "FP" language.
life/ Wild_LIFE: Implementation of LIFE, a programming language that
integrates functional programming, logic programming, and
object-oriented programming.
See Also: ?
===========================================================================
Package: lang/prolog/impl/fp_lp/alf/
Name: ALF
Summary: Algebraic Logic Functional programming language
Version: 23-JUN-92 (ALF preprocessor 0.7.3, FlatALF Compiler
2.13, A-WAM Bytecode Interpreter 0.5.9)
Description:
ALF (Algebraic Logic/Functional programming language) is a programming
language that combines functional and logic programming techniques.
ALF is based on Horn clause logic with equality. Predicates and Horn
clauses are used for logic programming, and functions and equations
for functional programming. Any functional expression can be used in a
goal literal, and any predicate can occur in the conditions of an
equation.
The ALF system is implemented using a combination of resolution,
narrowing, rewriting and rejection. The resolution rule is used to
solve literals and narrowing to evaluate functional expressions. The
number of possible narrowing steps is reduced by a leftmost-innermost
basic narrowing strategy, and terms are simplified by rewriting before
narrowing is applied. Equations are also rejected if the two sides
have different constructors at the top. Rewriting and rejection can
result in a large reduction of the search tree. Thus the operational
semantics of ALF is more efficient than Prolog's resolution strategy.
Like Prolog, ALF uses a backtracking strategy corresponding to a
depth-first search in the derivation tree. ALF programs are compiled
into instructions of an abstract machine based on the Warren Abstract
Machine (WAM) with several extensions to implement narrowing and
rewriting. The emulator for A-WAM programs is written in C.
===========================================================================
Package: lang/prolog/impl/fp_lp/aspect/
Name: ASpecT
Summary: A functional logic programming language.
Version:
Description:
ASpecT is a strict functional language that compiles to C and is
designed to be highly portable and fast.
===========================================================================
Package: lang/prolog/impl/fp_lp/eql/
Name: EqL
Summary: General purpose language combining functional and logic
programming
Version: 1.0 (May 1987)
Description:
EqL is a general-purpose language that combines the capabilities of
functional and logic programming languages. A program in EqL consists
of a collection of conditional, pattern-directed rules, where the
conditions are expressed as a conjunction of equations, and the
patterns are terms built up of data-constructors and basic values.
Due to its expressional syntax, EqL directly supports functional
programming. EqL also supports logic programming, as all its
variables are 'logical variables' and Prolog-style nondeterminism is
allowed. A limited form of constraint reasoning, going beyond
traditional functional and logic programming, is also supported.
Further details of the language are described in UNC TR 87-010.
The declarative semantics of a set of equations is expressed in terms
of its complete set of solutions. The computational paradigm in EqL is
equation solving, which may also be viewed as a form of 'innermost
narrowing', a restriction on narrowing that enables more efficient
computation of solutions (see the 1988 IEEE-SE paper for details).
The EqL interpreter runs about half as fast as the C-Prolog
interpreter on Vaxes and Suns, and has a modest number of features
to aid debugging and program testing.
===========================================================================
Package: lang/prolog/impl/fp_lp/fp/
Name: FP
Summary: A C implementation of John Backus' "FP" language.
Version: 5-JAN-1990
Description:
This directory contains a C implementation of John Backus' "FP"
functional programming language. Includes examples of bubble sort,
discrete Fourier transform, prime number generation, and regression
testing.
===========================================================================
Package: lang/prolog/impl/fp_lp/life/
Name: Wild_LIFE
Summary: Implementation of LIFE, a programming language that
integrates functional programming, logic programming, and
object-oriented programming.
Version: 1.0 (18-MAR-94); 0.91 (11-FEB-93)
Description:
LIFE (Logic, Inheritance, Functions, and Equations) 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. It subsumes, and fully
contains the functionality of, the precursor languages LOGIN and Le_Fun.
The syntax of Wild_LIFE has been kept as close as possible to that of the
Edinburgh family of Prolog so that Prolog compatibility is easy to
achieve.
From a theoretical point of view, LIFE implements a constraint logic
programming language with equality (unification) and entailment (matching)
constraints over order-sorted feature terms. The interplay of unification
and matching provides an implicit coroutining facility thanks to an
automatic suspension mechanism. This allows interleaving interpretation
of relational and functional expressions which specify structural
dependencies on objects.
Wild_LIFE includes a set of non-trivial example programs including an
incremental Gaussian equation solver, a PERT scheduler, a full LIFE
parser, a flower-drawing program that handles X events, uses an X
toolkit and a 3D turtle graphics package written in LIFE and compiles
rewrite rules into LIFE. It also includes an extensive test suite to
verify the correct operation of the interpreter.
===========================================================================
Topic: lang/prolog/impl/lp/
Summary: Logic programming language implementations other than Prolog.
Description:
Sources for a logic programming language implementations other than Prolog.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Logic Programming, Programming Languages!Logic Programming
Contains:
coral/ CORAL: Deductive database/logic programming language.
lolli/ Lolli: An interpreter for linear logic programming.
See Also: ?
===========================================================================
Package: lang/prolog/impl/lp/coral/
Name: CORAL
Summary: Deductive database/logic programming language.
Version: 1.1 (2-FEB-94)
Description:
CORAL is a deductive database/logic programming system developed at
the University of Wisconsin-Madison. It is a declarative language
based on Horn-clause rules with extensions like SQL's group-by and
aggregation operators, and uses a Prolog-like syntax.
CORAL supports many evaluation techniques, including bottom-up
fixpoint evaluation and top-down backtracking, a module mechanism,
support for disk-resident data, a C++ interface, and an on-line help
facility.
===========================================================================
Package: lang/prolog/impl/lp/lolli/
Name: Lolli
Summary: An interpreter for linear logic programming.
Version: 7.01 (1-DEC-92)
Description:
Lolli is an interpreter for logic programming based on intuitionist
linear logic principles. Lolli, named for the linear logic implication
operator "-o" called lollipop, is a full implementation of the
language described in the Hodas & Miller paper "Logic Programming in a
Fragment of Intuitionistic Linear Logic", though it differs a bit in
syntax, and has several built-in extra-logical predicates and
operators.
The logic underlying 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 that can be used as many, or as
few, times as desired, and those that must be used exactly once.
These features have been used to provide a perspicuous, logical
implementation of a number of example problems, including
object-oriented programming with mutable state and information hiding,
database update, and term rewriting. Lolli has also been used as the
setting for the development of a filler-gap dependency parser for
natural language processing (see Hodas's JICSLP-92 paper).
The preliminary implementation of Lolli is based on code written by
Pfenning and Elliot for their paper "A Semi-Functional Implementation
of a Higher-Order Logic Programming Language".
The system is written in Standard ML of New Jersey, and the parser and
lexer were built using the parser-generator (MLYACC) and
lexical-analyzer-generator (MLLEX) distributed with that system.
Though source files for the parser and lexer have been included, the
parser and lexer have already been built, so you do not need access to
the MLYACC or MLLEX.
===========================================================================
Topic: lang/prolog/impl/other/
Summary: Other logic-related languages of interest.
Description:
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Logic Languages, Programming Languages!Logic
Contains:
goedel/ Goedel: Prolog-like language with improved declarative
semantics.
ho_unif/ HO_UNIF: Higher Order E-Unification
prosit/ PROSIT: Programming in SItuation Theory
sel2/ SEL2: Declarative set-processing language that generates WAM
code
See Also: ?
===========================================================================
Package: lang/prolog/impl/other/goedel/
Name: Goedel
Summary: Prolog-like language with improved declarative semantics.
Version: 1.4 (16-MAY-94); 1.3.27 (24-JAN-94)
Description:
GOEDEL is intended to be a declarative successor to Prolog. The main
design aim of Goedel is to have functionality and expressiveness
similar to Prolog, but to have greatly improved declarative semantics
compared with Prolog. This improved declarative semantics has
substantial benefits for program construction, compilation,
verification, debugging, analysis, transformation, and so on.
Considerable emphasis is placed on Goedel's meta-logical facilities,
since this is where Prolog is most deficient. In particular, Goedel
has declarative replacements for Prolog's var, nonvar, assert, and
retract. Goedel is a strongly typed language, its type system being
based on many-sorted logic with parametric polymorphism.
Goedel's features include a module system, support for infinite
precision integers, infinite precision rationals, and floating-point
numbers, and support for processing of finite sets. It can solve
constraints over finite domains of integers and also linear rational
constraints. It supports processing of finite sets. It also
has a flexible computation rule and a pruning operator which
generalizes the commit of the concurrent logic programming languages.
The release includes the Goedel system, the SAGE partial evaluator
for Godel, a user manual, and 50 example programs.
===========================================================================
Package: lang/prolog/impl/other/ho_unif/
Name: HO_UNIF
Summary: Higher Order E-Unification
Version: 26-AUG-93
Description:
This directory contains an experimental implementation of of higher
order E-Unification developed at the FZI, Karlsruhe. It implements
the modular higher order E-Unification of Nipkow, Qian and Wang with
optimizations described in Franz Weber's PhD thesis.
===========================================================================
Package: lang/prolog/impl/other/prosit/
Name: PROSIT
Summary: Programming in SItuation Theory
Version: 0.3 (10-AUG-91)
Description:
PROSIT (Programming in SItuation Theory) is a programming language
similar to Prolog but based on Situation Theory instead of standard
first-order logic. PROSIT is a declarative language, that is,
programs and data in PROSIT are all just sets of declarative elements
called infons. Answering queries about these infons is the
fundamental action that the PROSIT interpreter carries out. But
unlike Prolog, PROSIT contains mechanisms for dealing with the
``situations'' of Situation Theory. Infons in PROSIT are not absolute
and global; they are local to situations. Situations may be set up to
inherit information from other situations. Situations may contain any
kind of information, including information about infons and
situations. PROSIT also supports forward chaining, in which the
addition of new infons triggers the addition of other new infons,
creating a constant flow of information through the system. And as in
Prolog, PROSIT can prove queries through backward chaining.
===========================================================================
Package: lang/prolog/impl/other/sel2/
Name: SEL2
Summary: Declarative set-processing language that generates WAM code
Version: 2
Description:
SEL (Subset-Equational Language) is a declarative set processing
language. Its main features are subset and equational program clauses,
pattern matching over sets, support for efficient iteration and
point-wise/incremental computation over sets, the ability to define
transitive closures through circular constraints, meta-programming and
simple higher-order programming, and a modest user-interface including
tracing. The language seems well-suited to a number of problems in
graph theory, program analysis, and discrete mathematics. The SEL
compiler is written in Quintus Prolog and the run-time system is
written in C. It generates WAM-like code, extended to deal with
set-matching, memoization, and the novel control structure of the
language.
The release comes with a user manual, bibliography of papers
(including .dvi files), several sample programs, and source code.
Example programs include a miniature Eliza, higher-order and
meta-programming with apply and univ, permutations, quicksort,
maxflow using min-cut, lazy evaluator for equations, shortest
distance in a directed graph, strongly connected components, and a
meta-interpreter for basic SEL in SEL.
===========================================================================
Topic: lang/prolog/impl/parallel/
Summary: Free/Shareware Parallel Prolog implementations
Description:
Sources for a large collection of parallel Prolog implementations.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Programming Languages!Parallel Prolog, Prolog!Implementations
Contains:
akl/ AKL: Andorra Kernel Language, a concurrent constraint
programming language.
bebop/ BeBOP, bp, and pnp: Parallel Object-Oriented Logic Programming
fcp/ FCP: Flat Concurrent Prolog
ncl/ NCL: Net-Clause Language
pcn/ PCN: Program Composition Notation
rolog/ ROLOG: Parallel Prolog compiler with a reduce-OR process model.
See Also: ?
===========================================================================
Package: lang/prolog/impl/parallel/akl/
Name: AKL
Summary: Andorra Kernel Language, a concurrent constraint
programming language.
Version: 0.9 (9-NOV-93)
Description:
AKL (Andorra Kernel Language) is a concurrent constraint programming
language that supports both Prolog-style programming and committed
choice programming. Its control of don't-know nondeterminism is based
on the Andorra model, which has been generalized to also deal with
nondeterminism encapsulated in guards and aggregates (such as bagof)
in a concurrent setting.
The Basic Andorra Model is a way to execute definite clause programs
that allows dependent and-parallelism to be exploited transparently.
It also supports nice programming techniques for search programs. The
idea is to first reduce all goals that match at most one clause. When
no such goal exists, any goal (e.g., the left-most) may be chosen.
The BAM was proposed by David H. D. Warren, and his group at Bristol
has developed an AND-OR parallel implementation called Andorra-I,
which also supports full Prolog.
This implementation of the AKL Programming System (AKL/PS) consists of
a compiler from AKL to PAM, a Prototype Abstract Machine for AKL, and
an emulator for PAM written in C.
===========================================================================
Package: lang/prolog/impl/parallel/bebop/
Name: BeBOP, bp, and pnp
Summary: Parallel Object-Oriented Logic Programming
Version: 1.0 (13-SEP-93)
Description:
The BeBOP language combines the features of sequential and parallel
Logic Programming (LP), object oriented programming and meta-level
programming. The goal of the system is to support the construction of
multi-agent systems.
The LP component offers both don't know non-determinism and stream
AND-parallelism, a combination not possible with concurrent LP
languages. BeBOP's object oriented features include object IDs,
encapsulation, message passing, state updating, and object behavior
modification. The meta-level capabilities are based on the treatment
of Prolog theories as first order entities, which enables them to be
updated easily, and for fragments to be passed between objects in
messages.
An interactive interpreter named BP is included in the distribution.
It supports incremental compilation and execution, and allows the
communication links within an object network to be specified
dynamically. BP also includes a history mechanism, allowing
syntactically correct goals to be repeated, listed, and modified.
Variables from previous queries can also be reused in later queries.
BP is a superset of NU-Prolog's interpreter NP and so can seamlessly
combine objects and prolog goals.
BeBOP programs are compiled into NU-Prolog, and its parallel
extension, PNU-Prolog (PNP). An unusual aspect of this is the way in
which object IDs are utilized as a communication mechanism between
objects. Code for the PNP preprocessor is included in the distribution.
NU-Prolog (AKA MU-Prolog) is a prolog interpreter implemented in C for
BSD Unix available from the University of Melbourne. Source licenses
are available for educational institutions. For more information,
write to University of Melbourne, MU-Prolog Distribution, Department
of Computer Science, Parkville, Victoria 3052, Australia, call
+61-3-344-7270, or send email to lee@cs.mu.oz.au or jws@cs.mu.oz.au.
===========================================================================
Package: lang/prolog/impl/parallel/fcp/
Name: FCP
Summary: Flat Concurrent Prolog
Version: 16-MAY-84
Description:
This directory contains a compiler for Flat Concurrent Prolog. It
compiles FCP clauses into PROLOG clauses and executes these according
to the definition of FCP. The FCP to PROLOG compiler is a modification
of the Concurrent Prolog to PROLOG compiler of Chikayama implemented
by Udi Shapiro & Colin Mierowsky.
Flat Concurrent Prolog corresponds to the AND parallel subset of
Concurrent Prolog. It was introduced in order to gain experience with
a number of implementation issues relating to Concurrent Prolog and to
provide a basis for experimentation with various distributed and
parallel algorithms.
An FCP program differs from a CP program in that guard systems contain
only boolean combinations (conjunctions and negations) of simple test
predicates (guard_kernel predicates). Declaratively, FCP programs are
the same as CP programs, but differ procedurally.
===========================================================================
Package: lang/prolog/impl/parallel/ncl/
Name: NCL
Summary: Net-Clause Language
Version: 2.0 (1-JUL-93)
Description:
NCL (Net-Clause Language) is aimed at describing distributed
computation models using term unification as a basic processing and
control mechanism. It is embedded in standard Prolog and comprises two
parts -- net-clauses and data-driven rules, which can communicate each
to other and to standard Prolog programs through the unified
representation of terms, the unification procedure and the database
mechanism provided by Prolog.
A net-clause is a special domain in the database defining a network of
nodes and links. The nodes are represented by Prolog compound terms.
The variables occurring within the nodes are global logical variables,
which can be shared within the scope of the net-clause thus playing
the role of network links. The net-clause nodes define local
conditions for unification of terms or execution of Prolog goals.
Thus two basic control mechanisms are implemented:
- A spreading activation scheme similar to the connectionist
spreading activation and to the marker passing mechanism in
semantic nets. In the framework of logic programming it is
seen as a restricted (no recursion) forward chaining
computation.
- A default mechanism based on using variables to propagate
terms without being bound to them, thus implementing the
non-monotonicity of default reasoning. This is similar to
Reiter's default assignment to variables.
The Data-driven Rules implement a full scale forward chaining for Horn
clauses. They simulate a data-driven parallel computation, where each
rule is a process (in contrast to the traditional parallel logic
programming, like PARLOG, where each goal is a process).
It is worth noting that NCL/Prolog is implemented in C as an augmented
Prolog interpreter together with some Prolog routines, so it can also
be used as a Prolog interpreter.
NCL includes several annotated example programs: natural language
parsing and semantic analysis, model-based diagnosis of a binary
adder, 4-queens problem, recognition of geometric figures, and
data-driven inductive learning.
===========================================================================
Package: lang/prolog/impl/parallel/pcn/
Name: PCN
Summary: Program Composition Notation
Version: 2.0 (2-FEB-93)
Description:
PCN (Program Composition Notation) is a system for developing and
executing parallel programs. It is not a logic programming language,
but it has similarities to Strand and other concurrent logic
programming languages. PCN provides a simple language for specifying
concurrent algorithms, interfaces to Fortran and C, a portable toolkit
that allows applications to be developed on a workstation or small
parallel computer and run unchanged on supercomputers, and integrated
debugging and performance analysis tools. PCN includes a runtime
system, compiler, linker, a set of standard libraries, virtual
topology tools, a symbolic debugger (PDB), an execution profiler
(Gauge), and a trace analysis tool (Upshot).
PCN was developed at Argonne National Laboratory and the California
Institute of Technology.
===========================================================================
Package: lang/prolog/impl/parallel/rolog/
Name: ROLOG
Summary: Parallel Prolog compiler with a reduce-OR process model.
Version: 1.0 (28-NOV-89)
Description:
ROLOG is a parallel PROLOG compiler with a reduce-OR process model.
It is machine independent, and runs on both shared and nonshared memory
machines.
Example programs include N-Queens, Towers of Hanoi, and Quicksort.
===========================================================================
Topic: lang/prolog/impl/prolog/
Summary: Free/Shareware Prolog implementations
Description:
Sources for a large collection of Prolog implementations.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Programming Languages!Prolog, Prolog!Implementations
Contains:
adapdpro/ ADA PD Prolog: Slow Prolog for MS-DOS systems.
aquarius/ Aquarius Prolog: Information about Aquarius Prolog, a free
(with license) high-performance portable implementation of
Prolog.
beta_pl/ Beta Prolog: Fast and portable Prolog emulator and compiler.
bin_pl/ BinProlog: Fast, small, and portable Prolog compiler.
eclipse/ ECLiPSe: ECRC Logic Programming System
elp/ eLP: Ergo Lambda Prolog
eslpdpro/ ESL Prolog-2 (PD Version): Good performance public domain
(limited) version of a Prolog for MS-DOS systems.
frolic/ FROLIC: Prolog implemented in Common Lisp and integrated with
the FROBS knowledge representation system
icp/ ICP: IC-Prolog ][, a multi-threaded Prolog implementation
suitable for distributed applications.
jbprolog/ JB-Prolog: Fast Prolog Demo System for the Macintosh
lmprolog/ LM-Prolog: Prolog implemented in ZetaLisp for Lisp Machines.
lp/ LP: Lambda Prolog
mac_pl/ MacProlog: Demonstration version of LPA MacProlog.
op/ Open Prolog: Prolog interpreter for the Apple Macintosh
pdprolog/ A.D.A. PD Prolog: A slow Prolog for MS-DOS systems.
pm/ Prolog/Mali: Compiler for higher-order Lambda Prolog
ppicl/ FJ PPiCL: Portable Prolog in Common Lisp from Japan
prolog2r/ PrologIIR: Un interpreteur de Prolog.
prolog68/ Prolog68: WAM-based Prolog for Atari ST and TT computers.
sbprolog/ SB-Prolog: Stony Brook Prolog
schelog/ Schelog: Embedding of Prolog in Scheme
scm_pl/ Prolog implemented in Scheme, with interval arithmetic.
sicstus/ SICStus: Information about SICStus Prolog for Unix.
swi_pl/ SWI Prolog: Fairly complete Edinburgh-style Prolog.
tricia/ Tricia Prolog: Edinburgh-style Prolog for Macintosh (and UNIX).
unsw_pl/ UNSW Prolog: Prolog for the Amiga
wamcc/ WAMCC: WAM-based Prolog to C compiler
xsb/ XSB Prolog: Prolog extended with OLDT (tabling) and Hilog
terms.
See Also: ?
===========================================================================
Package: lang/prolog/impl/prolog/adapdpro/
Name: ADA PD Prolog
Summary: Slow Prolog for MS-DOS systems.
Version: 1.91 (28-MAY-86)
Description:
A.D.A. Public Domain Prolog is a rather slow implementation of Prolog
for MS-DOS systems, originally a product of Automata Design Associates
(now defunct).
The distribution includes some sample expert systems, a few games
written in Prolog (including Towers of Hanoi), a few puzzles, and Lou
Schumacher's ATN-based natural language parser.
A simple editor implemented by Li Su of Richfield, Minnesota, is included.
===========================================================================
Package: lang/prolog/impl/prolog/aquarius/
Name: Aquarius Prolog
Summary: Information about Aquarius Prolog, a free (with license)
high-performance portable implementation of Prolog.
Version:
Description:
Aquarius Prolog is a high-performance, portable Prolog implementation
developed since 1989 by the Aquarius Project at UC/Berkeley, the Advanced
Computer Architecture Laboratory (ACAL) at the University of Southern
California (USC), and at Digital Equipment Corporation's Paris Research
Laboratory. The developers are Tom Getzinger, Ralph Clarke Haygood, and
Peter Van Roy. Aquarius Prolog includes:
- A compiler with global analysis. The compiler is built around the
Berkeley Abstract Machine (BAM) execution model for Prolog. BAM
retains desirable features of the Warren Abstract Machine (WAM),
but allows for significant further optimizations and is easier to
map onto actual general-purpose machines.
- A back-end that maps the BAM onto various actual general-purpose
machines, including MIPS R3000 (DEC Ultrix and MIPS RISC/os),
SPARC (SunOS), HP 9000 300/400 with MC68020, MC68030 or MC68040
processors (HP-UX), and Sun3 (SunOS).
- A run-time system offering substantially the same built-in
predicates and memory management as Quintus Prolog, with additions
such as two kinds of destructive assignment. Most of the built-in
predicates are written in Prolog, with little or no performance
penalty.
Aquarius Prolog also includes an interpreter and documentation.
Aquarius Prolog comes in two distributions, Enduser and Full. The
latter includes full source code and implementation notes.
*******************************************************************
*** NOTE: It is not possible to put Aquarius itself in the ***
*** Repository or on the CD-ROM, because its use requires a ***
*** license agreement, but the license is free. This directory ***
*** contains the Release Announcement, some readme.txt files ***
*** and other documentation, and the License Agreement. ***
*******************************************************************
===========================================================================
Package: lang/prolog/impl/prolog/beta_pl/
Name: Beta Prolog
Summary: Fast and portable Prolog emulator and compiler.
Version: 1.1 (11-MAR-94)
Description:
Beta-Prolog is an experimental Prolog system that provides many
facilities for specifying and solving combinatorial problems. It
supports the definition and manipulation of Boolean tables which can
be used to represent graphs, simple and hierarchical domains, and
situations in various combinatorial problems. Beta-Prolog also
provides several primitives for describing constraint satisfaction
problems declaratively.
The Beta-Prolog system consists of an emulator of the TOAM (matching
Tree Oriented Abstract Machine) written in C and a compiler of
Beta-Prolog written in Beta-Prolog itself. It differs from
WAM-based systems mainly in the following two aspects:
(1) It translates predicates into trees and generates
multi-level hashing code for predicates;
(2) It passes arguments directly in stack frames
like most compilers of procedural languages.
Beta-Prolog is currently one of the fastest emulator-based Prolog
systems. It will be of interest to Prolog users, programmers
investigating search algorithms for combinatorial problems, and
researchers who want to develop high-performance Prolog systems and/or
evaluate compilation techniques for Prolog.
===========================================================================
Topic: lang/prolog/impl/prolog/bin_pl/
Name: BinProlog
Summary: Fast, small, and portable Prolog compiler.
Description:
BinProlog replaces the WAM by a more compact continuation passing
logic engine based on a mapping of full Prolog to binary logic
programs. It includes an interface Tcl/Tk.
The compiler makes 528 KLIPS on a Sparc 10-40 (101 KLIPS on a NeXT)
and still uses a very small (49K under Solaris 2.1) emulator, making
it among the fastest freely available C-emulated Prologs (3-5 times
faster than C-Prolog, 2-3 times faster than SWI-prolog, 1.5-2 times
faster than (X)SB-prolog and close to C-emulated Sicstus 2.1.).
BinProlog's very small code-size and high performances make it
suitable to be integrated in industrial C-applications that need
the services of an embedded logic programming engine.
Multi-BinProlog 2.00 is a prototype Linda-style parallel extension to
BinProlog 1.71 developed by Koen De Bosschere and Paul Tarau. This
version uses Koen's C-parser and C-writer which together speed-up IO
considerably. It works with shared-memory and remote procedure calls.
BinProlog includes many examples, such as a VT100 implementation of
Tetris, a breadth-first meta-interpreter, an implementation of
backpropagation (neural nets), a CHAT parser, and implementations of
knight's tour and N-queens.
===========================================================================
Package: lang/prolog/impl/prolog/bin_pl/bp/
Name: BinProlog
Summary: Fast, small, and portable Prolog compiler.
Version: 2.20 (7-JAN-94)
Description:
BinProlog replaces the WAM by a more compact continuation passing
logic engine based on a mapping of full Prolog to binary logic
programs. It includes an interface Tcl/Tk.
The compiler makes 528 KLIPS on a Sparc 10-40 (101 KLIPS on a NeXT)
and still uses a very small (49K under Solaris 2.1) emulator, making
it among the fastest freely available C-emulated Prologs (3-5 times
faster than C-Prolog, 2-3 times faster than SWI-prolog, 1.5-2 times
faster than (X)SB-prolog and close to C-emulated Sicstus 2.1.).
BinProlog's very small code-size and high performances make it
suitable to be integrated in industrial C-applications that need
the services of an embedded logic programming engine.
Multi-BinProlog 2.00 is a prototype Linda-style parallel extension to
BinProlog 1.71 developed by Koen De Bosschere and Paul Tarau. This
version uses Koen's C-parser and C-writer which together speed-up IO
considerably. It works with shared-memory and remote procedure calls.
BinProlog includes many examples, such as a VT100 implementation of
Tetris, a breadth-first meta-interpreter, an implementation of
backpropagation (neural nets), a CHAT parser, and implementations of
knight's tour and N-queens.
===========================================================================
Package: lang/prolog/impl/prolog/bin_pl/mbp/
Name: MultiBinProlog
Summary: Linda-style Parallel extension to BinProlog
Version: 2.00 (10-JUN-93)
Description:
BinProlog replaces the WAM by a more compact continuation passing
logic engine based on a mapping of full Prolog to binary logic
programs. It includes an interface Tcl/Tk.
The compiler makes 528 KLIPS on a Sparc 10-40 (101 KLIPS on a NeXT)
and still uses a very small (49K under Solaris 2.1) emulator, making
it among the fastest freely available C-emulated Prologs (3-5 times
faster than C-Prolog, 2-3 times faster than SWI-prolog, 1.5-2 times
faster than (X)SB-prolog and close to C-emulated Sicstus 2.1.).
BinProlog's very small code-size and high performances make it
suitable to be integrated in industrial C-applications that need
the services of an embedded logic programming engine.
Multi-BinProlog 2.00 is a prototype Linda-style parallel extension to
BinProlog 1.71 developed by Koen De Bosschere and Paul Tarau. This
version uses Koen's C-parser and C-writer which together speed-up IO
considerably. It works with shared-memory and remote procedure calls.
BinProlog includes many examples, such as a VT100 implementation of
Tetris, a breadth-first meta-interpreter, an implementation of
backpropagation (neural nets), a CHAT parser, and implementations of
knight's tour and N-queens.
===========================================================================
Package: lang/prolog/impl/prolog/bin_pl/tcl/
Name: Tcl/Tk
Summary: X-Windows Toolkits
Version: TCL 7.3, TK 3.6
Description:
This directory contains the Tcl/Tk X-Windows toolkits for use with
binprolog. Tcl stands for ``tool command language'' and is
pronounced ``tickle.''
Tcl is actually two things: a language and a library. First, Tcl is a
simple textual programming language, intended primarily for issuing
commands to interactive programs such as text editors, debuggers,
illustrators, and shells. Second, Tcl is a library package that can be
embedded in application programs.
Tk is an extension to Tcl which provides the programmer with an
interface to the X11 windowing system.
For more information, see the Tcl/Tk FAQ in faq.tgz.
===========================================================================
Package: lang/prolog/impl/prolog/eclipse/
Name: ECLiPSe
Summary: ECRC Logic Programming System
Version: 3.4
Description:
ECLiPSe (ECRC Logic Programming System) combines the functionalities
of several ECRC systems, including Sepia, MegaLog and CHIP. ECLiPSe
includes a Prolog compiler with extended functionality that is Quintus
and SICStus compatible, a tightly connected database system based on
the BANG file system, a CLP system, and an interface to the Tcl/Tk X11
toolkit. The BANG database can store not only relations, but also any
Prolog structures and programs. The CLP system contains several
libraries with various types of constraint handling schemes, including
atomic finite domains, linear rational constraints, CHR (constraint
handling rules) and Propia (generalized propagation). It also
supports writing further extensions like new user-defined constraints
or complete new constraint solvers. ECLiPSe also includes a profiler,
user-definable syntax, metaterms as first-class citizens, coroutining,
and unlimited precision integer and rational numbers.
****************************************************************
*** NOTE: It is not possible to put ECLiPSe itself in the ***
*** Repository or on the CD-ROM, because its use requires a ***
*** license agreement and payment of a nominal fee. This ***
*** directory contains the ECLiPSe documentation and some ***
*** shareware packages that have been ported to ECLiPSe. ***
****************************************************************
===========================================================================
Package: lang/prolog/impl/prolog/elp/
Name: eLP
Summary: Ergo Lambda Prolog
Version: 0.15 (12-FEB-90)
Description:
eLP (Ergo Lambda Prolog) is an interpreter written by Conal Elliott,
Frank Pfenning and Dale Miller in Common Lisp and implements the core
of lambda Prolog (higher-order hereditary Harrop formulas). It is
embedded in a larger development environment called ESS (the Ergo
Support System). eLP implements all core language feature and offers
a module system, I/O, some facilities for tracing, error handling,
arithmetic, recursive top-levels, on-line documentation and a number
of extended examples, including many programs from Amy Felty's and
John Hannan's thesis.
(Lambda Prolog extends Prolog with a polymorphic type system,
higher-order programming, simply typed lambda-terms as data
structures, higher-order unification, scoping mechanisms for program
clauses and parameters, and modules and data abstraction.)
****************************************************************
*** Note: Although eLP is still distributed, it is no longer ***
*** actively maintained. ***
****************************************************************
===========================================================================
Package: lang/prolog/impl/prolog/eslpdpro/
Name: ESL Prolog-2 (PD Version)
Summary: Good performance public domain (limited) version of a
Prolog for MS-DOS systems.
Version: 2.30 (30-JAN-91)
Description:
ESL Prolog-2 (PD Version) is a public domain Prolog interpreter for
IBM PC (MS-DOS) systems with good performance. It deviates
slightly from Edinburgh standard (strings "like this" are not lists
of ASCII codes), but you can add a declaration that makes it fully
Edinburgh-compatible. (To do this, add the line
:- state(token_class,_,dec10).
at the beginning of the program.)
ESL PD Prolog is a more limited version of the commercial version of
the interpreter, which is available from Expert Systems Ltd. of
Oxford, England (see contact below). The commercial version is an
Edinburgh standard prolog interpreter and compiler with several
extensions, and runs on Sun3, Sun4, HP9000 (Unix), RS/6000 (Unix), VAX
(VMS), IBM PC (MS-DOS, Windows 3.0/3.1), and 386s. The windows version
includes BIPs for programming windows graphics and dialogues.
Documentation is available as a 2-volume set published by Ablex (type
"prolog2" for info). ESL Prolog is also discussed extensively in Tony
Dodd's book "Prolog: A Logical Approach" from Oxford University Press.
===========================================================================
Package: lang/prolog/impl/prolog/frolic/
Name: FROLIC
Summary: Prolog implemented in Common Lisp and integrated with
the FROBS knowledge representation system
Version: 19-AUG-93
Description:
FROLIC (Frobs + Logic) is an implementation of Prolog in Common Lisp
that allows access to external knowledge bases. It was designed to
provide a prolog-based interface to Frobs data structures. It uses
a Lisp-like syntax instead of Prolog's syntax.
Examples include a simple Eliza-like program.
===========================================================================
Package: lang/prolog/impl/prolog/icp/
Name: ICP
Summary: IC-Prolog ][, a multi-threaded Prolog implementation
suitable for distributed applications.
Version: ICP 0.96 (28-SEP-93); Parlog 1.5.9 (29-SEP-93)
Description:
IC-Prolog ][ (ICP) is a multi-threaded Prolog system developed at
Imperial College. Multiple threads allow queries to be executed
concurrently. ICP also has an interface to Unix TCP/IP system calls
and "mailboxes", a high level communication system. This interface
together with multiple threads enables distributed applications (such
as client/server systems) to be written in Prolog.
The package also includes a preprocessor for the Logic & Objects (L&O)
object-oriented extension to Prolog. This gives a powerful structuring
mechanism for Prolog programs as well as providing a logical
interpretation of inheritance and other object-oriented features.
(The sources for the L&O extension is also available to LPA MacProlog
users in the subdirectory 'lo'.)
Parlog has been integrated with IC-Prolog ][ as a separate thread, so
applications may be written in either language depending on which is
more suitable. (Standalone versions of the Parlog system for Sun-3 and
Sun-4 can be found in the parlog/ directory.)
The package also includes a simple expert system shell called Skilaki.
===========================================================================
Package: lang/prolog/impl/prolog/icp/lo/
Name: LO
Summary: Logic and Objects
Version:
Description:
Logic and Objects (L&O) is an object-oriented extension to Prolog.
This gives a powerful structuring mechanism for Prolog programs as
well as providing a logical interpretation of inheritance and other
object-oriented features.
This directory contains the original version of L&O, which runs under
LPA MacProlog on the Apple Macintosh. The second implementation is
included in the IC-Prolog II distribution itself.
===========================================================================
Package: lang/prolog/impl/prolog/jbprolog/
Name: JB-Prolog
Summary: Fast Prolog Demo System for the Macintosh
Version: 2.1.2 (24-JAN-94)
Description:
JB-Prolog is a slim and powerful prolog for the Macintosh. Its key
features are: Arbitrary long integers, fast interpreter only, source
line debugger, user interface toolkit, persistent objects.
The demo program shows the capabilities of the persistent objects
and user interface toolkit, which have not yet been documented.
===========================================================================
Package: lang/prolog/impl/prolog/lmprolog/
Name: LM-Prolog
Summary: Prolog implemented in ZetaLisp for Lisp Machines.
Version: 4-JAN-90
Description:
LM-Prolog is an implementation of Prolog for the MIT family of Lisp
Machines. The Prolog dialect differs quite a bit from the Edinburgh
Prolog family of dialects both in terms of syntax and built-in
predicates. The bulk of the code was written in 1983, when the
authors were at Uppsala University.
The implementation compiles Prolog predicates to Lisp functions, using
success continuations to emulate the Prolog control structure.
It is implemented in ZetaLisp and depends on features of ZetaLisp that
will make it hard to port to Common Lisp, such as locatives, invisible
pointers, and flavors.
Examples include a Concurrent Prolog interpreter, Warren's
benchmarks, Turtle graphics demos, and the Grammar Kit.
===========================================================================
Package: lang/prolog/impl/prolog/lp/
Name: LP
Summary: Lambda Prolog
Version: 2.7 (10-NOV-88)
Description:
Lambda Prolog is an experimental implementation of a higher-order
logic programming language. It extends Prolog with a polymorphic type
system, higher-order programming, simply typed lambda-terms as data
structures, higher-order unification, scoping mechanisms for program
clauses and parameters, and modules and data abstraction. These new
features are provided in a principled fashion by extending the
classical first-order theory of Horn clauses to the intuitionistic
higher-order theory of hereditary Harrop formulas.
Efficiency was not a consideration in the implementation, so this
version of Lambda Prolog is slow. For a faster and more robust
implementation of the language, see eLP (Ergo Lambda Prolog).
The addition of higher-order unification to a programming language
should be useful in proof systems, program transformation systems,
and natural language understanding systems.
===========================================================================
Package: lang/prolog/impl/prolog/mac_pl/
Name: MacProlog
Summary: Demonstration version of LPA MacProlog.
Version: 3.0
Description:
This directory contains a demonstration version of LPA MacProlog 3.0
===========================================================================
Package: lang/prolog/impl/prolog/op/
Name: Open Prolog
Summary: Prolog interpreter for the Apple Macintosh
Version: 1.0.2d0
Description:
Open Prolog (OP) is a Prolog interpreter for the Apple Macintosh. It
follows the so-called 'Edinburgh' syntax and supports most standard
Prolog features, including Definite Clause Grammars. OP includes a
debugger, good syntax error detection, and a flexible text editor. It
is reasonably fast, and can execute large programs. Extra predicates
can be added via drop-in external predicates, in a manner similar
to Hypercard's XCMDs.
===========================================================================
Package: lang/prolog/impl/prolog/pdprolog/
Name: A.D.A. PD Prolog
Summary: A slow Prolog for MS-DOS systems.
Version: 1.90 (5-MAY-86)
Description:
A.D.A. Public Domain Prolog is a rather slow implementation of Prolog
for MS-DOS systems, originally a product of Automata Design Associates
(now defunct).
The distribution includes some sample expert systems, including Simon
Blackwell's "PIE" Truth Maintenance System, a few games written in
Prolog (including Towers of Hanoi), a few puzzles, and Ludwig J.
Schumacher's ATN-based natural language parser.
************************************************************
*** Note: This and adapdpro are very similar. I haven't ***
*** the differences, and verified that the computer ***
*** algebra system runs in adapdpro, so I'm leaving this ***
*** version around for the time being. ***
************************************************************
===========================================================================
Package: lang/prolog/impl/prolog/pm/
Name: Prolog/Mali
Summary: Compiler for higher-order Lambda Prolog
Version: 1.8 (5-NOV-93)
Description:
Prolog/Mali is a compiler for the higher-order language Lambda Prolog.
Lambda Prolog is an extension of Prolog defined by Miller. It 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.
Prolog/Mali is a complete system which includes a C translator, a
linker, libraries, runtime, and documentation, and runs on UNIX.
Possible applications are the same as standard Prolog, but with a real
plus for those where scoping of variables is important, such as
theorem-proving, implementation of type systems, and formal
transformation on structured programs.
The system is a compiler (written in Prolog/Mali) which produces C
code. The execution scheme uses Mali (an abstract memory for
representing terms with efficient space management). Accordingly,
it is necessary to compile MALI before compiling PM. A copy of MALI
version 6 (16-DEC-93) is included in this directory.
(Lambda Prolog extends Prolog with a polymorphic type system,
higher-order programming, simply typed lambda-terms as data
structures, higher-order unification, scoping mechanisms for program
clauses and parameters, and modules and data abstraction.)
date, version
===========================================================================
Package: lang/prolog/impl/prolog/ppicl/
Name: FJ PPiCL
Summary: Portable Prolog in Common Lisp from Japan
Version: 2.0 (21-NOV-88)
Description:
A portable Prolog interpreter written in Common Lisp.
===========================================================================
Package: lang/prolog/impl/prolog/prolog2r/
Name: PrologIIR
Summary: Un interpreteur de Prolog.
Version: 16-DEC-90
Description:
PrologIIR est un interpreteur prolog compatible avec PrologII de
marseille. Il a ete ecrit par l'equipe MALI de l'INRIA Rennes.
Note au sujet de l'edition du programme depuis PrologIIR: PrologIIR
est une extension de PrologII, notamment, PrologIIR permet d'appeler,
depuis son sein, n'importe quel editeur pour modifer le programme
courant (grace a l'utilisation, par prologIIR, de la variable
d'environnement PrologEdit).
[For those of you who don't understand French:
PrologIIR is a Prolog interpreter using MALI, an efficient memory
system specially designed for Prolog implementations. Compatible with
PrologII from GIA Marseille, it offers rational trees unification and
control predicates such as dif and freeze. Compared with PrologII,
PrologIIR has few new features such as a garbage collector, some
advanced OR-control facilities (a generalized cut), some advanced
AND-control facilities (a delay mechanism based on groundness of
terms), a sound implementation of negation, if-then-else and
implication with explicit universal quantifiers, a configuration file
and an interactive trace. Finally PrologIIR is faster than PrologII
(up to 3 times on PC compatible computers). PrologIIR is available on
Sun3, Sun4, Gould NP1, UTX/32, IBM PC (XT, AT), and Macintosh. Only
the Sun3 and Sun4 versions are included in this distribution.]
===========================================================================
Package: lang/prolog/impl/prolog/prolog68/
Name: Prolog68
Summary: WAM-based Prolog for Atari ST and TT computers.
Version: 0.93
Description:
Prolog68 is a free WAM-based Prolog system running on Atari ST and
TT computers. It is not yet finished (no floating point, some
missing built-ins). Archived in ZOO format.
===========================================================================
Package: lang/prolog/impl/prolog/sbprolog/
Name: SB-Prolog
Summary: Stony Brook Prolog
Version: 2.5, 3.0, 3.1
Description:
SB-Prolog (Stony Brook Prolog) is a Prolog system for Unix and 386
MS-DOS systems. It is based on an extension of the Warren Abstract
Machine, which is written in C for enhanced portability. The
remainder of the system, including the translator from Prolog to the
virtual machine instructions, is written in Prolog. Prolog source
programs can be compiled into machine-independent byte code files,
which contain encodings of WAM instructions and are interpreted by
the simulator. Among SB-Prolog's features are dynamic
loading of predicates, an extension table facility that permits
memoization of relations, macro definition/expansion, and tail
recursion optimizations.
********************************************************************
*** NOTE: SB-Prolog is superseded by XSB and hence is no longer ***
*** supported by Stony Brook or the University of Arizona. The ***
*** only reason to continue using SB-Prolog is for DOS, since ***
*** XSB does not run under DOS and there are currently no plans ***
*** to port it to DOS. XSB is more robust than SB-Prolog and ***
*** XSB's compiler is quite a bit faster. XSB also supports ***
*** tabling (OLDT evaluation) at the engine level, which lets ***
*** you write programs that are much cleaner, shorter, & faster. ***
********************************************************************
There are three main versions: 2.5, 3.0, and 3.1. Version 2.5 runs
on machines like Vax, Sun3, HP-9000, and Amiga, but not on alignment
restricted processors like Sun4, Pyramid-98x, DEC3100 and SGI Iris.
Versions 3.0 and 3.1 do run on alignment-restricted systems, but lack
some builtin predicates. There were many different copies of the
different versions floating about; we've tried to resolve the
differences as best as possible. (Some of the differences had to do
with garbage collection, which was apparently buggy.)
All the versions contain a couple of benchmarks, such as naive
reverse and Pereira's benchmark suite, and some documentation.
Other documentation is also available in the doc.tar file.
The msdos subdirectory contains the 386 MS-DOS port of SB-Prolog
version 3.1.01 (31-OCT-91). It was compiled using version 1.05 of the
386 MS-DOS GNU C compiler port by D. J. Delorie. It supports up to
128M of extended memory and 128M of disk space for swapping. It is
compatible with XMS and VCPI programs (such as QEMM and 386MAX), but
not DPMI (such as Windows 3.0).
The Amiga port is in the amiga directory and includes a hypertext
version of the SB-Prolog manual for version 2.5 of the language.
The hilog directory contains a prototype of SB-HiLog that runs
under Quintus Prolog and SB-Prolog. SB-HiLog is an extension of
Prolog that possesses a higher-order syntax, so that arbitrary
terms may occupy the function position of terms. (XSB also includes
a version of HiLog.)
===========================================================================
Package: lang/prolog/impl/prolog/schelog/
Name: Schelog
Summary: Embedding of Prolog in Scheme
Version: 2 (18-FEB-93)
Description:
ScheLog is an implementation of Prolog in Scheme. It is a
collection of macros that expand syntax for clauses, elations, and
so on into pure Scheme. It should run in any R4RS Scheme, has been
tested in SCM, and will run any Scheme implementation that supports
SLIB (the Standard Scheme Library).
This implementation uses Scheme's first-class full continuations to
implement Prolog's backtracking mechanism. (See the papers in
references below for information on this type of embedding.) Its use
of higher-order continuations is probably a major obstacle to porting
it to Common Lisp.
The file portable.tar contains sample initialization files that
must be customized for your dialect of Scheme and loaded before
runing Schelog.
===========================================================================
Package: lang/prolog/impl/prolog/scm_pl/
Name:
Summary: Prolog implemented in Scheme, with interval arithmetic.
Version: 1.2 (12-JUN-92)
Description:
Prolog in Scheme is a collection of macros that expand syntax for
clauses, elations, and so on. It is written in Scheme and has support
for delayed goals and interval arithmetic. It is known to run in Chez
Scheme and in Elk, and is intended to be portable to other Scheme
implementations. It relies on continuations, and so is not easily
ported to Common Lisp.
===========================================================================
Package: lang/prolog/impl/prolog/sicstus/
Name: SICStus
Summary: Information about SICStus Prolog for Unix.
Version: 2.1
Description:
SICStus Prolog is a portable implementation of Prolog, written at SICS
(Swedish Institute of Computer Science) with support in part from
Ericsson Telecom AB, NobelTech Systems AB, Infologics AB, and
Televerket under the Swedish Board for Industrial Development of
Information Technology.
Written in C and Prolog, the implementation is based on the Warren
Abstract Machine (WAM). The programming environment has benefited
from public domain code contributed principally by R.A. O'Keefe and
D.H.D. Warren. An execution profiling package was written by M.M.
Gorlick and C.F. Kesselman at the Aerospace Corporation.
SICStus Prolog is portable to most UNIX(TM) machines (Berkeley UNIX is
preferred over System V). It provides indexed interpreted and
compiled predicates mixed arbitrarily, unbounded precision integer and
double precision floating point arithmetic, unification and term
comparison of cyclic structures, a garbage collector and stack
shifter, attention key (control-c) handling, a "procedure box"
debugger, dynamic interfacing to C functions, backtrackable
side-effects, coroutining facilities, execution profiling, and a
machine-independent WAM compiler.
SICStus Prolog also includes a module system, Boolean constraint
solver, native code compilers for Sun-3/4 and 68K-based NeXT, "Block"
declarations (generalizing "wait" declarations), Prolog queries
callable by C programs, support for building stand-alone applications,
a Prolog library, a facility for storing Prolog clauses on files with
user-defined indexing, a graphics package using InterViews 2.6, a
graphical interface to the profiling package, a multiprocessing
package based on the Linda model, exception raising and handling,
several new built-in arithmetic functions, and time-out and socket
communication primitives. SICS Aurora and Echo is a parallel emulator
for Sequent Balance, Sequent Symmetry, Encore Multimax, and BBN
Butterfly (Unix).
Send requests for ordering information to sicstus-request@sics.se.
===========================================================================
Package: lang/prolog/impl/prolog/swi_pl/
Name: SWI Prolog
Summary: Fairly complete Edinburgh-style Prolog.
Version: 1.9 (5-JUN-94); 1.8.7 (31-JAN-93)
Description:
SWI-Prolog is a fairly complete Edinburgh-style Prolog. It includes a
fast compiler, a profiler, a transparent and fast C interface (both
Prolog calling C and C calling Prolog), a Quintus-like module system,
garbage collector, stack expander, and dynamic autoloading of
libraries. It also includes a GNU-readline and GNU-Emacs interface.
SWI-Prolog has a large set of built-in predicates in common with
C-Prolog, Quintus and SICStus Prolog, so programs written for
SWI-Prolog should be fairly portable to other prolog implementations.
SWI-Prolog has no built-in facilities for graphics, but XPCE works
with SWI-Prolog. (XPCE is a language-independent interface to X11 that
provides a high level of abstraction.)
The system has been very stable since version 1.5. Most of the
changes since then are new features and minor bug fixes.
===========================================================================
Package: lang/prolog/impl/prolog/tricia/
Name: Tricia Prolog
Summary: Edinburgh-style Prolog for Macintosh (and UNIX).
Version: 0.9.5 d29 (20-OCT-93)
Description:
Tricia is a free Edinburgh-style Prolog developed by the Computing
Science Department at Uppsala University. It includes a high-level
emulator with interpreter.
The Macintosh version includes only a basic console interface (i.e.,
no fancy Macintosh interface).
===========================================================================
Package: lang/prolog/impl/prolog/unsw_pl/
Name: UNSW Prolog
Summary: Prolog for the Amiga
Version: 4.2
Description:
This directory contains UNSW Prolog, a Prolog for the Amiga (v1.0). It
works under Workbench 2.x and includes the 68030 version. (This is
the first release of UNSW Prolog for the Amiga.)
===========================================================================
Package: lang/prolog/impl/prolog/wamcc/
Name: WAMCC
Summary: WAM-based Prolog to C compiler
Version: 2.1 (8-JUN-94)
Description:
WAMCC is a WAM-based Prolog to C compiler. It conforms more or less
to the Edinburgh standard, and includes most of the usual built-in
predicates, a top-level, a Prolog debugger and a WAM debugger. WAMCC
is designed to be easily extended (see clp(FD), for example). WAMCC's
speed is halfway between SICStus emulated and SICStus native code on a
Sparc (1.5 times faster and 1.5 times slower, respectively).
Examples include a calendar program and the 8-queens problem.
===========================================================================
Package: lang/prolog/impl/prolog/xsb/
Name: XSB Prolog
Summary: Prolog extended with OLDT (tabling) and Hilog terms.
Version: 1.3 (14-SEP-93)
Description:
XSB is a Prolog-based Logic Programming System that extends the
standard functionality of Prolog with an implementation of OLDT
(tabling) and HiLog terms. XSB includes an optimizing compiler, C
interface, a module system, list processing libraries, and dynamic
loading. It is a descendent of PSB-Prolog and SB-Prolog.
OLDT resolution is useful for recursive query computation, allowing
programs to terminate correctly in many cases where Prolog does not.
Users interested in Parsing, Program Analysis, and memory-resident
Deductive Database applications may benefit from XSB.
XSB's OLDT implementation:
o Is incorporated at the emulator level for maximal efficiency.
The speed improvement over meta-interpreters written by
the XSB group is 2-3 orders of magnitude, with considerable
improvements in space as well.
o Evaluates programs with (left-to-right modularly) stratified
negation and aggregation.
o Allows for declaration of tabled predicates either
automatically by the system or manually by the user.
o Provides standard tabling predicates which can be used to
program a number of applications like meta-interpreters for
the well-founded semantics (provided as an example program).
o Allows full Prolog functionality in tabled code, including
cuts (subject to weak semantic restructions), meta-logical
predicates, second-order predicates, etc.
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.
XSB's HiLog implementation:
o Includes a fully integrated HiLog preprocessor. HiLog terms can
be used anywhere in XSB, including the interpreter level.
o Provides a number of meta-logical standard predicates for
HiLog terms.
Compiler optimizations for HiLog terms are currently under development.
===========================================================================
Topic: lang/prolog/impl/wam/
Name: WAM
Summary: WAM emulators and tracers.
Description:
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Programming Languages!WAM, Prolog!Implementations, WAM
Contains:
luther/ Luther: Luther-based WAM tracer.
wam_int/ WAM-Int: WAM interpreter
See Also: ?
===========================================================================
Package: lang/prolog/impl/wam/luther/
Name: Luther
Summary: Luther-based WAM tracer.
Version:
Description:
Johan Bevemyr's Luther-based WAM-tracer is available by anonymous ftp
from Uppsala University in Sweden. It includes a simple compiler from
Prolog to WAM code and a low-level WAM code tracer written in
emacs-lisp. The tracer splits the screen into regions to show
data-areas, registers, and so on. You can then step through running
the code.
===========================================================================
Package: lang/prolog/impl/wam/wam_int/
Name: WAM-Int
Summary: WAM interpreter
Version: 1.1 (19-SEP-89)
Description:
This directory contains a WAM emulator implemented in C.
A prolog to WAM compiler is included, as are numerous examples.
===========================================================================
Topic: lang/prolog/oop/
Name: OOP
Summary: Code related to object-oriented programming in Prolog.
Description:
Contains code and other materials related to object-oriented
programming in Prolog.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
OOP!Prolog, Prolog!Code
Contains:
ol/ OL(P): Object Layer for Prolog
poem/ POEM: Prolog Object-Oriented Embedded Manager
See Also:
lang/prolog/gui/xpce/
===========================================================================
Package: lang/prolog/oop/ol/
Name: OL(P)
Summary: Object Layer for Prolog
Version: 1.1 (23-JUN-93)
Description:
OL(P), Object Layer for Prolog, is an object-oriented extension to
Prolog. It provides an object-oriented structuring and reuse
mechanism for Prolog in a manner that preserves performance and
semantics. The object-oriented layer is compiled into Prolog without
introducing any side-effects. OL(P) takes the view of objects as
collections of predicates (called methods). To Prolog, OL(P) adds
objects with methods, data encapsulation, instances, and multiple
inheritance. Object methods can access Prolog predicates and vice
versa. The OL(P) incremental compiler translates OL(P) programs to
Prolog programs that don't need runtime interpretation (e.g., no
search is needed for inheritance). OL(P) comes with source code,
documentation, simple built-in project management, some libraries,
and example programs.
===========================================================================
Package: lang/prolog/oop/poem/
Name: POEM
Summary: Prolog Object-Oriented Embedded Manager
Version: 10-SEP-88
Description:
POEM (Prolog Object-Oriented Embedded Manager) is a simple
object-oriented programming package for Prolog. It includes notions of
classes, objects, and subclasses, similar to Simula-67. There is no
error detection mechanism.
POEM comes from a Poplog Users' Group tape in early 1987. (The
original code is from 1985.) This version includes some small changes
to improve portability suggested by Nick Youd of Cambridge
University's Engineering Department.
===========================================================================
Topic: lang/prolog/txt/
Summary: Online Prolog-related tech reports and papers.
Description:
This directory contains papers, proceedings, and benchmarks, many of
which come from the Constraint Programming Paper Archive located at
Aarhus University, Denmark, and accessible by anonymous ftp as
ftp.daimi.aau.dk:pub/CLP/. For further information on the archive,
contact Brian H. Mayoh .
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Benchmarks!Prolog, CLP, Prolog!Tech Reports
Contains:
proc/ Machine readable forms of conference proceedings
See Also: ?
===========================================================================
Package: lang/prolog/txt/proc/
Name:
Summary: Machine readable forms of conference proceedings
Version:
Description:
This directory contains copies of the following proceedings:
ppcp93
Proceedings of the Constraint Programming Workshop after PPCP93.
iclp93
Abstracts from the proceeding of the ICLP'93 Post-Conference Workshop
on Concurrent Constraint Programming, Budapest, June 24-25, 1993.
dfki9339
Manfred Meyer, editor, Proceedings of the International Workshop on
Constraint Programming at CSAM93 (St. Petersburg) August 1993.
DFKI technical report DFKI-93-39.
est93
Estonian Proceedings of Parnu NATO ASI August 1993 Conference on
Constraint Programming.
natobook
Proceedings of Parnu NATO ASI August 1994 Advanced Study
Institute Lectures on Constraint Programming.
===========================================================================
Topic: lang/prolog/util/
Summary: Utilities for programming in Prolog.
Description:
Contains a variety of utilities for programming in Prolog, such as
TeX macros for including Prolog code in documents.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Prolog!Utilities
Contains:
latex2pl/ Literate Prolog: LaTeX macros for including Prolog code in
documents.
ptags/ PTAGS: Creates a tags file from Prolog sources
See Also: ?
===========================================================================
Package: lang/prolog/util/latex2pl/
Name: Literate Prolog
Summary: LaTeX macros for including Prolog code in documents.
Version: 24-FEB-93
Description:
Literate Prolog (latex2pl) allows the user to include Prolog code in
LaTeX documents. The Prolog code is included between \begin{prolog}
and \end{prolog} commands. These sections are typeset in Courier to
distinguish them from the surrounding text. The commands
\begin{prologdisplay} and \end{prologdisplay} are like the verbatim
environment, except that the text is typeset in Courier Italic to
identify it as Prolog code that is not necessarily executable. Smaller
sections of Prolog text can be typeset using the {\pl ...} and
{\pli ...} commands, the latter being "Prolog italic".
The author did not use Web, because the formatting commands are
cryptic and Prolog doesn't need the same code reordering as Pascal and C.
===========================================================================
Package: lang/prolog/util/ptags/
Name: PTAGS
Summary: Creates a tags file from Prolog sources
Version: 5-MAR-89
Description:
Ptags creates a tags file for the Prolog predicates as defined in the
source files supplied as input. Its use is analogous to that of
ctags(1). Like ctags, output is sent to a file called tags in the
current directory. Each line in the tags file contains three
tab-separated fields: the first is the name of each predicate defined
in the source files; the second is the name of the file where the
predicate is defined; and the third is an instruction to be executed
by vi(1) or ex(1) to find the definition within the source file. As
with ctags, the tags file is sorted alphabetically by predicate name.
===========================================================================
Topic: lang/scheme/
Summary: CMU Scheme Repository
Description:
Welcome to the Scheme Repository.
The Scheme Repository at CMU is part of the CMU Artificial Intelligence
Repository. The goal of the Scheme Repository is to collect files and
programs of general interest to Scheme programmers. Information
files include the FAQ (Frequently Asked Questions) postings for the
comp.lang.scheme newsgroup and copies of the RnRS standards for scheme.
Thanks to Ozan S. Yigit, creator of the Internet Scheme Repository,
for assistance in gathering materials for the Scheme section of the
CMU AI Repository.
This is NOT a precise mirror of the Internet Scheme Repository. Some
of the materials have been relocated to more appropriate locations in
the AI Repository. We also have some additional materials not
currently present in the Internet Scheme Repository, and changed the
organization significantly.
If this is the first time you have used the Repository, please read
this file and the file named readme.txt. The file readme.txt contains
important information concerning the repository and conditions on use
of the repository. By retrieving files from the repository, you
signify your agreement to these conditions.
To contribute files to the repository, first see section [7] of the
readme.txt file. Then send mail to ai+scheme@cs.cmu.edu. If
possible, please put the files in ftp.cs.cmu.edu:user/ai/new/.
Origin: ftp.cs.cmu.edu:user/ai/lang/scheme/ [128.2.206.173]
Give "anonymous" (without the quotes) at the username:
prompt and type your email address (in the form "user@host")
at the password: prompt. NOTE: There is *no* leading slash
before user/ai/lang/scheme/; just type "cd user/ai/lang/scheme/"
at the ftp> prompt.
If you will be transferring compressed files, be sure to
type the "binary" command before retrieving the files. The
"get" command is used to get a single file, and "mget" to
retrieve multiple files using wildcards. If you're using
the "mget" command, you might want to turn off prompting
first by using the "prompt" command.
The Lisp Utilities Repository is kept in the Andrew File
System (AFS) directory
/afs/cs.cmu.edu/project/ai-repository/ai/lang/scheme/
and its subdirectories. If your site runs AFS, you can
just cd to this directory and copy the files directly.
(The FTP location given above is just a link to the AFS
directory.)
Further information about AFS can be obtained by
sending email to afs-sales@transarc.com.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Bug Reports: ai+scheme@cs.cmu.edu
Author(s): Maintained by Mark Kantrowitz .
Contact: ai+scheme@cs.cmu.edu
Keywords:
Programming Languages!Scheme, Scheme
Contains:
bookcode/ Machine readable parts of various Scheme books
code/ Scheme code for benchmarking, research, education, and fun
doc/ Documentation, including standards and proposals
edu/ Educational Materials for Teaching/Learning Scheme
faq/ Scheme FAQ: Frequently Asked Questions (FAQ) posting for
comp.lang.scheme newsgroup
gui/ Graphical User Interfaces (GUI) for Scheme and other graphics
code.
impl/ Free/Shareware Scheme implementations
mail/ Archives of the Scheme mailing list.
oop/ OOP: Code related to object-oriented programming.
txt/ Online Scheme-related tech reports and papers.
util/ Utilities for programming in Scheme.
See Also: ?
===========================================================================
Topic: lang/scheme/bookcode/
Summary: Machine readable parts of various Scheme books
Description:
Contains machine readable parts of various books.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Books!Scheme, Scheme!Code
Contains:
aibook/ AIbook: Code from Kreutzer and McKenzie's AI book.
eopl/ EOPL: Code from Friedman, Wand, and Haynes' book "Essentials of
Programming Languages".
sap/ SAP: Code from Springer and Friedman's book "Scheme and the Art
of Programming"
sicp/ SICP: Code from Abelson and Sussman's book "Structure and the
Interpretation of Computer Programs"
ssics/ SSICS: Code from Harvey and Wright's book "Simply Scheme"
See Also: ?
===========================================================================
Package: lang/scheme/bookcode/aibook/
Name: AIbook
Summary: Code from Kreutzer and McKenzie's AI book.
Version:
Description:
This directory contains source code for
Wolfgang Kreutzer and Bruce McKenzie, "Programming for
Artificial Intelligence: Methods, Tools and Applications",
Addison-Wesley (Reading, MA), 1990. 682 pages, ISBN 0-201-41621-2.
Kreutzer and McKenzie's book discusses Scheme, Prolog, and Smalltalk,
gives an overview of the history and philosophy of AI, and surveys
three major programming paradigms (procedural, declarative, and
object-oriented) and metaphors for AI programming.
===========================================================================
Package: lang/scheme/bookcode/eopl/
Name: EOPL
Summary: Code from Friedman, Wand, and Haynes' book "Essentials of
Programming Languages".
Version:
Description:
This directory contains source code for all the Scheme programs and
Scheme program fragments in the book
Daniel P. Friedman, Mitchell Wand, and Christopher T. Haynes,
"Essentials of Programming Languages", MIT Press/McGraw-Hill, 1992.
536 pages, ISBN 0-262-06145-7.
EOPL teaches fundamental concepts of programming language design by
using small interpreters as examples. The book covers most of the
features of Scheme. It includes a discussion of parameter passing
techniques, object oriented languages, and techniques for transforming
interpreters to allow their implementation in terms of any low-level
language. Also discussed are scanners, parsers, and the derivation of
a compiler and virtual machine from an interpreter.
===========================================================================
Package: lang/scheme/bookcode/sap/
Name: SAP
Summary: Code from Springer and Friedman's book "Scheme and the
Art of Programming"
Version:
Description:
This directory contains source code for all of the boxed programs
and some of the exercises from the book
George Springer and Daniel P. Friedman, "Scheme and the Art of
Programming", MIT Press and McGraw Hill, 1990. 596 pages.
SAP introduces the basic concepts of programming in Scheme. The book
also deals with object oriented programming, co-routining,
continuations. It gives numerous examples. SAP has more of an
emphasis on teaching Scheme than SICP, and can be seen as an
alternative to SICP.
===========================================================================
Package: lang/scheme/bookcode/sicp/
Name: SICP
Summary: Code from Abelson and Sussman's book "Structure and the
Interpretation of Computer Programs"
Version:
Description:
This directory contains source code for the examples from the text
Harold Abelson and Gerald Jay Sussman, with Julie Sussman. "Structure
and Interpretation of Computer Programs", MIT Press (Cambridge, MA)
and McGraw-Hill (New York), 1985. 542 pages. ISBN 0-262-01077-1.
The book starts off introductory, but rapidly gets into powerful
Lisp-particular constructs, such as using closures and engines,
building interpreters, compilers and object-oriented systems. Often
referred to by its acronym, SICP, which is pronounced "Sick-Pee". This
is the classical text for teaching program design using Scheme,
and everybody should read it at least once.
===========================================================================
Package: lang/scheme/bookcode/ssics/
Name: SSICS
Summary: Code from Harvey and Wright's book "Simply Scheme"
Version:
Description:
This directory contains source code from the book
Brian Harvey and Matthew Wright, "Simply Scheme: Introducing
Computer Science", MIT Press, Cambridge, MA, 1994.
583 pages, ISBN 0-262-08226-8, $49.95.
A review of the book is contained in the file named REVIEW. In
essence, the book is designed to be used before SICP, and gradually
and gently introduces the students to some of the key concepts of
programming in Scheme.
===========================================================================
Topic: lang/scheme/code/
Summary: Scheme code for benchmarking, research, education, and fun
Description:
This directory contains a variety of Scheme code and algorithm
implementations. This collection is intended to facilitate
code reuse. The code included here is of a type more basic to
programming in Scheme. AI software systems that happen to be
implemented in Scheme will appear in the areas/ directory tree.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Scheme!Code
Contains:
bench/ Scheme Benchmarking Suites
csp/ Constraint: Port of Steele's Constraint System
debug/ Scheme programs for debugging Scheme programs.
eval/ Scheme code related to partial evaluation, metacircular
evaluation, compilation, and so on.
ext/ Scheme Code Extensions: Collections of miscellaneous Scheme
code.
fun/ Some random fun programs written in Scheme, including
Adventure, calendar calculations, Micro ELI and Micro SAM.
io/ IO: Scheme code dealing with input and output routines.
library/ Libraries of Scheme Code.
match/ Scheme code for pattern matching.
math/ Math Library: Scheme code for various mathematical functions.
modules/ MODULES: Implementation of Bracha and Lindstrom's modules.
parsing/ Collection of Scheme code for parsing.
sps/ SPS: Semantic Prototyping System
syntax/ Code related to changing or translating to/from Scheme syntax.
tools/ Scheme Utilities: Collection of miscellaneous Scheme tools.
See Also:
lang/prolog/impl/prolog/schelog/
===========================================================================
Topic: lang/scheme/code/bench/
Summary: Scheme Benchmarking Suites
Description:
Code for benchmarking Scheme implementation performance.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Benchmarks!Scheme, Scheme!Benchmarks, Scheme!Code
Contains:
gabriel/ Gabriel Benchmarks: Scheme version of the Gabriel Lisp
benchmarks
See Also: ?
===========================================================================
Package: lang/scheme/code/bench/gabriel/
Name: Gabriel Benchmarks
Summary: Scheme version of the Gabriel Lisp benchmarks
Version: 9-FEB-88
Description:
This directory contains a Scheme version of the Gabriel benchmarks,
ported in 1987/88 by Will Clinger.
===========================================================================
Package: lang/scheme/code/csp/
Name: Constraint
Summary: Port of Steele's Constraint System
Version:
Description:
A translation of the constraint system first published in Steele, Guy
Lewis Jr., "The Definition and Implementation of a Computer
Programming Language Based on Constraints", MIT Artificial
Intelligence Laboratory TR-595, August 1980. The translation is
written for the current distribution of MIT Scheme.
===========================================================================
Topic: lang/scheme/code/debug/
Summary: Scheme programs for debugging Scheme programs.
Description:
This directory contains programs that are useful in debugging
Scheme programs.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Debuggers, LINT for Scheme@{{\tt lint} for Scheme}, Scheme!Code,
Scheme!Debuggers
Contains:
psd/ PSD: Portable Scheme Debugger
sclint/ SCLINT: A lint-like program for Scheme.
xscheme/ XScheme: Graphical Scheme debugger
See Also: ?
===========================================================================
Package: lang/scheme/code/debug/psd/
Name: PSD
Summary: Portable Scheme Debugger
Version: 1.3 (4-MAY-94)
Description:
With PSD, the portable Scheme debugger, you can do source code
debugging for any R4RS compliant Scheme interpreter when run in a GNU
Emacs buffer (either version 18 or 19). PSD lets you set and clear
breakpoints, single step evaluation, follow execution in an editor
window, and examine and change a program's variables. You can also let
a program run until an error occurs, and then examine the state of the
program. It works by instrumenting the original source code, so it
should run with any R4RS compliant Scheme. Includes documentation and
user's manual.
===========================================================================
Package: lang/scheme/code/debug/sclint/
Name: SCLINT
Summary: A lint-like program for Scheme.
Version: 0.9 (8-MAR-93)
Description:
SCLINT is a lint-like program for Scheme. It checks for consistency of
indentation, syntax of special forms, and the number of arguments to
primitive and most user-defined procedures. This is not a full
implementation, but rather a quick hack. It is used in teaching
programming at the Tampere University of Technology.
===========================================================================
Package: lang/scheme/code/debug/xscheme/
Name: XScheme
Summary: Graphical Scheme debugger
Version: 0.2
Description:
XScheme is a graphical Scheme debugger based on STk (Scheme Tk
interface) and was developed for cs169 Software Engineering class of
1994 at University of California at Berkeley.
The features of this release include:
* Breakpoints on any subexpression of a closure -- stop evaluation
before that subexpression is evaluated. Set break, remove break
enable/disable break operations can be done both interactively from
Break point manager window, Expression viewer or scheme prompt, as
well as from code.
* Self-evaluating watch expressions, that provide monitoring of
arbitrary expressions with various scope and evaluation options.
* Abitily to install custom viewers that provide a specialized
view at any scheme data. These viewers must confirm to a
common interface and can be attached to any watch expression
so the value of that watch expression is displayed with this
specified viewer.
* A number of viewer is provided with this release:
- expression viewer, shows data in textual notation, pretty
printed with color coded keywords.
- Box-n-Pointer Viewer, shows data in Box and Pointer
notation, with a cons cell represented
as a box with two pointers for car and cdr.
- Environment Viewer, a specialized viewer to display the
current binings of any given
environment, and its parent environments.
* Evaluation Monitor: provides display of the location of
evaluation when a breakpoint occurs and displays current
local bindings at that point.
* Help system. It provides a set of indexed entries that can be
expanded easily by loading a new text module and regestering.
Help screens can use custom fonts, sizes and formatting. No
colors are supported yet, but can be added with minimum effort.
===========================================================================
Topic: lang/scheme/code/eval/
Summary: Scheme code related to partial evaluation, metacircular
evaluation, compilation, and so on.
Description:
This directory contains Scheme code that is related to various
facets of evaluation and compilation, including partial evaluation,
metacircular evaluators, interpreters for languages embedded in
Scheme, etc.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Eval, Partial Evaluation, Scheme!Code
Contains:
blond/ BLOND: Non-reflective simulator of a reflective tower.
compil/ COMPIL: A small, optimizing Scheme compiler.
cpst/ CPST: Left-to-right call-by-value CPS transformation
lambda/ Lambda: Interprete de lambda-calcul
log_scm/ LogScheme: Metacircular evaluator for a logical extension of
Scheme.
pass2/ Pass2: Second pass of the Scheme 313 compiler
peval/ PEVAL: A toy partial evaluator
plscm/ PLScheme: Virtual machine and compiler for Scheme.
semant/ SEMANT: Scheme semantics
See Also: ?
===========================================================================
Package: lang/scheme/code/eval/blond/
Name: BLOND
Summary: Non-reflective simulator of a reflective tower.
Version: 6-OCT-88
Description:
This directory contains the non-reflective simulator of a reflective
tower described in
Olivier Danvy and Karoline Malmkjaer, "Intensions and Extensions in a
Reflective Tower", in Proceedings of the 1988 ACM Conference on Lisp
and Functional Programming, pages 327-341, 1988.
The interpreter is fully meta-circular.
===========================================================================
Package: lang/scheme/code/eval/compil/
Name: COMPIL
Summary: A small, optimizing Scheme compiler.
Version:
Description:
This directory contains a small, optimizing scheme compiler by
Marc Feeley and Guy LaPalme, as described in their 1987 Computer
Language article.
===========================================================================
Package: lang/scheme/code/eval/cpst/
Name: CPST
Summary: Left-to-right call-by-value CPS transformation
Version: 21-JUN-94
Description:
CPST converts Scheme into a continuation passing style.
===========================================================================
Package: lang/scheme/code/eval/lambda/
Name: Lambda
Summary: Interprete de lambda-calcul
Version:
Description:
===========================================================================
Package: lang/scheme/code/eval/log_scm/
Name: LogScheme
Summary: Metacircular evaluator for a logical extension of Scheme.
Version:
Description:
This directory contains Pierre Bonzon's metacircular evaluator for
a logical extension of scheme.
===========================================================================
Package: lang/scheme/code/eval/pass2/
Name: Pass2
Summary: Second pass of the Scheme 313 compiler
Version: 17-APR-91
Description:
This directory contains code for the second pass of the Scheme 313
compiler, including single assignment analysis, assignment
elimination, lambda lifting, and various local source transformations.
It operates as a source-to-source transformation on a subset of
Scheme.
===========================================================================
Package: lang/scheme/code/eval/peval/
Name: PEVAL
Summary: A toy partial evaluator
Version: 15-MAY-88
Description:
This directory contains PEVAL, a toy partial evaluator.
===========================================================================
Package: lang/scheme/code/eval/plscm/
Name: PLScheme
Summary: Virtual machine and compiler for Scheme.
Version: 8-DEC-88
Description:
This directory contains PLScheme, a virtual machine and compiler
developed by Jonathan Rees in 1988 for Dave Gifford's graduate
programming languages class (6.821) at MIT. The code is written in
Scheme. Includes LaTeX documentation.
===========================================================================
Package: lang/scheme/code/eval/semant/
Name: SEMANT
Summary: Scheme semantics
Version: January 1987
Description:
Semantics for Scheme.
===========================================================================
Topic: lang/scheme/code/ext/
Name: Scheme Code Extensions
Summary: Collections of miscellaneous Scheme code.
Description:
This directory contains a variety of extensions to Scheme and
miscellaneous Scheme code.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Scheme!Code, Scheme!Extensions
Contains:
arrays/ Multidimensional arrays in Scheme
avl/ AVL: AVL trees and tries.
function/ Extensions related to functions
hash/ General Table: Hash table implementation for Scheme
lattices/ Lattices: Jim Miller's Conform package.
lists/ Code for manipulating lists of various kinds.
resource/ Resources: Implementation of resources (weak pools) for Scheme.
sets/ Code for implementing sets of integers.
strings/ Scheme code for manipulating strings and characters.
structs/ Implementation of Structures for Scheme.
threads/ PCALL: Scheme code to emulate FUTURE and PCALL.
trees/ Code for various types of tree structures.
types/ Code related to Types.
See Also: ?
===========================================================================
Topic: lang/scheme/code/ext/arrays/
Summary: Multidimensional arrays in Scheme
Description:
This directory contains a Scheme extensions related to arrays.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Arrays, Scheme!Code, Scheme!Extensions
Contains:
arrays/ Alan Bawden's multidimensional arrays for Scheme
grid/ Grids: A simple implementation of multidimensional arrays.
See Also: ?
===========================================================================
Package: lang/scheme/code/ext/arrays/arrays/
Name:
Summary: Alan Bawden's multidimensional arrays for Scheme
Version: 21-FEB-93
Description:
This directory contains Alan Bawden's implementation of
multidimensional arrays for Scheme. It abstracts out the index
arithmetic.
===========================================================================
Package: lang/scheme/code/ext/arrays/grid/
Name: Grids
Summary: A simple implementation of multidimensional arrays.
Version: 20-MAR-93
Description:
A simple n-dimensional array package implemented by Lance Norskog.
===========================================================================
Package: lang/scheme/code/ext/avl/
Name: AVL
Summary: AVL trees and tries.
Version: AVL trees 1.1 (27-OCT-93); AVL tries 1.1 (4-DEC-93)
Description:
AVL trees are balanced binary trees. This implementation recreates
the tree around the inserted element, without side effects.
===========================================================================
Package: lang/scheme/code/ext/function/
Name:
Summary: Extensions related to functions
Version:
Description:
This directory contains extensions to Scheme related to functions.
optional.scm
Richard A. O'Keefe's package for defining functions with
&optional arguments. (26-MAR-93)
===========================================================================
Package: lang/scheme/code/ext/hash/
Name: General Table
Summary: Hash table implementation for Scheme
Version: 21-APR-94
Description:
This directory contains an implementation of hash tables for Scheme.
===========================================================================
Package: lang/scheme/code/ext/lattices/
Name: Lattices
Summary: Jim Miller's Conform package.
Version:
Description:
Package related to lattices and partial orders.
===========================================================================
Topic: lang/scheme/code/ext/lists/
Summary: Code for manipulating lists of various kinds.
Description:
This directory contains extensions to Scheme related to lists and
property lists.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Lists, Scheme!Code, Scheme!Extensions
Contains:
prop/ Prop: Simple implementation of property lists.
proplist/ Proplist: Hash-table implementation of property lists.
sort/ Portable and efficient destructive and non-destructive sorts.
See Also: ?
===========================================================================
Package: lang/scheme/code/ext/lists/prop/
Name: Prop
Summary: Simple implementation of property lists.
Version:
Description:
Prop is a simple implementation of get, put, remprop.
===========================================================================
Package: lang/scheme/code/ext/lists/proplist/
Name: Proplist
Summary: Hash-table implementation of property lists.
Version:
Description:
Proplist is a hash-table implementation of get, put.
===========================================================================
Package: lang/scheme/code/ext/lists/sort/
Name:
Summary: Portable and efficient destructive and non-destructive sorts.
Version: 11-JUN-91
Description:
This directory contains Richard O'Keefe's sorted?, merge, merge!,
sort, sort! implementations. These should probably be included in
every scheme implementation.
===========================================================================
Package: lang/scheme/code/ext/resource/
Name: Resources
Summary: Implementation of resources (weak pools) for Scheme.
Version:
Description:
This is an implementation of resources for Scheme. Rather than rely
on the garbage collector, it provides pools of objects which can be
reused. When you need an object, it allocates one from the pool,
creating a new object if necessary. When an object is no longer
needed, it gets returned to the pool. This can help avoid thrashing
if the objects are only needed for brief periods of time.
===========================================================================
Package: lang/scheme/code/ext/sets/
Name:
Summary: Code for implementing sets of integers.
Version: 1.00 (10-SEP-92)
Description:
This is John Ramsdell's Scheme port of Shephen Adams' SML programs
used to implement sets of integers. The implementation is based on
Binary search trees of Bounded Balance, similar to Nievergelt &
Reingold, SIAM J. Computing 2(1), March 1973.
===========================================================================
Topic: lang/scheme/code/ext/strings/
Summary: Scheme code for manipulating strings and characters.
Description:
This directory contains programs for manipulating strings and characters.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Scheme!Code, Scheme!Extensions, Strings
Contains:
char_set/ Character Sets: Implementation of character sets in Scheme.
conc_str/ Conc-String: Strings for efficient concatenation.
read_str/ Portable implementation of READ-STRING for Scheme.
str_ops/ Collection of miscellaneous procedures that operate on strings.
substr/ Substring matching code.
unpack/ Unpack integers from a string.
See Also: ?
===========================================================================
Package: lang/scheme/code/ext/strings/char_set/
Name: Character Sets
Summary: Implementation of character sets in Scheme.
Version: 26-MAY-93
Description:
A character set is, as its name might suggest, a set for storing
characters. Such sets are often particularly useful in string
processing applications. The reason for treating sets of characters
in a special manner is that until the advent of UNICODE and ISO ???,
character sets only contained a maximum of 255 characters and so this
fact could be taken advantage of in an implementation. The usual
approach being to store a character set as a bit set.
===========================================================================
Package: lang/scheme/code/ext/strings/conc_str/
Name: Conc-String
Summary: Strings for efficient concatenation.
Version: 1.8 (22-SEP-92)
Description:
CONC-STRING is a form of string that supports efficient concatenation.
This allows purely functional code to be written without the overhead
associated with the append operation in conventional strings. Of
course, there is no such thing as a free lunch, this efficiency is
achieved by removing the worst case O(1) time for accessing a
character in the string. Conc-strings are implemented as binary
trees with some redundant information.
===========================================================================
Package: lang/scheme/code/ext/strings/read_str/
Name:
Summary: Portable implementation of READ-STRING for Scheme.
Version:
Description:
This directory contains Richard O'Keefe's generic read-string routine
to port code to Scheme implementations that do not support a
read-string or read-line primitive.
===========================================================================
Package: lang/scheme/code/ext/strings/str_ops/
Name:
Summary: Collection of miscellaneous procedures that operate on strings.
Version: 1.2 (21-OCT-93)
Description:
A large collection of useful functions for operating on strings.
===========================================================================
Package: lang/scheme/code/ext/strings/substr/
Name:
Summary: Substring matching code.
Version: 6-AUG-91
Description:
This directory contains substring matching code based on
Daniel M. Sunday, "A Very Fast Substring Search Algorithm",
CACM 33(8), August 1990.
===========================================================================
Package: lang/scheme/code/ext/strings/unpack/
Name:
Summary: Unpack integers from a string.
Version: 03 (21-MAY-93)
Description:
This directory contains routines to unpack various sized integers
(8,16,24,32 bit) from a string. The routines are a cross between
string->integer with a radix of 255 and part of Perl's unpack
facility. Only the unsigned routines are really necessary, the others
can be synthesised from them. They are only included here for
historical reasons. Note that the numbers are extracted in network
(big endian) order.
===========================================================================
Topic: lang/scheme/code/ext/structs/
Summary: Implementation of Structures for Scheme.
Description:
This directory contains implementations of Structures for Scheme.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Records, Scheme!Code, Scheme!Extensions, Structures
Contains:
defstr/ DEFSTR: Implementation of Structures for Scheme.
records/ Records: DEFSTRUCT-like structures for Scheme.
See Also: ?
===========================================================================
Package: lang/scheme/code/ext/structs/defstr/
Name: DEFSTR
Summary: Implementation of Structures for Scheme.
Version: 10-NOV-87
Description:
This directory contains an implementation of defstruct for Scheme.
===========================================================================
Package: lang/scheme/code/ext/structs/records/
Name: Records
Summary: DEFSTRUCT-like structures for Scheme.
Version: 01-SEP-89
Description:
An implementation of Pavel's R5RS proposal for RECORDs (similar in
concept to Lisp STRUCTUREs).
===========================================================================
Package: lang/scheme/code/ext/threads/
Name: PCALL
Summary: Scheme code to emulate FUTURE and PCALL.
Version: 1.1 (15-JAN-92)
Description:
PCALL is a multi-threaded kernel that provides a pcall facility, an
implementation of futures and suspensions, and a high-level control
operator that allows the definition of partial continuations.
===========================================================================
Package: lang/scheme/code/ext/trees/
Name:
Summary: Code for various types of tree structures.
Version:
Description:
This directory contains a variety of extensions to Scheme and
miscellaneous Scheme code.
===========================================================================
Topic: lang/scheme/code/ext/types/
Summary: Code related to Types.
Description:
This directory contains code related to type-inferencing and other
type-related facilities.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Scheme!Code, Scheme!Extensions, Type Checking
Contains:
polytype/ PolyType: A toy type inferencer for Scheme.
soft_scm/ Soft Scheme: Practical soft type system for Scheme.
See Also: ?
===========================================================================
Package: lang/scheme/code/ext/types/polytype/
Name: PolyType
Summary: A toy type inferencer for Scheme.
Version: 16-MAY-88
Description:
PolyType is a toy type inferencer for Scheme.
===========================================================================
Package: lang/scheme/code/ext/types/soft_scm/
Name: Soft Scheme
Summary: Practical soft type system for Scheme.
Version: 0.08 (11-JAN-94)
Description:
Soft Scheme provides the benefits of static typing for dynamically
typed Scheme. Like a static type checker, a soft type checker infers
types for variables and expressions. But rather than reject programs
containing untypable fragments, a soft type checker inserts explicit
run-time checks to transform untypable programs to typable form.
These run-time checks indicate potential program errors, enabling
programmers to detect errors prior to program execution. Soft type
checking minimizes the number of run-time checks in the compiled code,
enabling dynamically typed languages to attain the efficiency of
statically typed languages like ML.
===========================================================================
Package: lang/scheme/code/fun/
Name:
Summary: Some random fun programs written in Scheme, including
Adventure, calendar calculations, Micro ELI and Micro SAM.
Version:
Description:
This directory contains a variety of Scheme programs that do fun things:
advent.scm A simple adventure game written in an object oriented
style mostly by a 10-year old. Posted by Ted Dunning
on 30-OCT-90.
calend.scm Scheme version of the Lisp code for Calendrical
Calculations by Nachum Dershowitz and Edward M. Reingold.
Ported by Ozan S. Yigit.
corewar.tar A CoreWars system in Scheme->C, by Sam Shen
on 18-APR-91.
(It will need some work to make it work under
others Scheme implementations.)
mceli.scm Chez version of Micro ELI (English Language Interpreter)
from Schank and Riesbeck's book "Inside Computer
Understanding", 1991.
mcsam.scm Chez version of Micro SAM (Script Applier) from Schank and
Riesbeck's book "Inside Computer Understanding", 1991.
work.scm Olivier Danvy's "Putting Scheme to Work" demo.
===========================================================================
Topic: lang/scheme/code/io/
Name: IO
Summary: Scheme code dealing with input and output routines.
Description:
This directory contains a variety of Scheme programs for dealing
with input and output operations in Scheme.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
IO, Input, Output, Scheme!Code, Scheme!IO
Contains:
adobe/ Adobe: Portable 2d gray-scale graphics package for Scheme.
chez_syb/ ChezSybase: A Chez Scheme interface to the Sybase database.
format/ Scheme implementation of Common Lisp's FORMAT.
pathname/ Scheme code for manipulating pathnames (filenames).
polyclip/ PolyClip: Scheme implementation of the Sutherland-Hodgmann
polygon clipping algorithm.
pp/ PP: Pretty printer for Scheme
sockets/ NetGlue: Implementation of TCP and UDP sockets for Scheme->C.
See Also: ?
===========================================================================
Package: lang/scheme/code/io/adobe/
Name: Adobe
Summary: Portable 2d gray-scale graphics package for Scheme.
Version: 1.0.1 (22-MAR-93)
Description:
ADOBE is John Bertoldi's portable 2d gray-scale graphics package for
Scheme. It implements an abstract graphic device, which, when written
to, produces a file that can be read by Adobe Illustrator (TM) and
most other page composition and illustration-editing applications.
Based on a similar, earlier module by O. Schlageter. Includes
documentation.
===========================================================================
Package: lang/scheme/code/io/chez_syb/
Name: ChezSybase
Summary: A Chez Scheme interface to the Sybase database.
Version: 1.0 (25-MAY-94)
Description:
This directory contains a Chez Scheme interface to the Sybase database.
It uses the Chez Scheme foreign function interface to provide a
high-level Scheme interface to the Sybase db-lib (the API to the
Sybase database). Most of the db-lib calls and datatypes are
supported, with the possible exception of spotty support for text and
image data. There also isn't any Scheme support for the datetime
datatype -- dates and times must be supplied to SQL as a string and
returned to Scheme in a CONVERT()ed column as a string. There is
no Scheme datetime datatype.
===========================================================================
Package: lang/scheme/code/io/format/
Name:
Summary: Scheme implementation of Common Lisp's FORMAT.
Version: 2.2
Description:
This directory contains Ken Dickey's implementation of FORMAT for
Scheme. It implements (FORMAT . args)
The current version is maintained by Dirk Lutzebaeck.
A copy of Ken Dickey's original (4-APR-91 version) is also included.
===========================================================================
Package: lang/scheme/code/io/pathname/
Name:
Summary: Scheme code for manipulating pathnames (filenames).
Version:
Description:
This directory contains Scheme programs for manipulating file names
(pathnames).
fname.tar Procedures for manipulating UNIX file names based on
the GNU-Emacs structures. Written by Olin Shivers.
pathname.tar Portable implementation of a subset of the
Common Lisp (CLtL1) pathname manipulation
functions. Written by Stephen J. Bevan (20-FEB-93).
===========================================================================
Package: lang/scheme/code/io/polyclip/
Name: PolyClip
Summary: Scheme implementation of the Sutherland-Hodgmann polygon
clipping algorithm.
Version: 22-MAR-90
Description:
PolyClip is a "T" implementation of Sutherland-Hodgmann polygon
clipping algorithm, by Olin Shivers.
[Need R4RS version of this code. Any takers?]
===========================================================================
Package: lang/scheme/code/io/pp/
Name: PP
Summary: Pretty printer for Scheme
Version:
Description:
PP is a pretty-printer for Scheme.
===========================================================================
Package: lang/scheme/code/io/sockets/
Name: NetGlue
Summary: Implementation of TCP and UDP sockets for Scheme->C.
Version: 13-MAY-91
Description:
This is a Scheme->C hack that allows you to create and maintain TCP
and UDP sockets. It has been used to implement a simple distributed
database and converse with a server over a TCP connection. There is
also a facility (pack/unpack) for transmitting simple Scheme objects
(cons nodes, string, symbol and integer) over socket connections. The
packing/unpacking routines are probably byte order dependent, but they
will probably work for big-endian architectures.
===========================================================================
Topic: lang/scheme/code/library/
Summary: Libraries of Scheme Code.
Description:
This directory contains several libraries of Scheme code, including
SLIB, the Standard Scheme Library.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Scheme!Code Libraries
Contains:
bevan/ Miscellaneous collection of Scheme code from Stephen Bevan.
cl2scm/ CL2Scheme: Library of Common Lisp functions for Scheme
slib/ SLIB: Standard Scheme Library
See Also: ?
===========================================================================
Package: lang/scheme/code/library/bevan/
Name:
Summary: Miscellaneous collection of Scheme code from Stephen Bevan.
Version: 26-JAN-92
Description:
This directory contains a collection of miscellaneous Scheme code from
Stephen Bevan. It includes, among other things, the augmented term
rewriting system from Wm Leler's book, the code from Sigplan on
building abstract iterators using continuations, an interpreter for
the language LOOP, a SKI compiler, an AVL tree implementation (without
delete), and implementation of gensym, quicksort, read-line, and various
useful string functions.
===========================================================================
Package: lang/scheme/code/library/cl2scm/
Name: CL2Scheme
Summary: Library of Common Lisp functions for Scheme
Version:
Description:
This directory contains a set of Scheme functions that should be
useful to programmers who are porting a Common Lisp program to Scheme.
These functions provide some of the functionality of Common Lisp in
Scheme.
Definitions of the following functions are provided, among others
AREF, ARRAY-SET!, ARAAY-DIMENSION, ARRAY-DIMENSIONS, ARRAY-RANK, ASH,
COMPILE, CONCATENATE, COUNT, COUNT-IF, DEFMACRO, DO*, DOLIST, DOTIMES,
ELT, FIND, FILL, FUNCALL, INTEGER-LENGTH, CL-LENGTH, LOGAND, LOGANDC2,
LOGCOUNT, LOGIOR, LOOP, MAPCAN, MAP, MAP-VEC, MAPCAR, NSUBSTITUTE-IF,
NSUBSTITUTE-IF-NOT, POSITION, PRINT, PROG1, PSETQ, PUSH, READ-LINE,
SEARCH, SET, SETF, SETQ, CL-SORT, CL-STRING, TIME, ATOM?, UNLESS,
WHEN, and WITH-OPEN-FILE.
===========================================================================
Package: lang/scheme/code/library/slib/
Name: SLIB
Summary: Standard Scheme Library
Version: 2a1 (27-APR-94)
Description:
SLIB (Standard Scheme Library) is a portable Scheme library
which is intended to provide compatibility and utility functions for
all the standard Scheme implementations. SLIB conforms to R4RS and
IEEE P1178. Answers to frequently asked questions about SLIB may be
found in the file slib.faq.
===========================================================================
Topic: lang/scheme/code/match/
Summary: Scheme code for pattern matching.
Description:
This directory contains a variety of Scheme code for pattern matching.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Matchers, Scheme!Code, Scheme!Matchers
Contains:
match/ Match: Pattern Matching and Data Definition facility for Scheme
matchcmp/ MatchComp: Pattern-match compiler for non-linear second-order
patterns.
p_case/ PATTERN-CASE: Implementation of simple pattern matching.
patmat/ PATMAT: A toy pattern matcher.
See Also: ?
===========================================================================
Package: lang/scheme/code/match/match/
Name: Match
Summary: Pattern Matching and Data Definition facility for Scheme
Version: 1.07 (28-FEB-94)
Description:
This package provides a pattern matching facility for Scheme, similar
to the pattern matching facilities of Haskell, Miranda, and ML.
Pattern matching provides a convenient syntax for destructuring
complicated list, and vector structures. The package also provides a
data definition facility for defining new forms of structured data.
Documentation is included in the distribution.
===========================================================================
Package: lang/scheme/code/match/matchcmp/
Name: MatchComp
Summary: Pattern-match compiler for non-linear second-order patterns.
Version: 2.13 (22-JUL-90)
Description:
MatchComp is Christian Queinnec's pattern-match compiler code for
compiling non-linear, second-order patterns on S-Expressions.
===========================================================================
Package: lang/scheme/code/match/p_case/
Name: PATTERN-CASE
Summary: Implementation of simple pattern matching.
Version:
Description:
PATTERN-CASE is a quick Scheme implementation of simple pattern
matching using the R4RS macro extensions.
===========================================================================
Package: lang/scheme/code/match/patmat/
Name: PATMAT
Summary: A toy pattern matcher.
Version:
Description:
PATMAT is a toy pattern matcher, shamelessly borrowed from
Eisenberg, Hartheimer, Clinger, and Abelson, "Programming
in MacScheme", Chapter 15 (Pattern Matching).
===========================================================================
Topic: lang/scheme/code/math/
Name: Math Library
Summary: Scheme code for various mathematical functions.
Description:
This directory contains a variety of math functions implemented in Scheme.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Math, Scheme!Code, Scheme!Math
Contains:
fib/ Fib: Four different implementations of Fibonacci.
jacal/ JACAL: Symbolic math system written in Scheme.
matrix/ Matrix: Scheme procedures for matrix manipulation
misc/ Math Library: Miscellaneous mathematical Scheme code
primes/ Primes: Simple sieve-based generator of prime numbers.
random/ Random number generator
satisfy/ SATISFY: Simple program to solve satisfiability.
See Also: ?
===========================================================================
Package: lang/scheme/code/math/fib/
Name: Fib
Summary: Four different implementations of Fibonacci.
Version:
Description:
MIXFIB is Kent Dybvig's four different fib routines using peano
arithmetic, regular, cps, global-value and call/cc.
===========================================================================
Package: lang/scheme/code/math/jacal/
Name: JACAL
Summary: Symbolic math system written in Scheme.
Version: 1a4 (24-DEC-93)
Description:
JACAL is a symbolic mathematics system for the simplification and
manipulation of equations and single and multiple valued algebraic
expressions constructed of numbers, variables, radicals, and algebraic
functions, differential, and holonomic functions. In addition,
vectors and matrices of the above objects are included.
JACAL is written in Scheme.
If you find JACAL useful, please support the development and
maintenance of JACAL by sending money to Aubrey.
===========================================================================
Package: lang/scheme/code/math/matrix/
Name: Matrix
Summary: Scheme procedures for matrix manipulation
Version: 0.5 (12-MAR-93)
Description:
This directory contains Eigenschink's matrix manipulation routines.
Some ideas were borrowed from a matrix package written by Joe Maruszewski.
===========================================================================
Package: lang/scheme/code/math/misc/
Name: Math Library
Summary: Miscellaneous mathematical Scheme code
Version:
Description:
This directory contains a variety of math functions implemented in Scheme.
hg.scm Implementation of hypergeometric function recursive
in Scheme by Preining Norbert.
(comp.lang.scheme 1-JUL-94)
===========================================================================
Package: lang/scheme/code/math/primes/
Name: Primes
Summary: Simple sieve-based generator of prime numbers.
Version:
Description:
===========================================================================
Package: lang/scheme/code/math/random/
Name:
Summary: Random number generator
Version: 2
Description:
This directory contains a minimal standard random number generator
in Scheme. 32 bit integer version.
===========================================================================
Package: lang/scheme/code/math/satisfy/
Name: SATISFY
Summary: Simple program to solve satisfiability.
Version:
Description:
SATISFY is a simple program to solve satisfiability. It uses a
continuation passing style to implement a backtracking search. No
attempt is made to make the search go fast other than using shared
variables.
===========================================================================
Package: lang/scheme/code/modules/
Name: MODULES
Summary: Implementation of Bracha and Lindstrom's modules.
Version: 13-AUG-93
Description:
This is a module system following Bracha and Lindstrom's ICCL 1992
paper, "Modularity Meets Inheritance".
The system's principal feature is a powerful set of operators for
manipulating name spaces, including:
instantiate, union, layer, extract, delete, difference,
symmetric-difference, extract-as, copy-as, rename, freeze,
freeze-except, hide, hide-except
===========================================================================
Topic: lang/scheme/code/parsing/
Summary: Collection of Scheme code for parsing.
Description:
Various parsing-related code for Scheme. The emphasis is more
on code-related parsing, such as LALR parsers, than on natural
language parsing. (Although some of the parsers can serve dual purposes.)
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Parsing, Scheme!Code, Scheme!Parsing
Contains:
cgram/ CGRAM: Grammar/Parser for ANSI C in Scheme.
earley/ Earley: Earley parser implemented in Scheme.
lalr/ LALR: LALR parser generator for Scheme.
pratt/ Pratt parser implemented in Scheme.
taurus/ Taurus: A recursive descent parser generator for Scheme.
wand/ Exploring aspects of combinator-based LL parser development.
zebu/ Zebu: A LALR(1) parser generator for Scheme.
See Also:
lang/lisp/code/parsing/
areas/nlp/parsing/
===========================================================================
Package: lang/scheme/code/parsing/cgram/
Name: CGRAM
Summary: Grammar/Parser for ANSI C in Scheme.
Version:
Description:
LL(k) (1 <= k <= 2) grammar/parser for ANSI C.
===========================================================================
Package: lang/scheme/code/parsing/earley/
Name: Earley
Summary: Earley parser implemented in Scheme.
Version:
Description:
This directory contains an Earley parser implemented in Scheme. It
includes code (tree.scm) to display trees on character devices.
===========================================================================
Package: lang/scheme/code/parsing/lalr/
Name: LALR
Summary: LALR parser generator for Scheme.
Version: 0.9 (24-MAY-93)
Description:
LALR(1) parser generator for Scheme.
===========================================================================
Package: lang/scheme/code/parsing/pratt/
Name:
Summary: Pratt parser implemented in Scheme.
Version: 2-FEB-90
Description:
PRATT is George Carrette's pratt parser (based on Vaughan
Pratt's "Top Down Operator Precedence").
===========================================================================
Package: lang/scheme/code/parsing/taurus/
Name: Taurus
Summary: A recursive descent parser generator for Scheme.
Version: 1.0 (29-OCT-92)
Description:
Taurus is a parser generator written in Scheme. It generates a
recursive descent parser from a LL(1) grammar augmented with semantic
actions supplied by the user. The resulting parser runs in Scheme,
and can perform automatic syntactic error recovery.
===========================================================================
Package: lang/scheme/code/parsing/wand/
Name:
Summary: Exploring aspects of combinator-based LL parser development.
Version:
Description:
This directory contains several files from Mitchell Wand at
Northeastern exploring aspects of combinator-based LL
parser development. Topics covered include parsers in pure
functional form and combinator-based scanners and parsers.
===========================================================================
Package: lang/scheme/code/parsing/zebu/
Name: Zebu
Summary: A LALR(1) parser generator for Scheme.
Version: 0.9
Description:
Zebu 0.9 is an LALR(1) parser generator for Scheme. Documentation
is included in the distribution.
Zebu reads grammar files that contain the description of a language as
well as the actions to be taken as the language is parsed. The
language is described by production rules, while the actions are
described by associated lambda expressions. Zebu uses the grammar
files to generate parse table files that describe an LR parsing
machine to process the specified language. The Zebu parser driver uses
the parse table file to process the specified language.
===========================================================================
Package: lang/scheme/code/sps/
Name: SPS
Summary: Semantic Prototyping System
Version: 1.6.01 (25-MAR-93)
Description:
This directory contains the Semantic Prototyping System (SPS). SPS
is a suite of programs, written in Scheme, for rapid prototyping
and testing of language definitions written using denotational
semantics. It consists of an ML-style type checker for a large
subset of Scheme, along with an LL(1) parser and transducer
generator.
===========================================================================
Topic: lang/scheme/code/syntax/
Summary: Code related to changing or translating to/from Scheme syntax.
Description:
Programs that provide an alternate syntax for Scheme, translate from
one version of Scheme to another, or provide a syntax extension to Scheme.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Scheme!Code, Scheme!Syntax
Contains:
bob/ Bob: Jim Miller's algolesque syntax for Dylan implemented in
Scheme.
extend/ EXTEND-SYNTAX: Macro for extending the syntax of Scheme.
See Also: ?
===========================================================================
Package: lang/scheme/code/syntax/bob/
Name: Bob
Summary: Jim Miller's algolesque syntax for Dylan implemented in Scheme.
Version: 2-MAR-93
Description:
Bob is algolesque syntax for Dylan implemented in Scheme. It is an
expression-based language.
===========================================================================
Package: lang/scheme/code/syntax/extend/
Name: EXTEND-SYNTAX
Summary: Macro for extending the syntax of Scheme.
Version: 17-APR-91
Description:
This directory contains Kent Dybvig's implementation of EXTEND-SYNTAX,
including the original code, MIT Scheme version, posted MacScheme
version, and examples. The theoretical work and basic design behind
extend-syntax comes from Eugene Kohlbecker PhD thesis.
===========================================================================
Topic: lang/scheme/code/tools/
Name: Scheme Utilities
Summary: Collection of miscellaneous Scheme tools.
Description:
Scheme programming utilities.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Scheme!Code, Scheme!Tools
Contains:
bawk/ BAWK: Scheme version of AWK
mawk/ MAWK: Minimal version of AWK
See Also: ?
===========================================================================
Package: lang/scheme/code/tools/bawk/
Name: BAWK
Summary: Scheme version of AWK
Version: 26-MAY-93
Description:
BAWK is a recreation of much of AWK with a Scheme syntax. (Uses
BTREE, a balanced binary tree package, in its implementation.)
===========================================================================
Package: lang/scheme/code/tools/mawk/
Name: MAWK
Summary: Minimal version of AWK
Version: 4-DEC-93
Description:
MAWK is Minimal AWK, a very simple implementation of many of the
facilities that can be found AWK. It doesn't attempt to look like
AWK, just emulate some of its facilities.
===========================================================================
Topic: lang/scheme/doc/
Summary: Documentation, including standards and proposals
Description:
Contains documents such as introductions to Scheme, copies of the
standards, lists of schools using scheme, and random notes on the
language.
Copying: Free use, copying, distribution
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: none
Keywords:
Scheme!Documents
Contains:
bib/ Bibliographies related to Scheme.
intro/ Introductions, tutorials, and quick reference guides for
Scheme.
macros/ Proposals and implementations for macros in Scheme.
notes/ Summaries and interesting notes about Scheme-related stuff.
standard/ Scheme standards documents and test suites
See Also: ?
===========================================================================
Package: lang/scheme/doc/bib/
Name:
Summary: Bibliographies related to Scheme.
Version:
Description:
This directory contains several bibliographies related to work on Scheme.
compiler.txt Ozan Yigit's bibliography (ascii) of work on compilation
techniques in Scheme.
funcprog.tar Tony Davie's bibliography of functional programming
in refer format. Updated 25-NOV-93.
(tamdhu.dcs.st-andrews.ac.uk:/pub/staple/pubs.txt)
sbib.tar Ozan Yigit's definitive Scheme bibliography in
bib, BibTeX, ASCII, and postscript form. (7-AUG-92)
===========================================================================
Package: lang/scheme/doc/intro/
Name:
Summary: Introductions, tutorials, and quick reference guides for Scheme.
Version:
Description:
intro.txt Ken Dickey's "The Scheme Programming Language".
quickref.txt Ken Dickey's "R4RS Function Signature Synopsis" quick
reference guide to Scheme. (3-OCT-92)
scmintro.tar Joseph W. Lavinus's "Introductory Scheme". (29-SEP-92)
===========================================================================
Topic: lang/scheme/doc/macros/
Summary: Proposals and implementations for macros in Scheme.
Description:
This directory contains the various low and high-level proposals for
macro facilities for Scheme, including the R4RS syntactic
abstraction proposal, lexically-scoped macros, syntactic closures,
explicit renaming, and syntax-case. Some implementations are included.
Copying: Free use, copying, distribution
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: none
Keywords:
Macros, Scheme!Code, Scheme!Documents, Scheme!Macros
Contains:
cr/ CR Macros: Implementation for macros in Scheme.
popl/ Lexically-scoped macros: POPL-91 paper and LP-93 re-exposition.
r4rs/ R4RS Macros: Three implementations of the R4RS macro proposal.
sc/ Syntax-Case Macros: Proposals and implementations for macros
based on syntax-case.
synclo/ Syntactic-Closure Macros: Proposal for macros based on
syntactic closures.
willc/ Explicit-Renaming Based Macros: Proposals and implementations
for macros in Scheme.
See Also: ?
===========================================================================
Package: lang/scheme/doc/macros/cr/
Name: CR Macros
Summary: Implementation for macros in Scheme.
Version:
Description:
This directory contains an implementation of CR-MACROS?
===========================================================================
Package: lang/scheme/doc/macros/popl/
Name: Lexically-scoped macros
Summary: POPL-91 paper and LP-93 re-exposition.
Version:
Description:
This directory contains papers related to lexically-scoped macros.
It includes William Clinger and Jonathan Rees's POPL-91 paper [5],
which describes a modified form of Kohlbecker's algorithm [9,10] for
reliably hygienic (capture-free) macro expansion in block-structured
languages. Also included is Jonathan Rees's 1993 Lisp Pointers paper
[11], which gives a more practical exposition of the algorithm given
in the POPL paper.
===========================================================================
Package: lang/scheme/doc/macros/r4rs/
Name: R4RS Macros
Summary: Three implementations of the R4RS macro proposal.
Version:
Description:
This directory contains two implementations of the R4RS low-level
macro facility, as described in the appendix [4].
===========================================================================
Package: lang/scheme/doc/macros/r4rs/dumesnil/
Name: Dumesnil
Summary: Dumesnil's implementation of R4RS Macros
Version: 1.0 (27-DEC-93)
Description:
This directory contains Antoine Dumesnil de Maricourt's
implementation of the R4RS low-level macro facility, as described
in the appendix [4].
===========================================================================
Package: lang/scheme/doc/macros/r4rs/simple/
Name: Simple Macros
Summary: Rees's implementation of the R4RS macro proposal.
Version: 13-JUN-93
Description:
This directory contains Jonathan Rees's simple implementation of
the R4RS low-level macro facility, as described in the appendix [4]:
DEFINE-SYNTAX, SYNTAX-RULES, and LET-SYNTAX (but not LETREC-SYNTAX).
===========================================================================
Package: lang/scheme/doc/macros/r4rs/syntax/
Name: R4RS Macros
Summary: Hieb and Dybvig's reference implementation of the R4RS
macro proposal.
Version: 1-FEB-91
Description:
This directory contains Robert Hieb and Ken Dybvig's reference
implementation of the R4RS macro proposal.
===========================================================================
Package: lang/scheme/doc/macros/sc/
Name: Syntax-Case Macros
Summary: Proposals and implementations for macros based on syntax-case.
Version: 2.1 (18-JUN-92)
Description:
This directory contains proposals and implementations for macros
based on syntax case. It includes a copy Robert Hieb and Kent
Dybvig's implementation and two related technical reports [6, 8].
===========================================================================
Package: lang/scheme/doc/macros/synclo/
Name: Syntactic-Closure Macros
Summary: Proposal for macros based on syntactic closures.
Version: 9-NOV-91
Description:
This directory contains a copy of Chris Hanson's Lisp Pointers
article [7] on a proposal for macros based on syntactic closures
and an implementation. (For more information, see also [1].)
===========================================================================
Package: lang/scheme/doc/macros/willc/
Name: Explicit-Renaming Based Macros
Summary: Proposals and implementations for macros in Scheme.
Version: Implementation 13-APR-93; Papers 21-FEB-92
Description:
This directory contains William Clinger's proposal for high-level
macros based on explicit renaming, and copies of the proposal [2,3].
===========================================================================
Package: lang/scheme/doc/notes/
Name:
Summary: Summaries and interesting notes about Scheme-related stuff.
Version:
Description:
This directory contains summaries and other notes of general
interest posted to various newsgroups and mailing lists related to
Scheme.
church.txt Notes on Church Numerals.
interval.txt Interval arithmetic and numerical gotcha's.
schools.txt Terry Kaufman's list of colleges, universities, and
secondary schools using Scheme in their curricula.
scmimpls.txt An old list of Scheme implementations compiled by
Jonathan Rees. This list is superseded by the
Scheme FAQ.
tigger.txt A poem about Scheme.
===========================================================================
Topic: lang/scheme/doc/standard/
Summary: Scheme standards documents and test suites
Description:
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: none
Keywords:
Scheme, Scheme!Documents, Scheme!Standards, Standards!Scheme
Contains:
dylan/ Dylan Compatibility: Discussion of Dylan/Scheme compatibility
p1178/ IEEE P1178: IEEE Standard for the Scheme Programming Language
rnrs/ RnRS: Revised Report on the Algorithmic Language Scheme
tests/ Tests Scheme implementations for adherence to the standard.
See Also: ?
===========================================================================
Package: lang/scheme/doc/standard/dylan/
Name: Dylan Compatibility
Summary: Discussion of Dylan/Scheme compatibility
Version:
Description:
Summary of the work of the task force appointed by the RNRS authors
to study the compatibility of Scheme with Dylan.
===========================================================================
Package: lang/scheme/doc/standard/p1178/
Name: IEEE P1178
Summary: IEEE Standard for the Scheme Programming Language
Version:
Description:
IEEE P1178 is IEEE Standard 1178-1990, "IEEE Standard for the Scheme
Programming Language", published by IEEE in 1991. ISBN 1-55937-125-0.
It is now also an ANSI standard. It may be ordered from IEEE by
calling 1-800-678-IEEE or 908-981-1393 or writing IEEE Service Center,
445 Hoes Lane, P.O. Box 1331, Piscataway, NJ 08855-1331, and using
order number SH14209 ($28 for IEEE members, $40 others).
We have removed the draft version of P1178 at IEEE's request.
===========================================================================
Topic: lang/scheme/doc/standard/rnrs/
Name: RnRS
Summary: Revised Report on the Algorithmic Language Scheme
Description:
This directory contains materials related to the RnRS standards for
Scheme.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: none
Author(s): Willaim Clinger and Jonathan Rees
Keywords:
RnRS, Scheme, Scheme!Documents, Standards!RnRS Scheme
Contains:
june92/ June92: Report of the June 1992 meeting of the RnRS authors
proposal/ RnRS Proposals: Proposals for R5RS
r3rs/ R3RS: Revised$^3$ Report on the Algorithmic Language Scheme
r4rs/ R4RS: Revised$^4$ Report on the Algorithmic Language Scheme
See Also: ?
===========================================================================
Package: lang/scheme/doc/standard/rnrs/june92/
Name: June92
Summary: Report of the June 1992 meeting of the RnRS authors
Version:
Description:
This directory contains the report from the June 1992 meeting of
the RnRS authors, on the way to a R5RS standard.
===========================================================================
Package: lang/scheme/doc/standard/rnrs/proposal/
Name: RnRS Proposals
Summary: Proposals for R5RS
Version:
Description:
This directory contains various proposals for the R5RS standard.
arith.txt The non-generic arithmetic proposal.
eval.txt The EVAL proposal.
records.tar The record proposal.
===========================================================================
Package: lang/scheme/doc/standard/rnrs/r3rs/
Name: R3RS
Summary: Revised$^3$ Report on the Algorithmic Language Scheme
Version:
Description:
This directory contains materials related to the R^3RS, R^3.95 and
R^3.99 standards for Scheme.
===========================================================================
Package: lang/scheme/doc/standard/rnrs/r4rs/
Name: R4RS
Summary: Revised$^4$ Report on the Algorithmic Language Scheme
Version:
Description:
This directory contains materials related to the R^4RS standard
for Scheme, including a texinfo format version of the standard.
===========================================================================
Package: lang/scheme/doc/standard/tests/
Name:
Summary: Tests Scheme implementations for adherence to the standard.
Version:
Description:
This directory contains Aubrey Jaffer's IEEE/R4RS compliance
test suite. Note that this is not an exhaustive test.
===========================================================================
Topic: lang/scheme/edu/
Summary: Educational Materials for Teaching/Learning Scheme
Description:
This directory contains materials for teaching Scheme, such as
problem sets, lecture notes, etc.
Copying: Free use, copying, distribution
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: none
Keywords:
Lecture Notes, Problem Sets, Scheme!Documents, Teaching Materials
Contains:
6001/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
gac/ Materials for teaching w/SICP from Gustavus Adolphus College.
plangs/ PLANGS: Principles of Programming Languages
tut/ TUT: Source code from a Scheme-based algorithms class at
Tampere University of Technology.
See Also: ?
===========================================================================
Topic: lang/scheme/edu/6001/
Name: 6.001
Summary: Materials from MIT's course "Structure and Interpretation of
Computer Programs"
Version: Fall 1983 -- Spring 1993
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1983
through Spring 1993.
Origin: /mit/6.001 Locker on Athena.
Copying: Copyright (c) 1985-94 by Massachusetts Institute of Technology
Problem sets may be reproduced for use with
Structure and Interpretation of Computer Programs
by Harold Abelson and Gerald Jay Sussman with Julie Sussman
MIT Press, 1985
Use, copying, and distribution of the software is permitted;
see copyright notice in the files for details.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Mailing List: none
Contact: Hal Abelson
Keywords:
6.001, Authors!Abelson, Lecture Notes, MIT, Problem Sets, SICP,
Scheme!Documents, Teaching Materials
Contains:
dbase/ 6.001: MIT Scheme Problem Set Database
fall83/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
fall84/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
fall85/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
fall86/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
fall87/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
fall88/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
fall89/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
fall90/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
fall91/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
fall92/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
fall93/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
spring84/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
spring85/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
spring86/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
spring87/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
spring88/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
spring89/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
spring90/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
spring91/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
spring92/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
spring93/ 6.001: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
See Also: ?
===========================================================================
Package: lang/scheme/edu/6001/dbase/
Name: 6.001
Summary: MIT Scheme Problem Set Database
Version: 1.0 (11-APR-90)
Description:
This directory contains the User's Manual, example code, and
problem sets from MIT's course "6.001 Structure and Interpretation of
Computer Programs". Some of the examples come from the SICP book.
The problem sets include most of those used in the course from Spring
1981 through Spring 1990. No solutions are included, but the problem
sets are organized according to the subject matter that they cover.
Also included is a history of the problem set usage in 6.001, and some
Scheme problem sets not developed at MIT.
The database of problem sets was organized by Franklyn Turbak.
===========================================================================
Package: lang/scheme/edu/6001/fall83/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1983
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1983.
===========================================================================
Package: lang/scheme/edu/6001/fall84/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1984
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1984.
===========================================================================
Package: lang/scheme/edu/6001/fall85/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1985
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1985.
===========================================================================
Package: lang/scheme/edu/6001/fall86/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1986
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1986.
===========================================================================
Package: lang/scheme/edu/6001/fall87/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1987
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1987.
===========================================================================
Package: lang/scheme/edu/6001/fall88/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1988
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1988.
===========================================================================
Package: lang/scheme/edu/6001/fall89/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1989
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1989.
===========================================================================
Package: lang/scheme/edu/6001/fall90/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1990
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1990.
===========================================================================
Package: lang/scheme/edu/6001/fall91/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1991
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1991.
===========================================================================
Package: lang/scheme/edu/6001/fall92/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1992
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1992.
===========================================================================
Package: lang/scheme/edu/6001/fall93/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Fall 1993
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Fall 1993.
===========================================================================
Package: lang/scheme/edu/6001/spring84/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Spring 1984
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Spring 1984.
===========================================================================
Package: lang/scheme/edu/6001/spring85/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Spring 1985
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Spring 1985.
===========================================================================
Package: lang/scheme/edu/6001/spring86/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Spring 1986
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Spring 1986.
===========================================================================
Package: lang/scheme/edu/6001/spring87/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Spring 1987
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Spring 1987.
===========================================================================
Package: lang/scheme/edu/6001/spring88/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Spring 1988
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Spring 1988.
===========================================================================
Package: lang/scheme/edu/6001/spring89/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Spring 1989
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Spring 1989.
===========================================================================
Package: lang/scheme/edu/6001/spring90/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Spring 1990
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Spring 1990.
===========================================================================
Package: lang/scheme/edu/6001/spring91/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Spring 1991
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Spring 1991.
===========================================================================
Package: lang/scheme/edu/6001/spring92/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Spring 1992
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Spring 1992.
===========================================================================
Package: lang/scheme/edu/6001/spring93/
Name: 6.001
Summary: Materials from MIT's course "Structure and
Interpretation of Computer Programs"
Version: Spring 1993
Description:
This directory contains the problem sets and solutions from MIT's course
"6.001 Structure and Interpretation of Computer Programs" from Spring 1993.
===========================================================================
Package: lang/scheme/edu/gac/
Name:
Summary: Materials for teaching w/SICP from Gustavus Adolphus College.
Version:
Description:
This directory contains teaching materials from Gustavus Adolphus
College (GAC) for use in combination with Abelson and Sussman's
"Structure and Interpretation of Computer Programs" (SICP).
Comments, suggestions, and improvements would be appreciated.
===========================================================================
Package: lang/scheme/edu/plangs/
Name: PLANGS
Summary: Principles of Programming Languages
Version: 18-NOV-93
Description:
This directory contains course notes for
COM 3351, Principles of Programming Languages
a first-year graduate course at Northeastern University.
Many of the programs are written in Scheme.
===========================================================================
Package: lang/scheme/edu/tut/
Name: TUT
Summary: Source code from a Scheme-based algorithms class at
Tampere University of Technology.
Version:
Description:
This directory contains source code for various data structures and
algorithms that are covered at Tampere University of Technology in the
course 81120, "Data Structures and Algorithms".
Includes code for AVL trees, binary trees, various queue
implementations, DFS search, Dijkstra's algorithm, expression
evaluation, Floyd's shortest path algorithm, finite-state machines,
graph traversal, hash tables, heap sort, Knuth-Morris-Pratt algorithm
for string searching, matrices, merge sort, quicksort, random numbers,
selection sort, skew heaps, stacks, and string searching.
===========================================================================
Package: lang/scheme/faq/
Name: Scheme FAQ
Summary: Frequently Asked Questions (FAQ) posting for
comp.lang.scheme newsgroup
Version:
Description:
A compendium of answers to frequently asked questions about
Scheme and related topics. Posted monthly to the comp.lang.scheme
newsgroups.
===========================================================================
Topic: lang/scheme/gui/
Summary: Graphical User Interfaces (GUI) for Scheme and other graphics
code.
Description:
Sources for all the free Scheme graphical user interfaces (GUI)
and information about several of the commercial interfaces.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
GUI!Scheme, Graphics, HCI
Contains:
ezd/ EZD: Interactive structured graphics in Scheme->C
scix/ SCIX: Scheme interface to the X Window System
See Also: ?
===========================================================================
Package: lang/scheme/gui/ezd/
Name: EZD
Summary: Interactive structured graphics in Scheme->C
Version: 1-JUL-91
Description:
Package for producing interactive, structured graphics in Scheme->C.
===========================================================================
Package: lang/scheme/gui/scix/
Name: SCIX
Summary: Scheme interface to the X Window System
Version: 0.97 (16-JUL-90)
Description:
SCIX is an object-oriented interface to the X Window System for
Scheme. Documentation is included in the distribution.
HWOOPS (Heavy-Weight OOPS) is included as part of the SCIX distribution.
===========================================================================
Topic: lang/scheme/impl/
Summary: Free/Shareware Scheme implementations
Description:
Sources for a large collection of Scheme implementations.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Programming Languages!Scheme, Scheme!Implementations
Contains:
apple2gs/ Scheme implementations for the Apple IIGS
bigloo/ Bigloo: A Scheme to C compiler and interpreter
elk/ Elk: Extension Language Kit interpreter for Scheme
fools/ Fools' Lisp: Small R4RS Scheme interpreter
gambit/ Gambit Scheme: An optimizing Scheme compiler.
help/ HELP: A lazy Scheme interpreter
iswym/ ISWYM: Scheme dialect with control operators run and fcontrol.
lib_scm/ libscheme: C library implementing R4RS Scheme.
mit_scm/ MIT Scheme: Portable and fast implementation of Scheme.
oaklisp/ Oaklisp: Object-Oriented Scheme.
pcscheme/ PC Scheme: Scheme implementation for IBM PCs
pixie/ Pixie Scheme: R3RS-compatible Scheme for the Macintosh
pseudo/ Pseudo Scheme: Scheme implemented on top of Common Lisp.
rabbit/ Rabbit Scheme: Old Scheme implementation in InterLisp
s88/ S88: Scheme for 8088 (PC)
scheme2c/ Scheme->C: Scheme implementation that compiles Scheme into C.
scheme48/ Scheme48: Portable and efficient implementation of Scheme.
scheme84/ Scheme84: Scheme that runs in Franz Lisp
scheme88/ Scheme88: Scheme84 ported to Common Lisp.
scm/ SCM: Portable implementation of a R4RS Scheme in C.
similix/ Similix: Self-Applicable Partial Evaluator for a Subset of
Scheme.
siod/ SIOD: Scheme in One Day
stk/ STk: R4RS Scheme interpreter with access to the Tk graphical
package.
t/ T: Scheme-like language developed at Yale
umb_scm/ UMB Scheme: Portable Scheme from UMass/Boston.
vscm/ VSCM: Portable R4RS Scheme implementation.
xscheme/ XScheme: R3RS Scheme with object-oriented programming
See Also: ?
===========================================================================
Package: lang/scheme/impl/apple2gs/
Name:
Summary: Scheme implementations for the Apple IIGS
Version:
Description:
This directory contains implementations of Scheme for the Apple IIgs
===========================================================================
Package: lang/scheme/impl/bigloo/
Name: Bigloo
Summary: A Scheme to C compiler and interpreter
Version: Bigloo 1.6c (9-JUN-94); Camloo 0.2 (9-JUN-94)
Description:
BIGLOO is a Scheme interpreter and compiler. It conforms to the
IEEE-Scheme standard (IEEE P1178) with some extensions, such as
regular expression parsing (RGC), a lexical analyzer generator, a full
foreign function interface, and a pattern matching compiler. Bigloo
can also compile modules written in Caml (an ML dialect), letting you
mix Scheme, ML, and C. Object-oriented programming is provided by
Meroon v3. The main goal of Bigloo is to deliver small and fast stand
alone applications. Bigloo produces ANSI C and hence should be easy
to port.
===========================================================================
Package: lang/scheme/impl/elk/
Name: Elk
Summary: Extension Language Kit interpreter for Scheme
Version: 2.2 (9-FEB-94)
Description:
Elk (Extension Language Kit) is a Scheme interpreter designed to be
used as a general extension language for applications written in C or
C++. Elk can also be used as a stand-alone implementation of the
Scheme programming language. It is mostly R4RS and P1178 conformant
(with the exception of the number system and a few minor details). It
has interfaces to Xlib, Xt, and the Athena and OSF/Motif widget sets.
It includes dynamic incremental linking of C object files, an
optional foreign function interface, and a generational garbage
collector. Elk can also freeze a fully customized application into a
new executable file. Other features include a simple macro
facility, environments as first-class objects, dynamic-wind,
fluid-let, autoloading, and provide/require.
===========================================================================
Package: lang/scheme/impl/fools/
Name: Fools' Lisp
Summary: Small R4RS Scheme interpreter
Version: 1.3.2 (16-OCT-91)
Description:
Fools' Lisp is a small portable Scheme interpreter that is R4RS conformant.
Includes a pretty printer and extend-syntax macros.
===========================================================================
Package: lang/scheme/impl/gambit/
Name: Gambit Scheme
Summary: An optimizing Scheme compiler.
Version: 2.0 (5-FEB-93)
Description:
Gambit is an optimizing Scheme compiler/system. It conforms to the
IEEE-Scheme standard (IEEE P1178) and the Revised^4 Report on Scheme
(R4RS). The system supports the whole numeric tower (i.e. integer,
rational, real and complex numbers). It also has several extensions to
the standards including: weak pairs, string ports, property lists,
futures, pretty printer, debugger, compiler and multitasking. The
distribution contains the interpreter and optimizing native code
compiler and all the sources required to build the system (the sources
for MacGambit are for THINK-C 5.0). MacGambit's specific features
include: a Scheme interface to several Toolbox routines (mostly
QuickDraw), a drawing window for simple graphics, an online help
system containing R4RS and a Scheme oriented editor with an emacs
compatibility mode.
===========================================================================
Package: lang/scheme/impl/help/
Name: HELP
Summary: A lazy Scheme interpreter
Version: 1.4 (12-JAN-93)
Description:
HELP (a lazy Scheme) is a complete and efficient Scheme-like
functional lazy Lisp interpreter. It has a 'friendly' interface
(parenthesis matcher, auto-indent), uses a full call-by-need semantics
and includes many examples, including a symbolic compiler for the
680x0. Efficiency is good and the laziness is fully parametrizable (you
may turn Help into a strict Scheme-like language if you like). French
AND English updated docs are included in Word4 and plain text formats.
===========================================================================
Package: lang/scheme/impl/iswym/
Name: ISWYM
Summary: Scheme dialect with control operators run and fcontrol.
Version: December 1992 (20-JAN-93)
Description:
This directory contains code for the Iswym dialect of Scheme. Iswym
provides Scheme with the control operators run and fcontrol.
===========================================================================
Package: lang/scheme/impl/lib_scm/
Name: libscheme
Summary: C library implementing R4RS Scheme.
Version: 0.3 (17-MAY-94)
Description:
libscheme is a C library implementing Scheme as described in R4RS. It
is easily integrated into a C program as a command interpreter or
extension language, and is easily extended in C with new primitive
types, primitive functions and syntax. It should be portable to most
machines with an ANSI C compiler.
===========================================================================
Topic: lang/scheme/impl/mit_scm/
Name: MIT Scheme
Summary: Portable and fast implementation of Scheme.
Version: 7.3 (beta)
Description:
MIT Scheme (aka C-Scheme) includes Edwin (Scheme's Emacs-like editor)
and Liar (the Scheme compiler). Does not have a convenient foreign
function interface yet. The distribution includes the MIT C-Scheme
Reference and User manuals.
For DOS floppy distribution requests (includes printed copies of
manuals), send $95.00 (payable in U.S. funds to "Scheme Distribution")
to cover costs of distribution to the contact address listed below.
On the NeXT, MIT Scheme is available as part of the Schematik
package, which provides an editor/front-end user interface,
graphics, and "robotics" support for Lego and the like.
Ports: Runs on DEC Alpha, DECStation (MIPS), HP 9000 300/400/700,
IBM RS-6000, Intel i386/i486 (DOS, NT, Windows 3.1, or Linux),
NeXT (NeXTOS 2 or 3), SGI (MIPS), Sony NEWS (MIPS),
Sun3 (SunOS 4.1) and Sun4 (SunOS 4.1).
Origin: martigny.ai.mit.edu:archive/scheme-7.3 [18.43.0.152]
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Bug Reports: bug-cscheme@martigny.ai.mit.edu
bug-cscheme-dos@martigny.ai.mit.edu (DOS version only)
Mailing List: Discussion occurs on the newsgroup comp.lang.scheme.c
which is gatewayed to the info-cscheme@zurich.ai.mit.edu
mailing list.
Contact: Scheme Distribution
c/o Prof. Hal Abelson
545 Technology Square, Room 410
Cambridge MA 02139
Keywords:
Authors!Abelson, C Scheme, Compilers!Scheme, Edwin, Interpreters!Scheme,
Liar, MIT, MIT Scheme, Programming Languages!Scheme, Scheme!IBM PC,
Scheme!Implementations, Scheme!UNIX
Contains:
schematk/ Schematik: MIT Scheme for the NeXT
scoops/ Version of SCOOPS modified to work with MIT Scheme.
sicp/ SICP: SICP compatibility package for MIT Scheme.
v61/ MIT Scheme: Portable and fast implementation of Scheme.
v72/ MIT Scheme: Portable and fast implementation of Scheme.
v73/ MIT Scheme: Portable and fast implementation of Scheme.
See Also: ?
===========================================================================
Package: lang/scheme/impl/mit_scm/schematk/
Name: Schematik
Summary: MIT Scheme for the NeXT
Version: Schematik 1.1.5.2; MIT Scheme 7.1.3
Description:
On the NeXT, MIT Scheme is available as part of the Schematik package,
which provides a NeXT front-end for the Scheme programming language.
Schematik includes an editor, user interface, graphics, and "robotics"
support for Lego and the like.
===========================================================================
Package: lang/scheme/impl/mit_scm/scoops/
Name:
Summary: Version of SCOOPS modified to work with MIT Scheme.
Version: 7.0
Description:
The scoops-7.0.scm in this directory modified by Peter Ross
(peter@aipna.ed.ac.uk) to work with MIT Scheme 7.0 and beyond. It is
based on a version of scoops written at Texas Instruments and modified
by sherin@linc.cis.upenn.edu (who is probably no longer at
linc.cis.upenn.edu) to work on an old version of MIT Scheme.
===========================================================================
Package: lang/scheme/impl/mit_scm/sicp/
Name: SICP
Summary: SICP compatibility package for MIT Scheme.
Version:
Description:
This directory contains the SICP (Structure and Interpretation of
Computer Programs) compatibility package for MIT CScheme.
===========================================================================
Package: lang/scheme/impl/mit_scm/v61/
Name: MIT Scheme
Summary: Portable and fast implementation of Scheme.
Version: 6.1.2
Description:
This directory contains version 6.1.2 of MIT Scheme.
===========================================================================
Package: lang/scheme/impl/mit_scm/v72/
Name: MIT Scheme
Summary: Portable and fast implementation of Scheme.
Version: 7.2
Description:
This directory contains version 7.2 of MIT Scheme.
===========================================================================
Package: lang/scheme/impl/mit_scm/v73/
Name: MIT Scheme
Summary: Portable and fast implementation of Scheme.
Version: 7.3 (17-DEC-93)
Description:
This directory contains version 7.3 (beta) of MIT Scheme.
Includes copies of the MIT Scheme Reference Manual and MIT Scheme
User's Guide.
===========================================================================
Package: lang/scheme/impl/oaklisp/
Name: Oaklisp
Summary: Object-Oriented Scheme.
Version:
Description:
Oaklisp is an seamless integration of Scheme with an object-oriented
substrate. Reference and implementation manuals are included in the
distribution.
===========================================================================
Topic: lang/scheme/impl/pcscheme/
Name: PC Scheme
Summary: Scheme implementation for IBM PCs
Description:
PC-Scheme is a Scheme implementation originally written by Texas
Instruments. This directory contains the version made public by
TI. Note that the public version wasn't as powerful as the
commercial version.
The University of Geneva produced a cleaned up implementation of the
public version and have called it PCS/Geneva. PCS/Geneva is also
available from this directory.
NOTE: Ibuki announced on July 13, 1992, that it has purchased the
rights to PC Scheme from TI and intends to make it also available on
486 PCs and under Windows 3.1. This version should be better than
either of the public versions. For more information, contact IBUKI,
PO Box 1627, Los Altos, CA 94022, phone 415-961-4996, fax 415-961-8016,
email rww@ibuki.com.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
PC Scheme, PCS/Geneva, Programming Languages!Scheme, Scheme!IBM PC,
Scheme!Implementations, Texas Instruments, Univ. of Geneva
Contains:
cwh/ PC Scheme extensions: Extensions to PC Scheme by Carl W.
Hoffman
geneva/ PCS/Geneva: Reimplementation of PC Scheme by Univ. of Geneva.
pcs/ PC Scheme: Scheme implementation for IBM PCs
See Also: ?
===========================================================================
Package: lang/scheme/impl/pcscheme/cwh/
Name: PC Scheme extensions
Summary: Extensions to PC Scheme by Carl W. Hoffman
Version: 10-SEP-90
Description:
This directory contains several extensions to PC Scheme written by
Carl W. Hoffman. The extensions include
clcp.tar Common Lisp Compatibility Package
Includes R3RS functions missing from Scheme,
macros (DEFMACRO, DOTIMES, DOLIST, DEFUN,
SETQ, SETF, PUSH, POP, INCF, DECF, DESCRIBE, ARGLIST),
FORMAT, WARN, ERROR, streams and I/O, sequence
and list functions
epsilon.tar Lisp mode for Epsilon, customized for PC Scheme.
r3rs.tar Adds some of the optional features of R3RS to
PC Scheme.
===========================================================================
Package: lang/scheme/impl/pcscheme/geneva/
Name: PCS/Geneva
Summary: Reimplementation of PC Scheme by Univ. of Geneva.
Version: 4.02PL1 (11-JAN-94)
Description:
PCS/Geneva is a Scheme interpreter/compiler developed at the
University of Geneva. It is based on Texas Instrument's PC Scheme
(version 3.03) but differs somewhat from the original. The main
extensions to PC Scheme are 486 support, BGI graphics, LIM-EMS
pagination support, line editing, mouse support, assembly-level
interfacing, and several powerful Scheme-oriented editors. (TI's PC
Scheme gives users full Revised^3 support along with many primitives
for DOS, Graphics and Text Windows. A powerful built-in optimizing
compiler produces fast code.)
===========================================================================
Package: lang/scheme/impl/pcscheme/pcs/
Name: PC Scheme
Summary: Scheme implementation for IBM PCs
Version: 3.03
Description:
PC-Scheme is a Scheme implementation originally written by Texas
Instruments. This directory contains the version made freely
distributable by TI. Note that the public version wasn't as
powerful as the commercial version, which costs $95 and includes a
reference manual and user guide. [The commercialized version is no
longer available. See the note about Ibuki purchasing the rights below.]
PC Scheme includes an optimizing compiler, an emacs-like editor,
inspector, debugger, performance testing, foreign function interface,
window system and an object-oriented subsystem. Conforms to the
Revised^3 Report on Scheme. Also supports the dialect used in Abelson
and Sussman's SICP.
NOTE: Ibuki announced on July 13, 1992, that it has purchased the
rights to PC Scheme from TI and intends to make it also available on
486 PCs and under Windows 3.1. This version should be better than
either of the public versions and will be supported by Ibuki. For
more information, contact IBUKI, PO Box 1627, Los Altos, CA 94022,
phone 415-961-4996, fax 415-961-8016, email rww@ibuki.com.
===========================================================================
Package: lang/scheme/impl/pixie/
Name: Pixie Scheme
Summary: R3RS-compatible Scheme for the Macintosh
Version: May, 1990
Description:
Pixie Scheme is an implementation of a Scheme interpreter for the
Macintosh with nearly complete coverage of R3RS. The interpreter is
very slow. It also has limited numeric types, with no numeric types
beyond 32-bit integer and 32-bit and 80-bit floats.
The distribution includes two program versions (one uses
68020 / 68881 code, the other runs on a straight MC68000) and
a HyperCard help stack.
Pixie Scheme is distributed as shareware; the author would be
delighted to receive a one dollar donation from each user.
===========================================================================
Package: lang/scheme/impl/pseudo/
Name: Pseudo Scheme
Summary: Scheme implemented on top of Common Lisp.
Version: 2.9 (20-MAY-93)
Description:
PseudoScheme is an implementation of Scheme written in Common Lisp.
It works by running the Scheme code through a preprocessor, which
generates Common Lisp code. It is well integrated with Common Lisp in
that Scheme and Common Lisp programs are directly intercallable.
Scheme programs can be executed using the Common Lisp evaluator or
compiler because Lisp sees Scheme special forms as macros that invoke
the translator. Pseudoscheme does not support first-class
continuations (CALL/CC isn't as general as in a true Scheme), and
it has only partial support for tail recursion and the number
system, but beyond these limitations it scrupulously implements all
of IEEE (and Revised^4) Scheme. It also provides an implementation
of the new "hygienic" high-level macro facility (Clinger and Rees,
POPL '91).
===========================================================================
Package: lang/scheme/impl/rabbit/
Name: Rabbit Scheme
Summary: Old Scheme implementation in InterLisp
Version: 12-FEB-92; Byte Compiler (17-JUN-94)
Description:
Rabbit Scheme is an old implementation of a Scheme compiler in
InterLisp.
Also included is an initial attempt at a bytecode compiler for Rabbit,
written by Tom Lord. [Anybody interested in finishing the job?]
===========================================================================
Package: lang/scheme/impl/s88/
Name: S88
Summary: Scheme for 8088 (PC)
Version: Beta 28
Description:
Scheme 8088 (s88) is a Scheme implementation for the 8088 (PC).
===========================================================================
Package: lang/scheme/impl/scheme2c/
Name: Scheme->C
Summary: Scheme implementation that compiles Scheme into C.
Version: 15-MAR-93
Description:
Scheme->C is an R4RS compliant Scheme system that is centered around
a compiler that compiles Scheme to C. The C code is then compiled
by the native C compiler for the target machine. This design results
in a portable and efficient system that allows either stand-alone
Scheme programs or programs written in a mix of compiled and
interpreted Scheme and compiled code from C, C++ and other languages.
Besides the base language, the system includes "expansion passing
style" macros, a foreign function call capability, records, weak
pointers, three X11 interfaces, call/cc, and a generational,
conservative, copying garbage collector. Numbers are represented
internally as 30-bit integers (62-bit integers on Alpha AXP), or 64-bit
floating point values.
The system is oriented towards block compilation to generate code
which can run in standalone programs which may include code from
other languages. While debugging is typically done using the
interpreter, it will never be considered a "Scheme environment".
The compiler is written in Scheme. Most of the runtime system
(including an interpreter) is written in Scheme. The generational garbage
collector and a few other things are written in C. There is a small
(< 100) amount of assembly code.
The system has three different interfaces to X11, all written in
Scheme. All are available gatekeeper (see Origin below). The first is
a complete set of stubs to Xlib included in the base system. The
second is an alternative to Xlib called SCIX, found in
pub/X11/contrib. The third, ezd, allows programs to easily produce
interactive, structured graphics and is found in pub/DEC/ezd.
===========================================================================
Package: lang/scheme/impl/scheme48/
Name: Scheme48
Summary: Portable and efficient implementation of Scheme.
Version: 0.36 (22-MAR-94)
Description:
Scheme 48 is a Scheme implementation based on a virtual machine
architecture. Scheme 48 is designed to be straightforward, flexible,
reliable, and fast. It should be easily portable to 32-bit
byte-addressed machines that have POSIX and ANSI C support.
In addition to the usual Scheme built-in procedures and a development
environment, library software includes support for hygienic macros (as
described in the Revised^4 Scheme report), multitasking, records,
exception handling, hash tables, arrays, weak pointers, and FORMAT.
Scheme 48 implements and exploits an experimental module system
loosely derived from Standard ML and Scheme Xerox. The development
environment supports interactive changes to modules and interfaces.
This feature makes the module system significantly easier to work with
than it would be otherwise.
The virtual machine executes a byte-code instruction set similar to
the target of the Scheme 311 compiler [Clinger, LFP 1984]. The
interpreter for the virtual instruction set is itself written in
Pre-Scheme, a systems programming dialect of Scheme. A Pre-Scheme
compiler applies intensive source-to-source rewrites to the
interpreter source code and emits low-level C code. When the output
is then compiled by an optimizing C compiler such as gcc, the result
is an efficient and portable emulator.
The virtual machine is initialized from a specified memory image
containing byte-compiled Scheme code and data. Images, including
small stand-alone applications, are built either using a static linker
or by writing out a procedure from an executing program. A standard
memory image contains a Scheme run-time library (APPEND, READ, WRITE,
etc.), a compiler from Scheme to the virtual instruction set, and a
command processor and debugger. In this way Scheme 48 can be
configured to look like a conventional Lisp interpreter.
The Pre-Scheme compiler, which produces scheme48vm.c from vm/*.scm, is
distributed separately. For information contact
kelsey@research.nj.nec.com.
This is a BETA release.
===========================================================================
Package: lang/scheme/impl/scheme84/
Name: Scheme84
Summary: Scheme that runs in Franz Lisp
Version: 0.6 (29-OCT-87)
Description:
Scheme84 is in the public domain. It runs on the VAX in Franz Lisp
under either VMS or BSD Unix.
===========================================================================
Package: lang/scheme/impl/scheme88/
Name: Scheme88
Summary: Scheme84 ported to Common Lisp.
Version: 0.4 (28-JUL-91)
Description:
Scheme88 is a re-implementation of Indiana University's Scheme84
to run in Common Lisp. The port was developed at the Rice University
Department of Computer Science.
Major improvements include
(1) the inclusion of a correct hygienic macro expander for
Kohlbecker's extend-syntax [0, 1];
(2) the inclusion of new control operators, namely, F to grab
FUNCTIONAL continuations, and RUN (or the syntactic abbreviation #>),
to delimit the extent of control operations [2, 3];
(3) an on-line help facility that provides simple descriptions of
built-in functions and syntactic forms.
===========================================================================
Topic: lang/scheme/impl/scm/
Name: SCM
Summary: Portable implementation of a R4RS Scheme in C.
Description:
SCM is a portable implementation of Scheme written in C. SCM conforms
to the Revised^4 Report on the Algorithmic Language Scheme and the
IEEE P1178 specification. SCM supports ASCII and EBCDIC.
For those without ftp access, an IBM PC floppy disk with the source
files and MSDOS and i386 executables is available for $99 from Aubrey
Jaffer (see address below).
If you find SCM useful, please support the development and
maintenance of SCM by sending money to Aubrey, even if you
got SCM by anonymous ftp. This will help fund continued development
work on SCM.
Other packages distributed with SCM, some of which are required
to use SCM, include:
SCMCONFIG Contains additional files for the SCM distribution to
build SCM on Unix machines using GNU autoconf.
HOBBIT Compiler for SCM code.
SMG-SCM Adds VMS SMG screen management routines to SCM.
TURTLSCM Turtle graphics package which works with SCM on MSDOS
or X11 machines.
WB Disk based, sorted associative array (B-tree)
library for SCM. Using WB, large databases can be
created and managed from SCM.
XSCM X windows interface package for Xlib and the Motif
and OpenLook toolkits which works with SCM.
JACAL Symbolic math system written in Scheme.
SLIB Portable Scheme library used by SCM.
SLIB-PSD Portable debugger for Scheme (requires emacs editor).
TEST Tests the correctness of Scheme implementations.
MacSCM Macintosh Support Library
Those packages which aren't included in this directory may be found
elsewhere in the Scheme section of the repository. (See "See Also" below.)
Ports: Runs on Amiga, Atari-ST, MacOS, MS-DOS, OS/2, NOS/VE,
VMS, Unix and similar systems.
Origin: altdorf.ai.mit.edu:archive/scm/
prep.ai.mit.edu:pub/gnu/jacal/
cs.indiana.edu:pub/scheme-repository/new/,
ftp.maths.tcd.ie:pub/bosullvn/jacal/
Copying: GNU GPL
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Author(s): Aubrey Jaffer
84 Pleasant Street
Wakefield, MA 01880
Keywords:
Authors!Jaffer, GNU GPL, HOBBIT, IEEE P1178 Compatible, JACAL, MacSCM, PSD,
Programming Languages!Scheme, R4RS Compatible, SCM, SLIB, SMG-SCM,
Scheme in C, Scheme!Amiga, Scheme!Atari-ST, Scheme!IBM PC,
Scheme!Implementations, Scheme!Macintosh, Scheme!UNIX, TEST, TURTLSCM, WB,
XSCM
Contains:
config/ SCM CONFIG: Uses GNU autoconf to build SCM for Unix
hobbit/ Hobbit: Compiler for SCM code.
macscm/ MacSCM: Macintosh support library for the scm Scheme
interpreter
scm/ SCM: Portable implementation of a R4RS Scheme in C.
smg_scm/ SMG SCM: Adds VMS SMG screen management routines to SCM.
turtlegr/ TURTLSCM: Turtle graphics package which works with SCM on MSDOS
and X11 machines.
wb/ WB: Database package which may be used with SCM.
xscm/ XSCM: X windows support library for the SCM Scheme interpreter
See Also:
lang/scheme/code/debug/psd/
lang/scheme/code/library/slib/
lang/scheme/code/math/jacal/
lang/scheme/doc/standard/tests/
===========================================================================
Package: lang/scheme/impl/scm/config/
Name: SCM CONFIG
Summary: Uses GNU autoconf to build SCM for Unix
Version: 4e1
Description:
SCMCONFIG contains additional files for the SCM distribution to
build SCM on Unix machines using GNU autoconf.
===========================================================================
Package: lang/scheme/impl/scm/hobbit/
Name: Hobbit
Summary: Compiler for SCM code.
Version: 3
Description:
HOBBIT is a small compiler for Scheme. It compiles Scheme programs
to C, and is intended to be used with Aubrey Jaffer's SCM scheme
interpreter. It treats SCM as a C library and integrates compiled
functions into SCM as new primitives. The main aim
of Hobbit is to produce maximally fast C programs which retain
most of the original Scheme program structure, making the output C
program readable and modifiable. Hobbit is written in Scheme and is
able to compile itself.
Hobbit imposes strong restrictions on the higher-order features of
Scheme. For example, it does not support continuations, it does not
allow the return of closures by functions or function redefinition,
and doesn't support CALL/CC, APPLY, FORCE, and DELAY.
The compiler uses lambda-lifting instead of closures.
If you find Hobbit useful, please support the development and
maintenance of Hobbit by sending money to Tanel.
===========================================================================
Package: lang/scheme/impl/scm/macscm/
Name: MacSCM
Summary: Macintosh support library for the scm Scheme interpreter
Version: 1.0 (April 1994)
Description:
MacSCM is similar to x-scm (a SCM package for X-Windows) in that it is
a bolt-on accessory for the "scm" Scheme interpreter that provides a
way to build Macintosh applications.
===========================================================================
Package: lang/scheme/impl/scm/scm/
Name: SCM
Summary: Portable implementation of a R4RS Scheme in C.
Version: 4e1
Description:
SCM is a portable implementation of Scheme written in C. SCM conforms
to the Revised^4 Report on the Algorithmic Language Scheme and the
IEEE P1178 specification. SCM supports ASCII and EBCDIC.
For those without ftp access, an IBM PC floppy disk with the source
files and MSDOS and i386 executables is available for $99 from Aubrey
Jaffer (see address below).
If you find SCM useful, please support the development and
maintenance of SCM by sending money to Aubrey, even if you
got SCM by anonymous ftp.
===========================================================================
Package: lang/scheme/impl/scm/smg_scm/
Name: SMG SCM
Summary: Adds VMS SMG screen management routines to SCM.
Version: 2a1 (17-MAY-93)
Description:
SMG-SCM is a package that adds VMS SMG screen management routines
to SCM. (SMG is VMS's equivalent of curses.) Source code,
documentation, and examples are included.
===========================================================================
Package: lang/scheme/impl/scm/turtlegr/
Name: TURTLSCM
Summary: Turtle graphics package which works with SCM on MSDOS and
X11 machines.
Version:
Description:
TURTLSCM is a turtle graphics package which works with SCM on MSDOS
or X11 machines.
===========================================================================
Package: lang/scheme/impl/scm/wb/
Name: WB
Summary: Database package which may be used with SCM.
Version: 1a2
Description:
WB is a disk based, sorted associative array (B-tree) C library. These
associative arrays consist of variable length (less that 256 bytes)
keys and values.
Using WB, large databases can be created and managed from SCM.
Basic operations are creation, destruction, opening and closing of
diskfiles and arrays, insertion, deletion, retrieval, successor, and
predecessor (with respect to dictionary order of keys). Functional
application of find-next, deletion, and modification over a range of
consecutive key values is supported. Multiple associative arrays
can be stored in one disk file. Simultaneous access to multiple
disk files is supported. A structure checker, garbage collector
are included. A repair program and ram-disk type file (for
temporary structures) are in development. The current WB
implementation has a file size limit of 2^32 * block size (default
2048) = 2^43 bytes (8796 Gbytes). WB does its own memory and disk
management.
===========================================================================
Package: lang/scheme/impl/scm/xscm/
Name: XSCM
Summary: X windows support library for the SCM Scheme interpreter
Version: 1.05 (15-AUG-92)
Description:
XSCM is an X Windows interface to Xlib and the Motif and
OpenLook toolkits for the SCM interpreter.
===========================================================================
Package: lang/scheme/impl/similix/
Name: Similix
Summary: Self-Applicable Partial Evaluator for a Subset of Scheme.
Version: 5.0 (May 1993)
Description:
Similix is an autoprojector (self-applicable partial evaluator) for a
large higher-order subset of the strict functional language Scheme.
Similix treats source programs that use a limited class of
side-effects, for instance input/output operations. Similix handles
partially static data structures.
Similix is automatic: in general, no user annotations (such as
unfolding information) are required; user assistance may in some cases
be required to avoid looping, however. Similix gives certain
guarantees concerning the residual programs it generates: computations
are never discarded (partial evaluation thus preserves termination
properties) and never duplicated.
Similix is well-suited for partially evaluating interpreters that use
environments represented as functions and interpreters written in
continuation passing style. Since Similix is self-applicable,
stand-alone compilers can be generated from interpreters.
Similix is highly portable. It conforms to the IEEE and R4RS Scheme
standards, but it also runs under R3RS Scheme.
===========================================================================
Package: lang/scheme/impl/siod/
Name: SIOD
Summary: Scheme in One Day
Version: 3.0 (12-MAR-94)
Description:
SIOD (Scheme in One Defun) is a small Scheme implementation in C
arranged as a set of subroutines that can be called from any main
program for the purpose of introducing an interpreted extension
language. Compiles to ~20K bytes of executable. Lisp calls C and C
calls Lisp transparently. Version 3.0 includes support for manipulation
of Oracle and Digital RDB relational databases (SQL interface).
===========================================================================
Package: lang/scheme/impl/stk/
Name: STk
Summary: R4RS Scheme interpreter with access to the Tk graphical package.
Version: 2.1 (12-JUN-94); 2.0 (4-JAN-94)
Description:
STk is a R4RS Scheme interpreter which can access the Tk graphical
package. All of the commands defined by the Tk toolkit are available
to the STk interpreter, and Tk variables are reflected back into
Scheme as Scheme variables. Callback is expressed in Scheme. Includes
a CLOS-like OO extension called STklos, which provides multiple
inheritance, generic functions, multi methods, and a true meta-object
protocol. A set of classes have been defined to manipulate Tk
commands (menu, buttons, scales, canvas, canvas items) as Scheme
objects.
Based in part on SIOD.
===========================================================================
Package: lang/scheme/impl/t/
Name: T
Summary: Scheme-like language developed at Yale
Version: 3.1 (22-NOV-91)
Description:
T3.1 is a Scheme-like language developed at Yale. Includes a
foreign function (C) interface.
The distribution includes a copy of the online version of the
T manual and release notes for T3.0 and T3.1.
MULT is a multiprocessing version of T for the Encore Multimax.
===========================================================================
Package: lang/scheme/impl/umb_scm/
Name: UMB Scheme
Summary: Portable Scheme from UMass/Boston.
Version: 2.12 (4-NOV-93)
Description:
UMB Scheme is a portable implementation of Scheme implemented in C. It
conforms to the R4RS and IEEE P1178 standards. It includes a simple
editor and debugger. It gives reasonable run-time performance, is
quite portable, and is suitable for use in undergraduate language courses.
A port of UMB Scheme 2.05 to the Amiga is also included.
===========================================================================
Package: lang/scheme/impl/vscm/
Name: VSCM
Summary: Portable R4RS Scheme implementation.
Version: V0r3 (13-APR-94)
Description:
VSCM is a portable R4RS Scheme. The implementation is based on a
virtual machine design with heavy support for most of the
sophisticated features of Scheme. The virtual machine is written in
ANSI-C to aid in its portability. The bytecode compiler is written in
Scheme itself.
Extensions to R4RS include:
- ability to create a memory image of a running VSCM (dump)
- ability to execute a shell command (system)
- continuations with multiple arguments (call-with-values)
- error handling (with-error-handler)
- flexible garbage collection (with-gc-strategy)
- interrupts (with-interrupt-handler)
- errors (error)
- CPU time measurements (clock, gc-clock, timer)
- access to the environment (getenv)
- eval
- control over open compilation
- file system interface (remove-file, rename-file, etc.)
- generic ports
- writing to and reading from strings
- property lists
===========================================================================
Package: lang/scheme/impl/xscheme/
Name: XScheme
Summary: R3RS Scheme with object-oriented programming
Version: 0.28 (16-SEP-91)
Description:
XScheme is an implementation of the Scheme programming language
with extensions to support object-oriented programming.
XScheme is R3RS compliant. Written in C.
===========================================================================
Package: lang/scheme/mail/
Name:
Summary: Archives of the Scheme mailing list.
Version:
Description:
This directory contains a copy of the archives of the Scheme Digest
mailing list.
===========================================================================
Topic: lang/scheme/oop/
Name: OOP
Summary: Code related to object-oriented programming.
Description:
Contains code and other materials related to object-oriented
programming in Scheme.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
OOP!Scheme, Scheme!Code
Contains:
meroon/ Meroon and Meroonet: Small and efficient object-oriented
programming system for Scheme.
methods/ Methods: Tiny object-oriented programming system for Scheme.
minioop/ MINIOOP: Minimal object support for Scheme
mos/ MOS: Macroless Object System for Scheme
scoops/ SCOOPS: Scheme Object Oriented Programming System
sos/ SOS: Scheme Object System
tinyclos/ TinyCLOS: Scheme implementation of a subset of CLOS, with
metaobject protocol.
yasos/ YASOS: Yet Another Scheme Object System
See Also: ?
===========================================================================
Package: lang/scheme/oop/meroon/
Name: Meroon and Meroonet
Summary: Small and efficient object-oriented programming system
for Scheme.
Version: Meroon v3 (4-JUN-94) StCharles Release
Meroonet 19-MAR-93
Description:
MEROON is a package written in Scheme to provide the basic facilities
of an object-oriented programming style through three macros:
define-class, define-generic, and define-method. MEROON offers simple
inheritance, reflective metaclasses and simple dispatching generic
functions with support for multimethods. MEROON also offers indexed
fields subsuming Scheme vectors without inheritance restrictions.
MEROONET is a toy version of meroon.
Documentation is included with the distribution.
===========================================================================
Package: lang/scheme/oop/methods/
Name: Methods
Summary: Tiny object-oriented programming system for Scheme.
Version: 30-Jun-89
Description:
This directory contains Brian Beckman's tiny object-oriented programming
system for Scheme. This system includes multiple inheritance and
error handling. It is modeled after the message passing modules in
Chapter 3 of Abelson & Sussman.
It is implemented in ``pure'' Scheme, without macros or syntax
extensions.
Documentation and examples are included.
===========================================================================
Package: lang/scheme/oop/minioop/
Name: MINIOOP
Summary: Minimal object support for Scheme
Version:
Description:
Mark Feeley's minimal object support for Scheme.
===========================================================================
Package: lang/scheme/oop/mos/
Name: MOS
Summary: Macroless Object System for Scheme
Version: 10-FEB-94
Description:
An object system for Scheme based on YASOS, but without using R4RS macros.
===========================================================================
Package: lang/scheme/oop/scoops/
Name: SCOOPS
Summary: Scheme Object Oriented Programming System
Version: 20-MAY-87
Description:
SCOOPS (Scheme Object Oriented Programming System) is an object system
for Scheme.
===========================================================================
Package: lang/scheme/oop/sos/
Name: SOS
Summary: Scheme Object System
Version: 7-OCT-93
Description:
SOS (Scheme Object System) is Chris Hanson's reimplementation of
tinyCLOS to be more efficient. Documentation is included in the
distribution.
This package is NOT supported.
===========================================================================
Package: lang/scheme/oop/tinyclos/
Name: TinyCLOS
Summary: Scheme implementation of a subset of CLOS, with
metaobject protocol.
Version: 1.2 (2-DEC-92)
Description:
Tiny CLOS is a Scheme implementation of a `kernelized' CLOS, with a
metaobject protocol. The implementation is even simpler than the
simple CLOS found in `The Art of the Metaobject Protocol,' weighing in
at around 850 lines of code, including (some) comments and
documentation.
===========================================================================
Package: lang/scheme/oop/yasos/
Name: YASOS
Summary: Yet Another Scheme Object System
Version: 2-SEP-92
Description:
YASOS (Yet Another Scheme Object System) is fairly functional in style
and uses delegation. The implementation includes multiple inheritance
and "send to super" and is much smaller than class-based OO systems.
Includes sample collection operations over lists, vectors, strings,
and simple tables.
YASOS is also included as part of SLIB.
The article (swob.txt) was first published as [1].
===========================================================================
Package: lang/scheme/txt/
Name:
Summary: Online Scheme-related tech reports and papers.
Version:
Description:
This directory contains machine readable forms of various
Scheme-related texh reports, conference papers, etc.
===========================================================================
Topic: lang/scheme/util/
Summary: Utilities for programming in Scheme.
Description:
Contains a variety of utilities for programming in Scheme, such as
Emacs-Lisp interfaces and TeX macros for including Scheme code in documents.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Scheme!Utilities
Contains:
editors/ Editor packages for editing/running Scheme code
lisp2tex/ Lisp2TeX: For inserting Scheme/Lisp code in TeX files.
scm_tex/ SchemeTeX: Simple support for literate programming in Scheme.
slatex/ SLaTeX: Allows you to include Scheme/Lisp code `as is' in LaTeX
and TeX source.
sweb/ SchemeWEB: Simple literate programming utility for Lisp, that
lets you generate Lisp and LaTeX code from the same source
file.
See Also: ?
===========================================================================
Package: lang/scheme/util/editors/
Name:
Summary: Editor packages for editing/running Scheme code
Version:
Description:
This directory contains editor packages for editing Scheme code and
running Scheme processes in a window.
emacs.tar is a package for running any Scheme implementation in
a GNU-Emacs buffer.
Olin Shivers
epsilon.tar is code for lisp-mode in the Epsilon (MSDOS) editor.
Steve Ward (March 1990)
cwh.tar lispmode for the Epsilon (MSDOS) editor version 4.13.
Works with Lisp and Scheme.
Carl W. Hoffman (10-SEP-90)
===========================================================================
Package: lang/scheme/util/lisp2tex/
Name: Lisp2TeX
Summary: For inserting Scheme/Lisp code in TeX files.
Version: 4-FEB-94
Description:
LiSP2TeX is a system that allows easy insertions of Scheme, or Lisp,
code towards TeX files. The originality of LiSP2TeX is that it
extracts Scheme definitions from the files where they appear and wraps
them appropriately within TeX macros for insertion into the
documentation file. LiSP2TeX decorrelates writing documentation from
programming: it is therefore possible to separately develop programs
and documentations and to merge them at the end to produce up to date
final documents. LiSP2TeX also has some pretty-printing capabilities
to produce denotations full of greek letters.
Documentation is included in the distribution.
===========================================================================
Package: lang/scheme/util/scm_tex/
Name: SchemeTeX
Summary: Simple support for literate programming in Scheme.
Version: 1.3 (30-JUN-88)
Description:
SchemeTeX is a Unix filter that translates schemeTeX source into LaTeX
source. Originally developed for the Scheme dialect of Lisp, it can
easily be used with most other dialects.
This is not the original distribution, but a version modified by
Pertti Kellom\"aki to work with GNU TeXinfo format.
===========================================================================
Package: lang/scheme/util/slatex/
Name: SLaTeX
Summary: Allows you to include Scheme/Lisp code `as is' in LaTeX
and TeX source.
Version: 2.2 (20-JAN-94)
Description:
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. 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).
===========================================================================
Package: lang/scheme/util/sweb/
Name: SchemeWEB
Summary: Simple literate programming utility for Lisp, that lets you
generate Lisp and LaTeX code from the same source file.
Version: 2.0 (25-FEB-94)
Description:
SchemeWEB provides simple support for literate programming in Lisp.
SchemeWEB version 2.0 is a Unix filter that allows you to generate
both Lisp and LaTeX code from one source file. The generated LaTeX
code formats Lisp programs in typewriter font obeying the spacing in
the source file. Comments can include arbitrary LaTeX commands.
SchemeWEB was originally developed for the Scheme dialect of Lisp, but
it can easily be used with most other dialects.
A SchemeWEB file is a Lisp source file which contains code sections
and comment sections, but each section is identified in a novel way.
A code section begins with a line whose first character is a left
parenthesis. It continues until a line is found which contains the
parenthesis that matches the one which started the code section. The
remaining lines of text in the source file are treated as comments.
===========================================================================
Topic: lang/st/
Summary: Smalltalk Repository
Description:
Welcome to the Smalltalk Repository.
Right now the Smalltalk Repository is a bit sparse, but we intend
to fill it out with relevant source code.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Programming Languages!Smalltalk, Smalltalk
Contains:
faq/ Smalltalk FAQ: Frequently Asked Questions (FAQ) posting for
comp.lang.smalltalk newsgroup
impl/ Free/Shareware Smalltalk implementations
See Also: ?
===========================================================================
Package: lang/st/faq/
Name: Smalltalk FAQ
Summary: Frequently Asked Questions (FAQ) posting for
comp.lang.smalltalk newsgroup
Version:
Description:
A compendium of answers to frequently asked questions about
Scheme and related topics. Posted monthly to the comp.lang.smalltalk
newsgroups.
===========================================================================
Topic: lang/st/impl/
Summary: Free/Shareware Smalltalk implementations
Description:
Sources for several Smalltalk implementations.
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Programming Languages!Smalltalk, Smalltalk!Implementations
Contains:
gnu/ GNU Smalltalk: GNU's implementation of Smalltalk
little/ Little Smalltalk: Tim Budd's version of Smalltalk
See Also: ?
===========================================================================
Package: lang/st/impl/gnu/
Name: GNU Smalltalk
Summary: GNU's implementation of Smalltalk
Version: Unix version 1.1.1 (15-SEP-91); DOS version 1.1.1 (12-SEP-93)
Description:
A free and portable C implementation of Smalltalk, from the folks at GNU.
GNU Smalltalk attempts to be a reasonably faithful implementation of
Smalltalk-80 as described in the "Blue Book", also know as
"Smalltalk-80, the Language and its Implementation", by Adele Goldberg
and David Robson. The syntax that the language accepts and the byte
codes that the virtual machine interprets are exactly as they appear
in the Blue Book. Most of the primitives are the same as well,
although due to the differing nature of the implementation some of the
primitives haven't been implemented, and other new ones have been.
GNU Smalltalk includes an incremental garbage collector, binary image
save capability, C-callout (allows Smalltalk to invoke user-written C
code and pass parameters to it), GNU Emacs editing mode, optional byte
code compilation tracing and byte code execution tracing,
automatically loaded per-user initialization files, and STIX (the
SmallTalk Interface to X).
===========================================================================
Package: lang/st/impl/little/
Name: Little Smalltalk
Summary: Tim Budd's version of Smalltalk
Version: Little ST v3 (7-APR-89); StdWin 0.9.6 (7-JUN-91)
Description:
This directory contains Tim Budd's implementation of Smalltalk.
The windowing interface is built on top of Guido van Rossum's standard
window package, and runs on top of systems that support this package,
including X-11 and the Macintosh.
===========================================================================
Topic: util/
Summary: Compression/Archiving Software
Description:
This directory contains compression and archiving software (gzip,
tar, etc.).
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Keywords:
Archiving Software, Compression Software, Utilities
Contains:
9660_u/ 9660_u: ISO-9660 CD-ROM Utilities
arc/ ARC: Archiving and Compression Program
arj/ ARJ: Archiving and Compression Program
bbedit/ BBEdit: Text editor for the Macintosh
dms/ DMS: Compression and Archiving Program
flip/ FLIP: Does newlines conversions between UNIX and MS-DOS
gnutar/ GNU Tar: Archiving Program
gzip/ GZIP: Compression Program
lha/ LHA: Compression and Archiving Program
mac/ Macintosh Archiving and Compression Programs
pak/ Archiving and Compression Programs
patch/ Patch: Larry Wall's Patch Program
shar/ SHAR: Shell Archiving Program
techinfo/ texinfo
uu/ UUENCODE and UUDECODE: ASCII to Binary and vice versa
zip/ ZIP: Compression and Archiving Program
zoo/ ZOO: Compression and Archiving Program
See Also: ?
===========================================================================
Package: util/9660_u/
Name: 9660_u
Summary: ISO-9660 CD-ROM Utilities
Version: 1.1
Description:
Bill Siegmund dug into the ISO-9660 documentation and pulled out enough
information to write some low-level user-mode code for reading ISO-9660
discs. Rich Morin tweaked the code a bit and added some shell scripts as
frosting. Neither Bill nor Rich is totally happy with the results, but
they agree that it is far better than nothing, and give it to you as a
starting point, tool, or what have you.
===========================================================================
Package: util/arc/
Name: ARC
Summary: Archiving and Compression Program
Version:
Description:
Handles files with extension ".arc" or ".ark" (LZW algorithm).
===========================================================================
Package: util/arj/
Name: ARJ
Summary: Archiving and Compression Program
Version:
Description:
Handles files with extension ".arj" (LZ77 with hashing, plus
secondary static Huffman encoding on a block basis).
===========================================================================
Package: util/bbedit/
Name: BBEdit
Summary: Text editor for the Macintosh
Version: BBEdit Lite 2.32; BBEdit Demo 2.5
Description:
This directory contains the Lite and Demo versions of the BBEdit
text editor for the Macintosh. See the file orders.txt for
information on ordering the full release.
===========================================================================
Package: util/dms/
Name: DMS
Summary: Compression and Archiving Program
Version:
Description:
Handles files with extension ".dms".
===========================================================================
Package: util/flip/
Name: FLIP
Summary: Does newlines conversions between UNIX and MS-DOS
Version: 1.0a (09-JUL-89)
Description:
Flip is a file interchange program that converts text file
formats between UNIX and MS-DOS. It converts lines ending
with carriage-return (CR) and linefeed (LF) to lines ending
with just linefeed, or vice versa.
Executables for MS-DOS and Windows have been included.
===========================================================================
Package: util/gnutar/
Name: GNU Tar
Summary: Archiving Program
Version: 1.11.2
Description:
GNU Tar is the Free Software Foundation's reimplementation of tar.
Extensions:
tar tar file
tgz Gzipped tar file
===========================================================================
Package: util/gzip/
Name: GZIP
Summary: Compression Program
Version: 1.2.4
Description:
GZIP is a compression program from the Free Software Foundation.
GZIP uses the Lempel-Ziv algorithm (LZ77), and generally achieves
better compression than LZW (compress), Huffman coding (pack) and
adaptive Huffman coding (compact), and is patent free. Implementations
exist for VMS, MSDOS, OS/2, Atari, Unix, and Macintosh.
The standard extension for GZIP files is ".gz". GZIP is backward
compatible with compress, so it will also expand ".Z" files.
Extensions:
gz Gzipped text or data file
dgz Gzipped DVI file
pgz Gzipped PostScript file
sgz Gzipped shell archive
tgz Gzipped tar file
txz Gzipped text file
===========================================================================
Package: util/lha/
Name: LHA
Summary: Compression and Archiving Program
Version:
Description:
Handles files with extension ".lha" or ".lzh" (LZ77 with a trie
data structure, plus secondary static Huffman coding on a block basis).
===========================================================================
Package: util/mac/
Name:
Summary: Macintosh Archiving and Compression Programs
Version:
Description:
This directory contains macintosh implementations of binhex/sit/sea/cpt
and the UNIX/PC equivalents. Some of the Unix/PC equivalents also
handle other Macintosh compression facilities, which is why this
directory is so general.
File extensions include
cpt Compact Pro for Mac
sea Self-Extracting Archive
sit Stuffit for Macintosh
hqx BinHex
===========================================================================
Package: util/pak/
Name:
Summary: Archiving and Compression Programs
Version:
Description:
Unpacks files with extension ".pak".
===========================================================================
Package: util/patch/
Name: Patch
Summary: Larry Wall's Patch Program
Version: 2.1
Description:
This directory contains Larry Wall's patch program.
===========================================================================
Package: util/shar/
Name: SHAR
Summary: Shell Archiving Program
Version:
Description:
SHAR (SHell ARchiver) is a UNIX utility for archiving files. Obviously,
this causes problems for non-UNIX systems. Although we've repackaged
most shar files as tar files, we've included unshar programs for DOS
and Macintosh just in case.
Extensions:
shar Shell Archives
shr Shell Archives
sh Shell Archives
===========================================================================
Package: util/techinfo/
Name:
Summary: texinfo
Version: 3.1
Description:
This directory contains source code for the TeX Info package.
===========================================================================
Package: util/uu/
Name: UUENCODE and UUDECODE
Summary: ASCII to Binary and vice versa
Version:
Description:
UUDECODE and ATOB are ascii-to-binary conversion programs. The make
it possible to send binary files by email.
Extensions:
uu uuencoded file
===========================================================================
Package: util/zip/
Name: ZIP
Summary: Compression and Archiving Program
Version:
Description:
There are numerous programs that can unpack files with a ".zip"
extension (LZ77 with hashing, plus secondary static Huffman coding
on a block basis). We've included a selection, for several architectures.
Extensions:
zip zipped archive (Info-ZIP format)
===========================================================================
Package: util/zoo/
Name: ZOO
Summary: Compression and Archiving Program
Version:
Description:
Uncompresses and unarchives files with a ".zoo" extension. The
algorithm is similar to that of lha.
===========================================================================