refined
algebraic-classes
Our great sponsors
refined | algebraic-classes | |
---|---|---|
1 | - | |
180 | 10 | |
- | - | |
1.5 | 0.0 | |
about 1 month ago | almost 4 years ago | |
Haskell | Haskell | |
MIT 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.
refined
-
Can types replace validation?
In one respect, nothing. You’re right. Even given refinement types as in Haskell or Scala, there is indeed a necessarily-partial function (refineV in Scala) to refine a value to its refinement type.
algebraic-classes
We haven't tracked posts mentioning algebraic-classes yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
elf - Parser for ELF object format.
lens - Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
semantic-source - Parsing, analyzing, and comparing source code across many languages
bson - Haskell representation and serialization of BSON documents (version 1.0) as defined at bsonspec.org
fmlist - FoldMap lists
text - Haskell library for space- and time-efficient operations over Unicode text.
llrbtree - Left-leaning red-black trees
primitive - This package provides various primitive memory-related operations.
hnix - A Haskell re-implementation of the Nix expression language
critbit - A Haskell implementation of crit-bit trees.
ruby-marshal - Haskell library to parse a subset of Ruby objects serialised with Marshal.dump
discrimination - Fast linear time sorting and discrimination for a large class of data types