sum-totality
Totality checking for sum type producers in Haskell (by aaronallen8455)
sketches
A Haskell blog (by effectfully)
sum-totality | sketches | |
---|---|---|
1 | 12 | |
1 | 123 | |
- | 0.8% | |
0.0 | 2.9 | |
over 2 years ago | 3 months ago | |
Haskell | Haskell | |
- | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
sum-totality
Posts with mentions or reviews of sum-totality.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-09-04.
-
A custom warning hack
Interesting, I wrote a library last week for this very purpose using generics and type level programming https://github.com/aaronallen8455/sum-totality. The simplicity of your custom warnings idea is very appealing though.
sketches
Posts with mentions or reviews of sketches.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-06-02.
- Hierarchical Free Monads: Mostly Pointless (2020)
-
Functional Declarative Design: A Comprehensive Methodology for Statically-Typed Functional Programming Languages
but free monads are an effect system and not an ergonomic one. I have a post on how one can do the same with constraints as with Hierarchical Free Monads, except with less boilerplate.
- Teaching GHC to Play Minesweeper
- Teaching GHC how to play Minesweeper
-
What's the modern idiomatic way to write this? / Inductive typeclasses with Nat
I have a post about pretty much exactly this problem. It has a good type families solution (no need to specify the arity of the zipping function) and an even better fundeps one.
- A custom warning hack
- Custom type equality errors
- Trouble in Paradise: Fibonacci
- Trouble in paradise: Fibonacci
- Enumerating type variables
What are some alternatives?
When comparing sum-totality and sketches you can also consider the following projects:
unliftio - The MonadUnliftIO typeclass for unlifting monads to IO
polysemy - :gemini: higher-order, no-boilerplate monads
eff - 🚧 a work in progress effect system for Haskell 🚧
functional-declarative-design-methodology - Article: Functional Declarative Design