stephen@temvax.UUCP (Stephen C. Arnold) (08/24/89)
Here is a copy of the responces I have gotten so far that list specific prologs. Out of the list of prologs, I have cut all those not free or that can not run on our Vax or Sun. If you want the full list, just ask. ********************************************************************* From bpa!cdin-1!uunet!mcnc.org!unc!bts Fri Aug 11 04:08:39 1989 Date: Thu, 10 Aug 89 16:41:41 EDT From: Bruce Smith <bpa!uunet!cs.unc.edu!bts> Subject: Re: Public Domain Version of Prolog Organization: University Of North Carolina, Chapel Hill Your best bet for a free Prolog is SB-Prolog, FTP-able from the U. of Arizona. Next best (in that $200 is almost free) would be the SICStus Prolog system from Sweden. SICStus is more Quintus-like, compatible down to its foreign function interface. SB-Prolog is fairly standard (Edinburgh style) Prolog, but it has differences in I/O, access to the database, etc. *********************************************************************** NAME: EqL (Equational Language) VERSION: 1.0 SRC/MACHINE/OS: C / Unix AVAILABILITY: Anyone COST: None. Access by FTPing to dopey.cs.unc.edu, log in as ftp, use your name as password, connect to directory pub/EqL, and get all files in directory. Will mail a tape if unable to access by FTP. FEATURES: Combines logic and functional programming, rule-based language, functional syntax, interpreter is essentially an equation solver, has tracing, runs about half as fast as C-Prolog interpreter, tutorial available. CONTACT: Bharat Jayaraman Computer Science Department University of N. Carolina at Chapel Hill Chapel Hill, NC 27514 bj@cs.unc.edu (919) 962-1764 DATED: December 1987 NOTES: The language was first described in the 1986 LISP & FP conference. Several papers and reports available. The language has been extensively tested, and also used in a graduate programming language class. Compiled version being planned. ------------------------------------------------------------------------- NAME: GProlog VERSION: Versions corresponding to C-Prolog versions 1.4 and 1.5 SRC/MACHINE/OS: C with some assembler/Sun 2 and Sun 3/SunOS (4.2 BSD) AVAILABILITY: Anyone COST: Send a magtape and $10 to cover postage and handling. Will store files in tar format. Specify which version of C-Prolog you are using. STATUS: Has been in use for several years, including use in a couple of large projects. FEATURES: Adds SunCore graphics predicates to C-Prolog CONTACT: Barry Brachman {ihnp4!alberta,uw-beaver,seismo}! Dept. of Computer Science ubc-vision!ubc-cs!brachman Univ. of British Columbia brachman@cs.ubc.cdn Vancouver, B.C. V6T 1W5 (604) 228-4327 DATED: August 1987 NOTES: A few of the SunCore routines are not available to GProlog. The distribution consists of patches to be applied to the original C-Prolog 1.4 or 1.5 sources; C-Prolog is *not* included in the distribution. Will email the 6 page manual in LaTeX form upon request. ------------------------------------------------------------------------- NAME: Lambda Prolog VERSION: 2.6 SRC/MACHINE/OS: C-Prolog 1.5, straightforward conversion to Quintus AVAILABILITY: Available by FTP from linc.cis.upenn.edu; log in as anonymous, use your login id as password; cd pub/lp2.6; retrieve the code in the subdirectory. Can mail tar format tapes for those who cannot FTP. CONTACT: Dale Miller (dale@linc.cis.upenn.edu) University of Pennsylvania or Gopalan Nadathur (gopalan@cs.duke.edu) Duke University FEATURES: Lambda Prolog extends Prolog by (1) using typed lambda-terms instead of first-order terms, (2) permitting quantification over function and predicate variables (3) performing higher-order unification and lambda-conversion (4) permitting and interpreting universally quantified goals, and (5) containing a notion of modules. This logic programming language provides many of the higher-order features which are common in functional programming languages. The availability of higher-order unification, however, gives this language a certain kind of richness not present in other programming languages. We illustrate this richness by demonstrating how this language can be used to provide novel specifications of (1) theorem provers and proof systems, (2) program transformation algorithms, and (3) knowledge representation systems. DATED: Sept 1987 --------------------------------------------------------------------- NAME: LISPLOG VERSION: 2 SRC/MACHINE/OS: SYMBOLICS COMMON LISP and FRANZ LISP or COMMON LISP in UNIX on VAX, APOLLO, SUN, and IBM-RT AVAILABILITY: Unrestricted. COST: Still free FEATURES: Iterative interpreter and CProlog translator; several LISP/PROLOG interfaces; varying-length structures; predicate variables; specialized cut operator and initial-cut tools; zoom-box model; modules; streams; forward-chaining extensions; micro-UNIXPERT system. CONTACT: LISPLOG-Buero, AG Richter FB Informatik, Univ. Kaiserslautern Postfach 3049 6750 Kaiserslautern W. Germany E-mail: lisplog@uklirb.UUCP DATED: September 1987 NOTES: Recursive interpreter (version II) also supported. --------------------------------------------------------------------- NAME: SB-Prolog VERSION: 2.5 SRC/MACHINE/OS: C and UNIX. Assumes longwords need only be word-aligned, may not port easily to machines with stronger alignment requirements. At present, does not work on Sun4. AVAILABILITY: FTP-able from arizona.edu, restrictions similar to GNU. Login to arizona.edu as anonymous, copy contents of the directory 'sbprolog'. Several files are in tar format, so ftp should be done in binary mode. The system is also available on 1600 bpi tar format tapes at distribution cost ($20 in USA and Canada; $40 elsewhere). COST: FREE!! FEATURES: Based on the Warren Abstract Machine. Allows arbitrary mixing of compiled (byte code) and interpreted code. Provides user-directed goal caching; argument indexing in both compiled and interpreted code; CProlog-like trace/debug package; compilation to byte-code object files, with dynamic loading of undefined predicates. CONTACT: Saumya K. Debray (debray@arizona.edu) Department of Computer Science University of Arizona Tucson, Arizona 85721 (602) 621-4527 DATED: September 1988 --------------------------------------------------------------------- --------------------------------------------------------------------- ************************************************************************ There also is a prolog from Sweeden that I am getting more information about. I'll post on it when I have all the info.
hankin@sauron.osf.org (Scott Hankin) (09/02/89)
A while back someone asked about public domain implementations of Prolog. The poster stated that when all the information was collected, a synopsis would be posted containing evrything. Did I miss it? If so, could someone repost it?
griesel@umn-cs.CS.UMN.EDU (Curtis W. Griesel) (09/12/89)
I've seen some discussion about public-domain Prologs in this group, but I haven't seen any information on where I can get ahold of one. I'm in need of one for my AT. Please send responses through net mail, as I don't always read this group. -- Curtis W. Griesel EQUAL Project (EQuipment for Universal Access to Learning), U of Minnesota Internet: griesel@umn-cs.cs.umn.edu; Voice: 612/625-9081; TDD: 612/626-1346 U S Mail: 4-192 EE/CSci Building; 200 Union Street SE; Minneapolis, MN 55455