Announcing Scrod, like Haddock but faster

Vlix:

Haddock doesn’t do that, does it?

Nope! As far as I know, Haddock does not retain function arguments at all.

Vlix:

Can you annotate arguments?

I don’t think so. You can document their types, of course. I think any documentation connected to the binding itself is simply dropped by GHC.

Vlix:

Even if a completely different parser has to be created.

This line of thinking reminds me of Kmett’s Coda and monoidal parsing: Reddit - The heart of the internet

Ambrose:

I just wrote something for what graphex needs

I did consider going down this route for Scrod. However I wanted to leverage GHC (and Haddock) as much as possible to avoid another haskell-src-exts situation where Scrod handles things differently than GHC and I’m constantly trying to fix the problems.