Binary trees as a computational framework
We present a new set of algorithms for performing arithmetic computations using binary trees. Our arithmetic algorithms have average time and space complexity comparable to traditional operations on bitstrings. Our results are implemented using Haskell instances isomorphic to natural numbers.
arithmetic computations with binary trees gdel system t types modeling computational abstractions with functional programming computations with balanced parenthesis languages