folds
base64-bytestring
| folds | base64-bytestring | |
|---|---|---|
| - | 1 | |
| 18 | 45 | |
| - | - | |
| 0.6 | 4.7 | |
| about 1 year ago | 7 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | GNU General Public License v3.0 or later |
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.
folds
We haven't tracked posts mentioning folds yet.
Tracking mentions began in Dec 2020.
base64-bytestring
-
Yatima: A programming language for the decentralized web
Sure, if you consider Haskell's runtime (I know that technically GHC /= Haskell, but in practice it's the only Haskell that matters, except maybe something like Asterius) all the primitives are backed by C libraries: https://hackage.haskell.org/package/ghc-prim-0.4.0.0/docs/GH...
Likewise with conventions around pointers, arrays, etc. to the point where if you want to do anything really low-level or performance sensitive in Haskell, you're essentially punching a hole into C. As a random example, within the fast base64bytestring library, you find lots of use of `malloc`, `ForeignPtr` etc.: https://github.com/haskell/base64-bytestring/blob/master/Dat... And of course because this is C there aren't really many safety guarantees here.
The plan with Yatima with its primitives, and eventually when we write an FFI is to integrate with Rust in the same way that Haskell uses C. My hope is that with Yatima's affine types we might even be able to FFI to and from safe Rust (since the borrow checker uses affine types), but this is a little bit of a research project to see how much that works. Even to unsafe Rust though, we have better safety guarantees than C, since unsafe Rust's UB is still more restricted than C's is.
What are some alternatives?
order-statistic-tree - Order statistic tree in Haskell
msgpack - Haskell implementation of MessagePack / msgpack.org[Haskell]
comonad - Haskell 98 comonads
asn1-encoding - ASN1 Raw/BER/DER/CER reader/writer in haskell
data-category - Library of categories, with categorical constructions on them
data-lens - Haskell 98 Lenses
comonads-fd - comonad transformers based on functional-dependencies
cassava-conduit - Conduit interface for cassava [Haskell]
fclabels - First class composable record labels for Haskell.
bimap - Bidirectional mapping between two key types
semigroupoids
filesystem-trees - Traverse and manipulate directories as lazy rose trees