AFTD Auto-Formalizing Theoretical Domains

CostM.parList

defimported Lean

N-ary parallel composition over a List of independent CostM operands. Returns are paired into a list in the original order; the cost is the sup of all operand costs (or ⊥ for the empty list).

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
variable {C : Type*} {A B : Type u} in
def CostM.parList [SemilatticeSup C] [OrderBot C] (ms : List (CostM C A)) :
    CostM C (List A)
Defined in
EconCSLib, `CostM.parList`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2025 Sorrachai Yingchareonthawornhcai. 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 26
Used by 4

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
variable {C : Type*} {A B : Type u} in
/-- N-ary parallel composition over a `List` of independent `CostM` operands. Returns are paired into a list in the original order; the cost is the sup of all operand costs (or `⊥` for the empty list). -/
def CostM.parList [SemilatticeSup C] [OrderBot C] (ms : List (CostM C A)) :
    CostM C (List A) :=
  ⟨ms.map (·.ret), ms.foldr (fun m acc => m.cost ⊔ acc) ⊥⟩
See it in the graphDiscuss this resultChallenge it