Four Complete Datatype Defining Rewrite Systems for an Abstract Datatype of Natural Numbers
| Authors | |
|---|---|
| Publication date | 14-06-2014 |
| Series | TCS Electronic Report series, 1407 |
| Edition | 3 |
| Number of pages | 14 |
| Publisher | Amsterdam: University of Amsterdam, Theory of Computer Science |
| Organisations |
|
| Abstract | Natural numbers with zero, one, successor, addition and multiplication, constitute a classic example of an abstract datatype amenable for equational initial algebra specification. Datatype defining rewrite systems provide a specification which at the same time is a complete, that is confluent and strongly terminating, rewrite system thereby providing means for automatic implementation. Syntax for unary, binary, decimal, and hexadecimal notation is introduced and corresponding rewrite systems are designed. |
| Document type | Report |
| Language | English |
| Published at | https://ivi.fnwi.uva.nl/tcs/pub/tcsreports/TCS1407v3.pdf |
| Downloads |
TCS1407v3
(Final published version)
|
| Permalink to this page | |
