accessor

A library that makes it nicer to work with nested functional data structures
IN THIS PACKAGE

Parameters

module B : Basic3

Signature

val apply : ( 'a -> 'b, 'd, 'e ) B.t -> ( 'a, 'd, 'e ) B.t -> ( 'b, 'd, 'e ) B.t
val map : ( 'a, 'd, 'e ) B.t -> f:( 'a -> 'b ) -> ( 'b, 'd, 'e ) B.t
val map2 : ( 'a, 'd, 'e ) B.t -> ( 'b, 'd, 'e ) B.t -> f:( 'a -> 'b -> 'c ) -> ( 'c, 'd, 'e ) B.t
val map3 : ( 'a, 'd, 'e ) B.t -> ( 'b, 'd, 'e ) B.t -> ( 'c, 'd, 'e ) B.t -> f:( 'a -> 'b -> 'c -> 'f ) -> ( 'f, 'd, 'e ) B.t
val both : ( 'a, 'd, 'e ) B.t -> ( 'b, 'd, 'e ) B.t -> ( 'a * 'b, 'd, 'e ) B.t
module Applicative_infix : sig ... end
include module type of Applicative_infix
val (<*>) : ( 'a -> 'b, 'd, 'e ) B.t -> ( 'a, 'd, 'e ) B.t -> ( 'b, 'd, 'e ) B.t
val (>>|) : ( 'a, 'd, 'e ) B.t -> ( 'a -> 'b ) -> ( 'b, 'd, 'e ) B.t
module Let_syntax : sig ... end