Combinatory Reductions and Lambda Reductions Compared

DOI10.1002/MALQ.19770230708MaRDI QIDQ4133942zbMATH OpenOpenAlexFDO

Authors Roger Hindley

Publication date 1977

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19770230708

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited in

(9)

• BCK-combinators and linear \(\lambda\)-terms have types
• Combinatory weak reduction in lambda calculus
• Intersection types for combinatory logic
• Normal forms in combinatory logic
• The search for a reduction in combinatory logic equivalent to -reduction. II.
• The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
• Proof-theoretic investigation of -reduction in the simply typed -calculus
• Judgmental and definitional equality from a Fregean perspective
• Une nouvelle C-réduction dans la logique combinatoire

This page was built for publication: Combinatory Reductions and Lambda Reductions Compared

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