On properties of $B$-terms

30 Jan 2019Mirai IkebuchiKeisuke Nakano

$B$-terms are built from the $B$ combinator alone defined by $B\equiv\lambda f.\lambda g.\lambda x. f~(g~x)$, which is well known as a function composition operator. This paper investigates an interesting property of $B$-terms, that is, whether repetitive right applications of a $B$-term cycles or not... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet