On repetitive right application of B-terms

DOI10.4230/LIPICS.FSCD.2018.18MaRDI QIDQ4993347zbMATH OpenFDO

Authors Mirai Ikebuchi, Keisuke Nakano

Publication date 15 June 2021

Full work available at URL https://arxiv.org/abs/1703.10938

zbMATH Keywords

combinatory logiclambda calculus\(B\) combinator

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• The combinator S
• Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
• The systematic construction of a one-combinator basis for lambda-terms
• scientific article; zbMATH DE number 4047682
• One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus

Cites work

• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• An improved Monte Carlo factorization algorithm
• Principal types of BCK-lambda-terms
• THEORETICAL PEARLS
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The word problem for Smullyan's lark combinator is decidable

This page was built for publication: On repetitive right application of \(B\)-terms

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