Cslib.SKI.Polynomial.toSKI
defimported Lean
Bracket abstraction, by induction using SKI.Polynomial.elimVar
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relation in def Cslib.SKI.Polynomial.toSKI {n : Nat} (Γ : SKI.Polynomial n) : SKI
- Defined in
- CSLib, `Cslib.SKI.Polynomial.toSKI`
- Lean proof
- By Thomas Waring, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Thomas Waring. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.SKI.Polynomial.toSKI← Cslib.SKI.Polynomial.toSKI (Cslib/Languages/CombinatoryLogic/Basic.lean:121): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- Cslib.SKI.Polynomial.varFreeToSKIA polynomial with no free variables is a term
- Cslib.SKI.Polynomial.elimVarInductively define a polynomial
Γ'so that (up to the fact that we haven't defined reduction on polynomials)Γ' ⬝ t ↠ Γ[xₙ ← t]. - Cslib.SKI.PolynomialA polynomial is an SKI terms with free variables.
- Cslib.SKIAn SKI expression is built from the primitive combinators
S,KandI, and application. - Cslib.SKI.CoeTermPolynomialCslib.SKI.CoeTermPolynomial
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relation in /-- Bracket abstraction, by induction using `SKI.Polynomial.elimVar` -/ def Cslib.SKI.Polynomial.toSKI {n : Nat} (Γ : SKI.Polynomial n) : SKI := match n with | 0 => Γ.varFreeToSKI | _ + 1 => Γ.elimVar.toSKI