Skip to content

chore: weekly linting for 2026-02-02 #312

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.

Sign up for GitHub

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

Open
chenson2018 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

chore: weekly linting for 2026-02-02 #312

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
1 change: 0 additions & 1 deletion Cslib/Computability/Languages/OmegaLanguage.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -322,7 +322,6 @@ theorem omegaPow_coind' [Inhabited α] (h_nn : [] ∉ l) (h_le : p ≤ l * p) :
intro s h_s
have h_nxt m (hm : s.drop m ∈ p) : ∃ n > m, s.extract m n ∈ l ∧ s.drop n ∈ p := by
obtain ⟨k, _⟩ := hmul_seq_prop ▸ h_le hm
use m + k
grind [extract_eq_drop_take]
choose nxt_n nxt_p using h_nxt
let f := iter_helper (fun n ↦ s.drop n ∈ p) nxt_n
Expand Down
1 change: 0 additions & 1 deletion Cslib/Foundations/Semantics/LTS/Basic.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -417,7 +417,6 @@ theorem LTS.Total.mTr_ωTr [Inhabited Label] [ht : lts.Total] {μl : List Label}
(hm : lts.MTr s μl t) : ∃ μs ss, lts.ωTr ss (μl ++ω μs) ∧ ss 0 = s ∧ ss μl.length = t := by
let μs : ωSequence Label := .const default
obtain ⟨ss', ho, h0⟩ := LTS.Total.ωTr_exists (h := ht) t μs
use μs
grind [LTS.ωTr.append hm ho h0]

/-- `LTS.totalize` constructs a total LTS from any given LTS by adding a sink state. -/
Expand Down
1 change: 0 additions & 1 deletion Cslib/Languages/LambdaCalculus/LocallyNameless/Untyped/FullBetaConfluence.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -92,7 +92,6 @@ lemma para_to_redex (para : M ⭢ₚ N) : M ↠βᶠ N := by
case fvar => constructor
case app L L' R R' l_para m_para redex_l redex_m =>
have : L.app R ↠βᶠ L'.app R := by grind
have : L'.app R ↠βᶠ L'.app R' := by grind
grind [ReductionSystem.MRed.trans]
case abs t t' xs _ ih =>
apply redex_abs_cong xs
Expand Down