Re: Warren Abstract Machine (David Keppel)
22 May 1997 22:10:56 -0400

          From comp.compilers

Related articles
Warren Abstract Machine (Andrew Gavin) (1997-05-16)
Re: Warren Abstract Machine (Dwight VandenBerghe) (1997-05-19)
Re: Warren Abstract Machine (1997-05-22)
Re: Warren Abstract Machine (1997-05-22)
Re: Warren Abstract Machine (Clark L. Coleman) (1997-05-22)
Re: Warren Abstract Machine (1997-05-22)
| List of all articles for this month |

From: (David Keppel)
Newsgroups: comp.compilers
Date: 22 May 1997 22:10:56 -0400
Organization: Computer Science & Engineering, U of Washington, Seattle
References: 97-05-201
Keywords: theory, prolog, bibliography

Andrew Gavin <> wrote:
>[Info on the Warren Abstract Machine? Efficent unification & backtracking.]

Here's some papers I found interesting; they only describe WAM to
introduce VAM, but since you mention efficiency, they may be

One contribution of these papers is in showing how to statically bound
the effects of new code (rules) that are introduced dynamically.
There's other good stuff here, too.

I haven't looked for these lately, I don't know if the URLs are still

;-D on ( Lost in the Warren ) Pardo

%A Andreas Krall
%A Thomas Berger
%T A Progress Report on Incremental Global Compilation
of Prolog
%J Proceedings of the ILPS'94 Workshop on Implementation Techniques
for Logic Programming Languages
%D 1994
%X (abstract) ``Traditional native code generating Prolog compilers
with global analysis compile programs as a whole and do not support
the data base builtin-predicates \fCassert\fP and \fCretract\fP. In
this paper we ... enable global analysis and incremental compoilation.
    ``... and expanded on the fly to machine code'' (see [KB 95]).

%A Andreas Krall
%A Thomas Berger
%T The VAM(AI) \- an Abstract Machine for Incremental
Dataflow Analysis of Prolog
%J Proceedings of the ICLP'95 Workshop on Abstract Interpretation
%D 1995
%X The virtual machine code is used to drive abstract interpretation.
The vitual machine code is updated during abstract interpretation to
hold results of analysis.

%A Andreas Krall
%A Thomas Berger
%T Incremental Global Compilation of Prolog with the
Vienna Abstract Machine
%J Proceedings of the ICLP'95 Workshop on Abstract Interpretation
%D 1995
%X Prolog allows program modification via \fCassert\fP (insert program
code) and \fCretract\fP (delete program code)
In general, adding code invalidates compiler assumptions, e.g. if some
variable types can become more general (e.g., integer and atom instead
of atom). Incremental analysis allows for recompilation of just the
parts where it is necessary.

Post a followup to this message

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