Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers
Paul Tarau · 2014
Our tree-based hereditarily binary numbers apply recursively a run-length compression mechanism. They enable performing arithmetic computations symbolically and lift tractability of computations to be limited by the representation size of their operands rather than by their bitsizes.