The search for a reduction in combinatory logic equivalent to -reduction

DOI10.1016/J.TCS.2011.02.002MaRDI QIDQ654911zbMATH OpenOpenAlexFDO

Authors 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

abstractionbeta-eta-reductionbeta-reductioncombinatory logiclambda-calculusstrong reductionweak reduction

Mathematics Subject Classification ID

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

Recommendations

• The search for a reduction in combinatory logic equivalent to -reduction. II.
• Une nouvelle C-réduction dans la logique combinatoire
• Combinatory weak reduction in lambda calculus
• scientific article; zbMATH DE number 4045707
• On pseudo-c normal form in combinatory logic

Cites work

• \(c\beta\)-Machine with \(\lambda \beta\)-reduction
• A set of postulates for the foundation of logic. II
• Abstraction problems in combinatory logic: A compositive approach
• Combinatory logic. Vol. II
• Combinatory Reductions and Lambda Reductions Compared
• scientific article; zbMATH DE number 5318491 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• New sets of postulates for combinatory logics
• On pseudo-c normal form in combinatory logic
• Some Additions to the Theory of Combinators
• Some Advances in the Combinatory Theory of Quantification
• The inconsistency of certain formal logics
• The Paradox of Kleene and Rosser
• Une nouvelle C-réduction dans la logique combinatoire

Cited in

(14)

• On pseudo-c normal form in combinatory logic
• Combinatory weak reduction in lambda calculus
• \(c\beta\)-Machine with \(\lambda \beta\)-reduction
• Combinatory logic with polymorphic types
• Strong reduction of combinatory calculus with streams
• The Church Rosser theorem for strong reduction in combinatory logic
• On adding (ξ) to weak equality in combinatory logic
• scientific article; zbMATH DE number 3909737 (Why is no real title available?)
• scientific article; zbMATH DE number 4045104 (Why is no real title available?)
• scientific article; zbMATH DE number 4045707 (Why is no real title available?)
• Effective reduction and conversion strategies for combinators
• The search for a reduction in combinatory logic equivalent to -reduction. II.
• The Church-Rosser property in symmetric combinatory logic
• Une nouvelle C-réduction dans la logique combinatoire

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

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