Une nouvelle C-réduction dans la logique combinatoire

DOI10.1016/0304-3975(84)90132-4zbMATH Open0557.03009OpenAlexW2020478268MaRDI QIDQ762137FDOQ762137

Authors: 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

Recommendations

• The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
• A solution to Curry and Hindley's problem on combinatory strong reduction
• The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.
• On pseudo-c\(\beta\) normal form in combinatory logic
• \(c\beta\)-Machine with \(\lambda \beta\)-reduction

zbMATH Keywords

equivalencecombinatory logicabstraction algorithmCL-reductionlambda-beta-reduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

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

Cited In (7)

• Title not available (Why is that?)
• Analytic combinatory calculi and the elimination of transitivity
• The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.
• The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
• On adding (ξ) to weak equality in combinatory logic
• On pseudo-c\(\beta\) normal form in combinatory logic
• \(c\beta\)-Machine with \(\lambda \beta\)-reduction

This page was built for publication: Une nouvelle C\(\beta\)-réduction dans la logique combinatoire

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