perf: simplifier performance issues on match and if-then-else terms#3118
Closed
leodemoura wants to merge 6 commits intomasterfrom
Closed
perf: simplifier performance issues on match and if-then-else terms#3118leodemoura wants to merge 6 commits intomasterfrom
match and if-then-else terms#3118leodemoura wants to merge 6 commits intomasterfrom
Conversation
The new test exposes a performance problem found in software verification applications.
See new test for example that takes exponential time without new simp theorems. TODO: replace auxiliary theorems with simprocs as soon as we implement them.
match and if-then-else termsmatch and if-then-else terms
match and if-then-else termsmatch and if-then-else terms
Member
Author
|
!bench |
Collaborator
|
Here are the benchmark results for commit 6110405. |
|
The example was looping with the new `simp` reduction strategy. Here is the looping trace. ``` List.reverseAux (List.reverseAux as []) bs ==> rewrite using reverseAux_reverseAux List.reverseAux [] (List.reverseAux (List.reverseAux as []) bs) ==> unfold reverseAux List.reverseAux (List.reverseAux as []) bs ==> rewrite using reverseAux_reverseAux List.reverseAux [] (List.reverseAux (List.reverseAux as []) bs) ==> ... ```
leodemoura
added a commit
to leanprover-community/batteries
that referenced
this pull request
Dec 27, 2023
Using `simp [forIn]` may cause nontermination with different `simp` reduction strategies. We have the following theorem ``` @[simp] theorem forIn_eq_forIn [Monad m] : @List.forIn α β m _ = forIn := rfl ``` Then, executing `simp [forIn]` in a term containing `forIn` iterating over a `List` may cause nontermination since the theorem above will fold it again. Remark: the reduction strategy implemented leanprover/lean4#3118 triggers nontermination.
Member
Author
|
!bench |
Collaborator
|
Here are the benchmark results for commit 308942c. |
joehendrix
pushed a commit
to leanprover-community/batteries
that referenced
this pull request
Dec 28, 2023
Using `simp [forIn]` may cause nontermination with different `simp` reduction strategies. We have the following theorem ``` @[simp] theorem forIn_eq_forIn [Monad m] : @List.forIn α β m _ = forIn := rfl ``` Then, executing `simp [forIn]` in a term containing `forIn` iterating over a `List` may cause nontermination since the theorem above will fold it again. Remark: the reduction strategy implemented leanprover/lean4#3118 triggers nontermination. Co-authored-by: Joe Hendrix <joe@lean-fro.org>
Member
Author
|
Subsumed by #3124 |
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.
No description provided.