1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
(* Js_of_ocaml compiler
* http://www.ocsigen.org/js_of_ocaml/
* Copyright (C) 2010 Jérôme Vouillon
* Laboratoire PPS - CNRS Université Paris Diderot
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, with linking exception;
* either version 2.1 of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*)
module Make
(N : sig
type t
end)
(NSet : Set.S with type elt = N.t)
(NMap : Map.S with type key = N.t) : sig
type t =
{ domain : NSet.t
; fold_children : 'a. (N.t -> 'a -> 'a) -> N.t -> 'a -> 'a
}
val invert : t -> t
module type DOMAIN = sig
type t
val equal : t -> t -> bool
val bot : t
end
module Solver (D : DOMAIN) : sig
val f : t -> (D.t NMap.t -> N.t -> D.t) -> D.t NMap.t
end
end
module type ISet = sig
type t
type elt
val iter : (elt -> unit) -> t -> unit
val mem : t -> elt -> bool
val add : t -> elt -> unit
val remove : t -> elt -> unit
val copy : t -> t
end
module type Tbl = sig
type 'a t
type key
type size
val get : 'a t -> key -> 'a
val set : 'a t -> key -> 'a -> unit
val make : size -> 'a -> 'a t
end
module Make_Imperative
(N : sig
type t
end)
(NSet : ISet with type elt = N.t)
(NTbl : Tbl with type key = N.t) : sig
type t =
{ domain : NSet.t
; iter_children : (N.t -> unit) -> N.t -> unit
}
val invert : NTbl.size -> t -> t
module type DOMAIN = sig
type t
val equal : t -> t -> bool
val bot : t
end
module Solver (D : DOMAIN) : sig
val f : NTbl.size -> t -> (D.t NTbl.t -> N.t -> D.t) -> D.t NTbl.t
val f' :
NTbl.size
-> t
-> (update:(children:bool -> N.t -> unit) -> D.t NTbl.t -> N.t -> D.t)
-> D.t NTbl.t
end
end
module type ACTION = sig
type t
end
module type DOMAIN = sig
type t
val equal : t -> t -> bool
val bot : t
val top : t
val join : t -> t -> t
end
module Solver
(N : sig
type t
end)
(NSet : ISet with type elt = N.t)
(NTbl : Tbl with type key = N.t)
(A : ACTION)
(D : DOMAIN) : sig
type t =
{ domain : NSet.t
; iter_children : (N.t -> A.t -> unit) -> N.t -> unit
}
val f :
state:D.t NTbl.t
-> t
-> (state:D.t NTbl.t -> dep:N.t -> target:N.t -> action:A.t -> D.t)
-> unit
end
|
