The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
From MaRDI portal
Publication:654911
DOI10.1016/j.tcs.2011.02.002zbMath1246.03033MaRDI QIDQ654911
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
abstraction; lambda-calculus; combinatory logic; beta-eta-reduction; beta-reduction; strong reduction; weak reduction
03B70: Logic in computer science
03B35: Mechanization of proofs and logical operations
68Q42: Grammars and rewriting systems
03-03: History of mathematical logic and foundations
03B40: Combinatory logic and lambda calculus
Related Items
The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II., Combinatory logic with polymorphic types
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