Standard and Normal Reductions

DOI10.2307/1998843MaRDI QIDQ4177543zbMATH OpenOpenAlexFDO

Authors Roger Hindley

Publication date 1978

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

zbMATH Keywords

Combinatory WeakLambda-Beta-Eta CalculusNormal ReductionsStandard Reduction Sequence

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites work

• A mathematical logic without variables. I
• An abstract Church-Rosser theorem. II: Applications
• An Abstract form of the church-rosser theorem. I
• Combinatory logic. Vol. II
• Combinatory logic. With two sections by William Craig.
• scientific article; zbMATH DE number 3504962 (Why is no real title available?)
• scientific article; zbMATH DE number 3423994 (Why is no real title available?)
• Reductions of Residuals are Finite
• Some Properties of Conversion
• The Equivalence of Complete Reductions
• The Standardization Theorem for λ‐Calculus

Cited in

(4)

• Intersection types for combinatory logic
• Combinatory reduction systems: Introduction and survey
• Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
• Reductions of Residuals are Finite

This page was built for publication: Standard and Normal Reductions

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