holmes VS dependent-map

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

holmes

A reference library for constraint-solving with propagators and CDCL. (by i-am-tom)

dependent-map

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

holmes

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

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

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.

What are some alternatives?

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

code-builder - Packages for defining APIs, running them, generating client code and documentation.

d10 - Digits 0-9

massiv - Efficient Haskell Arrays featuring Parallel computation

dependent-state

refined - Refinement types with static checking

critbit - A Haskell implementation of crit-bit trees.

prim-uniq - Opaque unique identifiers in primitive state monads

hierarchy

interpolate - String interpolation for Haskell done right!

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

Frames - Data frames for tabular data.

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