On properties of B-terms

Mirai Ikebuchi, Keisuke Nakano

Research output: Contribution to journalArticlepeer-review

Abstract

B-terms are built from the B combinator alone defined by B ≡ λfgx.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. We discuss conditions for B-terms to have and not to have the property through a sound and complete equational axiomatization. Specifically, we give examples of B-terms which have the cyclic property and show that there are infinitely many B-terms which do not have the property. Also, we introduce another interesting property about a canonical representation of B-terms that is useful to detect cycles, or equivalently, to prove the cyclic property, with an efficient algorithm.

Original languageEnglish
Article number8
Pages (from-to)1-23
Number of pages23
JournalLogical Methods in Computer Science
Volume16
Issue number2
DOIs
Publication statusPublished - 2020

Keywords

  • B combinator
  • Combinatory logic
  • Lambda calculus

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On properties of B-terms'. Together they form a unique fingerprint.

Cite this