The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction

DOI10.1016/j.tcs.2011.02.002zbMath1246.03033OpenAlexW2075116123MaRDI QIDQ654911

Jonathan P. Seldin

Publication date: 23 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.002

zbMATH Keywords

abstractionlambda-calculuscombinatory logicbeta-eta-reductionbeta-reductionstrong reductionweak reduction

Mathematics Subject Classification ID

Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42) History of mathematical logic and foundations (03-03) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Combinatory logic with polymorphic types ⋮ The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.

Cites Work

• Unnamed Item
• Unnamed Item
• Une nouvelle C\(\beta\)-réduction dans la logique combinatoire
• On pseudo-c\(\beta\) normal form in combinatory logic
• Abstraction problems in combinatory logic: A compositive approach
• \(c\beta\)-Machine with \(\lambda \beta\)-reduction
• A set of postulates for the foundation of logic. II
• Combinatory logic. Vol. II
• Combinatory Reductions and Lambda Reductions Compared
• Some Additions to the Theory of Combinators
• The Paradox of Kleene and Rosser
• Some Advances in the Combinatory Theory of Quantification
• The inconsistency of certain formal logics
• New sets of postulates for combinatory logics

This page was built for publication: The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction