PADL 2014: Practical Aspects of Declarative Languages pp 120-135 | Cite as
A Declarative Specification of Giant Number Arithmetic
Abstract
The tree based representation described in this paper, hereditarily binary numbers, applies recursively a run-length compression mechanism that enables computations limited by the structural complexity of their operands rather than by their bitsizes. While within constant factors from their traditional counterparts for their average and worst case behavior, our arithmetic operations open the doors for interesting numerical computations, intractable with a traditional number representation.
We provide a complete specification of our algorithms in the form of a purely declarative Prolog program.
Keywords
hereditary numbering systems compressed number representations arithmetic computations with giant numbers tree-based numbering systems Prolog as a specification languagePreview
Unable to display preview. Download preview PDF.
References
- 1.Knuth, D.E.: Mathematics and Computer Science: Coping with Finiteness. Science 194(4271), 1235–1242 (1976)CrossRefMATHMathSciNetGoogle Scholar
- 2.Tarau, P., Haraburda, D.: On Computing with Types. In: Proceedings of SAC 2012, ACM Symposium on Applied Computing, PL track, Riva del Garda (Trento), Italy, pp. 1889–1896 (March 2012)Google Scholar
- 3.Tarau, P.: A Prolog Specification of Giant Number Arithmetic. In: Rocha, R., Have, C.T. (eds.) Proceedings of the 13th International Colloquium on Implementation of Constraint Logic Programming Systems (CICLOPS 2013), Istanbul, Turkey (August 2013), http://arxiv.org/abs/1307.8389
- 4.Goodstein, R.: On the restricted ordinal theorem. Journal of Symbolic Logic (9), 33–41 (1944)Google Scholar
- 5.Knuth, D.E.: TCALC program (December 1994)Google Scholar
- 6.Vuillemin, J.: Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates. In: 19th IEEE Symposium on Computer Arithmetic, ARITH 2009, pp. 7–14 (June 2009)Google Scholar