The WAM---Definition and Compiler Correctness

The WAM---Definition and Compiler Correctness (1995)

by Egon Borger

Citations:

72 - 13 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The WAM---Definition and Compiler Correctness	user correction - Legacy Corrections
AUTHOR NAME	Egon Borger	SVM HeaderParse 0.1
AUTHOR AFFIL	; Dipartimento di Informatica, Universita di Pisa; Dean Rosenzweig; FSB, University of Zagreb	SVM HeaderParse 0.2
AUTHOR ADDR	; Cso Italia 40, I-56100 Pisa; Salajeva 5, 41000 Zagreb, Croatia	SVM HeaderParse 0.1
ABSTRACT	: This paper provides a mathematical analysis of the Warren Abstract Machine for executing Prolog and a correctness proof for a general compilation scheme of Prolog for the WAM. Starting from an abstract Prolog model which is close to the programmer's intuition, we derive the WAM methodically by stepwise refinement of Prolog models, proving correctness and completeness for each refinement step. Along the way we explicitely formulate, as proof assumptions, a set of natural conditions for a compiler to be correct, thus making our proof applicable to a whole class of compilers. The proof method provides a rigorous mathematical framework for the study of Prolog compilation techniques. It can be applied in a natural way to extensions and variants of Prolog and related WAMs allowing for parallelism, constraint handling, types, functional components---in some cases it has in fact been successfully extended. Our exposition assumes only a general understanding of Prolog. We reach full mathemati...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
CITATIONS	19 found	ParsCit 1.0