naperian VS hamtmap

Compare naperian vs hamtmap and see what are their differences.

naperian

Efficient representable functors (by aaronvargo)

hamtmap

By exclipy
Our great sponsors
  • InfluxDB - Collect and Analyze Billions of Data Points in Real Time
  • Onboard AI - Learn any GitHub repo in 59 seconds
  • SaaSHub - Software Alternatives and Reviews
naperian hamtmap
0 0
5 45
- -
0.0 0.0
about 5 years ago -
Haskell Haskell
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.

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.

hamtmap

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

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

What are some alternatives?

When comparing naperian and hamtmap you can also consider the following projects:

justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.

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

EdisonAPI - Edison: A Library of Efficient Data Structures

rawr - Anonymous extensible records and variant types

DrIFT - A mirror of DrIFT.

selections - Haskell Package for operating with selections over an underlying functor

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

exposed-containers - A redistribution of 'containers', with all hidden modules exposed.

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)

heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.

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

claferIG - Support for reasoning on Clafer models by instantiation and counter example generation.