Skip to content
Snippets Groups Projects
Commit a00483fe authored by Loïc Correnson's avatar Loïc Correnson
Browse files

[WP] Relocatable sig

parent 8821c996
No related branches found
No related tags found
No related merge requests found
...@@ -29,7 +29,6 @@ sig ...@@ -29,7 +29,6 @@ sig
module M : Model module M : Model
module Node : sig module Node : sig
type t type t
module Map : Qed.Idxmap.S with type key = t module Map : Qed.Idxmap.S with type key = t
...@@ -43,29 +42,28 @@ sig ...@@ -43,29 +42,28 @@ sig
module E : sig module E : sig
type t type t
val create : M.sigma sequence -> F.pred -> t val create : M.sigma sequence -> F.pred -> t
(** Bundle an equation with the sigma sequence that created it *) val get : t -> F.pred
val reads : t -> M.domain
val writes : t -> M.domain
val relocate : M.sigma sequence -> t -> t val relocate : M.sigma sequence -> t -> t
val get: t -> F.pred
end end
(** Relocatable predicate *)
module P :
sig
type t
val create : M.sigma Node.Map.t -> F.pred -> t
(** Bundle an equation with the sigma sequence that created it. *)
val relocate : M.sigma Node.Map.t -> t -> t
val get: t -> F.pred
end
(** Relocatable condition *)
module C : module C :
sig sig
type t type t
val create : M.sigma -> F.pred -> t val create : M.sigma -> F.pred -> t
(** Bundle an equation with the sigma sequence that created it. *) val get : t -> F.pred
val reads : t -> M.domain
val relocate : M.sigma -> t -> t val relocate : M.sigma -> t -> t
end
module P :
sig
type t
val create : M.sigma Node.Map.t -> F.pred -> t
val get: t -> F.pred val get: t -> F.pred
val reads : t -> M.domain Node.Map.t
val relocate : M.sigma Node.Map.t -> t -> t
end end
type cfg type cfg
......
...@@ -73,9 +73,9 @@ sig ...@@ -73,9 +73,9 @@ sig
end end
type node = Node.t type node = Node.t
val node : unit -> node
(** fresh node *) (** fresh node *)
val node : unit -> node
(** {2 Relocatable Formulae} (** {2 Relocatable Formulae}
Can be created once with fresh environment, and used several Can be created once with fresh environment, and used several
...@@ -84,31 +84,37 @@ sig ...@@ -84,31 +84,37 @@ sig
(** Relocatable set of equations *) (** Relocatable set of equations *)
module E : sig module E : sig
type t type t
val create : M.sigma sequence -> F.pred -> t
(** Bundle an equation with the sigma sequence that created it *) (** Bundle an equation with the sigma sequence that created it *)
val create : M.sigma sequence -> F.pred -> t
val get : t -> F.pred
val reads : t -> M.domain
val writes : t -> M.domain
val relocate : M.sigma sequence -> t -> t val relocate : M.sigma sequence -> t -> t
val get: t -> F.pred
end end
(** Relocatable predicate *) (** Relocatable condition *)
module P : module C :
sig sig
type t type t
val create : M.sigma Node.Map.t -> F.pred -> t
(** Bundle an equation with the sigma sequence that created it. *) (** Bundle an equation with the sigma sequence that created it. *)
val relocate : M.sigma Node.Map.t -> t -> t val create : M.sigma -> F.pred -> t
val get: t -> F.pred val get : t -> F.pred
val reads : t -> M.domain
val relocate : M.sigma -> t -> t
end end
(** Relocatable predicate *)
(** Relocatable condition *) module P :
module C :
sig sig
type t type t
val create : M.sigma -> F.pred -> t
(** Bundle an equation with the sigma sequence that created it. *) (** Bundle an equation with the sigma sequence that created it. *)
val relocate : M.sigma -> t -> t val create : M.sigma Node.Map.t -> F.pred -> t
val get: t -> F.pred val get: t -> F.pred
val reads : t -> M.domain Node.Map.t
val relocate : M.sigma Node.Map.t -> t -> t
end end
type cfg (** Structured collection of traces. *) type cfg (** Structured collection of traces. *)
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment