AFTD Auto-Formalizing Theoretical Domains

Cslib.SKI.size

defimported Lean

The size of an SKI term is its number of combinators.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
def Cslib.SKI.size : SKI → Nat
Defined in
CSLib, `Cslib.SKI.size`
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
Built on 1
  • Cslib.SKIAn SKI expression is built from the primitive combinators S, K and I, and application.

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
/-- The size of an SKI term is its number of combinators. -/
def Cslib.SKI.size : SKI → Nat
  | S => 1
  | K => 1
  | I => 1
  | x ⬝ y => size x + size y
See it in the graphDiscuss this resultChallenge it