matsc@sics.se (Mats Carlsson) (01/04/90)
Archive-name: lm-prolog Original-posting-by: matsc@sics.se (Mats Carlsson) Original-subject: LM-Prolog available Archive-site: sics.se [192.16.123.90] Archive-directory: archive Archive-files: lm-prolog.tar.Z Reposted-by: emv@math.lsa.umich.edu (Edward Vielmetti) 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, Ken Kahn and Mats Carlsson, were at Uppsala University. The work was supported by the Swedish National Board for Technical Development (STU). Ken Kahn wrote two precursors to the present implementation, one in Pure Lisp and one based on flavors and message passing and implemented libraries of built-in predicates and demo programs. The present implementation compiles Prolog predicates to Lisp functions, using success continuations to emulate the Prolog control structure. Mats Carlsson implemented the compiler and runtime support including microcode extensions for LMI CADRs and Lambdas. This code is provided as is, without any warranty or support. It has run on an LMI Lambda Release 3.0 of December 1986. Earlier versions ran on all Symbolics and LMI models, but it is unlikely that this version does. Although the implementation language - ZetaLisp - is similar to Common Lisp, porting the system to Common Lisp would be a major project since extensive use was made of ZetaLisp features such as locatives, invisible pointers, and flavors. LM-Prolog is now in the public domain and available by anonymous ftp from sics.se (192.16.123.90) as 'archive/lm-prolog.tar.Z'. -- Mats Carlsson SICS, PO Box 1263, S-164 28 KISTA, Sweden Internet: matsc@sics.se Tel: +46 8 7521543 Ttx: 812 61 54 SICS S Fax: +46 8 7517230