nextstep-plist
refined
| nextstep-plist | refined | |
|---|---|---|
| - | 1 | |
| 3 | 180 | |
| - | - | |
| 0.0 | 1.0 | |
| over 11 years ago | 8 days 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.
nextstep-plist
We haven't tracked posts mentioning nextstep-plist 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?
critbit - A Haskell implementation of crit-bit trees.
elf - Parser for ELF object format.
text - Haskell library for space- and time-efficient operations over Unicode text.
semantic-source - Parsing, analyzing, and comparing source code across many languages
binary - Efficient, pure binary serialisation using ByteStrings in Haskell.
fmlist - FoldMap lists
hnix - A Haskell re-implementation of the Nix expression language
text-icu - This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.
llrbtree - Left-leaning red-black trees
bifunctors - Haskell 98 bifunctors, bifoldables and bitraversables
ruby-marshal - Haskell library to parse a subset of Ruby objects serialised with Marshal.dump