Add to ORKGThe Vienna Abstract Machine (VAM) is a Prolog machine developed at the TUWien. In contrast to the standard implementation technique (Warren Abstract Machine { WAM), an inference in VAM is performed by unifying the goal and head immediately, instead of bypassing arguments through a register interface. We present two implemen-tations for VAM: VA
The authors outline an experiment on Warren abstract machine (WAM) based compiler technology. In pre...
Based on Danvy et al.'s functional correspondence, we give a further example of gradual re finement ...
AbstractWe extend the theory of Prolog to provide a framework for the study of Prolog compilation te...
The Vienna Abstract Machine (VAM) is an abstract machine which has been designed to eliminate some w...
AbstractThe goal of Prolog implementations is to achieve high overall efficiency. Many high-speed im...
This paper is a short survey about currently used implementation techniques for Prolog. It gives an ...
Traditional native code generating Prolog compilers with global analysis compile programs as a whole...
In order to achieve competitive performance, abstract machines for Prolog and related languages end ...
In order to achieve competitive performance, abstract machines for Prolog and related languages end ...
This paper describes the first half of the formal verification of a Prolog compiler with the KIV ("K...
In order to achieve competitive performance, abstract machines for Prolog and related languages end ...
Machine (WAM), the most widely used abstract machine for Prolog implementation, arguments are passed...
In order to achieve competitive performance, abstract machines for Prolog and related languages end ...
Prolog has been widely recognized as a powerful programming language for artificial intelligence. It...
We discuss an efficient implementation of the Warren Abstract Machine (WAM) [12] in detail. Special ...
The authors outline an experiment on Warren abstract machine (WAM) based compiler technology. In pre...
Based on Danvy et al.'s functional correspondence, we give a further example of gradual re finement ...
AbstractWe extend the theory of Prolog to provide a framework for the study of Prolog compilation te...
The Vienna Abstract Machine (VAM) is an abstract machine which has been designed to eliminate some w...
AbstractThe goal of Prolog implementations is to achieve high overall efficiency. Many high-speed im...
This paper is a short survey about currently used implementation techniques for Prolog. It gives an ...
Traditional native code generating Prolog compilers with global analysis compile programs as a whole...
In order to achieve competitive performance, abstract machines for Prolog and related languages end ...
In order to achieve competitive performance, abstract machines for Prolog and related languages end ...
This paper describes the first half of the formal verification of a Prolog compiler with the KIV ("K...
In order to achieve competitive performance, abstract machines for Prolog and related languages end ...
Machine (WAM), the most widely used abstract machine for Prolog implementation, arguments are passed...
In order to achieve competitive performance, abstract machines for Prolog and related languages end ...
Prolog has been widely recognized as a powerful programming language for artificial intelligence. It...
We discuss an efficient implementation of the Warren Abstract Machine (WAM) [12] in detail. Special ...
The authors outline an experiment on Warren abstract machine (WAM) based compiler technology. In pre...
Based on Danvy et al.'s functional correspondence, we give a further example of gradual re finement ...
AbstractWe extend the theory of Prolog to provide a framework for the study of Prolog compilation te...