Abstract:
This paper introduces a sequence of -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
Available as PostScript, PDF,
DVI.
|