Abstract
We investigate numeral systems in the lambda calculus; specifically in the linear lambda calculus where terms cannot be copied or erased. Our interest is threefold: representing numbers in the linear calculus, finding constant time arithmetic operations when possible for successor, addition and predecessor, and finally, efficiently encoding subtraction—an operation that is problematic in many numeral systems. This paper defines systems that address these points, and in addition provides a characterisation of linear numeral systems.
| Original language | English |
|---|---|
| Pages (from-to) | 887-909 |
| Number of pages | 23 |
| Journal | Journal of Automated Reasoning |
| Volume | 63 |
| Issue number | 4 |
| Early online date | 7 Feb 2018 |
| DOIs | |
| Publication status | Published - Dec 2019 |