Add mutually recursive types to Lambda #333
Draft
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
added 6 commits
January 16, 2026 11:58
Generate eliminators for mutual recursive types Change Boogie TypeDecl to take in List Leave ProgramWF proofs as sorry for now Change strict positivity+uniformity checks for mutually recursive types
Also includes tests
Remove topological ordering, require TypeContext for order Adds tests for mutually recursive SMT encoding and for Boogie verif
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Description of changes:
Adds mutually recursive types to Lambda and its corresponding SMT generation (
declare-datatypes). In particular, mutually recursive types generate multiple eliminators, which still have the expected computational behavior. This PR includes tests inTypeFactoryTests.leanfor eliminators, other derived functions, and typechecking and inSMTEncoderDatatypeTest.leanandDatatypeVerificationTest.leanfor SMT output and verification.Some key changes:
Right now, the proofs in
ProgramWF.leanare broken; they will be fixed.By submitting this pull request, I confirm that you can use, modify, copy, and redistribute this contribution, under the terms of your choice.