An Adequate Left-Associated Binary Numeral System in the lambda-Calculus
DOI:
https://doi.org/10.7146/brics.v2i42.19943Resumé
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.
Downloads
Publiceret
1995-06-12
Citation/Eksport
Goldberg, M. (1995). An Adequate Left-Associated Binary Numeral System in the lambda-Calculus. BRICS Report Series, 2(42). https://doi.org/10.7146/brics.v2i42.19943
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
