Cslib.Algorithms.Lean.TimeM.bind
defimported Lean
Sequentially composes two TimeM computations, summing their time costs. Prefer to use the >>= notation.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in protected def Cslib.Algorithms.Lean.TimeM.bind {α β} [Add T] (m : TimeM T α) (f : α → TimeM T β) : TimeM T β
- Defined in
- CSLib, `Cslib.Algorithms.Lean.TimeM.bind`
- Lean proof
- By Sorrachai Yingchareonthawornhcai, Eric Wieser, from github.com/leanprover/cslib at
3951377e5a3f(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.33.0.Cslib.Algorithms.Lean.TimeM.bind← Cslib.Algorithms.Lean.TimeM.bind (Cslib/Algorithms/Lean/TimeM.lean:69): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- Cslib.Algorithms.Lean.TimeM.instPureOfZeroCslib.Algorithms.Lean.TimeM.instPureOfZero
- Cslib.Algorithms.Lean.TimeMA monad for tracking time complexity of computations.
TimeM T αrepresents a computation that returns a value of typeαand…
- Used by 1
- Cslib.Algorithms.Lean.TimeM.instBindOfAddCslib.Algorithms.Lean.TimeM.instBindOfAdd
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- Sequentially composes two `TimeM` computations, summing their time costs. Prefer to use the `>>=` notation. -/ protected def Cslib.Algorithms.Lean.TimeM.bind {α β} [Add T] (m : TimeM T α) (f : α → TimeM T β) : TimeM T β := let r := f m.ret ⟨r.ret, m.time + r.time⟩