Arnaud Spiwack

> The structure I'm talking about holds only unrestricted values, so your concern about strictness isn't relevant. It is though, because of the linked structure of the pairing heap, independently...

This implementation of move is unproblematic. You can implement it client-side too. You could also simply implement `move` as a simple recursion through the `PQ` concrete definition (the one you...

Aha! Very interesting. So the idea is, in an amortized structure, you do a bunch of cheap operations, but eventually you have to do an expensive operation. You certainly don't...

(well in their defence pairing heap are a very unfair data structure: they are dead simple, and perform well in many applications) Is there anything left on this issue, that...

I think (I'm pretty sure in fact) I wrote a comment here, and never finished. It got lost. Sorry. I'm seeing this again now. What kind of documentation do you...

I'd say that linear GHC is somewhat ready. Linear types work fine, but `let` and `where` bindings are never linear, which can be rather painful. This is something that I've...

As a follow up, you were asking for chats: we now have a Discord: https://discord.gg/7yg5GxzvDJ .

Let me close as I believe the question has been answered.

Here's a plan, albeit a half-baked one still. We can make a class ```haskell class Monad m => MonadEvaluate m where evaluate :: a -> m a ``` Evidently, `IO`...

An issue of allowing `IO` computations with local state, is that `IO` computations can call `myThreadId`, since I silently create threads each time we modify the local state, `myThreadId` will...