No really, computable real store the AST of the computation to lazily compute digits as they are needed (which is an interesting idea but memory hungry at scale

No really, computable real store the AST of the computation to lazily compute digits as they are needed (which is an interesting idea but memory hungry at scale) while Haskell approach is more akind to a form of general type deduction. Note that I first meet computable numbers in Haskell : https://wiki.haskell.org/Applications_and_libraries/Mathematics#Dynamic_precision_by_lazy_evaluation https://wiki.haskell.org/Applications_and_libraries/Mathemat...