Theorems · Inductive type · probability
Random
(Type u → Type u_1) → Type u → Type (max (max 1 u) u_1)
Random m α gives us machinery to generate values of type α in the monad m.
Note that m is a parameter as some types may only be sampleable with access to a certain monad.
- Defined in
- Mathlib.Control.Random
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 0 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by8
Results whose statement or proof uses this declaration.
- Random.noConfusionstatement and proof · cited by 0
- Random.noConfusionTypestatement and proof · cited by 0
- Random.randstatement and proof · cited by 0
- Random.randomstatement and proof · cited by 0
- Random.recOnstatement and proof · cited by 0
- Random.mk.noConfusionstatement · cited by 0
- Random.casesOnstatement and proof · cited by 0
- Random.ctorIdxstatement and proof · cited by 0