Theorems · Inductive type · probability
BoundedRandom
(Type u → Type u_1) → (α : Type u) → [Preorder α] → Type (max (max 1 u) u_1)
BoundedRandom m α gives us machinery to generate values of type α between certain bounds in
the monad m.
- Defined in
- Mathlib.Control.Random
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- Preorder
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.
- Preorderstatement · cited by 7,952
Cited by8
Results whose statement or proof uses this declaration.
- Random.randBoundstatement and proof · cited by 0
- BoundedRandom.casesOnstatement and proof · cited by 0
- BoundedRandom.ctorIdxstatement and proof · cited by 0
- BoundedRandom.noConfusionstatement and proof · cited by 0
- BoundedRandom.noConfusionTypestatement and proof · cited by 0
- BoundedRandom.randomRstatement and proof · cited by 0
- BoundedRandom.recOnstatement and proof · cited by 0
- BoundedRandom.mk.noConfusionstatement · cited by 0