cmaeda@a.gp.cs.cmu.edu (Christopher Maeda) (04/19/91)
You could also get Elk Scheme and run the Calgary Scheme Prolog Interpreter. I'll upload the prolog program to cs.orst.edu. Here's the readme file: Scheme Prolog 1.1 ----------------- written by John Cleary, Alan Dewar, Vinit Kaushik and Sue Rempel at the University of Calgary (cleary@cpsc.ucalgary.ca). This package provides a fairly simple interpreter for pure Prolog, implemented in Scheme. It is primarily intended for use in students' projects involving implementations of Prolog. Scheme Prolog version 1.1 is mostly a pure Prolog interpreter, though a few built-in primitives are also included. Delayed goals are also supported, and an interval-arithmetic package is included. For details on invoking Scheme Prolog and on the built-in routines supported, refer to "manual". For implementation details, refer to "impl". For details on the interval-arithmetic package, refer to the following paper: Cleary, John G. (1987) "Logical Arithmetic," Future Computing Systems 2(2) 125-149. -- Chris Maeda, Grad Student from Hell |Mail: cmaeda@cs.cmu.edu Yow! I find I enjoy netnews more after |UUCP: fuck if I know having a couple of twinkies and a coke. |(si:halt "boot Am I a Unix Weenie yet? |")
piak@sics.se (Per Kreuger) (04/24/91)
In response to requests for information on prologs for NeXT I post the following anouncement from the group that developed the SICSTUS system. Although I do work at SICS I am not part of the group that developed SICSTUS, but use the system regularly and am very satisfied with it. Note that the NeXT version we have running at SICS is not quite complete at present. Save and restore does not work, nor is does the foreign function inteface (for accesseing c-procedures from within a Prolog program). These problems might be fixed in future versions. What follows is a the official anouncement of the SICTUS Prolog product: Announcing SICStus Prolog version 0.7 ===================================== SICStus Prolog is a portable implementation of Prolog, written at SICS (Swedish Institute of Computer Science). Written in C and Prolog, the implementation is based on the Warren Abstract Machine (WAM). The programming environment has benefitted 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 functionally comparable to Quintus Prolog(TM) 2.4 as far as syntax and built-in predicates are concerned. Version 0.7 does not have a module system, but does provide indexed interpreted and compiled predicates mixed arbitrarily, unbounded precision integer and double precision floating point arithmetic, unification of cyclic structures, a garbage collector and a stack shifter, attention key (control-c) handling, a "procedure box" debugger, dynamic interfacing to C functions, backtrackable side-effects, wait declarations for data-driven execution, execution profiling primitives, a machine-independent WAM compiler, and a native code compiler for Sun-3's. Send requests for ordering information to 'sicstus_request@sics.se'. SICStus Prolog is portable to most UNIX(TM) machines (Berkeley UNIX is preferred over System V). Summary of features added since version 0.6: - Primitives for collecting execution profiling data exist. - A Sun-3 native code compiler exists. - Interpreted code is indexed but is not necessarily dynamic. - Declarations, clauses, and commands take effect in order of occurrence in the various compile/consult/load loops. - Clauses of multifile predicates can be loaded from object files, and recursive loads are allowed. - No global symbol table is used for floats and large integers. - The precision of integers is unbounded. Per Kreuger Internet: piak@sics.se Swedish Institute of Computer Science Phone (intn'l): +46 8 752 15 22 Box 1263 Telefon (nat'l): 08 - 752 15 22 S-164 28 KISTA, SWEDEN