blanchet@49263
|
1 |
(* Title: HOL/Tools/Sledgehammer/sledgehammer_filter_mash.ML
|
blanchet@49263
|
2 |
Author: Jasmin Blanchette, TU Muenchen
|
blanchet@49263
|
3 |
|
blanchet@49263
|
4 |
Sledgehammer's machine-learning-based relevance filter (MaSh).
|
blanchet@49263
|
5 |
*)
|
blanchet@49263
|
6 |
|
blanchet@49263
|
7 |
signature SLEDGEHAMMER_FILTER_MASH =
|
blanchet@49263
|
8 |
sig
|
blanchet@49266
|
9 |
type status = ATP_Problem_Generate.status
|
blanchet@49266
|
10 |
type stature = ATP_Problem_Generate.stature
|
blanchet@49311
|
11 |
type fact = Sledgehammer_Fact.fact
|
blanchet@49311
|
12 |
type fact_override = Sledgehammer_Fact.fact_override
|
blanchet@49266
|
13 |
type params = Sledgehammer_Provers.params
|
blanchet@49303
|
14 |
type relevance_fudge = Sledgehammer_Provers.relevance_fudge
|
blanchet@49266
|
15 |
type prover_result = Sledgehammer_Provers.prover_result
|
blanchet@49266
|
16 |
|
blanchet@49323
|
17 |
val trace : bool Config.T
|
blanchet@49334
|
18 |
val MaShN : string
|
blanchet@49329
|
19 |
val meshN : string
|
blanchet@49329
|
20 |
val iterN : string
|
blanchet@49329
|
21 |
val mashN : string
|
blanchet@49329
|
22 |
val fact_filters : string list
|
blanchet@49318
|
23 |
val escape_meta : string -> string
|
blanchet@49318
|
24 |
val escape_metas : string list -> string
|
blanchet@49323
|
25 |
val unescape_meta : string -> string
|
blanchet@49323
|
26 |
val unescape_metas : string -> string list
|
blanchet@49326
|
27 |
val extract_query : string -> string * string list
|
blanchet@49336
|
28 |
val suggested_facts : string list -> ('a * thm) list -> ('a * thm) list
|
blanchet@49336
|
29 |
val mesh_facts :
|
blanchet@49336
|
30 |
int -> (('a * thm) list * ('a * thm) list) list -> ('a * thm) list
|
blanchet@49339
|
31 |
val is_likely_tautology_or_too_meta : thm -> bool
|
blanchet@49266
|
32 |
val theory_ord : theory * theory -> order
|
blanchet@49266
|
33 |
val thm_ord : thm * thm -> order
|
blanchet@49333
|
34 |
val features_of :
|
blanchet@49333
|
35 |
Proof.context -> string -> theory -> status -> term list -> string list
|
blanchet@49331
|
36 |
val isabelle_dependencies_of : unit Symtab.table -> thm -> string list
|
blanchet@49266
|
37 |
val goal_of_thm : theory -> thm -> thm
|
blanchet@49336
|
38 |
val run_prover_for_mash :
|
blanchet@49333
|
39 |
Proof.context -> params -> string -> fact list -> thm -> prover_result
|
blanchet@49323
|
40 |
val mash_RESET : Proof.context -> unit
|
blanchet@49331
|
41 |
val mash_INIT :
|
blanchet@49331
|
42 |
Proof.context -> bool
|
blanchet@49331
|
43 |
-> (string * string list * string list * string list) list -> unit
|
blanchet@49323
|
44 |
val mash_ADD :
|
blanchet@49331
|
45 |
Proof.context -> bool
|
blanchet@49331
|
46 |
-> (string * string list * string list * string list) list -> unit
|
blanchet@49331
|
47 |
val mash_QUERY :
|
blanchet@49333
|
48 |
Proof.context -> bool -> int -> string list * string list -> string list
|
blanchet@49323
|
49 |
val mash_reset : Proof.context -> unit
|
blanchet@49333
|
50 |
val mash_could_suggest_facts : unit -> bool
|
blanchet@49336
|
51 |
val mash_can_suggest_facts : Proof.context -> bool
|
blanchet@49313
|
52 |
val mash_suggest_facts :
|
blanchet@49336
|
53 |
Proof.context -> params -> string -> int -> term list -> term
|
blanchet@49336
|
54 |
-> ('a * thm) list -> ('a * thm) list * ('a * thm) list
|
blanchet@49334
|
55 |
val mash_learn_thy :
|
blanchet@49334
|
56 |
Proof.context -> params -> theory -> Time.time -> fact list -> string
|
blanchet@49331
|
57 |
val mash_learn_proof :
|
blanchet@49336
|
58 |
Proof.context -> params -> term -> ('a * thm) list -> thm list -> unit
|
blanchet@49303
|
59 |
val relevant_facts :
|
blanchet@49307
|
60 |
Proof.context -> params -> string -> int -> fact_override -> term list
|
blanchet@49311
|
61 |
-> term -> fact list -> fact list
|
blanchet@49334
|
62 |
val kill_learners : unit -> unit
|
blanchet@49334
|
63 |
val running_learners : unit -> unit
|
blanchet@49263
|
64 |
end;
|
blanchet@49263
|
65 |
|
blanchet@49263
|
66 |
structure Sledgehammer_Filter_MaSh : SLEDGEHAMMER_FILTER_MASH =
|
blanchet@49263
|
67 |
struct
|
blanchet@49264
|
68 |
|
blanchet@49266
|
69 |
open ATP_Util
|
blanchet@49266
|
70 |
open ATP_Problem_Generate
|
blanchet@49266
|
71 |
open Sledgehammer_Util
|
blanchet@49266
|
72 |
open Sledgehammer_Fact
|
blanchet@49266
|
73 |
open Sledgehammer_Filter_Iter
|
blanchet@49266
|
74 |
open Sledgehammer_Provers
|
blanchet@49333
|
75 |
open Sledgehammer_Minimize
|
blanchet@49266
|
76 |
|
blanchet@49323
|
77 |
val trace =
|
blanchet@49323
|
78 |
Attrib.setup_config_bool @{binding sledgehammer_filter_mash_trace} (K false)
|
blanchet@49323
|
79 |
fun trace_msg ctxt msg = if Config.get ctxt trace then tracing (msg ()) else ()
|
blanchet@49323
|
80 |
|
blanchet@49334
|
81 |
val MaShN = "MaSh"
|
blanchet@49334
|
82 |
|
blanchet@49329
|
83 |
val meshN = "mesh"
|
blanchet@49329
|
84 |
val iterN = "iter"
|
blanchet@49329
|
85 |
val mashN = "mash"
|
blanchet@49329
|
86 |
|
blanchet@49329
|
87 |
val fact_filters = [meshN, iterN, mashN]
|
blanchet@49329
|
88 |
|
blanchet@49329
|
89 |
fun mash_home () = getenv "MASH_HOME"
|
blanchet@49329
|
90 |
fun mash_state_dir () =
|
blanchet@49324
|
91 |
getenv "ISABELLE_HOME_USER" ^ "/mash"
|
blanchet@49331
|
92 |
|> tap (Isabelle_System.mkdir o Path.explode)
|
blanchet@49329
|
93 |
fun mash_state_path () = mash_state_dir () ^ "/state" |> Path.explode
|
blanchet@49266
|
94 |
|
blanchet@49266
|
95 |
(*** Isabelle helpers ***)
|
blanchet@49266
|
96 |
|
blanchet@49323
|
97 |
fun meta_char c =
|
blanchet@49266
|
98 |
if Char.isAlphaNum c orelse c = #"_" orelse c = #"." orelse c = #"(" orelse
|
blanchet@49266
|
99 |
c = #")" orelse c = #"," then
|
blanchet@49266
|
100 |
String.str c
|
blanchet@49266
|
101 |
else
|
blanchet@49266
|
102 |
(* fixed width, in case more digits follow *)
|
blanchet@49266
|
103 |
"\\" ^ stringN_of_int 3 (Char.ord c)
|
blanchet@49266
|
104 |
|
blanchet@49323
|
105 |
fun unmeta_chars accum [] = String.implode (rev accum)
|
blanchet@49323
|
106 |
| unmeta_chars accum (#"\\" :: d1 :: d2 :: d3 :: cs) =
|
blanchet@49323
|
107 |
(case Int.fromString (String.implode [d1, d2, d3]) of
|
blanchet@49323
|
108 |
SOME n => unmeta_chars (Char.chr n :: accum) cs
|
blanchet@49323
|
109 |
| NONE => "" (* error *))
|
blanchet@49323
|
110 |
| unmeta_chars _ (#"\\" :: _) = "" (* error *)
|
blanchet@49323
|
111 |
| unmeta_chars accum (c :: cs) = unmeta_chars (c :: accum) cs
|
blanchet@49323
|
112 |
|
blanchet@49323
|
113 |
val escape_meta = String.translate meta_char
|
blanchet@49318
|
114 |
val escape_metas = map escape_meta #> space_implode " "
|
blanchet@49330
|
115 |
val unescape_meta = String.explode #> unmeta_chars []
|
blanchet@49330
|
116 |
val unescape_metas =
|
blanchet@49330
|
117 |
space_explode " " #> filter_out (curry (op =) "") #> map unescape_meta
|
blanchet@49266
|
118 |
|
blanchet@49326
|
119 |
fun extract_query line =
|
blanchet@49326
|
120 |
case space_explode ":" line of
|
blanchet@49330
|
121 |
[goal_name, suggs] => (unescape_meta goal_name, unescape_metas suggs)
|
blanchet@49327
|
122 |
| _ => ("", [])
|
blanchet@49326
|
123 |
|
blanchet@49326
|
124 |
fun find_suggested facts sugg =
|
blanchet@49326
|
125 |
find_first (fn (_, th) => Thm.get_name_hint th = sugg) facts
|
blanchet@49326
|
126 |
fun suggested_facts suggs facts = map_filter (find_suggested facts) suggs
|
blanchet@49326
|
127 |
|
blanchet@49343
|
128 |
val scale_factor = 1000
|
blanchet@49343
|
129 |
|
blanchet@49343
|
130 |
fun scaled_powX x = Integer.pow 8 x
|
blanchet@49343
|
131 |
|
blanchet@49343
|
132 |
fun sum_sq_avg [] = 0
|
blanchet@49343
|
133 |
| sum_sq_avg xs = fold (Integer.add o scaled_powX) xs 0 div (length xs)
|
blanchet@49328
|
134 |
|
blanchet@49335
|
135 |
fun mesh_facts max_facts [(selected, unknown)] =
|
blanchet@49335
|
136 |
take max_facts selected @ take (max_facts - length selected) unknown
|
blanchet@49329
|
137 |
| mesh_facts max_facts mess =
|
blanchet@49329
|
138 |
let
|
blanchet@49335
|
139 |
val mess = mess |> map (apfst (`length))
|
blanchet@49329
|
140 |
val fact_eq = Thm.eq_thm o pairself snd
|
blanchet@49335
|
141 |
fun score_in fact ((sel_len, sels), unks) =
|
blanchet@49335
|
142 |
case find_index (curry fact_eq fact) sels of
|
blanchet@49335
|
143 |
~1 => (case find_index (curry fact_eq fact) unks of
|
blanchet@49343
|
144 |
~1 => SOME 0
|
blanchet@49335
|
145 |
| _ => NONE)
|
blanchet@49343
|
146 |
| j => SOME (scale_factor * (sel_len - j) div sel_len)
|
blanchet@49343
|
147 |
fun score_of fact = mess |> map_filter (score_in fact) |> sum_sq_avg
|
blanchet@49335
|
148 |
val facts = fold (union fact_eq o take max_facts o snd o fst) mess []
|
blanchet@49329
|
149 |
in
|
blanchet@49343
|
150 |
facts |> map (`score_of) |> sort (int_ord o swap o pairself fst)
|
blanchet@49343
|
151 |
|> tap (List.app (fn (score, (_, th)) => tracing ("score: " ^ string_of_int score ^ " " ^ Thm.get_name_hint th))
|
blanchet@49343
|
152 |
)
|
blanchet@49343
|
153 |
|> map snd |> take max_facts
|
blanchet@49329
|
154 |
end
|
blanchet@49327
|
155 |
|
blanchet@49318
|
156 |
val thy_feature_prefix = "y_"
|
blanchet@49266
|
157 |
|
blanchet@49318
|
158 |
val thy_feature_name_of = prefix thy_feature_prefix
|
blanchet@49318
|
159 |
val const_name_of = prefix const_prefix
|
blanchet@49318
|
160 |
val type_name_of = prefix type_const_prefix
|
blanchet@49318
|
161 |
val class_name_of = prefix class_prefix
|
blanchet@49266
|
162 |
|
blanchet@49339
|
163 |
fun is_likely_tautology_or_too_meta th =
|
blanchet@49339
|
164 |
let
|
blanchet@49339
|
165 |
val is_boring_const = member (op =) atp_widely_irrelevant_consts
|
blanchet@49339
|
166 |
fun is_boring_bool t =
|
blanchet@49339
|
167 |
not (exists_Const (not o is_boring_const o fst) t) orelse
|
blanchet@49339
|
168 |
exists_type (exists_subtype (curry (op =) @{typ prop})) t
|
blanchet@49339
|
169 |
fun is_boring_prop (@{const Trueprop} $ t) = is_boring_bool t
|
blanchet@49339
|
170 |
| is_boring_prop (@{const "==>"} $ t $ u) =
|
blanchet@49339
|
171 |
is_boring_prop t andalso is_boring_prop u
|
blanchet@49339
|
172 |
| is_boring_prop (Const (@{const_name all}, _) $ (Abs (_, _, t)) $ u) =
|
blanchet@49339
|
173 |
is_boring_prop t andalso is_boring_prop u
|
blanchet@49339
|
174 |
| is_boring_prop (Const (@{const_name "=="}, _) $ t $ u) =
|
blanchet@49339
|
175 |
is_boring_bool t andalso is_boring_bool u
|
blanchet@49339
|
176 |
| is_boring_prop _ = true
|
blanchet@49339
|
177 |
in
|
blanchet@49339
|
178 |
is_boring_prop (prop_of th) andalso not (Thm.eq_thm_prop (@{thm ext}, th))
|
blanchet@49339
|
179 |
end
|
blanchet@49339
|
180 |
|
blanchet@49339
|
181 |
fun theory_ord p =
|
blanchet@49339
|
182 |
if Theory.eq_thy p then
|
blanchet@49339
|
183 |
EQUAL
|
blanchet@49339
|
184 |
else if Theory.subthy p then
|
blanchet@49339
|
185 |
LESS
|
blanchet@49339
|
186 |
else if Theory.subthy (swap p) then
|
blanchet@49339
|
187 |
GREATER
|
blanchet@49339
|
188 |
else case int_ord (pairself (length o Theory.ancestors_of) p) of
|
blanchet@49339
|
189 |
EQUAL => string_ord (pairself Context.theory_name p)
|
blanchet@49339
|
190 |
| order => order
|
blanchet@49339
|
191 |
|
blanchet@49339
|
192 |
val thm_ord = theory_ord o pairself theory_of_thm
|
blanchet@49339
|
193 |
|
blanchet@49341
|
194 |
val bad_types = [@{type_name prop}, @{type_name bool}, @{type_name fun}]
|
blanchet@49341
|
195 |
|
blanchet@49333
|
196 |
fun interesting_terms_types_and_classes ctxt prover term_max_depth
|
blanchet@49333
|
197 |
type_max_depth ts =
|
blanchet@49266
|
198 |
let
|
blanchet@49333
|
199 |
fun is_bad_const (x as (s, _)) args =
|
blanchet@49333
|
200 |
member (op =) atp_logical_consts s orelse
|
blanchet@49333
|
201 |
fst (is_built_in_const_for_prover ctxt prover x args)
|
blanchet@49319
|
202 |
fun add_classes @{sort type} = I
|
blanchet@49319
|
203 |
| add_classes S = union (op =) (map class_name_of S)
|
blanchet@49266
|
204 |
fun do_add_type (Type (s, Ts)) =
|
blanchet@49266
|
205 |
(not (member (op =) bad_types s) ? insert (op =) (type_name_of s))
|
blanchet@49266
|
206 |
#> fold do_add_type Ts
|
blanchet@49319
|
207 |
| do_add_type (TFree (_, S)) = add_classes S
|
blanchet@49319
|
208 |
| do_add_type (TVar (_, S)) = add_classes S
|
blanchet@49266
|
209 |
fun add_type T = type_max_depth >= 0 ? do_add_type T
|
blanchet@49266
|
210 |
fun mk_app s args =
|
blanchet@49266
|
211 |
if member (op <>) args "" then s ^ "(" ^ space_implode "," args ^ ")"
|
blanchet@49266
|
212 |
else s
|
blanchet@49266
|
213 |
fun patternify ~1 _ = ""
|
blanchet@49266
|
214 |
| patternify depth t =
|
blanchet@49266
|
215 |
case strip_comb t of
|
blanchet@49266
|
216 |
(Const (s, _), args) =>
|
blanchet@49266
|
217 |
mk_app (const_name_of s) (map (patternify (depth - 1)) args)
|
blanchet@49266
|
218 |
| _ => ""
|
blanchet@49266
|
219 |
fun add_term_patterns ~1 _ = I
|
blanchet@49266
|
220 |
| add_term_patterns depth t =
|
blanchet@49266
|
221 |
insert (op =) (patternify depth t)
|
blanchet@49266
|
222 |
#> add_term_patterns (depth - 1) t
|
blanchet@49266
|
223 |
val add_term = add_term_patterns term_max_depth
|
blanchet@49266
|
224 |
fun add_patterns t =
|
blanchet@49266
|
225 |
let val (head, args) = strip_comb t in
|
blanchet@49266
|
226 |
(case head of
|
blanchet@49333
|
227 |
Const (x as (_, T)) =>
|
blanchet@49333
|
228 |
not (is_bad_const x args) ? (add_term t #> add_type T)
|
blanchet@49266
|
229 |
| Free (_, T) => add_type T
|
blanchet@49266
|
230 |
| Var (_, T) => add_type T
|
blanchet@49266
|
231 |
| Abs (_, T, body) => add_type T #> add_patterns body
|
blanchet@49266
|
232 |
| _ => I)
|
blanchet@49266
|
233 |
#> fold add_patterns args
|
blanchet@49266
|
234 |
end
|
blanchet@49341
|
235 |
in [] |> fold add_patterns ts end
|
blanchet@49266
|
236 |
|
blanchet@49266
|
237 |
fun is_exists (s, _) = (s = @{const_name Ex} orelse s = @{const_name Ex1})
|
blanchet@49266
|
238 |
|
blanchet@49312
|
239 |
val term_max_depth = 1
|
blanchet@49312
|
240 |
val type_max_depth = 1
|
blanchet@49266
|
241 |
|
blanchet@49266
|
242 |
(* TODO: Generate type classes for types? *)
|
blanchet@49333
|
243 |
fun features_of ctxt prover thy status ts =
|
blanchet@49318
|
244 |
thy_feature_name_of (Context.theory_name thy) ::
|
blanchet@49333
|
245 |
interesting_terms_types_and_classes ctxt prover term_max_depth type_max_depth
|
blanchet@49333
|
246 |
ts
|
blanchet@49317
|
247 |
|> exists (not o is_lambda_free) ts ? cons "lambdas"
|
blanchet@49317
|
248 |
|> exists (exists_Const is_exists) ts ? cons "skolems"
|
blanchet@49317
|
249 |
|> (case status of
|
blanchet@49317
|
250 |
General => I
|
blanchet@49317
|
251 |
| Induction => cons "induction"
|
blanchet@49317
|
252 |
| Intro => cons "intro"
|
blanchet@49317
|
253 |
| Inductive => cons "inductive"
|
blanchet@49317
|
254 |
| Elim => cons "elim"
|
blanchet@49317
|
255 |
| Simp => cons "simp"
|
blanchet@49317
|
256 |
| Def => cons "def")
|
blanchet@49266
|
257 |
|
blanchet@49341
|
258 |
fun isabelle_dependencies_of all_facts = thms_in_proof (SOME all_facts)
|
blanchet@49266
|
259 |
|
blanchet@49266
|
260 |
val freezeT = Type.legacy_freeze_type
|
blanchet@49266
|
261 |
|
blanchet@49266
|
262 |
fun freeze (t $ u) = freeze t $ freeze u
|
blanchet@49266
|
263 |
| freeze (Abs (s, T, t)) = Abs (s, freezeT T, freeze t)
|
blanchet@49266
|
264 |
| freeze (Var ((s, _), T)) = Free (s, freezeT T)
|
blanchet@49266
|
265 |
| freeze (Const (s, T)) = Const (s, freezeT T)
|
blanchet@49266
|
266 |
| freeze (Free (s, T)) = Free (s, freezeT T)
|
blanchet@49266
|
267 |
| freeze t = t
|
blanchet@49266
|
268 |
|
blanchet@49266
|
269 |
fun goal_of_thm thy = prop_of #> freeze #> cterm_of thy #> Goal.init
|
blanchet@49266
|
270 |
|
blanchet@49336
|
271 |
fun run_prover_for_mash ctxt params prover facts goal =
|
blanchet@49266
|
272 |
let
|
blanchet@49266
|
273 |
val problem =
|
blanchet@49266
|
274 |
{state = Proof.init ctxt, goal = goal, subgoal = 1, subgoal_count = 1,
|
blanchet@49304
|
275 |
facts = facts |> map (apfst (apfst (fn name => name ())))
|
blanchet@49333
|
276 |
|> map Untranslated_Fact}
|
blanchet@49336
|
277 |
val prover = get_minimizing_prover ctxt Normal (K ()) prover
|
blanchet@49266
|
278 |
in prover params (K (K (K ""))) problem end
|
blanchet@49266
|
279 |
|
blanchet@49266
|
280 |
|
blanchet@49317
|
281 |
(*** Low-level communication with MaSh ***)
|
blanchet@49317
|
282 |
|
blanchet@49338
|
283 |
fun write_file (xs, f) file =
|
blanchet@49333
|
284 |
let val path = Path.explode file in
|
blanchet@49338
|
285 |
File.write path "";
|
blanchet@49338
|
286 |
xs |> chunk_list 500
|
blanchet@49338
|
287 |
|> List.app (File.append path o space_implode "" o map f)
|
blanchet@49333
|
288 |
end
|
blanchet@49331
|
289 |
|
blanchet@49331
|
290 |
fun mash_info overlord =
|
blanchet@49331
|
291 |
if overlord then (getenv "ISABELLE_HOME_USER", "")
|
blanchet@49331
|
292 |
else (getenv "ISABELLE_TMP", serial_string ())
|
blanchet@49331
|
293 |
|
blanchet@49331
|
294 |
fun run_mash ctxt (temp_dir, serial) core =
|
blanchet@49326
|
295 |
let
|
blanchet@49331
|
296 |
val log_file = temp_dir ^ "/mash_log" ^ serial
|
blanchet@49331
|
297 |
val err_file = temp_dir ^ "/mash_err" ^ serial
|
blanchet@49326
|
298 |
val command =
|
blanchet@49331
|
299 |
mash_home () ^ "/mash.py --quiet --outputDir " ^ mash_state_dir () ^
|
blanchet@49331
|
300 |
" --log " ^ log_file ^ " " ^ core ^ " 2>&1 > " ^ err_file
|
blanchet@49331
|
301 |
in
|
blanchet@49331
|
302 |
trace_msg ctxt (fn () => "Running " ^ command);
|
blanchet@49338
|
303 |
write_file ([], K "") log_file;
|
blanchet@49338
|
304 |
write_file ([], K "") err_file;
|
blanchet@49331
|
305 |
Isabelle_System.bash command; ()
|
blanchet@49331
|
306 |
end
|
blanchet@49326
|
307 |
|
blanchet@49331
|
308 |
fun run_mash_init ctxt overlord write_access write_feats write_deps =
|
blanchet@49331
|
309 |
let
|
blanchet@49331
|
310 |
val info as (temp_dir, serial) = mash_info overlord
|
blanchet@49331
|
311 |
val in_dir = temp_dir ^ "/mash_init" ^ serial
|
blanchet@49331
|
312 |
|> tap (Isabelle_System.mkdir o Path.explode)
|
blanchet@49331
|
313 |
in
|
blanchet@49331
|
314 |
write_file write_access (in_dir ^ "/mash_accessibility");
|
blanchet@49331
|
315 |
write_file write_feats (in_dir ^ "/mash_features");
|
blanchet@49331
|
316 |
write_file write_deps (in_dir ^ "/mash_dependencies");
|
blanchet@49331
|
317 |
run_mash ctxt info ("--init --inputDir " ^ in_dir)
|
blanchet@49331
|
318 |
end
|
blanchet@49331
|
319 |
|
blanchet@49333
|
320 |
fun run_mash_commands ctxt overlord save max_suggs write_cmds read_suggs =
|
blanchet@49331
|
321 |
let
|
blanchet@49331
|
322 |
val info as (temp_dir, serial) = mash_info overlord
|
blanchet@49333
|
323 |
val sugg_file = temp_dir ^ "/mash_suggs" ^ serial
|
blanchet@49331
|
324 |
val cmd_file = temp_dir ^ "/mash_commands" ^ serial
|
blanchet@49331
|
325 |
in
|
blanchet@49338
|
326 |
write_file ([], K "") sugg_file;
|
blanchet@49331
|
327 |
write_file write_cmds cmd_file;
|
blanchet@49331
|
328 |
run_mash ctxt info
|
blanchet@49333
|
329 |
("--inputFile " ^ cmd_file ^ " --predictions " ^ sugg_file ^
|
blanchet@49333
|
330 |
" --numberOfPredictions " ^ string_of_int max_suggs ^
|
blanchet@49331
|
331 |
(if save then " --saveModel" else ""));
|
blanchet@49333
|
332 |
read_suggs (fn () => File.read_lines (Path.explode sugg_file))
|
blanchet@49331
|
333 |
end
|
blanchet@49331
|
334 |
|
blanchet@49331
|
335 |
fun str_of_update (name, parents, feats, deps) =
|
blanchet@49331
|
336 |
"! " ^ escape_meta name ^ ": " ^ escape_metas parents ^ "; " ^
|
blanchet@49326
|
337 |
escape_metas feats ^ "; " ^ escape_metas deps ^ "\n"
|
blanchet@49326
|
338 |
|
blanchet@49331
|
339 |
fun str_of_query (parents, feats) =
|
blanchet@49331
|
340 |
"? " ^ escape_metas parents ^ "; " ^ escape_metas feats
|
blanchet@49331
|
341 |
|
blanchet@49331
|
342 |
fun init_str_of_update get (upd as (name, _, _, _)) =
|
blanchet@49331
|
343 |
escape_meta name ^ ": " ^ escape_metas (get upd) ^ "\n"
|
blanchet@49326
|
344 |
|
blanchet@49323
|
345 |
fun mash_RESET ctxt =
|
blanchet@49329
|
346 |
let val path = mash_state_dir () |> Path.explode in
|
blanchet@49324
|
347 |
trace_msg ctxt (K "MaSh RESET");
|
blanchet@49324
|
348 |
File.fold_dir (fn file => fn () =>
|
blanchet@49324
|
349 |
File.rm (Path.append path (Path.basic file)))
|
blanchet@49324
|
350 |
path ()
|
blanchet@49324
|
351 |
end
|
blanchet@49317
|
352 |
|
blanchet@49331
|
353 |
fun mash_INIT ctxt _ [] = mash_RESET ctxt
|
blanchet@49331
|
354 |
| mash_INIT ctxt overlord upds =
|
blanchet@49331
|
355 |
(trace_msg ctxt (fn () => "MaSh INIT " ^
|
blanchet@49331
|
356 |
elide_string 1000 (space_implode " " (map #1 upds)));
|
blanchet@49338
|
357 |
run_mash_init ctxt overlord (upds, init_str_of_update #2)
|
blanchet@49338
|
358 |
(upds, init_str_of_update #3) (upds, init_str_of_update #4))
|
blanchet@49317
|
359 |
|
blanchet@49331
|
360 |
fun mash_ADD _ _ [] = ()
|
blanchet@49331
|
361 |
| mash_ADD ctxt overlord upds =
|
blanchet@49331
|
362 |
(trace_msg ctxt (fn () => "MaSh ADD " ^
|
blanchet@49331
|
363 |
elide_string 1000 (space_implode " " (map #1 upds)));
|
blanchet@49338
|
364 |
run_mash_commands ctxt overlord true 0 (upds, str_of_update) (K ()))
|
blanchet@49317
|
365 |
|
blanchet@49333
|
366 |
fun mash_QUERY ctxt overlord max_suggs (query as (_, feats)) =
|
blanchet@49329
|
367 |
(trace_msg ctxt (fn () => "MaSh QUERY " ^ space_implode " " feats);
|
blanchet@49333
|
368 |
run_mash_commands ctxt overlord false max_suggs
|
blanchet@49338
|
369 |
([query], str_of_query)
|
blanchet@49333
|
370 |
(fn suggs => snd (extract_query (List.last (suggs ()))))
|
blanchet@49326
|
371 |
handle List.Empty => [])
|
blanchet@49317
|
372 |
|
blanchet@49317
|
373 |
|
blanchet@49266
|
374 |
(*** High-level communication with MaSh ***)
|
blanchet@49266
|
375 |
|
blanchet@49336
|
376 |
fun try_graph ctxt when def f =
|
blanchet@49336
|
377 |
f ()
|
blanchet@49336
|
378 |
handle Graph.CYCLES (cycle :: _) =>
|
blanchet@49336
|
379 |
(trace_msg ctxt (fn () =>
|
blanchet@49336
|
380 |
"Cycle involving " ^ commas cycle ^ " when " ^ when); def)
|
blanchet@49336
|
381 |
| Graph.UNDEF name =>
|
blanchet@49336
|
382 |
(trace_msg ctxt (fn () =>
|
blanchet@49336
|
383 |
"Unknown fact " ^ quote name ^ " when " ^ when); def)
|
blanchet@49336
|
384 |
|
blanchet@49316
|
385 |
type mash_state =
|
blanchet@49331
|
386 |
{thys : bool Symtab.table,
|
blanchet@49331
|
387 |
fact_graph : unit Graph.T}
|
blanchet@49264
|
388 |
|
blanchet@49331
|
389 |
val empty_state = {thys = Symtab.empty, fact_graph = Graph.empty}
|
blanchet@49316
|
390 |
|
blanchet@49316
|
391 |
local
|
blanchet@49316
|
392 |
|
blanchet@49336
|
393 |
fun mash_load _ (state as (true, _)) = state
|
blanchet@49336
|
394 |
| mash_load ctxt _ =
|
blanchet@49324
|
395 |
let val path = mash_state_path () in
|
blanchet@49317
|
396 |
(true,
|
blanchet@49317
|
397 |
case try File.read_lines path of
|
blanchet@49331
|
398 |
SOME (comp_thys :: incomp_thys :: fact_lines) =>
|
blanchet@49317
|
399 |
let
|
blanchet@49331
|
400 |
fun add_thy comp thy = Symtab.update (thy, comp)
|
blanchet@49337
|
401 |
fun add_edge_to name parent =
|
blanchet@49337
|
402 |
Graph.default_node (parent, ())
|
blanchet@49337
|
403 |
#> Graph.add_edge (parent, name)
|
blanchet@49331
|
404 |
fun add_fact_line line =
|
blanchet@49331
|
405 |
case extract_query line of
|
blanchet@49331
|
406 |
("", _) => I (* shouldn't happen *)
|
blanchet@49331
|
407 |
| (name, parents) =>
|
blanchet@49331
|
408 |
Graph.default_node (name, ())
|
blanchet@49337
|
409 |
#> fold (add_edge_to name) parents
|
blanchet@49331
|
410 |
val thys =
|
blanchet@49331
|
411 |
Symtab.empty |> fold (add_thy true) (unescape_metas comp_thys)
|
blanchet@49331
|
412 |
|> fold (add_thy false) (unescape_metas incomp_thys)
|
blanchet@49336
|
413 |
val fact_graph =
|
blanchet@49337
|
414 |
try_graph ctxt "loading state" Graph.empty (fn () =>
|
blanchet@49336
|
415 |
Graph.empty |> fold add_fact_line fact_lines)
|
blanchet@49331
|
416 |
in {thys = thys, fact_graph = fact_graph} end
|
blanchet@49319
|
417 |
| _ => empty_state)
|
blanchet@49317
|
418 |
end
|
blanchet@49316
|
419 |
|
blanchet@49331
|
420 |
fun mash_save ({thys, fact_graph, ...} : mash_state) =
|
blanchet@49316
|
421 |
let
|
blanchet@49324
|
422 |
val path = mash_state_path ()
|
blanchet@49331
|
423 |
val thys = Symtab.dest thys
|
blanchet@49333
|
424 |
val line_for_thys = escape_metas o AList.find (op =) thys
|
blanchet@49333
|
425 |
fun fact_line_for name parents =
|
blanchet@49333
|
426 |
escape_meta name ^ ": " ^ escape_metas parents
|
blanchet@49331
|
427 |
val append_fact = File.append path o suffix "\n" oo fact_line_for
|
blanchet@49316
|
428 |
in
|
blanchet@49331
|
429 |
File.write path (line_for_thys true ^ "\n" ^ line_for_thys false ^ "\n");
|
blanchet@49331
|
430 |
Graph.fold (fn (name, ((), (parents, _))) => fn () =>
|
blanchet@49331
|
431 |
append_fact name (Graph.Keys.dest parents))
|
blanchet@49331
|
432 |
fact_graph ()
|
blanchet@49316
|
433 |
end
|
blanchet@49316
|
434 |
|
blanchet@49317
|
435 |
val global_state =
|
blanchet@49319
|
436 |
Synchronized.var "Sledgehammer_Filter_MaSh.global_state" (false, empty_state)
|
blanchet@49316
|
437 |
|
blanchet@49316
|
438 |
in
|
blanchet@49316
|
439 |
|
blanchet@49336
|
440 |
fun mash_map ctxt f =
|
blanchet@49336
|
441 |
Synchronized.change global_state (mash_load ctxt ##> (f #> tap mash_save))
|
blanchet@49316
|
442 |
|
blanchet@49336
|
443 |
fun mash_get ctxt =
|
blanchet@49336
|
444 |
Synchronized.change_result global_state (mash_load ctxt #> `snd)
|
blanchet@49317
|
445 |
|
blanchet@49323
|
446 |
fun mash_reset ctxt =
|
blanchet@49317
|
447 |
Synchronized.change global_state (fn _ =>
|
blanchet@49324
|
448 |
(mash_RESET ctxt; File.write (mash_state_path ()) "";
|
blanchet@49323
|
449 |
(true, empty_state)))
|
blanchet@49316
|
450 |
|
blanchet@49316
|
451 |
end
|
blanchet@49316
|
452 |
|
blanchet@49333
|
453 |
fun mash_could_suggest_facts () = mash_home () <> ""
|
blanchet@49336
|
454 |
fun mash_can_suggest_facts ctxt =
|
blanchet@49336
|
455 |
not (Graph.is_empty (#fact_graph (mash_get ctxt)))
|
blanchet@49264
|
456 |
|
blanchet@49336
|
457 |
fun parents_wrt_facts ctxt facts fact_graph =
|
blanchet@49331
|
458 |
let
|
blanchet@49333
|
459 |
val graph_facts = Symtab.make (map (rpair ()) (Graph.keys fact_graph))
|
blanchet@49331
|
460 |
val facts =
|
blanchet@49336
|
461 |
try_graph ctxt "when computing ancestor facts" [] (fn () =>
|
blanchet@49336
|
462 |
[] |> fold (cons o Thm.get_name_hint o snd) facts
|
blanchet@49336
|
463 |
|> filter (Symtab.defined graph_facts)
|
blanchet@49336
|
464 |
|> Graph.all_preds fact_graph)
|
blanchet@49333
|
465 |
val facts = Symtab.empty |> fold (fn name => Symtab.update (name, ())) facts
|
blanchet@49336
|
466 |
in
|
blanchet@49336
|
467 |
try_graph ctxt "when computing parent facts" [] (fn () =>
|
blanchet@49336
|
468 |
fact_graph |> Graph.restrict (Symtab.defined facts) |> Graph.maximals)
|
blanchet@49336
|
469 |
end
|
blanchet@49331
|
470 |
|
blanchet@49333
|
471 |
(* Generate more suggestions than requested, because some might be thrown out
|
blanchet@49333
|
472 |
later for various reasons and "meshing" gives better results with some
|
blanchet@49333
|
473 |
slack. *)
|
blanchet@49333
|
474 |
fun max_suggs_of max_facts = max_facts + Int.min (200, max_facts)
|
blanchet@49333
|
475 |
|
blanchet@49335
|
476 |
fun is_fact_in_graph fact_graph (_, th) =
|
blanchet@49335
|
477 |
can (Graph.get_node fact_graph) (Thm.get_name_hint th)
|
blanchet@49335
|
478 |
|
blanchet@49333
|
479 |
fun mash_suggest_facts ctxt ({overlord, ...} : params) prover max_facts hyp_ts
|
blanchet@49333
|
480 |
concl_t facts =
|
blanchet@49316
|
481 |
let
|
blanchet@49317
|
482 |
val thy = Proof_Context.theory_of ctxt
|
blanchet@49336
|
483 |
val fact_graph = #fact_graph (mash_get ctxt)
|
blanchet@49336
|
484 |
val parents = parents_wrt_facts ctxt facts fact_graph
|
blanchet@49333
|
485 |
val feats = features_of ctxt prover thy General (concl_t :: hyp_ts)
|
blanchet@49333
|
486 |
val suggs =
|
blanchet@49335
|
487 |
if Graph.is_empty fact_graph then []
|
blanchet@49335
|
488 |
else mash_QUERY ctxt overlord (max_suggs_of max_facts) (parents, feats)
|
blanchet@49335
|
489 |
val selected = facts |> suggested_facts suggs
|
blanchet@49335
|
490 |
val unknown = facts |> filter_out (is_fact_in_graph fact_graph)
|
blanchet@49335
|
491 |
in (selected, unknown) end
|
blanchet@49264
|
492 |
|
blanchet@49331
|
493 |
fun add_thys_for thy =
|
blanchet@49331
|
494 |
let fun add comp thy = Symtab.update (Context.theory_name thy, comp) in
|
blanchet@49331
|
495 |
add false thy #> fold (add true) (Theory.ancestors_of thy)
|
blanchet@49331
|
496 |
end
|
blanchet@49319
|
497 |
|
blanchet@49331
|
498 |
fun update_fact_graph ctxt (name, parents, feats, deps) (upds, graph) =
|
blanchet@49331
|
499 |
let
|
blanchet@49331
|
500 |
fun maybe_add_from from (accum as (parents, graph)) =
|
blanchet@49336
|
501 |
try_graph ctxt "updating graph" accum (fn () =>
|
blanchet@49336
|
502 |
(from :: parents, Graph.add_edge_acyclic (from, name) graph))
|
blanchet@49336
|
503 |
val graph = graph |> Graph.default_node (name, ())
|
blanchet@49331
|
504 |
val (parents, graph) = ([], graph) |> fold maybe_add_from parents
|
blanchet@49331
|
505 |
val (deps, graph) = ([], graph) |> fold maybe_add_from deps
|
blanchet@49331
|
506 |
in ((name, parents, feats, deps) :: upds, graph) end
|
blanchet@49321
|
507 |
|
blanchet@49333
|
508 |
val pass1_learn_timeout_factor = 0.5
|
blanchet@49333
|
509 |
|
blanchet@49333
|
510 |
(* The timeout is understood in a very slack fashion. *)
|
blanchet@49334
|
511 |
fun mash_learn_thy ctxt ({provers, verbose, overlord, ...} : params) thy timeout
|
blanchet@49334
|
512 |
facts =
|
blanchet@49319
|
513 |
let
|
blanchet@49333
|
514 |
val timer = Timer.startRealTimer ()
|
blanchet@49333
|
515 |
val prover = hd provers
|
blanchet@49333
|
516 |
fun timed_out frac =
|
blanchet@49333
|
517 |
Time.> (Timer.checkRealTimer timer, time_mult frac timeout)
|
blanchet@49336
|
518 |
val {fact_graph, ...} = mash_get ctxt
|
blanchet@49335
|
519 |
val new_facts =
|
blanchet@49335
|
520 |
facts |> filter_out (is_fact_in_graph fact_graph)
|
blanchet@49335
|
521 |
|> sort (thm_ord o pairself snd)
|
blanchet@49323
|
522 |
in
|
blanchet@49323
|
523 |
if null new_facts then
|
blanchet@49334
|
524 |
""
|
blanchet@49323
|
525 |
else
|
blanchet@49319
|
526 |
let
|
blanchet@49323
|
527 |
val ths = facts |> map snd
|
blanchet@49330
|
528 |
val all_names =
|
blanchet@49339
|
529 |
ths |> filter_out is_likely_tautology_or_too_meta
|
blanchet@49331
|
530 |
|> map (rpair () o Thm.get_name_hint)
|
blanchet@49331
|
531 |
|> Symtab.make
|
blanchet@49333
|
532 |
fun do_fact _ (accum as (_, true)) = accum
|
blanchet@49333
|
533 |
| do_fact ((_, (_, status)), th) ((parents, upds), false) =
|
blanchet@49333
|
534 |
let
|
blanchet@49333
|
535 |
val name = Thm.get_name_hint th
|
blanchet@49333
|
536 |
val feats = features_of ctxt prover thy status [prop_of th]
|
blanchet@49333
|
537 |
val deps = isabelle_dependencies_of all_names th
|
blanchet@49333
|
538 |
val upd = (name, parents, feats, deps)
|
blanchet@49333
|
539 |
in (([name], upd :: upds), timed_out pass1_learn_timeout_factor) end
|
blanchet@49336
|
540 |
val parents = parents_wrt_facts ctxt facts fact_graph
|
blanchet@49333
|
541 |
val ((_, upds), _) =
|
blanchet@49333
|
542 |
((parents, []), false) |> fold do_fact new_facts |>> apsnd rev
|
blanchet@49333
|
543 |
val n = length upds
|
blanchet@49331
|
544 |
fun trans {thys, fact_graph} =
|
blanchet@49331
|
545 |
let
|
blanchet@49331
|
546 |
val mash_INIT_or_ADD =
|
blanchet@49331
|
547 |
if Graph.is_empty fact_graph then mash_INIT else mash_ADD
|
blanchet@49331
|
548 |
val (upds, fact_graph) =
|
blanchet@49331
|
549 |
([], fact_graph) |> fold (update_fact_graph ctxt) upds
|
blanchet@49331
|
550 |
in
|
blanchet@49331
|
551 |
(mash_INIT_or_ADD ctxt overlord (rev upds);
|
blanchet@49331
|
552 |
{thys = thys |> add_thys_for thy,
|
blanchet@49331
|
553 |
fact_graph = fact_graph})
|
blanchet@49331
|
554 |
end
|
blanchet@49333
|
555 |
in
|
blanchet@49336
|
556 |
mash_map ctxt trans;
|
blanchet@49334
|
557 |
if verbose then
|
blanchet@49334
|
558 |
"Processed " ^ string_of_int n ^ " proof" ^ plural_s n ^
|
blanchet@49334
|
559 |
(if verbose then
|
blanchet@49334
|
560 |
" in " ^ string_from_time (Timer.checkRealTimer timer)
|
blanchet@49334
|
561 |
else
|
blanchet@49334
|
562 |
"") ^ "."
|
blanchet@49334
|
563 |
else
|
blanchet@49334
|
564 |
""
|
blanchet@49333
|
565 |
end
|
blanchet@49323
|
566 |
end
|
blanchet@49319
|
567 |
|
blanchet@49336
|
568 |
fun mash_learn_proof ctxt ({provers, overlord, ...} : params) t facts used_ths =
|
blanchet@49331
|
569 |
let
|
blanchet@49331
|
570 |
val thy = Proof_Context.theory_of ctxt
|
blanchet@49333
|
571 |
val prover = hd provers
|
blanchet@49342
|
572 |
val name = ATP_Util.timestamp () ^ " " ^ serial_string () (* fresh enough *)
|
blanchet@49333
|
573 |
val feats = features_of ctxt prover thy General [t]
|
blanchet@49331
|
574 |
val deps = used_ths |> map Thm.get_name_hint
|
blanchet@49331
|
575 |
in
|
blanchet@49336
|
576 |
mash_map ctxt (fn {thys, fact_graph} =>
|
blanchet@49324
|
577 |
let
|
blanchet@49336
|
578 |
val parents = parents_wrt_facts ctxt facts fact_graph
|
blanchet@49331
|
579 |
val upds = [(name, parents, feats, deps)]
|
blanchet@49331
|
580 |
val (upds, fact_graph) =
|
blanchet@49331
|
581 |
([], fact_graph) |> fold (update_fact_graph ctxt) upds
|
blanchet@49324
|
582 |
in
|
blanchet@49331
|
583 |
mash_ADD ctxt overlord upds;
|
blanchet@49331
|
584 |
{thys = thys, fact_graph = fact_graph}
|
blanchet@49331
|
585 |
end)
|
blanchet@49331
|
586 |
end
|
blanchet@49264
|
587 |
|
blanchet@49333
|
588 |
(* The threshold should be large enough so that MaSh doesn't kick in for Auto
|
blanchet@49333
|
589 |
Sledgehammer and Try. *)
|
blanchet@49333
|
590 |
val min_secs_for_learning = 15
|
blanchet@49342
|
591 |
val learn_timeout_factor = 2.0
|
blanchet@49333
|
592 |
|
blanchet@49336
|
593 |
fun relevant_facts ctxt (params as {learn, fact_filter, timeout, ...}) prover
|
blanchet@49336
|
594 |
max_facts ({add, only, ...} : fact_override) hyp_ts concl_t facts =
|
blanchet@49329
|
595 |
if not (subset (op =) (the_list fact_filter, fact_filters)) then
|
blanchet@49329
|
596 |
error ("Unknown fact filter: " ^ quote (the fact_filter) ^ ".")
|
blanchet@49329
|
597 |
else if only then
|
blanchet@49304
|
598 |
facts
|
blanchet@49336
|
599 |
else if max_facts <= 0 orelse null facts then
|
blanchet@49303
|
600 |
[]
|
blanchet@49303
|
601 |
else
|
blanchet@49303
|
602 |
let
|
blanchet@49333
|
603 |
val thy = Proof_Context.theory_of ctxt
|
blanchet@49342
|
604 |
fun maybe_learn () =
|
blanchet@49336
|
605 |
if not learn orelse Async_Manager.has_running_threads MaShN then
|
blanchet@49334
|
606 |
()
|
blanchet@49334
|
607 |
else if Time.toSeconds timeout >= min_secs_for_learning then
|
blanchet@49334
|
608 |
let
|
blanchet@49342
|
609 |
val soft_timeout = time_mult learn_timeout_factor timeout
|
blanchet@49342
|
610 |
val hard_timeout = time_mult 4.0 soft_timeout
|
blanchet@49334
|
611 |
val birth_time = Time.now ()
|
blanchet@49334
|
612 |
val death_time = Time.+ (birth_time, hard_timeout)
|
blanchet@49334
|
613 |
val desc = ("machine learner for Sledgehammer", "")
|
blanchet@49334
|
614 |
in
|
blanchet@49334
|
615 |
Async_Manager.launch MaShN birth_time death_time desc
|
blanchet@49334
|
616 |
(fn () =>
|
blanchet@49334
|
617 |
(true, mash_learn_thy ctxt params thy soft_timeout facts))
|
blanchet@49334
|
618 |
end
|
blanchet@49333
|
619 |
else
|
blanchet@49333
|
620 |
()
|
blanchet@49329
|
621 |
val fact_filter =
|
blanchet@49329
|
622 |
case fact_filter of
|
blanchet@49342
|
623 |
SOME ff => (() |> ff <> iterN ? maybe_learn; ff)
|
blanchet@49333
|
624 |
| NONE =>
|
blanchet@49342
|
625 |
if mash_can_suggest_facts ctxt then (maybe_learn (); meshN)
|
blanchet@49342
|
626 |
else if mash_could_suggest_facts () then (maybe_learn (); iterN)
|
blanchet@49333
|
627 |
else iterN
|
blanchet@49303
|
628 |
val add_ths = Attrib.eval_thms ctxt add
|
blanchet@49307
|
629 |
fun prepend_facts ths accepts =
|
blanchet@49303
|
630 |
((facts |> filter (member Thm.eq_thm_prop ths o snd)) @
|
blanchet@49307
|
631 |
(accepts |> filter_out (member Thm.eq_thm_prop ths o snd)))
|
blanchet@49308
|
632 |
|> take max_facts
|
blanchet@49329
|
633 |
fun iter () =
|
blanchet@49313
|
634 |
iterative_relevant_facts ctxt params prover max_facts NONE hyp_ts
|
blanchet@49313
|
635 |
concl_t facts
|
blanchet@49329
|
636 |
fun mash () =
|
blanchet@49335
|
637 |
mash_suggest_facts ctxt params prover max_facts hyp_ts concl_t facts
|
blanchet@49329
|
638 |
val mess =
|
blanchet@49335
|
639 |
[] |> (if fact_filter <> mashN then cons (iter (), []) else I)
|
blanchet@49329
|
640 |
|> (if fact_filter <> iterN then cons (mash ()) else I)
|
blanchet@49303
|
641 |
in
|
blanchet@49328
|
642 |
mesh_facts max_facts mess
|
blanchet@49303
|
643 |
|> not (null add_ths) ? prepend_facts add_ths
|
blanchet@49303
|
644 |
end
|
blanchet@49303
|
645 |
|
blanchet@49334
|
646 |
fun kill_learners () = Async_Manager.kill_threads MaShN "learner"
|
blanchet@49334
|
647 |
fun running_learners () = Async_Manager.running_threads MaShN "learner"
|
blanchet@49334
|
648 |
|
blanchet@49263
|
649 |
end;
|