AFTD Auto-Formalizing Theoretical Domains

CostM.par

defimported Lean

Independent (parallel) composition of two CostM computations. The return is the pair of return values; the cost is the sup of the two costs.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
variable {C : Type*} {A B : Type u} in
def CostM.par [SemilatticeSup C] (m₁ : CostM C A) (m₂ : CostM C B) : CostM C (A × B)
Defined in
EconCSLib, `CostM.par`
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 24
Used by 2

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
/-- Independent (parallel) composition of two `CostM` computations. The return is the pair of return values; the cost is the sup of the two costs. -/
def CostM.par [SemilatticeSup C] (m₁ : CostM C A) (m₂ : CostM C B) : CostM C (A × B) :=
  ⟨(m₁.ret, m₂.ret), m₁.cost ⊔ m₂.cost⟩
See it in the graphDiscuss this resultChallenge it