Une nouvelle C\(\beta\)-réduction dans la logique combinatoire

DOI10.1016/0304-3975(84)90132-4zbMath0557.03009OpenAlexW2020478268MaRDI QIDQ762137

Mohamed Mezghiche

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90132-4

zbMATH Keywords

equivalencecombinatory logicabstraction algorithmCL-reductionlambda-beta-reduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

On pseudo-c\(\beta\) normal form in combinatory logic, \(c\beta\)-Machine with \(\lambda \beta\)-reduction, The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction, The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.

Cites Work

• Combinatory logic. With two sections by William Craig.
• The lambda calculus, its syntax and semantics
• Combinatory logic. Vol. II
• Combinatory Reductions and Lambda Reductions Compared
• Axioms for strong reduction in combinatory logic