package traverse

  1. Overview
  2. Docs
Traversable data structures with applicative functors


Dune Dependency






Definition of applicative functors with instances for traversable data structures

Published: 02 Oct 2020


traverse: Traversable data structures with applicative functors

This library provides:

  • a module signature Traverse.Applicative.S for applicative functors [McBride and Patterson, 2008],

  • two functions Traverse.list and Traverse.seq to traverse lists and sequences by a given applicative functor and with a given arity,

  • many instances of applicative functors: Traverse.Applicative.{iter, map, reduce, env, fold, pair, forall, exists, option, result, list}.

The purpose of this library is to provide a common dictionary of "visitors", which is orthogonal to the visited data structure. For instance, Traverse.list Traverse.Applicative.iter (S O) is equivalent to List.iter, Traverse.list (S (S O)) is equivalent to List.map2, etc. Moreover, one can get a visitor which combine, for instance, both and List.fold_left by invoking Traverse.list Traverse.Applicative.(pair map fold). To get the same visitors for a sequence ('a Seq.t), one just have to replace Traverse.list by Traverse.seq, and it is easy to define a traversal for any algebraic data structures.

Dependencies (5)

  1. metaquot >= "0.3.0"
  2. metapp >= "0.3.0"
  3. stdcompat >= "14"
  4. dune >= "1.11.0"
  5. ocaml >= "4.03.0"

Dev Dependencies (1)

  1. odoc with-doc & >= "1.5.1"

Used by (2)

  1. clangml-transforms >= "0.25"
  2. refl >= "0.3.0"