varying
Continuously varying values, made easy :) (by schell)
recursion-schemes
Generalized bananas, lenses and barbed wire (by ekmett)
Our great sponsors
| varying | recursion-schemes | |
|---|---|---|
| 0 | 16 | |
| 36 | 307 | |
| - | 2.3% | |
| 0.0 | 3.9 | |
| almost 3 years ago | about 1 month ago | |
| Haskell | Haskell | |
| MIT License | BSD 2-clause "Simplified" 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.
varying
Posts with mentions or reviews of varying.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning varying yet.
Tracking mentions began in Dec 2020.
recursion-schemes
Posts with mentions or reviews of recursion-schemes.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-16.
-
Ah yes I love arrays with a length of infinity!!!
Writing something as a type of fold over an infinite sequence is nicer than using recursion directly in my opinion. See: https://hackage.haskell.org/package/recursion-schemes
-
Tips on mastering recursion and trees and shit?
Consider recursion schemes! It let's you separate the logic of how your recursion is structured on your data, and the logic of what you're doing on each recursion stage. So e.g. you can write the core logic of a recursive linked list summation as just fun x accum -> x + accum, and then you just find the appropriate recursion scheme to pipe the list values into x and handle recursing to build accum (a catamorphism in this case)
-
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.
-
fromMaybe is Just a fold
https://hackage.haskell.org/package/recursion-schemes is the "normal" library for this type of generalized folding. It even contains Base instances for Maybe and Either.
-
Annotation via anamorphism?
I've been working on a system which uses recursion-schemes to annotate a recursive type. The annotated tree itself is pretty simple; at each level, we pair the annotation with the base functor, or
-
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.
-
Annotate AST with location information
A short (?) primer before you dive into recursion-schemes:
-
Anamorphisms aka Unfolds Explained | Functional Works
And here is the branch containing my implementation.
What are some alternatives?
When comparing varying and recursion-schemes you can also consider the following projects:
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
conduit-combinators - Type classes for mapping, folding, and traversing monomorphic containers
pipes-core - Compositional pipelines
chr-core - Constraint Handling Rules
rank2classes - Grammar parser - combinator library for parsing a general context-free grammar
machines - Networks of composable stream transducers
record - Anonymous records
funflow - Functional workflows
cr
cond - Basic conditional operators with monadic variants.
fused-effects - A fast, flexible, fused effect system for Haskell