G. Huet. Confluent reductions: abstract perperties and applications to term rewriting systems. JACM, 27(4):797--821, 1980. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Abduction in Logic Programming: A New Definition and an.. - Lin, You (2002) (2 citations) (Correct)
....rewriting, and formula transformations as simplification rules, along with two loop rules to handle loops. It turns out that rewriting by a rewrite system of this kind always terminates at a unique formula, independent of any order of rewriting. In the literature of rewrite systems (see, e.g. [5, 13]) this latter property is called the confluence property, and confluent and terminating systems are called canonical systems. A canonical system guarantees the termination at a unique expression independent of the order of rewriting. It is interesting to remark here that we could implement a form ....
G. Huet. Confluent reductions: abstract perperties and applications to term rewriting systems. JACM, 27(4):797--821, 1980.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC