How to normalize the Jay

In this note we give an elementary proof of the strong normalization property of the J combinator by providing an explicit bound for the maximal length of the reduction paths of a term. This result shows clearly that in the theorem of Toyama, Klop and Barendregt on completeness of unions of left-lin...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science 2001, Vol.254 (1), p.677-681
Hauptverfasser:	Probst, Dieter, Studer, Thomas
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatory logic Computer science control theory systems Exact sciences and technology General logic Logic and foundations Mathematical logic, foundations, set theory Mathematics Model theory Sciences and techniques of general use Strong normalization Term rewriting systems Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this note we give an elementary proof of the strong normalization property of the J combinator by providing an explicit bound for the maximal length of the reduction paths of a term. This result shows clearly that in the theorem of Toyama, Klop and Barendregt on completeness of unions of left-linear term rewriting systems, disjointness is essential.
ISSN:	0304-3975 1879-2294
DOI:	10.1016/S0304-3975(00)00379-0