AFTD Auto-Formalizing Theoretical Domains

scheduleCost

def

The total fetch cost of a cache schedule up to time T, defined as the sum over time steps of the number of newly fetched pages.

Statement

def scheduleCost {α : Type*} [DecidableEq α] (sched : ℕ → Finset α) (T : ℕ) : ℕ
Defined in
arXiv:2610.18767 Sec. 2
Verified
18 Oct 2026
Axioms
none listed
Used by 6

Read back from the Lean

Given a type α with decidable equality, a schedule sched : ℕ → Finset α, and a time bound T : ℕ, scheduleCost sched T is defined as the sum over t ∈ Finset.range T (i.e., t from 0 to T - 1) of the cardinality of the set difference (sched (t + 1)) \ (sched t).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The total fetch cost of a cache schedule up to time T. -/
def scheduleCost {α : Type*} [DecidableEq α] (sched : ℕ → Finset α) (T : ℕ) : ℕ :=
  ∑ t ∈ Finset.range T, ((sched (t + 1)) \ (sched t)).card
See it in the graphDiscuss this resultChallenge it