connection-pool
refined
Our great sponsors
connection-pool | refined | |
---|---|---|
- | 1 | |
7 | 180 | |
- | - | |
0.0 | 1.5 | |
almost 6 years 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.
connection-pool
We haven't tracked posts mentioning connection-pool 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?
uuid - A Haskell library for creating, printing and parsing UUIDs
elf - Parser for ELF object format.
scientific - Arbitrary-precision floating-point numbers represented using scientific notation
semantic-source - Parsing, analyzing, and comparing source code across many languages
unordered-containers - Efficient hashing-based container types
fmlist - FoldMap lists
audiovisual - Extensible records, variants, structs, effects, tangles
hnix - A Haskell re-implementation of the Nix expression language
protobuf - An implementation of Google's Protocol Buffers in Haskell.
llrbtree - Left-leaning red-black trees
critbit - A Haskell implementation of crit-bit trees.
ruby-marshal - Haskell library to parse a subset of Ruby objects serialised with Marshal.dump