An adequate and efficient left-associated binary numeral system in the λ-calculus

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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, i.e. 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
Number of pages17
JournalJournal of Functional Programming
Volume10
Issue number6
DOIs
StatePublished - 1 Jan 2000

Fingerprint

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

Cite this