Linear numeral systems
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Jonathan Hayman.
We take a fresh look at an old problem of representing natural numbers
in the lambdacalculus. Our interest is in finding representations
where we can compute efficiently (and where possible, in constant
time) the following functions: successor, predecessor, addition,
subtraction and test for zero. Surprisingly, we find a solution in the
linear lambdacalculus, where copying and erasing are not permitted.
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
