recursion-schemes
rio-orphans
Our great sponsors
recursion-schemes | rio-orphans | |
---|---|---|
20 | 6 | |
335 | 836 | |
0.6% | 1.0% | |
4.9 | 0.0 | |
11 days ago | about 1 year ago | |
Haskell | Haskell | |
BSD 2-clause "Simplified" License | MIT 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.
recursion-schemes
-
-❄️- 2023 Day 4 Solutions -❄️-
Reasonably proud of my part 2 solution, although would like to try using a recursion scheme rather than unstructured recursion:
-
Interactive animations
Yeah, that project is pretty much at the bottom of my list, unfortunately. My top projects these days are mgmt, klister, recursion-schemes, and hint... And that's already too much!
-
Science of Recursion
In a programming context, recursion schemes can be used to write recursive (or corecursive) functions, by automating/abstracting away the common boilerplate part of actually doing the recursion. They take the form of polymorphic higher-order functions, which can be imported from a library like this classic one.
-
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?
-
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…
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
rio-orphans
-
Haskell IHP Framework, from a Technical and Business Perspective
https://github.com/commercialhaskell/rio#language-extensions which is cited as an example in simplehaskell's page on recommendations.
- [ANN] text-display 0.0.1.0: A typeclass for user-facing output
-
Haskell: The Bad Parts, part 2 (2020)
> Can we move to a better standard lib? Here Snoyman has put forward a great effort by releasing his classy-prelude, but iirc he also stopped using it.
He mentioned https://github.com/commercialhaskell/rio in the 1st article, it's interesting, I wasn't aware of it. (I am using classy-prelude but I might try it out.)
-
Are similar effects system like in Scalas ex: Cats Effects, ZIO etc also available in Haskell?
rio
-
Why exactly I want Boring Haskell to happen
It's worth mentioning that Snoyman's "Boring Haskell" is actually a fairly moderate position: if you look at his suggested list of language extensions, it's pretty broad (and fairly reasonable in my view).
-
Haskell The Bad Parts Part 1
via ByteString was recommended by Snoyman in the post Beware of readFile (referenced in the Haskell: The Bad Parts, part 1 too). But this has got a disadvantage compared to Data.Text.IO combined with hSetEncoding. This might be a good time to update Beware of readFile, u/snoyberg.
What are some alternatives?
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
basic-prelude - An enhanced core prelude, meant for building up more complete preludes on top of.
record - Anonymous records
time-warp
unliftio - The MonadUnliftIO typeclass for unlifting monads to IO
ghc-proposals - Proposed compiler and language changes for GHC and GHC/Haskell
machines - Networks of composable stream transducers
bytestring-progress - A Haskell library for tracking the consumption of lazy ByteStrings
chr-core - Constraint Handling Rules
cond - Basic conditional operators with monadic variants.
pipes-core - Compositional pipelines
ifcxt - constraint level if statements