fin | refined | |
---|---|---|
- | 1 | |
23 | 180 | |
- | - | |
2.9 | 1.5 | |
6 months ago | about 1 month ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | MIT 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.
fin
We haven't tracked posts mentioning fin yet.
Tracking mentions began in Dec 2020.
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.
What are some alternatives?
unordered-containers - Efficient hashing-based container types
elf - Parser for ELF object format.
critbit - A Haskell implementation of crit-bit trees.
semantic-source - Parsing, analyzing, and comparing source code across many languages
text - Haskell library for space- and time-efficient operations over Unicode text.
fmlist - FoldMap lists
holmes - A reference library for constraint-solving with propagators and CDCL.
hnix - A Haskell re-implementation of the Nix expression language
json-autotype - Automatic Haskell type inference from JSON input
llrbtree - Left-leaning red-black trees
dependent-map - Dependently-typed finite maps (partial dependent products)
ruby-marshal - Haskell library to parse a subset of Ruby objects serialised with Marshal.dump