Binary lambda calculus and combinatory logic

In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-interpreters for these binary languages. Along the way we also present new results on list representations, bracket abstraction, and fixpoint combinators. In the second part we review Al-gorithmic Information Theory, for which these interpreters provide a con-venient vehicle. We demonstrate this with several concrete upper bounds on program-size complexity.