s10817-018-9456-6.pdf (660.88 kB)
Linear numeral systems
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.
History
Publication status
- Published
File Version
- Published version
Journal
Journal of Automated ReasoningISSN
0168-7433Publisher
Springer VerlagExternal DOI
Issue
4Volume
63Page range
887-909Department affiliated with
- Informatics Publications
Full text available
- Yes
Peer reviewed?
- Yes
Legacy Posted Date
2018-02-19First Open Access (FOA) Date
2018-02-19First Compliant Deposit (FCD) Date
2018-02-17Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC