Theorems · Definition · combinatorics
List.Vector.mOfFn
{m : Type u → Type u_6} → [Monad m] → {α : Type u} → {n : ℕ} → (Fin n → m α) → m (List.Vector α n)Monadic analog of Vector.ofFn.
Given a monadic function on Fin n, return a Vector α n inside the monad.
- Defined in
- Mathlib.Data.Vector.Basic
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 26 from the axioms · uses propext
- Assumes
- Monad
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.Vectorstatement · cited by 270
Cited by9
Results whose statement or proof uses this declaration.
- Vector.mOfFn_part_somestatement · cited by 5
- Partrec.vector_mOfFnstatement · cited by 2
- Turing.ToPartrec.Code.exists_code.compstatement and proof · cited by 1
- List.Vector.mOfFn_purestatement · cited by 1
- Nat.Partrec'.recOnstatement and proof · cited by 0
- Nat.Partrec'.tailproof · cited by 0
- Nat.Partrec'.casesOnstatement and proof · cited by 0
- List.Vector.mOfFn.eq_defstatement and proof · cited by 0
- Nat.Partrec'.below.casesOnstatement and proof · cited by 0