Skip to content
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

coinductive version of always #113

Merged
merged 2 commits into from
Apr 2, 2024

Conversation

andres-erbsen
Copy link
Contributor

@andres-erbsen andres-erbsen commented Apr 2, 2024

please fast-forward for mit-plv/fiat-crypto#1846

@andres-erbsen andres-erbsen merged commit 88b1403 into mit-plv:master Apr 2, 2024
2 checks passed
@@ -50,4 +50,14 @@ Section Combinators.
(Preserve: forall s, invariant s -> step s invariant)
(Use: forall s, invariant s -> P s).

CoInductive always' (P : State -> Prop) (s : State) : Prop :=
always'_step { hd_always' : P s; tl_always' : step s (always P) }.
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

In the recursive invocation in tl_always', you use the Inductive always, not the CoInductive, is this intended? (simply replacing always by always' doesn't work because non-strictly positive occurrence). If it is intended, could you add introduction and elimination rules that pretend the Inductive doesn't exist, and express everything in terms of the CoInductive?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Yes I intended an independent definition; trying again.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants