Re: Warren Abstract Machine

fjh@mundook.cs.mu.OZ.AU (Fergus Henderson)
22 May 1997 21:49:02 -0400

          From comp.compilers

Related articles
Warren Abstract Machine andrew.gavin@aethos.co.uk (Andrew Gavin) (1997-05-16)
Re: Warren Abstract Machine dwight@pentasoft.com (Dwight VandenBerghe) (1997-05-19)
Re: Warren Abstract Machine fjh@mundook.cs.mu.OZ.AU (1997-05-22)
Re: Warren Abstract Machine pardo@cs.washington.edu (1997-05-22)
Re: Warren Abstract Machine clc5q@cs.virginia.edu (Clark L. Coleman) (1997-05-22)
Re: Warren Abstract Machine Jacques.Noye@emn.fr (1997-05-22)
| List of all articles for this month |
From: fjh@mundook.cs.mu.OZ.AU (Fergus Henderson)
Newsgroups: comp.compilers
Date: 22 May 1997 21:49:02 -0400
Organization: Comp Sci, University of Melbourne
References: 97-05-201
Keywords: theory, prolog, bibliography



Andrew Gavin <andrew.gavin@aethos.co.uk> writes:


> Does anyone know where I might find some information on Warren
>Abstract Machines? I am interested in books web sites and publically
>available papers.


The best description of the WAM that I know of is


@book{wamtute,
author = {Hassan Ait-Kaci},
title = {Warren's abstract machine: a tutorial reconstruction},
publisher = {MIT Press},
year = {1991}
}


>Failing this does anyone know any other languages like prolog which
>are have similar unification and backtracking features? [If that is
>not too dumb a question]
>
>I am looking into how unification and backtracking are efficiently
>implemented in lanuages.


A good general reference is


              "1983-1993: The Wonder Years of Sequential Prolog Implementation",
              Peter Van Roy, May/July 1994, Journal of Logic Programming. A survey
              of implementation technology and systems since the WAM. Available via
              <http://www.info.ucl.ac.be/people/PVR/implementation.html>.


If you're interested in efficiency, then you should also have a look at
some of our papers on Mercury <http://www.cs.mu.oz.au/mercury/papers.html>,
since the Mercury implementation is probably the most efficient logic
programming language implementation around at the moment.


--
Fergus Henderson <fjh@cs.mu.oz.au>
WWW: <http://www.cs.mu.oz.au/~fjh>
PGP: finger fjh@128.250.37.3
--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.