Stronger invariants in recursive tree computation in Indtypes#21593
Open
ppedrot wants to merge 4 commits intorocq-prover:masterfrom
Open
Stronger invariants in recursive tree computation in Indtypes#21593ppedrot wants to merge 4 commits intorocq-prover:masterfrom
ppedrot wants to merge 4 commits intorocq-prover:masterfrom
Conversation
We know statically that the rel context and the rtree context are synchronized. In particular they must have the same size.
The only reason we care about the value of the recarg_type is to check whether we are looking at the inductive being defined or some other nesting inductive type. We replace this by a proper ADT.
ppedrot
added
kind: cleanup
coqbot-app
bot
removed
the
request: full CI
yannl35133
approved these changes
Feb 5, 2026
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
We use a mix of dedicated ADTs and assertions to make explicit some hidden invariants in the computation of inductive positivity and recursive tree representation.