-
# Topics in Haskell beyond LYAH
## Type theory related
1. ~~`Functor-Applicative-Monad` typeclass hierarchy (covered in LYAH)~~
1. ~~`State` monad (covered in LYAH)~~
1. ~~General` Zip…
-
Part of the [Merge yaya into recursion-schemes?](https://github.com/ekmett/recursion-schemes/issues/76) thread. Here are the comments from that thread which pertain to the topic.
In the [yaya docum…
-
Does unbound semantics allow to create the shape functor for the AST?
It would help a lot to implement the AST transformations using recursion schemes.
I.e. in this short [closure conversion tutoria…
-
it isn't a standard recursion-scheme with a fancy Latin name (there's on named "dyna" but I think it means something else), but it is definitely a common pattern when writing recursive functions, so I…
-
E.g.
``` haskell
foldCofree :: Functor f => (a -> f b -> b) -> Cofree f a -> b
foldCofree f = go where
go (x :< ts) = f x (fmap go ts)
```
-
```
File "/usr/lib/python3.10/_distutils_system_mod.py", line 137, in wrapped_load_schemes
_inject_headers(name, scheme)
File "/usr/lib/python3.10/_distutils_system_mod.py", line …
-
Part of the [Merge yaya into recursion-schemes?](https://github.com/ekmett/recursion-schemes/issues/76) thread. Here are the comments from that thread which pertain to the topic.
In the [yaya docum…
-
[See here][1] the definition of the base functor for `Cofree`.
type instance Base (CofreeT f w a) = Compose w (CofreeF f a)
Here are the relevant import lines:
import qualified Contro…
-
Walk is a bit of a mess. It seems we should be able to do something more elegant, using recursion schemes or something.
For motivation see jgm/pandoc#7130.
Here we have `walk fixLinks` where `fixL…
-
While it may look like I haven't been doing anything with the project since I took over its maintainership, I have in fact been collaborating (the discussion is not available online, sorry) on fixing …