Theoretical Pearl - An adequate and efficient left-associated binary numeral system in the Lambda-calculus.

Research output: Contribution to journalArticlepeer-review

Abstract

This paper introduces a sequence of λ-expressions modeling 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, ie one in which all recursive functions are lambda-definable. These functions can be computed efficiently; To this end, we introduce a notion of complexity that is independent of the order of evaluation.‏
Original languageEnglish
Pages (from-to)607-623
JournalJ. Funct. Program.
Volume10
Issue number6
StatePublished - 2000

Fingerprint

Dive into the research topics of 'Theoretical Pearl - An adequate and efficient left-associated binary numeral system in the Lambda-calculus.'. Together they form a unique fingerprint.

Cite this