Infinite normal forms: Preliminary version

Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We continue here a study of properties of rewrite systems that are not necessarily terminating, but allow for infinite derivations that have a limit. In particular, we give algebraic semantics for theories described by such systems, consider sufficient completeness of hierarchical systems, suggest practical conditions for the existence of a limit and for its uniqueness, and extend the ideas to conditional rewriting.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 16th International Colloquium, Proceedings
EditorsMariangiola Dezani-Ciancaglini, Simonetta Ronchi Della Rocca, Giorgio Ausiello
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783540513711
StatePublished - 1989
Externally publishedYes
Event16th International Colloquium on Automata, Languages and Programming, 1989 - Stresa, Italy
Duration: 11 Jul 198915 Jul 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume372 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference16th International Colloquium on Automata, Languages and Programming, 1989


Dive into the research topics of 'Infinite normal forms: Preliminary version'. Together they form a unique fingerprint.

Cite this