Type Arithmetics: Computation based on the theory of types
| dc.creator | Kiselyov, Oleg | |
| dc.date | 2001-04-03 | |
| dc.date.accessioned | 2026-07-07T03:17:04Z | |
| dc.date.available | 2026-07-07T03:17:04Z | |
| dc.description | The present paper shows meta-programming turn programming, which is rich enough to express arbitrary arithmetic computations. We demonstrate a type system that implements Peano arithmetics, slightly generalized to negative numbers. Certain types in this system denote numerals. Arithmetic operations on such types-numerals - addition, subtraction, and even division - are expressed as type reduction rules executed by a compiler. A remarkable trait is that division by zero becomes a type error - and reported as such by a compiler. | |
| dc.description | 1 HTML page, 1 C++ source code file | |
| dc.identifier | https://arxiv.org/abs/cs/0104010 | |
| dc.identifier | http://arxiv.org/abs/cs/0104010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30586 | |
| dc.subject | Computation and Language | |
| dc.subject | F.3.3; F.4.2; D.3.3 | |
| dc.title | Type Arithmetics: Computation based on the theory of types | |
| dc.type | text |