burrido VS exceptionally

do-notation can be easily implemented using delimited continuations (ie. generators). Generators compose well and flatten tail calls so you don't need TCO or trampolines. The only notable issue is that one-shot delimited continuations like generators don't work with non-deterministic monads (ie. List). Multi-shot can be emulated by keeping a cache of past values and replaying the generator, but performance will suffer. See burrido [1] for a JavaScript do-notation implementation.

[1] https://github.com/pelotom/burrido

I haven’t tried this out myself but there’s libraries out there that emulate do notation with generators, if that’s any better than e.g. fp-ts’ Do. A quick Google search led me to burrido

Looks great!

A few questions (hopefully the author still reads it):

* Any plan for support of arrow/monad comprehensions?

* Semi-related: When it comes to generators it might be worth to consider making them clonable (see https://github.com/pelotom/burrido)

I one also thought that handlong errors works better when havung a good structure but that didn't really plan out. I stopped throwing anything inside my codebases. The only way to get full knowledge over the possible outcomes of a function call is if the function also returns exceptions instead of throwing them. TypeScript will not help you if something gets thrown. I wrote my own little library to handle this: https://github.com/ivanhofer/exceptionally I recently discovered that there are also other solutions out there that do something similar. With such an approach you will also know after 5 and more levels of function calls if your code really covers all possible outcomes. Really useful for refactoings!