An Investigation of Compact and Efficient Number Representations in the Pure Lambda Calculus

Abstract

We argue that a compact right-associated binary number representation gives simpler operators and better efficiency than the leftassociated binary number representation proposed by den Hoed and investigated by Goldberg. This representation is then generalised to higher number-bases and it is argued that bases between 3 and 5can give higher efficiency than binary representation.