matchmaker
recursion-schemes
Our great sponsors
| matchmaker | recursion-schemes | |
|---|---|---|
| 1 | 18 | |
| 77 | 316 | |
| - | 0.3% | |
| 0.0 | 0.0 | |
| over 1 year ago | 17 days ago | |
| Haskell | Haskell | |
| GNU General Public License v3.0 or later | BSD 2-clause "Simplified" 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.
matchmaker
-
Seeking a Project Lead for Matchmaker - Haskell Foundation
Matchmaker is a project of the Haskell Foundation to help open-source maintainers and contributors find each other, and provide a smoother experience for people wishing to invest themselves in the open-source Haskell ecosystem.
recursion-schemes
-
Is there a way to avoid call overhead?
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…
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.
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
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
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
I wouldn't bother with gfold, it's broken and rarely used. I'd start from a simpler implementation of zygo:
What are some alternatives?
record - Anonymous records
distributed-process-platform - DEPRECATED (Cloud Haskell Platform) in favor of distributed-process-extras, distributed-process-async, distributed-process-client-server, distributed-process-registry, distributed-process-supervisor, distributed-process-task and distributed-process-execution
unliftio - The MonadUnliftIO typeclass for unlifting monads to IO
machines - Networks of composable stream transducers
chr-core - Constraint Handling Rules
conduit-combinators - Type classes for mapping, folding, and traversing monomorphic containers
pipes-core - Compositional pipelines
freer-simple - A friendly effect system for Haskell
effect-monad - Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.
rank2classes - Grammatical parsers - combinator library for parsing general context-free grammars
time-warp
errors - Type-safe error handling