Theorems · Theorem

Traversable.foldr_toList

∀ {α β : Type u} {t : Type u → Type u} [inst : Traversable t] [LawfulTraversable t] (f : α → β → β) (xs : t α) (x : β),
  Traversable.foldr f x xs = List.foldr f x (Traversable.toList xs)

Defined in

Mathlib.Control.Fold

Cited by

0 results in Mathlib

Foundations

Depth 42 from the axioms · uses propext, Quot.sound

Assumes

TraversableLawfulTraversable