Conditional Narrowing Modulo a Set of Equations

Bockmayr, Alexander

doi:10.1007%2FBF01202035

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2055296_3

DetailsSummary

Released

Journal Article

Conditional Narrowing Modulo a Set of Equations

MPS-Authors

/persons/resource/persons44149

Bockmayr, Alexander
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bockmayr, A. (1993). Conditional Narrowing Modulo a Set of Equations. Applicable Algebra in Engineering, Communication and Computing, 4(3), 147-168. doi:10.1007%2FBF01202035.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0023-C736-A

Abstract

Narrowing is a universal unification procedure for equational theories given by a canonical term rewrite system. In this paper we introduce conditional narrowing modulo a set of conditional equations and give a full proof of its correctness and completeness for equational conditional rewrite systems R,E without extravariables where E is regular and R,E is Church‐Rosser modulo E and decrasing modulo E. This result can be seen as the theoretical foundation of a special form of constraint logic and functional programming.