|about 2 months ago||about 7 years ago|
|BSD 2-clause "Simplified" License||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.
Is there a way to avoid call overhead?
5 projects | reddit.com/r/rust | 10 Sep 2022
Maybe I didn't link the best post. It is unfortunately the only one I know that uses Rust. If you are able to read Haskell, the documentation for the recursion-schemes package might be a better resource?
So you come across an undocumented library…
2 projects | reddit.com/r/haskell | 16 Nov 2021
But wait, there's more! One of the two challenges was the recursion-schemes library. I wrote some examples, but the output I was getting from that example was not what I expected. I dug further, and it turned out to be a bug in the library! In addition to the documentation, I thus also worked on a fix for that bug.2 projects | reddit.com/r/haskell | 16 Nov 2021
It's a pretty complicated bug, documented in details at https://github.com/recursion-schemes/recursion-schemes/issues/50
Beautiful ideas in programming: generators and continuations
2 projects | news.ycombinator.com | 3 Aug 2021
It’s also trivial and easy in Haskell — you just need an instance of `Foldable` or `Traversable` on your collection, and then you can fold or traverse it in a configurable way. Or for recursive structures, use https://hackage.haskell.org/package/recursion-schemes. Or even just pass a traversal function as an argument for maximum flexibility.
Seeking a Project Lead for Matchmaker - Haskell Foundation
3 projects | reddit.com/r/haskell | 26 Jul 2021
Yes please! Right now all of my open-source projects (most notably hint and recursion-schemes) are about to drop into barely-updated mode, and while I knew this would happen and have been working towards finding co-maintainers, I am now realizing that it wasn't enough. I think such a website would definitely have helped, and I am hoping that once it launches, I'll be able to use it to find some co-maintainers to tide over my projects until I become available again.
Question about composing functors, functor products, comonads and recursion schemes
2 projects | reddit.com/r/haskell | 1 Apr 2021
I wouldn't bother with gfold, it's broken and rarely used. I'd start from a simpler implementation of zygo:
We haven't tracked posts mentioning distributed-process-platform yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
either - the EitherT monad transformer
assert-failure - syntactic sugar that improves the usability of 'assert' and 'error' in Haskell
chr-core - Constraint Handling Rules
distributed-process-registry - Extended Process Registry
unliftio - The MonadUnliftIO typeclass for unlifting monads to IO
machines - Networks of composable stream transducers
pipes-core - Compositional pipelines
conduit-combinators - Type classes for mapping, folding, and traversing monomorphic containers
record - Anonymous records
effect-monad - Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.