AFTD Auto-Formalizing Theoretical Domains

uniform_kserver_det_schedule

def

Given types α and β, a mapping A : List α → β, and an input list ρ : List α, uniform_kserver_det_schedule A ρ is the list of elements of β of length ρ.length whose t-th element (for 0 ≤ t < ρ.length) is A (ρ.take (t + 1)).

Statement

def uniform_kserver_det_schedule {α β : Type*}
    (A : List α → β) (ρ : List α) : List β
Defined in
arXiv:2610.37192 Sec. 6
Verified
30 Oct 2026
Axioms
none listed
Used by 3
  • uniform_kserver_det_schedule_is_scheduleFor a natural number k, a family of types M indexed by Fin k, an algorithm A : List (∀ i, M i) → (∀ i, M i) satisfying…
  • uniform_kserver_det_costFor a natural number k, a family of types M indexed by Fin k with decidable equality, an algorithm A : List (∀ i, M i) → (∀ i, M i), an…
  • uniform_kserver_det_k_one_competitiveFor generalized 1-server on any family of uniform metric spaces M indexed by Fin 1 with decidable equality and any initial configuration a…

Read back from the Lean

For types α and β, a function A : List α → β, and a list ρ : List α, uniform_kserver_det_schedule A ρ is the list of values in β obtained by mapping each t from 0 to ρ.length - 1 (i.e., each element of List.range ρ.length) to A (ρ.take (t + 1)), which evaluates A on the prefix of ρ of length t + 1.

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 schedule of outputs chosen online by A on input sequence ρ. -/
def uniform_kserver_det_schedule {α β : Type*}
    (A : List α → β) (ρ : List α) : List β :=
  (List.range ρ.length).map (fun t => A (ρ.take (t + 1)))
See it in the graphDiscuss this resultChallenge it