Dependencesval init : Zelus.eq -> boolInitialization equations init x = e and reset init x = e... every ...]
val nodep : Zelus.eq -> boolval index : Zelus.eq -> intval unsafe : Zelus.eq -> boolval fresh : int -> Zelus.eq collection -> Zelus.eq collection * intval name_to_index :
(Graph.S.t Ident.Env.t
* Graph.S.t Ident.Env.t
* (int * Zelus.eq * Ident.S.t * Ident.S.t * Ident.S.t) list) ->
Zelus.eq collection ->
Graph.S.t Ident.Env.t
* Graph.S.t Ident.Env.t
* (int * Zelus.eq * Ident.S.t * Ident.S.t * Ident.S.t) listval make_read_write :
Graph.S.t Ident.Env.t ->
Graph.S.t Ident.Env.t ->
(Graph.E.key * 'a * Ident.S.t * Ident.S.t * Ident.S.t) list ->
'a Graph.graphval make_unsafes :
'a ->
'b ->
'c Graph.graph ->
Zelus.eq collection ->
'c Graph.graphval make : Zelus.eq collection -> Zelus.eq Graph.graphval print : Format.formatter -> Zelus.eq Graph.graph -> unit