dependent-map VS fin

Compare dependent-map vs fin and see what are their differences.

dependent-map

Dependently-typed finite maps (partial dependent products) (by obsidiansystems)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
dependent-map fin
1 -
61 23
- -
0.0 2.9
over 1 year ago 6 months ago
Haskell Haskell
LicenseRef-OtherLicense 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.

dependent-map

Posts with mentions or reviews of dependent-map. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-10-02.
  • Monthly Hask Anything (October 2021)
    7 projects | /r/haskell | 2 Oct 2021
    Are there any clever ways to abstract the reallyUnsafePtrEquality traversal trick (as found e.g. here). Integrating it into something like uniplate was the only real idea I had, but I'm sure the overhead there would more than negate the saved allocations.

fin

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

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

What are some alternatives?

When comparing dependent-map and fin you can also consider the following projects:

d10 - Digits 0-9

unordered-containers - Efficient hashing-based container types

dependent-state

critbit - A Haskell implementation of crit-bit trees.

text - Haskell library for space- and time-efficient operations over Unicode text.

hierarchy

refined - Refinement types with static checking

relevant-time - relevant times useful for looking forward or backward in time from a time-anchor

holmes - A reference library for constraint-solving with propagators and CDCL.

conffmt - language-conf - .conf (e.g. nginx configuration) parsers and pretty-printers for the Haskell programming language.

json-autotype - Automatic Haskell type inference from JSON input