SaaSHub helps you find the best software and product alternatives Learn more →
Top 23 Haskell Data structure Projects
-
Project mention: Resurrection/modernization of an old Haskell+Haste project (boardgame Yinsh) | reddit.com/r/haskell | 2023-02-08
-
Project mention: FP language idea - would this is possible to infer and type check? | reddit.com/r/haskell | 2023-01-26
Agda has the so-called mixfix operators (which are powerful enough to cover pre/in/postfix cases with an arbitrary number of arguments), check that out: - https://agda.readthedocs.io/en/v2.6.1/language/mixfix-operators.html - https://github.com/agda/agda/blob/master/examples/Introduction/Operators.agda - https://github.com/agda/agda-stdlib/blob/master/src/Data/Product/Base.agda
-
SonarLint
Clean code begins in your IDE with SonarLint. Up your coding game and discover issues early. SonarLint is a free plugin that helps you find & fix bugs and security issues from the moment you start writing code. Install from your favorite IDE marketplace today.
-
Project mention: The Ethereum Virtual Machine (EVM) - What Is It and How to Make Business on It? | dev.to | 2022-06-30
hevm - written in Haskel
-
Haskell: https://github.com/TheAlgorithms/Haskell/blob/master/src/Sorts/MergeSort.hs
-
Project mention: Programming with -XStrict/Unlifted datatypes and associated ecosystem/libraries/preludes | reddit.com/r/haskell | 2022-12-30
"Make invalid laziness unrepresentable" means you should use strict versions of container types instead of lazy ones. However, for better or for worse, sometimes the "strict version" of a data type is not actually a strict data type, it's just a strict API to the lazy type. Examples include Data.Map.Strict (not Data.Map or Data.Map.Lazy) or Data.HashMap.Strict (not Data.HashMap.Lazy) (sadly there is no Data.Sequence.Strict but perhaps there will be one day).
-
Project mention: Is it possible to create singleton types for datatype wrapping String/Text? | reddit.com/r/haskell | 2022-07-06
-
vinyl
Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode. (by VinylRecords)
> Having set types like this and refining them smaller is something I wish Haskell would learn from Typescript, especially the automatic inference side
Haskell has far better type inference than Typescript in large part because it doesn't have subtyping.
There are libraries for open records and sums (e.g. https://hackage.haskell.org/package/vinyl) but they're almost always the wrong choice.
-
InfluxDB
Build time-series-based applications quickly and at scale.. InfluxDB is the Time Series Platform where developers build real-time applications for analytics, IoT and cloud-native services. Easy to start, it is available in the cloud or on-premises.
-
Project mention: N-ary Tree data structure with efficient parent access? | reddit.com/r/haskellquestions | 2022-12-18
Your names are good, I reckon it is Martin Erwig's fgl stuff and Andrey Mokhov's algebraic-graphs that you have in mind.
-
-
-
justified-containers
Standard containers, with keys that carry type-level proofs of their own presence.
-
-
-
-
-
parameterized-utils
A set of utilities for using indexed types including containers, equality, and comparison.
-
-
-
-
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
Haskell Data structures related posts
- FP language idea - would this is possible to infer and type check?
- Making sense of TypeScript using set theory
- Best Programming Language for Computational Proof
- Building not-gloss package
- Programming with -XStrict/Unlifted datatypes and associated ecosystem/libraries/preludes
- Extensible ASTs with extensible types
- N-ary Tree data structure with efficient parent access?
-
A note from our sponsor - #<SponsorshipServiceOld:0x00007fea5962dc20>
www.saashub.com | 9 Feb 2023
Index
What are some of the best open-source Data structure projects in Haskell? This list will help you:
Project | Stars | |
---|---|---|
1 | miso | 2,036 |
2 | Agda | 2,035 |
3 | hevm | 1,861 |
4 | Haskell | 316 |
5 | containers | 305 |
6 | singletons | 278 |
7 | vinyl | 254 |
8 | fgl | 175 |
9 | cubical | 136 |
10 | repa-array | 127 |
11 | justified-containers | 79 |
12 | barbies | 78 |
13 | hoq | 78 |
14 | ethereum-client-haskell | 76 |
15 | type-level-sets | 64 |
16 | psqueues | 62 |
17 | dlist | 59 |
18 | parameterized-utils | 54 |
19 | EdisonAPI | 52 |
20 | unpacked-containers | 51 |
21 | bookkeeper | 51 |
22 | slist | 48 |
23 | knit | 45 |