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
Structured graphs #7
Merged
Merged
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
Well, it works. Now to clean it up I guess. |
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 PR adds structured graphs, as described in Functional Programming with Structured Graphs by Bruno C. d. S. Oliveira & William R. Cook.
Note that the implementation herein is additionally implemented over higher-order functors (of kind
(* -> *) -> * -> *
) rather than the paper’s standard functors (of kind* -> *
).The goal is to replace our use of
hcata
andHFix
withHGraph
and its various folds, making computation of recursive properties more tractable.This will presumably also necessitate new API for introducing recursive parsers within the PHOAS context of the
HGraph
.mu
.deriv
over structured graph parsers.HFix
parser stuff to structured graph parsers.Data.Higher.Fix
.Data.Memo
.parseNull
call inderiv
is unsound.Parser a
wrappingforall v. Combinator v a
.