The beginnings of mutually-recursive support. #28
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This gives us multi-sorted recursion-schemes. It involves adding a bunch of “higher-order” type classes, etc., which parallel the ones we already use. Right now the implementation is pretty minimal – cata/ana, cataM/anaM are available. These _should_ generalize the same way as the mono-sorted recursion schemes (para, apo, futu, etc.), but there’s just more stuff to add before that’s available. There are a couple minimal tests that show that it does _something_, that apparently gets the right answer.
|
Blocked by scala/scala#5744 for Scala 2.12 (and scala/scala#5749 for Scala 2.11). |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This gives us multi-sorted recursion-schemes.
It involves adding a bunch of “higher-order” type classes, etc., which
parallel the ones we already use.
Right now the implementation is pretty minimal – cata/ana, cataM/anaM
are available. These should generalize the same way as the mono-sorted
recursion schemes (para, apo, futu, etc.), but there’s just more stuff
to add before that’s available.
There are a couple minimal tests that show that it does something,
that apparently gets the right answer.