Paper Info
Title
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.
Year
DOI
Venue
2014
10.1007/978-3-319-04132-2_9
PADL
Keywords
Field
DocType
prolog as a specification language,arithmetic computations with giant numbers,compressed number representations,hereditary numbering systems,tree-based numbering systems
Programming language,Number representation,Computer science,Operand,Arithmetic,Theoretical computer science,Prolog,Recursion,Computation,Binary number,Doors
Conference
Citations 
PageRank 
References 
0
0.34
3
Authors
1
Name
Order
Citations
PageRank
Paul Tarau11529113.14