AFTD Auto-Formalizing Theoretical Domains

Cslib.SKI

inductiveimported Lean

An SKI expression is built from the primitive combinators S, K and I, and application.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
inductive Cslib.SKI
Defined in
CSLib, `Cslib.SKI`
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.
Verified
08 Oct 2026
Axioms
none listed
Used by 16

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- An SKI expression is built from the primitive combinators `S`, `K` and `I`, and application. -/
inductive Cslib.SKI where
  /-- `S`-combinator, with semantics $λxyz.xz(yz)$ -/
  | S
  /-- `K`-combinator, with semantics $λxy.x$ -/
  | K
  /-- `I`-combinator, with semantics $λx.x$ -/
  | I
  /-- Application $x y ↦ xy$ -/
  | app : SKI → SKI → SKI
deriving Repr, DecidableEq
See it in the graphDiscuss this resultChallenge it