An Adequate Left-Associated Binary Numeral System in the lambda-Calculus
This paper introduces a sequence of lambda-expressions, modelling the binary
expansion of integers. We derive expressions computing the test
for zero, the successor function, and the predecessor function, thereby
showing the sequence to be an adequate numeral system. These functions
can be computed efficiently. Their complexity is independent of
the order of evaluation.
Keywords: Programming calculi, lambda-calculus, functional programming.
How to Cite
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.