DMCA
Defining Standard Prolog in rewriting logic (2001)
Cached
Download Links
- [www.informatik.fernuni-hagen.de]
- [www.fernuni-hagen.de]
- [www.fernuni-hagen.de]
- DBLP
Other Repositories/Bibliography
| Venue: | Proc. of the 3rd Int. Workshop on Rewriting Logic and its Applications (WRLA 2000 |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Beierle01definingstandard,
author = {M.Kulas and C. Beierle},
title = {Defining Standard Prolog in rewriting logic},
booktitle = {Proc. of the 3rd Int. Workshop on Rewriting Logic and its Applications (WRLA 2000},
year = {2001},
pages = {36},
publisher = {Elsevier}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut and whose depth-first search strategy is incomplete. The purpose of this paper is to present the key concepts of a new, simple operational semantics of Standard Prolog in the form of rewriting rules. We use a novel linear representation of the Prolog tree traversal. A derivation is represented at the level of unification and backtracking. The rewriting system presented here can easily be implemented in a rewriting logic language, giving an executable specification of Prolog. 1
