Cslib.SKI.CoeTermPolynomial
instanceimported Lean
Cslib.SKI.CoeTermPolynomial
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relation in instance Cslib.SKI.CoeTermPolynomial (n : Nat) : Coe SKI (SKI.Polynomial n)
- Defined in
- CSLib, `Cslib.SKI.CoeTermPolynomial`
- 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.CoeTermPolynomial← Cslib.SKI.CoeTermPolynomial (Cslib/Languages/CombinatoryLogic/Basic.lean:57): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- 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.
- Used by 11
- Cslib.SKI.Church_succCslib.SKI.Church_succ
- Cslib.SKI.ChurchFunction form of the church numerals.
- Cslib.SKI.OneChurch one := λ f x. f x
- Cslib.SKI.FFStandard false: FF := λ x y. y
- Cslib.SKI.TTStandard true: TT := λ x y. x
- Cslib.SKI.Polynomial.varFreeToSKIA polynomial with no free variables is a term
- Cslib.SKI.Polynomial.toSKIBracket abstraction, by induction using
SKI.Polynomial.elimVar - Cslib.SKI.Polynomial.evalSubstitute terms for the free variables of a polynomial
- 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.ZeroChurch zero := λ f x. x
- Cslib.SKI.Church_zeroCslib.SKI.Church_zero
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relation in instance Cslib.SKI.CoeTermPolynomial (n : Nat) : Coe SKI (SKI.Polynomial n) := ⟨SKI.Polynomial.term⟩