naperian VS justified-containers

Compare naperian vs justified-containers and see what are their differences.

naperian

Efficient representable functors (by aaronvargo)

justified-containers

Standard containers, with keys that carry type-level proofs of their own presence. (by matt-noonan)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
naperian justified-containers
- -
5 79
- -
0.0 0.0
over 5 years ago about 4 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License BSD 2-clause "Simplified" 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.

naperian

Posts with mentions or reviews of naperian. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning naperian yet.
Tracking mentions began in Dec 2020.

justified-containers

Posts with mentions or reviews of justified-containers. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning justified-containers yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing naperian and justified-containers you can also consider the following projects:

repa-array - High performance, regular, shape polymorphic parallel arrays.

more-containers - A few more container types

hamtmap

clafer - Clafer is a lightweight modeling language

rawr - Anonymous extensible records and variant types

tie-knot - "Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values.

DrIFT - A mirror of DrIFT.

void - Provides Data.Void, which is in base since ghc 7.8 or so

type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)

miso - :ramen: A tasty Haskell front-end framework

EdisonAPI - Edison: A Library of Efficient Data Structures

functor-friends - Friendly helpers for your recursion schemes.