I’m starting to learn interesting interactions between a languages’s type system (or lack thereof) and its implementation. For example, in a statically typed setting, the runtime doesn’t need continuation barriers because reentry can be prevented at the type level. It’s really cool to learn about how different language features interact and their implications.

That’s true if you have a very specific kind of type system

Right, I should’ve been more specific!

Does anyone know of a good explanation (maybe in Scheme even) of how async/await work?

Depending on what you want in an explanation, it’s just the generator feature of Racket

Ok that makes more sense now. Thanks.