Cslib.SKI.Polynomial.eval
defimported Lean
Substitute terms for the free variables of a polynomial
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relation in def Cslib.SKI.Polynomial.eval {n : Nat} (Γ : SKI.Polynomial n) (l : List SKI) (hl : List.length l = n) : SKI
- Defined in
- CSLib, `Cslib.SKI.Polynomial.eval`
- 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.eval← Cslib.SKI.Polynomial.eval (Cslib/Languages/CombinatoryLogic/Basic.lean:60): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- Cslib.SKIAn SKI expression is built from the primitive combinators
S,KandI, and application. - Cslib.SKI.PolynomialA polynomial is an SKI terms with free variables.
- Cslib.SKI.CoeTermPolynomialCslib.SKI.CoeTermPolynomial
- Cslib.SKIAn SKI expression is built from the primitive combinators
- Used by 14
- qutrit_source_two_cubics_no_common_planeTwo explicit cubic maximal minors of the source vectors cannot both vanish on a complex two-dimensional plane.
- ppt_qutrit_source_full_rank_for_independent_columnsThe contracted four-vector qutrit source has full row rank somewhere on every plane spanned by two independent complex vectors.
- op_1693_noon_witness_loss_monotonicity_oneFor N = 1 and any balance parameter q in the open interval (0, 1) and transmissivities x, y in the open interval (0, 1), if…
- ppt_qutrit_bell_source_full_rank_on_every_planeThe contraction of the four source vectors has full qutrit row rank for some vector in each complex two-plane.
- hilton_strong_incomparability_matrixFor every natural number n there are a field K, a matrix L over K with rows indexed by the subsets of Fin n and 2^(n-1) columns, and a…
- op75_tm2_inhabited_compPolynomial-time finite stack machines compose whenever their intermediate alphabet is inhabited; the input and output alphabets are…
- Cslib.SKI.Polynomial.varFreeToSKIA polynomial with no free variables is a term
- op75_tm2_bool_compPolynomial-time finite stack machines compose when their intermediate alphabet is Boolean, for arbitrary input and output alphabets.
- Cslib.Turing.SingleTapeTM.PolyTimeComputableA Turing machine + a polynomial time function + a proof it outputs
fin at mosttime(input.length)steps. - op75_tm2_empty_compPolynomial-time finite stack machines compose when their intermediate alphabet is empty, for arbitrary input and output alphabets.
- quantitative_combinatorial_nullstellensatzFor a multivariate polynomial f of total degree at most ∑ t_i over a field F, the coefficient of the monomial ∏ x_i^{t_i} equals the sum…
- op_928_digit_exchange_differential_uniformity_le_thirty_sixFor every integer m ≥ 1 and every element c in GaloisField 2 m with absolute trace Algebra.trace (ZMod 2) (GaloisField 2 m) c = 1, the…
- is_intersective_exists_posIf h ∈ ℤ[X] is intersective and m is a positive integer, there exists a positive integer n > 0 such that h(n) ≡ 0 (mod m).
- ppt_qutrit_source_projection_basis_from_isometry_factorEach rank-two qutrit projection has a plane basis whose first normalized-source contraction has full row rank, conditional only on…
Lean source view module on GitHub
open Cslib.SKI @[inherit_doc] local infixl:100 " ⬝ " => app set_option autoImplicit true in set_option relaxedAutoImplicit true in open Relation in /-- Substitute terms for the free variables of a polynomial -/ def Cslib.SKI.Polynomial.eval {n : Nat} (Γ : SKI.Polynomial n) (l : List SKI) (hl : List.length l = n) : SKI := match Γ with | .term x => x | .var i => l[i] | .app Γ Δ => (Γ.eval l hl) ⬝ (Δ.eval l hl)