Implicit parameters vs ReaderT

1. Truth

   1 5 33 9.4 Haskell

   Changes and Pinafore projects. Pull requests not accepted. (by AshleyYakeley)

   

   Here's an example in Pinafore's type unifier code, where I use ?rigidity :: String -> NameRigidity everywhere. In my opinion, the implicit parameter constraint makes the already complicated code slightly simpler. But it doesn't escape the module.

2. CodeRabbit

   coderabbit.ai featured

   CodeRabbit: AI Code Reviews for Developers. Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.

   

3. codex

   2 3 66 0.0 Haskell

   UI experiments for coda (by ekmett)

   

   https://github.com/ekmett/codex/tree/master/engine is a nice demonstration, in particular the fact that user code in there all runs in IO directly, with no mtl-like interpreter overhead.

4. cleff

   3 5 108 0.0 Haskell

   Fast and concise extensible effects

   

   I ended up using a different approach to guiding inference in my project, but I still thought the IP way was cool

Suggest a related project