CostM.bind
defimported Lean
Sequential composition. The cost of m >>= f is m.cost + (f m.ret).cost.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u in variable {C : Type*} {A B : Type u} in protected def CostM.bind [Add C] (m : CostM C A) (f : A → CostM C B) : CostM C B
- Defined in
- EconCSLib, `CostM.bind`
- 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.CostM.bind← CostM.bind (EconCSLib/Foundation/CostM.lean:153): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- CostMWriter monad over an arbitrary additive monoid
C. ACostM C Ais a return value of typeAtogether with an accumulated cost inC.… - CostM.instPureCostM.instPure
- CostMWriter monad over an arbitrary additive monoid
- Used by 1
- CostM.instBindCostM.instBind
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 /-- Sequential composition. The cost of `m >>= f` is `m.cost + (f m.ret).cost`. -/ protected def CostM.bind [Add C] (m : CostM C A) (f : A → CostM C B) : CostM C B := let r := f m.ret ⟨r.ret, m.cost + r.cost⟩