Theorems · Definition
sequence
{t : Type u → Type u} → {α : Type u} → {f : Type u → Type u} → [Applicative f] → [Traversable t] → t (f α) → f (t α)A traversable functor commutes with all applicative functors.
- Defined in
- Mathlib.Control.Traversable.Basic
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
- Assumes
- ApplicativeTraversable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Traversable.traverseproof · cited by 53
- Traversablestatement and proof · cited by 38
Cited by6
Results whose statement or proof uses this declaration.
- nhds_listproof · cited by 2
- Filter.mem_traverse_iffstatement and proof · cited by 1
- Traversable.naturality'statement · cited by 0
- Traversable.comp_sequencestatement · cited by 0
- Traversable.id_sequencestatement · cited by 0
- Filter.sequence_monostatement and proof · cited by 0