Since 2014
An Adequate Left-Associated Binary Numeral System in the lambda-Calculus
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
An Adequate Left-Associated Binary Numeral System in the lambda-Calculus
|
|
| Creator |
Goldberg, Mayer
|
|
| Description |
This paper introduces a sequence of lambda-expressions, modelling the binaryexpansion of integers. We derive expressions computing the testfor zero, the successor function, and the predecessor function, therebyshowing the sequence to be an adequate numeral system. These functionscan be computed efficiently. Their complexity is independent ofthe order of evaluation.Keywords: Programming calculi, lambda-calculus, functional programming.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-06-12
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19943
10.7146/brics.v2i42.19943 |
|
| Source |
BRICS Report Series; No 42 (1995): RS-42 An Adequate Left-Associated Binary Numeral System in the lambda-Calculus
BRICS Report Series; No 42 (1995): RS-42 An Adequate Left-Associated Binary Numeral System in the lambda-Calculus 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19943/17596
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|