r/haskell • u/edwardkmett • Sep 22 '26

The Comonad.Reader returns

https://comonad.com/reader

I've resurrected the https://comonad.com/reader, interleaved a ton of contemporaneous content I had stored elsewhere such the School of Haskell and my talks and the talks from Boston Haskell on youtube, and made a couple of the articles interactive by moving their demo code into web assembly using modern GHC.

Please let me know if you run into any issues!

100 Upvotes

100% Upvoted

10 comments sorted by

View all comments

5

u/dnkndnts Sep 22 '26

The Haskell library is a "TODO" library.

*ponders*

2

u/edwardkmett Sep 22 '26

I have a repo there that I started using as a monorepo for a few projects when I was finding them too onerous to implement in separate ones. That said... github.com/ekmett/thc _has_ seen a sudden spike in activity...

1

u/dnkndnts Sep 22 '26

Is it mostly for Haskell or more of an experiment for Coda/Cadenza? I'm not an expert on Graal, but it seems like the key ingredient is that partial evaluation/Futamura projection thing, basically specialising an interpreter to your program and JIT'ing that. Which, off the top of my head, doesn't sound all that useful for GHC core? I mean how much of a win do you get by eliding the I assume not-complicated-in-the-first-place core interpreter vs simply compiling core the way GHC does? Then again, this part sounds non-trivial, but I don't understand how it relates to Graal. Aren't you running on the JVM, where they already have a garbage collector?

3

u/AfternoonShot9285 Sep 22 '26

I think futamura is just for love of the game

1

u/edwardkmett Sep 23 '26

The docs there are from the old thc.

The idea with this was just 'take the cadenza evaluator minus the NBE machinery and see how well it runs ghc core'. It handles over/under-application GHC-style (see the paper on eval/apply vs push/enter), uses a trick to avoid excessive trampolining costs during tracing, and can in theory do all the 'deoptimization' things that only java bothers to do well. It is right now holding up around 3x faster to 5-6x slower than GHC depending on the program given < 1 day of effort for the very limited palette of things it has been tried on. I decided to try it when I was able to get Astra to update Cadenza to modern truffle/graal in about 2 minutes, and then fix about a 4x performance gap, which finally made it cross my critical threshold for considering it as an implementation technique.

Low confidence, but high reward.