Conditional Equational Theories and Complete Sets of Transformations (1988)
| Venue: | IN PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON FIFTH GENERATION COMPUTER SYSTEMS |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Hölldobler88conditionalequational,
author = {Steffen Hölldobler},
title = {Conditional Equational Theories and Complete Sets of Transformations},
booktitle = {IN PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON FIFTH GENERATION COMPUTER SYSTEMS},
year = {1988},
pages = {405--412},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The idea to combine the advantages of function and logic programming has attracted many researches. Their work ranges from the integration of existing languages over higher-order logic to equational logic languages, where logic programs are augmented with equational theories. Recently, it has been proposed to handle those equational theories by complete sets of transformations. These transformations are extensions of the rules introduced by Herbrand and later used by Martelli and Montanari to compute the most general unifier of two expressions. We generalize this idea to complete sets of transformations for arbitrary conditional equational theories, the largest class of equational theories that admit a least Herbrand model. The completeness
