package prbnmcn-dagger

  1. Overview
  2. Docs

Module type Intf.SSource

Module type describing the DSL, implemented by inference backends.

type 'a t

'a t is the type of computations of type 'a

val return : 'a -> 'a t

return x injects a value x as a computation

val bind : 'a t -> ('a -> 'b t) -> 'b t

Monadic bind

val map : 'a t -> ('a -> 'b) -> 'b t

Functorial map

val map2 : 'a t -> 'b t -> ('a -> 'b -> 'c) -> 'c t

Applicative structure

val map_array : 'a t array -> ('a array -> 'b) -> 'b t

N-ary applicative structure

val if_ : bool t -> (bool -> 'a t) -> 'a t

If-then-else, mostly useful for monads featuring incremental computation. Allows to efficiently bind on a boolean computation.

module Infix : Infix with type 'a t := 'a t
type 'a dist

The type of distributions

val sample : 'a dist -> 'a t

sample dist builds a computation that samples from dist. Note that dist must be a pure computation.

val map_score : 'a t -> ('a -> float) -> 'a t

map_score m f behaves similarly to m except that the associated computation will be reweighted according to the result of evaluating f on the value of m.

val map_log_score : 'a t -> ('a -> Log_space.t) -> 'a t

Same as map_score excepts that a log-space likelihood is expected.

val score : float -> unit t

score s reweights the computation by s.

  • raises Invalid_arg

    if s < 0

val log_score : Log_space.t -> unit t

log_score behaves as score except that a log-space weight is expected.

module List_ops : Foldable with type 'a t = 'a list and type 'a m := 'a t
module Array_ops : Foldable with type 'a t = 'a array and type 'a m := 'a t
module Seq_ops : Foldable with type 'a t = 'a Seq.t and type 'a m := 'a t