rfcs VS eff

I would add that Equality saturation/E-graphs has become quite a hot topic recently, since their POPL21 paper, with workshops dedicated to applications of e-graphs. They have even recently been added to Cranelift as an IR for optimizations.

I think with Cranelift's investment into an e-graph based optimizer (https://github.com/bytecodealliance/rfcs/blob/main/accepted/cranelift-egraph.md) they are well positioned to have quite competitive performance as a backend.

They're also actively working in this area, for example the recently added equality saturation framework and the pattern matching DSL it builds on.

There's an RFC here: https://github.com/bytecodealliance/rfcs/pull/28 and Saúl Cabrera, the person who is leading this effort and implementing the compiler tier, has a work-in-progress draft PR here: https://github.com/bytecodealliance/wasmtime/pull/4907

You can swap-out implementations for testing, avoid the crazy N^2 instances issues, etc. They're pretty cool. Currently there are many competing libraries. polysemy and eff both have good examples on their homepages.

Effect systems and Algebraic effects. ocaml has just released a stripped-down effect system. People are also working on Effect systems for Haskell (eff, fused-effects, effet). Koka is a language built with effects first and foremost and it’s rapidly gaining popularity. Unison also has effects.

There are also a few subtle issues that arise with delconts related to semantics of higher order effects (see here and here), but they might be solvable.

Details are in https://github.com/hasura/eff/issues/12 and https://www.reddit.com/r/haskell/comments/pywuqg/unresolved_challenges_of_scoped_effects_and_what/.

You'll get fearless parallel with STM in the mixture, and GHC is getting a work in progress effect system for Haskell, as Delimited continuation primops has been merged.

My last example is algebraic effects, some of which have been made possible in a both practical and efficient way thanks to extremely recent research, and that I can use to implement architectures like Ports and Adapters or Clean Architecture and have very maintainable code. (Extensible Effects — An Alternative to Monad Transformers was published in 2013, Effect Handlers in Scope was published in 2014 and they are behind Polysemy, while there is ongoing work on effects with even better performance, like Eff)

cleff's Eff monad is esentially implemented as a ReaderT IO. [...] This is first done by eff, [...]

Here is link number 1 - Previous text "eff"

Languages such as Koka only support algebraic effects, not scoping operations such as catch and listen. The Effect Handlers in Scope paper introduces scoping operations, which lead to the Haskell libraries fused-effects and polysemy, but they turned out to have some weird semantics. eff is her effort to fix that.

There are a few languages that have algebraic effect systems, most notably Haskell, but these systems are implemented as libraries, not baked into the language (which can have advantages and disadvantages).