The Equivalence of Complete Reductions

DOI10.2307/1998507zbMath0361.02036OpenAlexW4242544250MaRDI QIDQ4133943

Roger Hindley

Publication date: 1977

Full work available at URL: https://doi.org/10.2307/1998507

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (5)

Reductions of Residuals are Finite ⋮ Confluence and superdevelopments ⋮ Standard and Normal Reductions ⋮ Descendants and origins in term rewriting. ⋮ Combinatory reduction systems: Introduction and survey

Cites Work

• Unnamed Item
• Combinatory logic. With two sections by William Craig.
• Combinatory logic. Vol. II
• An abstract Church-Rosser theorem. II: Applications
• An Abstract form of the church-rosser theorem. I
• Tree-Manipulating Systems and Church-Rosser Theorems
• The Calculi of Lambda Conversion. (AM-6)

This page was built for publication: The Equivalence of Complete Reductions