bifunctors
Haskell 98 bifunctors, bifoldables and bitraversables (by ekmett)
hnix
A Haskell re-implementation of the Nix expression language (by haskell-nix)
bifunctors | hnix | |
---|---|---|
1 | 4 | |
56 | 729 | |
- | 0.4% | |
5.6 | 6.8 | |
about 2 months ago | about 2 months ago | |
Haskell | Nix | |
BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
bifunctors
Posts with mentions or reviews of bifunctors.
We have used some of these posts to build our list of alternatives
and similar projects.
-
Why is the maybe monad transformer defined as MaybeT { runMaybeT :: m (Maybe a) } instead of MaybeT { runMaybeT :: Maybe (m a) } ?
But it is possible to derive using a newtype of a tuple with its arguments reversed: Flip (,) s. If we get the (Biapplicative bi, Monoid b) => Applicative (Flip bi b) instance (issue). It will require a constraint to restrict m to have a representational argument because otherwise we cannot coerce through it.
hnix
Posts with mentions or reviews of hnix.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-01-06.
-
Adding my own stuff to the prelude / global imports?
I can refere to prelude setup in HNix
-
Good Haskell Source Code
I also can nominate HNix: https://github.com/haskell-nix/hnix. Nix is a lazy pure language, HNix is an implementation of Nix in lazy pure language (Haskell). The project was done by a famous expert in the field of compilers/interpreters, which worked on Borland C++ compiler back in a day. The project overall was done by a pretty start team.
-
Tvix: We are rewriting Nix
Well, maintaining a rewrite of Nix in Haskell: https://github.com/haskell-nix/hnix.
-
HNix - Nix in Haskell, about the project & meeting with the creator
HNix is a Nix (pure lazy language) interpreter/tooling in Haskell. So it is a field&case of pure-to-pure, lazy-to-lazy language creation. HNix is created with fancy design paradigms (design introduction): as recursion schemes (since Nix is a recursive language) & Abstracting Definitional Interpreters. Mentioning these two particularly, as they align HNix to GHC in a natural way, design leverages & projects GHC power to HNix, allowing to concentrate on language implementation.
What are some alternatives?
When comparing bifunctors and hnix you can also consider the following projects:
size-based
massiv - Efficient Haskell Arrays featuring Parallel computation
frontmatter - Attoparsec parsers for YAML frontmatter as used in Jekyll
safecopy - An extension to Data.Serialize with built-in version control
combobuffer - Several pure buffer implementations
hashable - A class for types that can be converted to a hash value
hebrew-time - Hebrew dates and prayer times.
abcBridge - Haskell bindings for ABC
hierarchy
b-tree - Haskell on-disk B* tree implementation
gps2htmlReport - Generates a HTML page report detailing a GPS journey, with charts, statistics and an OpenStreetMap graphic.
primitive - This package provides various primitive memory-related operations.