Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Overhaul of recursion schemes #391

Open
gallais opened this issue Jul 19, 2018 · 3 comments
Open

Overhaul of recursion schemes #391

gallais opened this issue Jul 19, 2018 · 3 comments

Comments

@gallais
Copy link
Member

gallais commented Jul 19, 2018

A follow-up of sorts of #278:

Add other recursion schemes. For inspiration, look at: https://hackage.haskell.org/package/recursion-schemes-5.0.3/docs/Data-Functor-Foldable.html

@clayrat
Copy link

clayrat commented Jul 19, 2018

If I may ask here, are there any techniques on working with refolds, like hylo, in total setting? Refolds look inherently partial to me, as they mix data with codata.

@gallais
Copy link
Member Author

gallais commented Jul 20, 2018

I don't know! I haven't tagged this "low hanging fruit" precisely because there's all
of these questions about totality.

@clayrat
Copy link

clayrat commented Jul 25, 2018

Found this, not sure if it's relevant.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants