Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!husc6!rutgers!ames!oliveb!intelca!mipos3!omepd!perry
From: perry@inteloa.intel.com (Perry The Cynic)
Newsgroups: comp.lang.prolog
Subject: Prolog implementation papers (?)
Message-ID: <757@omepd>
Date: Tue, 2-Jun-87 16:17:47 EDT
Article-I.D.: omepd.757
Posted: Tue Jun  2 16:17:47 1987
Date-Received: Sat, 6-Jun-87 07:48:37 EDT
Sender: news@omepd
Reply-To: perry@inteloa.intel.com (Perry The Cynic)
Organization: Intel Corp., Hillsboro
Lines: 18

Hello, everybody!

I am looking for information (books, papers etc.) on prolog *implementations*.
I am specially interested in the following:
  -- What are the prevailing implementation approaches (fundamental ideas of
     implementations)?
  -- What optimizations do Prolog implementations apply (e.g., tail recursion
     eliminination), how do they manage their resources (e.g. garbage
     collection)?
  -- What ideas are behind Prolog *compilers* (such as Turbo Prolog), and what
     are the inherent limits of such approaches?

Are there any overviews?
Thanks for your help
------------------------------------------------------------------------
  <<  Perry The Cynic >>		   =>> perry@inteloa.intel.com <<=
				      ...!tektronix!ogcvax!omepd!inteloa!perry
   (Peter Kiehtreiber)				...!verdix!omepd!inteloa!perry