ethereum-analyzer
An Ethereum contract analyzer. (by zchn)
heaps
Asymptotically optimal Brodal/Okasaki heaps (by ekmett)
Our great sponsors
| ethereum-analyzer | heaps | |
|---|---|---|
| - | 1 | |
| 17 | 29 | |
| - | - | |
| 0.0 | 0.0 | |
| about 6 years ago | over 1 year ago | |
| Haskell | Haskell | |
| Apache License 2.0 | 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.
ethereum-analyzer
Posts with mentions or reviews of ethereum-analyzer.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning ethereum-analyzer yet.
Tracking mentions began in Dec 2020.
heaps
Posts with mentions or reviews of heaps.
We have used some of these posts to build our list of alternatives
and similar projects.
-
What's "One Cool Thing" about OCaml? I.e. some piece of code or language concept which is more elegant or powerful in ocaml than in most or all other mainstream languages, but that could be explained to a room of unfamiliar cs majors in under five minutes?
You can implement all this in Haskell (and Kmett has), but the double-layer functor presentation is beautiful in its expression of recursion and memoization through the composition of first-class modules. Yes, you could do this with typeclasses in Haskell, but typeclasses but I think there's just an element of elegance to first-class modules that can't be found with typeclasses. (Not the mention Haskell's horridly bare-bones module system.)
What are some alternatives?
When comparing ethereum-analyzer and heaps you can also consider the following projects:
ethereum-client-haskell
fgl - A Functional Graph Library for Haskell
hevm - Dapp, Seth, Hevm, and more
EdisonAPI - Edison: A Library of Efficient Data Structures
ethereum-merkle-patricia-db
helf - Haskell implementation of the Edinburgh Logical Framework
ethereum-rlp
repa-array - High performance, regular, shape polymorphic parallel arrays.
permutation - git import of patrick perry permutations lib from darcs
flux-monoid - A monoid which counts changing values in a sequence
monadic-arrays - MArray instances for monad transformers
map-syntax - Syntax sugar and explicit semantics for statically defined maps
ethereum-analyzer vs ethereum-client-haskell
heaps vs fgl
ethereum-analyzer vs hevm
heaps vs EdisonAPI
ethereum-analyzer vs ethereum-merkle-patricia-db
heaps vs helf
ethereum-analyzer vs ethereum-rlp
heaps vs repa-array
ethereum-analyzer vs permutation
heaps vs flux-monoid
ethereum-analyzer vs monadic-arrays
heaps vs map-syntax