You can use lazy memo tries to implement efficient multiplication on Dirichlet generating functions. Not sure if this is useful, but some fun Haskell (laziness/infinitude beyond the usual lists that have equivalents like "streams" in e.g. Rust) http://vmchale.com/static/serve/MTrie.pdf https://vmchale.com/static/serve/MTrie.lhs