How to normalize the Jay (Q5940936)
From MaRDI portal
scientific article; zbMATH DE number 1635087
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to normalize the Jay |
scientific article; zbMATH DE number 1635087 |
Statements
How to normalize the Jay (English)
0 references
20 August 2001
0 references
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.
0 references
Term rewriting systems
0 references
Combinatory logic
0 references
Strong normalization
0 references
