Cslib.SKI.Polynomial.varFreeToSKI
defimported Lean
A polynomial with no free variables is a term
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relation in def Cslib.SKI.Polynomial.varFreeToSKI (Γ : SKI.Polynomial 0) : SKI
- Defined in
- CSLib, `Cslib.SKI.Polynomial.varFreeToSKI`
- 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.varFreeToSKI← Cslib.SKI.Polynomial.varFreeToSKI (Cslib/Languages/CombinatoryLogic/Basic.lean:68): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- Cslib.SKI.Polynomial.evalSubstitute terms for the free variables of a polynomial
- 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
- Used by 1
- Cslib.SKI.Polynomial.toSKIBracket abstraction, by induction using
SKI.Polynomial.elimVar
- Cslib.SKI.Polynomial.toSKIBracket abstraction, by induction using
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relation in /-- A polynomial with no free variables is a term -/ def Cslib.SKI.Polynomial.varFreeToSKI (Γ : SKI.Polynomial 0) : SKI := Γ.eval [] (by trivial)