|Prolog stack algorithm description email@example.com (2001-07-27)|
|Re: Prolog stack algorithm description firstname.lastname@example.org.EDU.AU (Peter Gammie) (2001-07-30)|
|Re: Prolog stack algorithm description email@example.com (2001-07-30)|
|From:||Peter Gammie <firstname.lastname@example.org.EDU.AU>|
|Date:||30 Jul 2001 01:10:52 -0400|
|Posted-Date:||30 Jul 2001 01:10:49 EDT|
If you really want to get your mind around Prolog's execution algorithm, I
can only suggest you read:
Warren's Abstract Machine: A Tutorial Reconstruction
There is a concise abstract machine model in an appendix. Even if you
don't make use of the instruction set, the explanation of the memory model
is very good.
On 27 Jul 2001, Hans Aberg wrote:
> Does anybody know of a reference to a concise description of the Prolog
> stack algorithm:
> I made a Haskell->C++ port of the Mini-Prolog demo that comes with Hugs
> http://haskell.org/hugs, and I am satisfied with the resulting C++ OO
> style. But the original code relies on Haskell lazyness in order to
> achieve the Prolog execution model which does not work under C++, which is
> strict. So I want a reference in order to ensure the needed rewriting
> results in correct C++ code.
Return to the
Search the comp.compilers archives again.