[comp.newprod] sicstus0.6

matsc@sics.se (Mats Carlsson) (04/30/88)

		Announcing SICStus Prolog version 0.6
		=====================================
				   
SICStus Prolog is a portable (BSD Unix (tm), marginally sysV Unix (tm)) 
C implementation of Prolog, written at SICS (Swedish Institute of
Computer Science).  The implementation is based on the Warren Abstract
Machine (WAM).  The programming environment bas benefitted from public
domain code contributed principally by R.A. O'Keefe and D.H.D. Warren.

SICStus Prolog is functionally comparable to Quintus Prolog (tm) 2.2
as far as syntax and built-in predicates are concerned.  Version 0.6
does not have indexed interpreted code, modules, or an Emacs
interface, but does provide interpreted and compiled predicates mixed
arbitrarily, 32-bit 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
operations, and wait declarations for data-driven execution.

SICStus Prolog is being actively maintained.  Bug reports and
suggested improvements are most welcome and will contribute to the
quality of future versions.  Send bug reports to

	sicstus_bug@sics.se

Send requests for ordering information to

	sicstus_request@sics.se


Summary of features added since 0.5:

	- a manual exists (hardcopy and on-line),

	- save/[1,2], save_program/1, and restore/1 exist and
	  enable entire execution states to be saved,

	- compiles and consults can be recursive and are more
	  consistent.  Both support the declarations
		:- dynamic Name/Arity.
		:- multifile Name/Arity.
		:- wait Name/Arity.

	- redefinition warnings appear when predicates are defined
	  in one file and redefined in another,

	- "~" and "~USER" are supported in pathnames,

	- the debugger is extended (printlevels and navigation),

	- statistics messages are more consistent,

	- the restriction on term size in certain predicates has been lifted,

	- interpreted code runs significantly faster,

	- a few new predicates exist,

	- numerous bugs have been fixed.