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.

Sign up for GitHub

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

Jump to bottom

Mutual recursion lemma #84

Closed

rolyp opened this issue Mar 31, 2021 · 0 comments

Assignees

Labels

Collaborator

rolyp commented Mar 31, 2021 •

edited

Loading

Prove that the fwd/bwd definitions for closeDefs form a GC.

The text was updated successfully, but these errors were encountered:

rolyp added the what:proof label

rolyp mentioned this issue

Eval/uneval Galois connection #10

Closed

20 tasks

rolyp changed the title ~~Mutual recursion Galois connection~~ Mutual recursion lemma

rolyp assigned min-nguyen

rolyp closed this as completed

rolyp mentioned this issue

Closed

7 tasks

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