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

Fix verification failure and add archive of raw source files #35

Closed
wants to merge 1 commit into from
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file not shown.
4 changes: 2 additions & 2 deletions assets/src/semantics-of-regular-expressions/Languages.dfy
Original file line number Diff line number Diff line change
Expand Up @@ -139,7 +139,7 @@ module Languages5WithProof refines Languages5 {
}
}

lemma PlusCongruenceAlternative<A>(k: nat, L1a: Lang, L1b: Lang, L2a: Lang, L2b: Lang)
lemma PlusCongruenceAlternative<A(!new)>(k: nat, L1a: Lang, L1b: Lang, L2a: Lang, L2b: Lang)
requires Bisimilar#[k](L1a, L1b)
requires Bisimilar#[k](L2a, L2b)
ensures Bisimilar#[k](Plus(L1a, L2a), Plus(L1b, L2b))
Expand Down Expand Up @@ -182,7 +182,7 @@ module Languages6 {
import opened Languages4
import opened Languages5WithProof

greatest lemma BisimilarityIsTransitive<A>[nat](L1: Lang, L2: Lang, L3: Lang)
greatest lemma BisimilarityIsTransitive<A(!new)>[nat](L1: Lang, L2: Lang, L3: Lang)
requires Bisimilar(L1, L2) && Bisimilar(L2, L3)
ensures Bisimilar(L1, L3)
{}
Expand Down
Loading