The Warren' S Abstract Machine ( abstract Machine of Warren ) is a virtual Machine making it possible to implement the language Prolog. This machine is made up of a special Instruction set as well as Mémoire. It was defined by David H.D. Warren in 1983. It is one of the traditional implementations for Prolog.

Instruction set

The Instruction set of the WAM is composed of eight types of instructions.

Instructions Could

August 1st

Instructions Get

August 1st

Instructions Set

August 1st

Instructions of Unification

August 1st

Instructions of control

August 1st

Instructions of choice

August 1st

Instructions of index

August 1st

Instructions of cut

These instructions allow the management of the cut of Prolog (predicate! /0).

August 1st

Structure of the memory

The memory of machine WAM is separate in five parts (since the bottom of the memory):

• the first space contains the achievable code.
• the second space contains a Tas ( heap ) growing in direction top of the memory.
• the third space contains a pile ( stack ) growing in direction top of the memory. This pile contains in particular the points of choice and the environments.
• the fourth space contains the trail growing in direction top of the memory.
• the fifth space contains the pdl growing in direction of the bottom of the memory (since the highest address of the memory of the machine).

External bonds

• Warren' S Abstract Machine: In Tutorial Rebuilding

Random links:

Eubée | Flora (Indonesia) | Jon Aaraas | Yamada | Water falls of Suyangsan