constraints
sorty
Our great sponsors
constraints | sorty | |
---|---|---|
3 | - | |
70 | 1 | |
- | - | |
5.4 | 0.0 | |
7 months ago | over 14 years ago | |
Haskell | Haskell | |
BSD 2-clause "Simplified" License | BSD 3-clause "New" or "Revised" License |
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.
constraints
- GHC 7.4 gave us the ability to talk about ConstraintKinds. They stopped crashing the compiler in GHC 7.6
-
How is an instance of Monad an instance of Applicative?
If you are okay with some constraint-vocab you an see that Monad m entails Applicative m and Functor m
-
Monthly Hask Anything (November 2021)
If it's anywhere, I'd expect it in constraints, but it's not Dict and it's not Forall.
sorty
We haven't tracked posts mentioning sorty yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
mios - A SAT solver written in Haskell.
djinn - Generate Haskell code from a type
superconstraints
pipes-binary - Encode and decode binary streams using the pipes and binary libraries.
cluss - simple alternative to type classes
compressed - Compressed generators for monoidal reducers
confsolve - Generalized file conflict resolving tool.
constraints-emerge - 📤 defer instance resolution until runtime
sbv - SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.
constraints-deriving - Programmatically create new instances using core-to-core plugins
profunctors - Haskell 98 Profunctors