Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)

Keisuke Nakano, Munehiro Iwami

We study the termination of sole combinatory calculus, which consists of only one combinator. Specifically, the termination for non-erasing combinators is disproven by finding a de…