From owner-FreeBSD-users-jp@jp.freebsd.org  Tue Nov 18 10:48:17 1997
Received: by jaz.jp.freebsd.org (8.8.8+2.7Wbeta7/8.7.3) id KAA21270
	Tue, 18 Nov 1997 10:48:17 +0900 (JST)
Received: by jaz.jp.freebsd.org (8.8.8+2.7Wbeta7/8.7.3) with ESMTP id KAA21263
	for <FreeBSD-users-jp@jp.freebsd.org>; Tue, 18 Nov 1997 10:48:10 +0900 (JST)
From: hirano@ccm.cl.nec.co.jp
Received: from adam.dsp.cl.nec.co.jp (root@adam.dsp.cl.nec.co.jp [133.207.2.76]) by research.gate.nec.co.jp (8.8.7+2.7Wbeta7/971104) with ESMTP id KAA12785; Tue, 18 Nov 1997 10:48:07 +0900 (JST)
Received: from ccm.cl.nec.co.jp by adam.dsp.cl.nec.co.jp (8.8.5+2.7Wbeta5/CL-960412) with ESMTP id KAA15257; Tue, 18 Nov 1997 10:48:06 +0900 (JST)
Message-Id: <199711180148.KAA15257@adam.dsp.cl.nec.co.jp>
To: FreeBSD-users-jp@jp.freebsd.org
In-reply-to: Your message of Tue, 18 Nov 1997 03:25:27 JST.
             <199711180104.KAA05301@fz04.ec.hokudai.ac.jp> 
Date: Tue, 18 Nov 1997 10:48:01 +0900
Reply-To: FreeBSD-users-jp@jp.freebsd.org
Precedence: bulk
X-Distribute: distribute [version 2.1 (Alpha) patchlevel=20]
X-Sequence: FreeBSD-users-jp 20829
Subject: [FreeBSD-users-jp 20829] Re: Is there Prolog? 
Errors-To: owner-FreeBSD-users-jp@jp.freebsd.org
Sender: owner-FreeBSD-users-jp@jp.freebsd.org

$B!!(BProlog$B%f!<%6$G$O$J$$$G$9$,!D(B

> FreeBSD$B$G$D$+$($k%U%j!<%&%'%"$N(BProlog$B$O$"$j$^$9$+!)(B

$B!!(B2.2.5-RELEASE$B$N(Bpackages$B$N(BINDEX$B$r(Bgrep$B$9$k$H!"(B

swi-pl-2.8.6|/usr/ports/lang/swi-pl|/usr/local|
Edinburgh-style Prolog compiler.|/usr/ports/lang/swi-pl/pkg/DESCR|
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
max@FreeBSD.ORG|lang||

$B$3$&$$$&$N$,=P$FMh$^$7$?!#;H$C$?$3$H$,$J$$$N$G!"%U%j!<$+$I$&$+$H$+!"A4(B
$B$/$o$+$j$^$;$s$,!D(B

$B!!$"$H!"<j85$K$"$k$N$O>/!98E$$$G$9$,!"(B

========================================================================
From: free-compilers@idiom.com (Steven Robenalt)
Newsgroups: comp.compilers,comp.lang.misc,comp.archives.admin,news.answers,comp.answers
Subject: Catalog of compilers, interpreters, and other language tools [p3of5]
Date: 1 Mar 1996 07:00:07 -0500
Approved: compilers@iecc.com
Message-ID: <free3-Mar-96@comp.compilers>
========================================================================

$B$3$s$J5-;v$,$"$j$^$9!#(BProlog$B$*$h$S$=$N?F@L$,BgNL$K$"$j$^$9$M!#(BGPL$B$J%$(B
$B%s%?%W%j%?$b$"$j$^$9$M!#D9$$$N$G!"$3$N%a!<%k$N:G8e$KIU$1$H$-$^$9!#(B

$B!t(B386BSD$B$K%]!<%H$5$l$?$N$^$G$"$k!D(B

$B!!8f4uK>$K$=$&$b$,$"$j$^$7$?$i!"(BQandA$B7A<0$K$7$F!"(BQandA@jp.freebsd.org
$B$K$G$bAw$C$F$d$C$F2<$5$$!#(B

----
$BF|K\EE5$(B($B3t(B)C&C$B%a%G%#%"8&5f=j!!J?Ln989((B
E-mail : hirano@ccm.CL.nec.co.jp
========================================================================
language:	Prolog
package:	SB-Prolog
version:	3.1 ?
parts:		?
author:		interpreter
location:	ftp pub/sbprolog from sbcs.sunysb.edu
description:	?
restriction:	GNU General Public License
contact:	? warren@sbcs.sunysb.edu ?
updated:	?

language:	Prolog
package:	XSB
version:	1.2
parts:		interpreter, preprocessor(HiLog), documentation
author:		XSB research group / SUNY at Stony Brook
location:	ftp pub/XSB/XSB.tar.Z from sbcs.sunysb.edu (130.245.1.15)
description:	XSB extends the standard functionality of Prolog (being a
		descendant of PSB- and SB-Prolog) to include implementations of
		OLDT (tabling) and HiLog terms.	 OLDT resolution is extremely
		useful for recursive query computation, allowing programs to
		terminate correctly in many cases where Prolog does not.  HiLog
		supports a type of higher-order programming in which predicate
		symbols can be variable or structured.	This allows unification
		to be performed on the predicate symbols themselves in addition
		to the arguments of the predicates.  Of course, Tabling and
		HiLog can be used together.
ports:		Sun, Solaris, NeXT, Linux, 386 BSD, IRIX, HP-UX
portability:	Generally to 32-bit machines.
contact:	xsb-contact@cs.sunysb.edu
updated:	1993/07/28

language:	Prolog
package:	Modular SB-Prolog
version:	?
parts:		interpreter
author:		?
location:	ftp pub/dts/mod-prolog.tar.Z from ftp.dcs.ed.ac.uk
description:	SB-Prolog version 3.1 plus modules
restriction:	GNU General Public License
ports:		Sparc
contact:	Brian Paxton <mprolog@dcs.ed.ac.uk>
updated:	?

language:	ALF [prolog variant]
package:	alf (Algebraic Logic Functional programming language) 
version:	?
parts:		runtime, compiler(Warren Abstract Machine)
author:		Rudolf Opalla <opalla@julien.informatik.uni-dortmund.de>
location:	ftp pub/programming/languages/LogicFunctional from
		ftp.germany.eu.net
description:	ALF is a language which combines functional and
		logic programming techniques.  The foundation of
		ALF is Horn clause logic with equality which consists
		of predicates and Horn clauses for logic programming,
		and functions and equations for functional programming.
		Since ALF is an integration of both programming
		paradigms, any functional expression can be used
		in a goal literal and arbitrary predicates can
		occur in conditions of equations.
updated:	1992/10/08

language:	CLP (Constraint Logic Programming language) [Prolog variant]
package:	CLP(R)
version:	1.2
parts:		runtime, compiler(byte-code), contstraint solver
author:		IBM
location:	mail to Joxan Jaffar <joxan@watson.ibm.com>
description:	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.	 We are distributing CLP(R) in order 
		to help widen the use of constraint programming, and 
		to solicit feedback on the system
restriction:	free for academic and research purposes only
ports:		unix, msdos, OS/2
contact:	Roland Yap <roland@bruce.cs.monash.edu.au>, Joxan Jaffar
updated:	1992/10/14

language:	Prolog + constraints over Finite Domains and Booleans
package:	clp(FD)
version:	2.2
parts:		compiler clp(FD)->C, FD solver, runtime, debugger.
author:		Daniel Diaz - INRIA Rocquencourt - FRANCE
location:	ftp ftp.inria.fr in the directory
		/INRIA/Projects/ChLoE/LOGIC_PROGRAMMING/clp_fd
description:	clp(FD) is a constraint logic programming language
		over Finite Domains. clp(FD) is based on the wamcc
		Prolog compiler which translates Prolog to C. 
		clp(FD) provides several constraints "a la CHIP" on
		Finite Domains and Booleans and some facilities to
		build new constraints. clp(FD) is 4 times faster than
		CHIP v3.2 on average. 
restriction:	free (see COPYRIGHT notice)
requires:	GNU C (gcc) version 2.4.5 or higher
ports:		Sparc workstations, PC under linux, sony mews, dec ultrix
portability:	Generally to 32-bit machines with gcc.
contact:	Daniel Diaz (Daniel.Diaz@inria.fr)
updated:	1994/08/01

language:	Prolog
package:	wamcc
version:	2.2
parts:		compiler Prolog->C, runtime, Prolog debugger, WAM debugger.
author:		Daniel Diaz - INRIA Rocquencourt - FRANCE
location:	ftp ftp.inria.fr in the directory
		/INRIA/Projects/ChLoE/LOGIC_PROGRAMMING/wamcc
description:	wamcc is a Prolog Compiler which translates Prolog to
		C via the WAM. wamcc has a syntax very close to the
		future ansi standard. wamcc offers the most usual
		built-in predicates, a top-level, a Prolog debugger and a
		WAM debugger. wamcc is designed to be easily extended
		(e.g. see clp(FD)).
		From an efficiency point of view, wamcc is between
		SICStus "emulated" and SICStus "native code" on Sparc
		machines (1.5 times faster than SICStus emulated, 1.5
		times slower than SICStus "native code").
restriction:	free (see COPYRIGHT notice)
requires:	GNU C (gcc) version 2.4.5 or higher
ports:		Sparc workstations, PC under linux, sony mews, dec ultrix
portability:	Generally to 32-bit machines with gcc.
contact:	Daniel Diaz (Daniel.Diaz@inria.fr)
updated:	1994/08/01

language:	Prolog (variant)
package:	Aditi
version:	Beta Release
parts:		interpreter, database
author:		Machine Intelligence Project, Univ. of Melbourne, Australia
location:	send email to aditi@cs.mu.oz.au
description:	The Aditi Deductive Database System is a multi-user
		deductive database system.  It supports base relations
		defined by facts (relations in the sense of relational
		databases) and derived relations defined by rules that
		specify how to compute new information from old
		information.  Both base relations and the rules
		defining derived relations are stored on disk and are
		accessed as required during query evaluation.  The
		rules defining derived relations are expressed in a
		Prolog-like language, which is also used for expressing
		queries.  Aditi supports the full structured data
		capability of Prolog.  Base relations can store
		arbitrarily nested terms, for example arbitrary length
		lists, and rules can directly manipulate such terms.
		Base relations can be indexed with B-trees or
		multi-level signature files.  Users can access the
		system through a Motif-based query and database
		administration tool, or through a command line
		interface.  There is also in interface that allows
		NU-Prolog programs to access Aditi in a transparent
		manner.	 Proper transaction processing is not supported
		in this release.
ports:		Sparc/SunOS4.1.2 Mips/Irix4.0
contact:	<aditi@cs.mu.oz.au>
updated:	1992/12/17

language:	Lambda-Prolog
package:	Prolog/Mali (PM)
version:	? 6/23/92 ?
parts:		compiler(->C), linker, libraries, runtime, documentation
author:		Pascal Brisset <brisset@irisa.fr>
location:	ftp pm/* from ftp.irisa.fr
description:	Lambda-Prolog, a logic programming language defined by
		Miller, is an extension of Prolog where terms are
		simply typed $\lambda$terms and clauses are higher
		order hereditary Harrop formulas. The main novelties
		are universal quantification on goals and implication.
reference:	Miller D.A. and Nadathur G. "Higher-order logic 
		 programming", 3rd International Conference on Logic 
		 Programming, pp 448-462, London 1986.
		Nadathur G. "A Higher-Order Logic as a Basis for Logic
		 Programming", Thesis, University of Pennsylvania, 1987.	 
requires:	MALI-V06 abstract memory. MALI is available by anonymous ftp 
		from ftp.irisa.fr
ports:		unix
discussion:	prolog-mali-request@irisa.fr
contact:	pm@irisa.fr
updated:	1992/07/06

language:	Prolog (variant)
package:	CORAL
version:	?
parts:		interpreter, interface(C++), documentation
author:		?
location:	ftp ? from ftp.cs.wisc.edu
description:	The CORAL deductive database/logic programming system was
		developed at the University of Wisconsin-Madison.  The CORAL
		declarative language is based on Horn-clause rules with
		extensions like SQL's group-by and aggregation operators, and
		uses a Prolog-like syntax.  * Many evaluation techniques are
		supported, including bottom-up fixpoint evaluation and top-down
		backtracking.  * A module mechanism is available.  Modules are
		separately compiled; different evaluation methods can be used
		in different modules within a single program.  * Disk-resident
		data is supported via an interface to the Exodus storage
		manager.  * There is an on-line help facility
requires:	AT&T C++ 2.0 (G++ soon)
ports:		Decstation, Sun4
updated:	1993/01/29

language:	Prolog
package:	BinProlog
version:	1.71
parts:		interpreter?, documentation
author:		?
location:	ftp BinProlog/* from clement.info.umoncton.ca
description:	BinProlog 1.71 is at this time probably the
		fastest freely available C-emulated Prolog.
ports:		IBM-PC/386, Sun-4, Sun-3, NeXT
contact:	Paul Tarau <tarau@info.umoncton.ca>
updated:	1993/04/03

language:	Prolog
package:	SWI-Prolog
version:	1.7.2
parts:		?
author:		Jan Wielemaker <jan@swi.psy.uva.nl>
location:	ftp pub/SWI-Prolog from swi.psy.uva.nl 
    OS/2:	ftp pub/toolw/SWI/* from mpii02999.ag2.mpi-sb.mpg.de
description:	?
conformance:	superset
features:	"very nice Ed. style prolog, best free one I've seen"
restriction:	GNU General Public License
ports:		Sun-4, Sun-3 (complete); Linux, DEC MIPS (done but 
		incomplete, support needed); RS6000, PS2/AIX, Atari ST,
		Gould PN, NeXT, VAX, HP-UX (known problems, support needed);
		MSDOS (status unknown), OS/2
status:		activly developed
discussion:	prolog-request@swi.psy.uva.nl
contact:	(OS/2) Andreas Toenne <atoenne@mpi-sb.mpg.de>
updated:	1993/07/23

language:	Prolog
package:	Beta-Prolog
version:	1.5
parts:		interpreter(?), libraries, debugger
author:		Neng-Fa Zhou <zhou@mse.kyutech.ac.jp>
		form "Real Name <email@address>".  Surface mail addresses
		are not used unless there is no email address.
location:	ftp pub/Language/prolog/* from ftp.kyutech.ac.jp
description:	?
conformance:	Incorporates most built-in predicates in ISO-Prolog.
updated:	1995/04/05

language:	Prolog
package:	Frolic
version:	?
parts:		?
author:		?
location:	ftp pub/frolic.tar.Z from cs.utah.edu
description:	?
requires:	Common Lisp
contact:	?
updated:	1991/11/23

language:	Prolog
package:	? Prolog package from the University of Calgary ?
version:	?
parts:		?
author:		?
location:	ftp pub/prolog1.1/prolog11.tar.Z from cpsc.ucalgary.ca
description:	+ delayed goals
		+ interval arithmetic
requires:	Scheme
portability:	relies on continuations
contact:	?
updated:	?

language:	Prolog
package:	? slog ?
version:	?
parts:		translator(Prolog->Scheme)
author:		dorai@cs.rice.edu
location:	ftp public/slog.sh from titan.rice.edu
description:	macros expand syntax for clauses, elations etc, into Scheme
ports:		Chez Scheme
portability:	reliese on continuations
updated:	?

language:	Prolog
package:	LM-PROLOG
version:	?
parts:		?
author:		Ken Kahn and Mats Carlsson
location:	ftp archives/lm-prolog.tar.Z from sics.se
description:	?
requires:	ZetaLisp
contact:	?
updated:	?

language:	Prolog
package:	Open Prolog
version:	?
parts:		?
author:		?
location:	ftp languages/open-prolog/* from grattan.cs.tcd.ie
description:	?
ports:		Macintosh
contact:	Michael Brady <brady@cs.tcd.ie>
updated:	?

language:	Prolog
package:	UPMAIL Tricia Prolog
version:	?
parts:		?
author:		?
location:	ftp pub/Tricia/README from ftp.csd.uu.se
description:	?
contact:	<tricia-request@csd.uu.se>
updated:	?

language:	Prolog
package:	?; ? (two systems)
version:	?; ?
parts:		?; ?
author:		?
location:	ftp ai.prolog/Contents from aisun1.ai.uga.edu
description:	?; ?
ports:		MSDOS, Macintosh; MSDOS
contact:	Michael Covington <mcovingt@uga.cc.uga.edu>
updated:	?; ?

language:	Prolog
package:	XWIP (X Window Interface for Prolog)
version:	0.6
parts:		library
author:		?
location:	ftp contrib/xwip-0.6.tar.Z from export.lcs.mit.edu
description:	It is a package for Prologs following the Quintus foreign
		function interface (such as SICStus). It provides a (low-level)
		Xlib style interface to X. The current version was developed
		and tested on SICStus 0.7 and MIT X11 R5 under SunOS 4.1.1.
portability:	It is adaptable to many other Unix configurations.
contact:	xwip@cs.ucla.edu
updated:	1993/02/25

language:	Prolog
package:	PI
version:	?
parts:		library
author:		?
location:	ftp pub/prolog/ytoolkit.tar.Z from ftp.ncc.up.pt
description:	PI is a interface between Prolog applications and XWindows that
		aims to be independent from the Prolog engine, provided that it
		has a Quintus foreign function interface (such as SICStus,
		YAP).  It is mostly written in Prolog and is divided in two
		libraries: Edipo - the lower level interface to the Xlib
		functions; and Ytoolkit - the higher level user interface
		toolkit
contact:	Ze' Paulo Leal <zp@ncc.up.pt>
updated:	1993/03/02

language:	Prolog
package:	ISO draft standard
version:	? (What year??)
parts:		language definition
author:		?
location:	ftp ? from ftp.th-darmstadt.de
description:	?
updated:	1992/07/06

language:	Prolog
iref:		(Prolog) Tim Budd's C++ implementation of Kamin's interpreters

language:	OPS5
package:	PD OPS5
version:	?
parts:		interpreter
author:		Written by Charles L. Forgy and ported to Common Lisp by 
		George Wood and Jim Kowalski. 
location:	ftp /afs/cs.cmu.edu/user/mkant/Public/Lisp/ops5* from 
		ftp.cs.cmu.edu
description:	Public domain implementation of an OPS5 interpreter. OPS5 is
		a programming language for rule-based production systems.
		A rule consists of pre-condition(s) and the resulting
		action. The system as a whole acts first checking the
		status of system in its working memory and matches the
		rules to see if there are rules that are satisfied,
		and then the action in one selected satisfied rule is
		executed.
		There is a commercial version available called OPS83.
		Please contact the author for information.
requires:	Common Lisp
contact:	? Mark Kantrowitz <mkant+@cs.cmu.edu> ?
updated:	1992/10/17
========================================================================
