Arnaud Spiwack

Hi @b-mehta , happy to hear from you: it's been a while. You're absolutely right, of course. Thanks for flagging it. In the implementation, it's `singleton` which uses `Unsafe.linear`, maybe...

I'm being silent on this issue, because I need to think about it. Apologies.

Oooff… I kind of forgot about this issue for a while. Sorry. My intention with these is type is that - `(==) :: a %1-> a %1-> (Bool, a, a)`...

I assume `foo` would be a `traverse` function, but we haven't got around to design the traversable hierarchy see #220 . I don't have any generic mechanism for `bar` in...

I object to the renaming of the `example/` subdirectory. These examples aren't meant to be sorted accorded to the what modules they exercise (indeed they exercise several). They are meant...

You leave me a little confused, my apologies. Can I ask you to scribble some code example of what you would like to do and find it problematic with linear...

Because I'm very slow, I just figured out that this was related to https://github.com/tweag/linear-base/issues/453#issuecomment-1556285703 :slightly_smiling_face: . My thoughts right now: - I agree that queues are useful; what was puzzling...

Sorry, I mispoke: I meant that amortisation is easy because single-threadedness avoids all the issues with purely functional data structures that more sophisticated data structures avoid. In a function with...

On the efficiency stand-point, I think the right approach is to use `dupR` instead of `dup2` (in `iterate`, `cycle`, etc…). But even using a `Replicator` in our recursion, there may...

Another option is to build `take` into these functions and produce only a prefix of the list. But it feels rather limited as we can't compose these functions well. So...