Compiler: MiniLog becomes co-inductive #75
Merged
Conversation
This file contains hidden or 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 was referenced Mar 21, 2023
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.
DONE
fail because of the cycle.
Talking to @Saizan and @Anniepoo made me realize that we actually want
p :- pto be true, which after digging a bit more seems like it's a form of logic called co-inductive logic.Intuitively, I adjusted the resolution procedure to find ancestor goals that 'unify' with the current one, and if one was found, just return the shared bindings after 'ancestor' unified with 'current'. This seems to match the operational semantics of co-inductive goal resolution.
Not entirely sure what the implications of this whole thing is, tried thinkering with it and provide some tests, so far it seems to behave exactly as one would expect from a type class system.
References: