[Haskell fan boy here] I feel like there is at least one Haskell library out there that automates this "no virtual DOM" problem. In Haskell it is not uncommon

[Haskell fan boy here] I feel like there is at least one Haskell library out there that automates this "no virtual DOM" problem. In Haskell it is not uncommon to create data structures on the fly, only to deconstruct them immediately again. If done correctly the compiler can remove the immediate structure completely, leaving a (recursive) algorithm. An example of this would be sorting via binary trees. If done correctly, the intermediate tree is never (completely) present in ram.