Stephen Tetley

> Brainstorm immutable Vector. As an intermediate step - a RandomAccessList [*] is very easy to implement (much easier than a Hash-mapped Trie). I've one waiting the benchmarking fix #3992...

Thanks Jonathan. Chris Okasaki says on page 133 of Purely Functional Data Structures: > Skew binary random-access lists are a good choice for applications that take advantage of both the...

Could a `MonadZip` class help? This was added to Haskell for monad comprehensions.

George Giorgidze, et al - Bringing Back Monad Comprehensions https://db.inf.uni-tuebingen.de/staticfiles/publications/haskell2011.pdf There is also Jeremy Gibbons's - Comprehending Ringads https://www.cs.ox.ac.uk/jeremy.gibbons/publications/ringads.pdf

I've implemented Haskell's `MonadZip` class in Flix - shall I make a PR to add it to the stdlib?

I've created a PR #4347 - feat: add a MonadZip class, potentially helping issue #4230 I'm looking at adding some more `Applicative` / `Monad` traversals to the stdlib so I've...

Thanks Magnus, yes I'll take a look at this.

Considering `ioHandlerWithSeverity` - do you want each message timestamped or just the start of the "run" of the collected messages when printed to the console?

I'm getting an error trying to implement the list handler for logger, below a simplified version (no thunks / laziness or severity levels). Is the error expected - i.e. is...

> pub def toListHandler(f: Unit -> a \ ef ): (a, List[String]) \ ef Thanks Magnus, I'll go with that.