An Investigation of Compact and Efficient Number Representations in the Pure Lambda Calculus

Authors:
Torben Æ. Mogensen
Affiliations:
-
Venue:
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Year:
2001

Citing 2
Cited 1

Self-applicable online partial evaluation of the pure lambda calculus

PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
An adequate and efficient left-associated binary numeral system in the λ-calculus

Journal of Functional Programming

Binary trees as a computational framework

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We argue that a compact right-associated binary number representation gives simpler operators and better efficiency than the left-associated binary number representation proposed by den Hoed and investigated by Goldberg. This representation is then generalised to higher number-bases and it is argued that bases between 3 and 5can give higher efficiency than binary representation.