🚀 go-pugleaf

------------------
CLP(R) Version 1.2
------------------
 
We wish to announce the release of a new version of IBM's prototype
implementation of CLP(R).  This system is available for academic and
research purposes only, and is provided free of charge.  The system
is distributed with source code, manual, examples, etc..  Receipients 
of the system should note that the system comes with a disclaimer and 
user agreement embedded within the source code.  We are distributing 
CLP(R) in order to help widen the use of constraint programming, and 
to solicit feedback on the system.  Our preferred method of distribution 
is by electronic mail in a number of uuencoded files.
Requests for the system should be sent to:
 
     Joxan Jaffar, H1-D48
     IBM Thomas J. Watson Research Center
     P.O. Box 704
     Yorktown Heights, NY 10598
     U.S.A.
     (joxan@watson.ibm.com, joxan@yktvmh.bitnet)
 
CLP(R) is a constraint logic programming language with real-arithmetic
constraints.  The implementation contains a built-in constraint solver
which deals with linear arithmetic and contains a mechanism for delaying
nonlinear constraints until they become linear.  Since CLP(R) subsumes
PROLOG, the system is also usable as a general-purpose logic programming
language.  There are also powerful facilities for meta programming
with constraints.  Significant CLP(R) applications have been published in
diverse areas such as molecular biology, finance, physical modelling, etc.
 
The system, consisting of a compiler, byte-code emulator and constraint
solver, is written entirely in C.  It has been known to run on a number 
of machines: Suns, Vaxen, MIPS-based machines (Decstations, Silicon 
Graphics), IBM RS6000s and PS2s, PC's using a number of UNIX[tm]-based 
operating systems: AIX, System 5, BSD, Mach and SunOS, as well
as under PC's (386's and 486's) running: MS/DOS and OS/2 2.0.

Version 1.2 replaces the previous version 1.1.  It contains a number
of new features which includes support for MS/DOS and OS/2 2.0,
new non-linear constraints for arc sin and arc cos, style checking,
symbolic constants, new system predicates and other enhancements.
 
* UNIX is a trade-mark of AT&T Bell Laboratories.
 
(enquiries may also be directed to roland@bruce.cs.monash.edu.au)