package bap-primus-greedy-scheduler

You can search for identifiers within the package.

in-package search v0.2.0

Evaluates all machines in the DFS order

Install

sha256=9c126781385d2fa9b8edab22e62b25c70bf2f99f6ec78abb7e5e36d63cfa4174

md5=5abd9b3628b43f797326034f31ca574f

Various function combinators lifted into the Kleisli category.

val id : 'a -> 'a t

id x a monadic identity function

val ignore : 'a t -> unit t

ignore m computes m and discards the result.

val nothing : unit -> unit t

nothing is a computation that does nothing.

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

non f returns a negation of the function f.

val apply_n_times : n:int -> ('a -> 'a t) -> 'a -> 'a t

apply_n_times ~n f creates a chaing of computation of size n made from applications of the same function to its own result.

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

compose f g creates a composition f.g of two function.