Dictionary as Monad

[gusty]

A sort of "infinite" dictionary would allow it to act as a Monad and Applicative.

[gusty]

One limitation with this implementation is that it would require the infinite dictionary to be in the first position of the applicative expression, otherwise it would try to iterate through an infinite dictionary.

There are ways to improve this:

• Create a specific type and match against the type in the applicative implementation. The problem is that the applicative implementation would be linked to only this specific type, though this could be acceptable in order to get applicatives working.
• Make the applicative implementation to get the count first, then iterate with the smaller dict. This is in anycase a good optimization. The problem here is what if both dictionaries are infinites? And how do we signal that it's infinite? Count=MaxInteger? Or maybe use negative numbers, this feels really hacky but it would allow to encode the infinity nature of the dictionary, moreover if we allow adding elements to these dictionaries we can return a negative count of the overridden elements.

[gusty]

I re-opened it just to experiment, but it doesn't mean that I'm proposing to merge it, as I still think it will break LSP.