Standard and Normal Reductions
From MaRDI portal
Publication:4177543
DOI10.2307/1998843zbMath0395.03015OpenAlexW4255311557MaRDI QIDQ4177543
Publication date: 1978
Full work available at URL: https://doi.org/10.2307/1998843
Related Items
Reductions of Residuals are Finite ⋮ Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends ⋮ Intersection types for combinatory logic ⋮ Combinatory reduction systems: Introduction and survey
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatory logic. With two sections by William Craig.
- A mathematical logic without variables. I
- Combinatory logic. Vol. II
- The Standardization Theorem for λ‐Calculus
- An abstract Church-Rosser theorem. II: Applications
- The Equivalence of Complete Reductions
- Reductions of Residuals are Finite
- An Abstract form of the church-rosser theorem. I
- Some Properties of Conversion