Cslib.SKI.Zero
defimported Lean
Church zero := λ f x. x
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in protected def Cslib.SKI.Zero : SKI
- Defined in
- CSLib, `Cslib.SKI.Zero`
- Lean proof
- By Thomas Waring, Jesse Alama, 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.Zero← Cslib.SKI.Zero (Cslib/Languages/CombinatoryLogic/Recursion.lean:101): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- Cslib.SKI.Church_succCslib.SKI.Church_succ
- Cslib.SKI.Church_zeroCslib.SKI.Church_zero
- 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
open Cslib.SKI @[inherit_doc] local infixl:100 " ⬝ " => app set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- Church zero := λ f x. x -/ protected def Cslib.SKI.Zero : SKI := K ⬝ I