Cslib.SKI.Polynomial
inductiveimported Lean
A polynomial is an SKI terms with free variables.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relation in protected inductive Cslib.SKI.Polynomial (n : Nat) : Type
- Defined in
- CSLib, `Cslib.SKI.Polynomial`
- 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← Cslib.SKI.Polynomial (Cslib/Languages/CombinatoryLogic/Basic.lean:46): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- Cslib.SKIAn SKI expression is built from the primitive combinators
S,KandI, and application.
- Cslib.SKIAn SKI expression is built from the primitive combinators
- Used by 5
- 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.CoeTermPolynomialCslib.SKI.CoeTermPolynomial
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relation in /-- A polynomial is an SKI terms with free variables. -/ protected inductive Cslib.SKI.Polynomial (n : Nat) : Type where | term : SKI → SKI.Polynomial n | var : Fin n → SKI.Polynomial n | app : SKI.Polynomial n → SKI.Polynomial n → SKI.Polynomial n