-
Notifications
You must be signed in to change notification settings - Fork 2
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
working on the logrel for soundness proof #86
Conversation
The logical relations for soundness is somewhat cumbersome. In Agda code, they are defined by recursion on the PER model, which obviously is not possible in our case. I think it might just be easier to copy the PER model and extends it. Then we prove two lemmas: one says that a PER model necessarily gives a gluing model, and the other one says that a gluing model can be degenerated to a PER model. Hopefully, this is enough to recover the recursive definitions in Agda. I am not sure how repetitive the lemmas will be. I hope not by a lot after prove these two lemmas. |
It's ready for review. Let's prove properties in another PR. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM
No description provided.