On pseudo-c\(\beta\) normal form in combinatory logic

DOI10.1016/0304-3975(89)90157-6zbMath0673.03010OpenAlexW2083220767MaRDI QIDQ1120559

Mohamed Mezghiche

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90157-6

zbMATH Keywords

combinatory logic\(\lambda\)-termc\(\beta\)-reductionpseudo-c\(\beta \) normal form

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (4)

Normal forms 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

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

This page was built for publication: On pseudo-c\(\beta\) normal form in combinatory logic