Skip to content

feat(CombinatoryLogic): Partrec → SKI computability #403

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
jessealama wants to merge 3 commits into
base: main
Choose a base branch
from
+540 −1
Open

feat(CombinatoryLogic): Partrec → SKI computability #403

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
c31c74d
feat(CombinatoryLogic): Partrec → SKI computability
jessealama Mar 6, 2026
4e5cc61
refactor(CombinatoryLogic): simplify Computes using isChurch_trans
jessealama Mar 7, 2026
88b9608
style(PartrecEquivalence): add blank lines after defs and clarify doc…
jessealama Mar 7, 2026
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: 1 addition & 0 deletions Cslib.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -76,6 +76,7 @@ public import Cslib.Languages.CombinatoryLogic.Confluence
public import Cslib.Languages.CombinatoryLogic.Defs
public import Cslib.Languages.CombinatoryLogic.Evaluation
public import Cslib.Languages.CombinatoryLogic.List
public import Cslib.Languages.CombinatoryLogic.PartrecEquivalence
public import Cslib.Languages.CombinatoryLogic.Recursion
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Context
public import Cslib.Languages.LambdaCalculus.LocallyNameless.Fsub.Basic
Expand Down
1 change: 1 addition & 0 deletions Cslib/Languages/CombinatoryLogic/Basic.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -288,6 +288,7 @@ theorem cond_correct (a x y : SKI) (u : Bool) (h : IsBool u a) :

/-- Neg := λ a. Cond FF TT a -/
protected def Neg : SKI := SKI.Cond ⬝ FF ⬝ TT
@[scoped grind →]
theorem neg_correct (a : SKI) (ua : Bool) (h : IsBool ua a) : IsBool (¬ ua) (SKI.Neg ⬝ a) := by
apply isBool_trans (a' := if ua then FF else TT)
· apply cond_correct (h := h)
Expand Down
1 change: 1 addition & 0 deletions Cslib/Languages/CombinatoryLogic/List.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -74,6 +74,7 @@ theorem nil_def (c n : SKI) : (Nil ⬝ c ⬝ n) ↠ n :=
NilPoly.toSKI_correct [c, n] (by simp)

/-- The empty list term correctly represents `[]`. -/
@[scoped grind .]
theorem nil_correct : IsChurchList [] Nil := nil_def

/-! ### Cons: Consing an element onto a list -/
Expand Down
Loading