Module Bigraph.AppCond

Application conditions for bigraph reaction rules.

type t = {
  1. neg : bool;
    (*

    Negative application condition.

    *)
  2. where : loc;
    (*

    Specify whether the predicate has to be checked against the context or the parameter of a match.

    *)
  3. pred : Big.t;
    (*

    Predicate.

    *)
}

The type of application conditions.

and loc =
  1. | Ctx
    (*

    Context.

    *)
  2. | Param
    (*

    Parameter.

    *)
val pp : Ppx_deriving_runtime.Format.formatter -> t -> Ppx_deriving_runtime.unit
val show : t -> Ppx_deriving_runtime.string
val pp_loc : Ppx_deriving_runtime.Format.formatter -> loc -> Ppx_deriving_runtime.unit
val show_loc : loc -> Ppx_deriving_runtime.string
val to_yojson : t -> Yojson.Safe.t
val of_yojson : Yojson.Safe.t -> t Ppx_deriving_yojson_runtime.error_or
val loc_to_yojson : loc -> Yojson.Safe.t
val loc_of_yojson : Yojson.Safe.t -> loc Ppx_deriving_yojson_runtime.error_or
module type C = sig ... end

Output signature of the functor AppCond.Make.

module Make (_ : sig ... end) : C

Functor building an implementation of the application conditions given a module exposing the occurrence check (the only part of the solver interface used).