Sch_freeFree applicative functor over an effect 'f.
apply f x passes every effect in f to the natural transformation before those in x, then gives app.apply the two results in the same order. Applicatives that accumulate values should therefore append x's values to f's.
val pure : 'a -> ('f, 'a) tval lift : ('a, 'f) Sch_sig.app -> ('f, 'a) tval hoist : ('f, 'g) Sch_sig.nat -> ('f, 'a) t -> ('g, 'a) tval retract : 'f Sch_sig.applicative -> ('f, 'a) t -> ('a, 'f) Sch_sig.appval run :
'g Sch_sig.applicative ->
('f, 'g) Sch_sig.nat ->
('f, 'a) t ->
('a, 'g) Sch_sig.apprun app nat free interprets free in one pass. It is not tail recursive; stack depth matches the nesting depth of free, usually the number of fields.
module Syntax : sig ... end