Correctness proof for the WAM with types (1992)
| Venue: | Computer Science Logic, volume 626 of LNCS |
| Citations: | 12 - 5 self |
BibTeX
@INPROCEEDINGS{Beierle92correctnessproof,
author = {Christoph Beierle and Egon Börger},
title = {Correctness proof for the WAM with types},
booktitle = {Computer Science Logic, volume 626 of LNCS},
year = {1992},
pages = {15--34},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
: We provide a mathematical specification of an extension of Warren's Abstract Machine for executing Prolog to type-constraint logic programming and prove its correctness. In this paper, we keep the notion of types and dynamic type constraints rather abstract to allow applications to different constraint formalisms like Prolog III or CLP(R). This generality permits us to introduce modular extensions of Borger's and Rosenzweig 's formal derivation of the WAM. Starting from type-constraint Prolog algebras that are derived from Borger's standard Prolog algebras, the specification of the typeconstraint WAM extension is given by a sequence of evolving algebras, each representing a refinement level. For each refinement step a correctness proof is given. Thus, we obtain the theorem that for every such abstract type-constraint logic programming system L and for every compiler satisfying the specified conditions, the WAM extension with an abstract notion of types is correct w.r.t. L. This is a ...
