Please use this identifier to cite or link to this item:
|Citation:||LECTURE NOTES IN COMPUTER SCIENCE, 560(), 40-56|
|Abstract:||Equational Programming is an elegant way to uniformly integrate important features of logic and functional programming. A number of function symbols encountered in such a programming paradigm have the properties of associativity and commutativity (AC for short). It is therefore important Lo find equation solving strategies which can handle AC operators effectively. In this paper we show that a strict top-down approach extending [Mit90] will not solve the problem in the general case. We then develop a sound and complete strategy for equation solving, which performs better than the conventional approaches using AC-narrowing. Furthermore, we show that by using the AC-rules as constraints while solving the non-AC equations, a number of fruitless (and even infinite) search paths may be eliminated.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.