containers
ghc-proposals
Our great sponsors
containers | ghc-proposals | |
---|---|---|
11 | 159 | |
313 | 668 | |
-0.3% | 0.1% | |
6.2 | 9.1 | |
6 days ago | 10 days ago | |
Haskell | Python | |
BSD 3-clause "New" or "Revised" License | - |
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.
containers
-
Programming with -XStrict/Unlifted datatypes and associated ecosystem/libraries/preludes
"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).
-
How are Lists & Sequences (from containers package) control structures?
Indeed it's rather subtle. See https://github.com/haskell/containers/issues/752 for more discussion on the matter. Nonetheless, I believe it is "spine strict" in the sense that thunks for all values always exist, even if the spine that holds them can be rearranged due to laziness.
-
An elegant approach to solve this problem?
Note that the list index operator has O(n) complexity. Ideally you'd want to use something like Seq from the containers package
- Monthly Hask Anything (June 2022)
-
Why is seemingly infinite (lazy) recursion faster?
Edison and containers both have sequence types that support efficient, cons, snoc, viewL, viewR, append, map, and length.
-
Haskell - Important Libraries
containers
-
Assessing Haskell (blogpost, slightly negative!)
Calling linked lists Haskell's "primary data structure" seems off-base to me. Yes, there's String, yes, there's built-in syntax for List... but there's also everything in containers, and vector is pretty easy to use in practice, though it would probably be good for more learning material to mention it more prominently.
-
Is a a MONAD in Haskell just the functional equivalent of a generic type (such as in C#) and how do MONADs enable things like saving data?
Haskell has much more sophisticated immutable data structures, you can find them in the "containers" package: https://hackage.haskell.org/package/containers
-
Looking for projects that make heavy use of IntMap which have benchmarks
I asked this on the libraries mailing list but thought posting here would bring in potentially more responses. I made a recent change to the behaviour of lookup and find (see here for more details: https://github.com/haskell/containers/pull/800).
-
Semver doesn't mean MAJOR.MINOR.PATCH, it means FAILS.FEATURES.BUGS
Rust has nothing on Haskell. containers, which might as well be considered part of the standard library, has been out for almost 14 years and is still 0.x
ghc-proposals
-
An alternative front end for Haskell?
> I think Haskell needs a way to graduate (or retire) language extensions
-
Or patterns proposal: Prefix signalling or just infix?
Additionally, while this proposal is focused on the simple implementation and so in the current proposal or patterns do not bind any variables as per #522, if we do get settled on syntax and then later wish to expand to allow binding variables as in #43, then the syntax is again clean and discoverable.
-
Monthly Hask Anything (May 2023)
Yeah, a relatively natural thing would be to be able to opt-in to having the HasField instances be available in all contexts. The (not yet implemented, but accepted) "Modifiers" GHC proposal might be nice for that.
-
Is there any way to build a simple additive prelude?
The local modules proposal imo is excellent as-is.
-
Interview and AMA with Simon Peyton Jones
Why would you drop TypeFamilies? It seems fairly popular, given that it was just one vote short of getting added to GHC2021. Do you consider it a less-ideal compromise, that is subsumed by your second proposal (Core with GRTT)?
-
Amendmend proposal: Changed syntax for Or patterns
as syntax is contentious a topic as ever, David (the main proposal author) and I would like to invite you to give your input on https://github.com/ghc-proposals/ghc-proposals/pull/585, where we propose to change the syntax of the accepted proposal #522 introducing Or patterns. In particular, we'd like to know
-
MSc Dissertation: Comprehending Pure Functional Effect Systems
This looks great, congratulations on completing it! I assume you didn’t get an opportunity to evaluate the delimited continuations based eff library? It would’ve been nice to see Cont included as one of the effects covered, though perhaps not available in all the systems you looked at? Maybe some future work.
-
Trouble understanding function import in Haskell
I do hope qualified exports are available someday: https://github.com/ghc-proposals/ghc-proposals/pull/283
-
{-# WARNING #-} for Data.List.{head,tail} in future GHC 9.8
Right. Being able to disable "custom type warnings" at use sites was part of an earlier proposal (https://github.com/ghc-proposals/ghc-proposals/pull/454) but it ended up being shelved.
- Foldr type level implementation
What are some alternatives?
singletons - Fake dependent types in Haskell using singletons
haskell-language-server - Official haskell ide support via language server (LSP). Successor of ghcide & haskell-ide-engine.
EdisonAPI - Edison: A Library of Efficient Data Structures
ihp - 🔥 The fastest way to build type safe web apps. IHP is a new batteries-included web framework optimized for longterm productivity and programmer happiness
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
julia - The Julia Programming Language
hevm - Dapp, Seth, Hevm, and more
rio-orphans - A standard library for Haskell
miso - :ramen: A tasty Haskell front-end framework
hoogle - Haskell API search engine
indexed-containers
ghc - Mirror of the Glasgow Haskell Compiler. Please submit issues and patches to GHC's Gitlab instance (https://gitlab.haskell.org/ghc/ghc). First time contributors are encouraged to get started with the newcomers info (https://gitlab.haskell.org/ghc/ghc/wikis/contributing).