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

Dune Dependency

github.com Edit opam file Versions (4)

Authors

B

BAP Team

Maintainers

I

Ivan Gotovchits <ivg@ieee.org>

Sources

v2.3.0.tar.gz

sha256=a6e80853aaaa26b7ca564d9878891d7146ec1c83852541387c1bba1ad036b8ea

md5=13f2cb1e3b9d90348852252fb0f2d09f

doc/bap-plugin-primus_greedy/Primus_greedy_main/Greedy/argument-1-Machine/Collection/Delay/argument-1-T/index.html

Parameter `Delay.T`

include Monads.Std.Monad.Collection.Basic

type 'a t

x t a container that hold values of type x

val return : 'a -> 'a t

return x creates a singleton container holding x

include Monads.Std.Monad.Plus.S with type 'a t := 'a t

val zero : unit -> 'a t

zero () constructs a zero element

val plus : 'a t -> 'a t -> 'a t

plus x y an associative operation.

val fold : 
  'a t ->
  init:'s ->
  f:('s -> 'a -> ('s -> 'r) -> 'r) ->
  ('s -> 'r) ->
  'r

fold xs ~init:s ~f a delayed fold implementation. It is the same as a regular fold except that function f accepts an extra continuation argument, and the fold expression returns a continuation.