Explictly define partial order for lattices#48
Merged
Conversation
agle
approved these changes
Feb 18, 2026
Owner
agle
left a comment
agle
left a comment
There was a problem hiding this comment.
You'll have to push an empty commit or similar to get CI to re-run on the new main branch to be able to merge this I think.
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.
Replaces #46.
Every lattice now has a function$s \subseteq t$ to describe the partial order. We use this for the value soundness check instead of join.
leq : t -> t -> boolwhich returns true iff