Arnaud Spiwack

Ah, yes. Hash tables are susceptible to this sort of attacks in a way that trees are not. I was aware that `hash = id` for ints. Even `hashWithSalt` is...

@mb64 just a quick note: I'm going on holiday roughly now, and all of the maintainers of linear-base will be on holiday next week. Don't be surprised if it takes...

Hi, thanks for your interest. I'll get back to you on this issue and your PR very soon.

Hello, Thanks for your PR. Can you elaborate on your design? Why create a `BitwiseAnd` class, in particular?

`applyUr f` is `unur . Data.fmap f`. But I don't believe that we wrote an equivalent to `applyMove` (though I guess it's `unur . Data.map f . move`; but it's...

Ok. Let's go for `($^)`.

For most of the things introduced here, see #79 . Which covers the same ground except: - The traversal story is different there - There is no getters with `Top`...

> We have to decide whether we should use the new `VM` on the `Dupable` class. I feel like it would be a good default (based on What would be...

I'm on this. I know how to fix. But, of course, it duplicates every Optics type. In my head, I'm suffixing them with a `U`, so we would have ```haskell...

I actually failed to solve this, today. But I can't yet put intelligible words on it, I'll get back here soon.