AFTD Auto-Formalizing Theoretical Domains

Online.OnlineAlgorithm.runStatus

abbrevimported Lean

The terminal status (state) run halts in — the first component of run, after the end-of-input step.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {α σ β : Type*} in
abbrev Online.OnlineAlgorithm.runStatus (alg : OnlineAlgorithm α σ β) (s : σ) (rs : List α) : σ
Defined in
EconCSLib, `Online.OnlineAlgorithm.runStatus`
Lean proof
By Claude (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 2
  • Online.OnlineAlgorithm.runDrive the machine across the requests, halting at the first step that emits an output. When the genuine requests are exhausted without…
  • Online.OnlineAlgorithmA deterministic online algorithm as a state machine. The state State summarises the relevant past; step consumes the current state and…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {α σ β : Type*} in
/-- The **terminal status** (state) `run` halts in — the first component of `run`, after the end-of-input step. -/
abbrev Online.OnlineAlgorithm.runStatus (alg : OnlineAlgorithm α σ β) (s : σ) (rs : List α) : σ :=
  (alg.run s rs).1
See it in the graphDiscuss this resultChallenge it