Normalisation in Weakly Orthogonal Rewriting

A rewrite sequence is said to be outermost-fair if every outermost redex occurrence is eventually eliminated. Outermost-fair rewriting is known to be (head-)normalising for almost orthogonal rewrite systems. We study (head-)normalisation for the larger class of weakly orthogonal rewrite systems. (In...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	van Oostrom, Vincent
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Copy Relation Critical Pair Exact sciences and technology Initial Term Marked Term Normal Form Programming theory Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!