The Equivalence of Complete Reductions

DOI10.2307/1998507zbMATH Open0361.02036OpenAlexW4242544250MaRDI QIDQ4133943FDOQ4133943

Authors: 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)

Cites Work

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

Cited In (5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133943)