publication . Article . Doctoral thesis . Other literature type . 1987

Termination of rewriting

Dershowitz, Nachum;
Open Access
  • Published: 01 Feb 1987 Journal: Journal of Symbolic Computation, volume 3, issue 1-2, pages 69-115 (issn: 0747-7171, Copyright policy)
  • Publisher: Elsevier BV
  • Country: Germany
Abstract
More and more, term rewriting systems are applied in computer science aswell as in mathematics. They are based on directed equations which may be used as non-deterministic functional programs. Termination is a key property for computing with termrewriting systems.In this thesis, we deal with different classes of so-called simplification orderings which areable to prove the termination of term rewriting systems. Above all, we focus on the problemof applying these termination methods to examples occurring in practice. We introduce aformalism that allows clear representations of orderings. The power of classical simplifica-tion orderings - namely recursive path ord...
Subjects
free text keywords: Algebra and Number Theory, Computational Mathematics, ddc:004
Related Organizations
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue