6 let bomb = ref(`Var(-1,-666));;
10 ; div: i_var option (* None = bomb *)
11 ; conv: i_n_var list (* the inerts that must converge *)
12 ; ps: i_n_var list (* the n-th inert must become n *)
13 ; sigma: (int * nf) list (* the computed substitution *)
14 ; deltas: (int * nf) list ref list (* collection of all branches *)
15 ; initialSpecialK: int
19 (match p.div with None -> [] | Some t -> [(t :> i_n_var)])
24 let problem_measure p = 0 ;;
26 let print_problem label ({freshno; div; conv; ps; deltas} as p) =
27 Console.print_hline ();
28 prerr_endline ("\n||||| Displaying problem: " ^ label ^ " |||||");
30 let deltas = String.concat nl (List.map (fun r -> String.concat " <> " (List.map (fun (i,_) -> string_of_int i) !r)) deltas) in
31 let l = Array.to_list (Array.init (freshno + 1) string_of_var) in
32 nl ^ "measure="^string_of_int(problem_measure p)^" freshno = " ^ string_of_int freshno
33 ^ nl ^ "\b> DISCRIMINATING SETS (deltas)"
34 ^ nl ^ deltas ^ (if deltas = "" then "" else nl)
35 ^ "\b> DIVERGENT" ^ nl
36 ^ "*: " ^ (match div with None -> "*" | Some div -> print ~l (div :> nf)) ^ "\n| "
37 ^ "\b> CONVERGENT" ^ nl
38 ^ String.concat "\n| " (List.map (fun t -> "_: " ^ (if t = `N (-1) then "_" else print ~l (t :> nf))) conv) ^
39 (if conv = [] then "" else "\n| ")
41 ^ String.concat "\n| " (List.mapi (fun i t -> string_of_int i ^ ": " ^ print ~l (t :> nf)) ps)
46 let failwithProblem p reason =
47 print_endline (print_problem "FAIL" p);
51 let make_fresh_var p arity =
52 let freshno = p.freshno + 1 in
53 {p with freshno}, `Var(freshno,arity)
56 let make_fresh_vars p arities =
58 (fun arity (p, vars) -> let p, var = make_fresh_var p arity in p, var::vars)
63 let simple_expand_match ps =
64 let rec aux level = function
65 | #i_num_var as t -> aux_i_num_var level t
66 | `Lam(b,t) -> `Lam(b,aux (level+1) t)
67 and aux_i_num_var level = function
68 | `Match(u,v,bs_lift,bs,args) as torig ->
69 let u = aux_i_num_var level u in
70 bs := List.map (fun (n, x) -> n, aux 0 x) !bs;
74 let i = index_of (lift (-level) u) (ps :> nf list) (* can raise Not_found *)
75 in let t = mk_match (`N i) v bs_lift bs args in
79 | _ -> raise Not_found)
81 `Match(cast_to_i_num_var u,v,bs_lift,bs,List.map (aux level) args))
82 | `I(v,args) -> `I(v,Listx.map (aux level) args)
83 | `N _ | `Var _ as t -> t
88 let rec aux x = let x' = f x in if x <> x' then aux x' else x in aux
91 let rec super_simplify_ps ps =
92 fixpoint (List.map (cast_to_i_num_var ++ (simple_expand_match ps)))
95 let super_simplify ({div; ps; conv} as p) =
96 let ps = super_simplify_ps p.ps (p.ps :> i_num_var list) in
97 let conv = super_simplify_ps ps (p.conv :> i_num_var list) in
98 let div = option_map (fun div ->
99 let divs = super_simplify_ps p.ps ([div] :> i_num_var list) in
101 {p with div=option_map cast_to_i_var div; ps=List.map cast_to_i_n_var ps; conv=List.map cast_to_i_n_var conv}
103 exception ExpandedToLambda;;
105 let subst_in_problem x inst ({freshno; div; conv; ps; sigma} as p) =
106 let len_ps = List.length ps in
107 (*(let l = Array.to_list (Array.init (freshno + 1) string_of_var) in
108 prerr_endline ("# INST0: " ^ string_of_var x ^ " := " ^ print ~l inst));*)
109 let rec aux ((freshno,acc_ps,acc_new_ps) as acc) =
113 (*prerr_endline ("EXPAND t:" ^ print (t :> nf));*)
114 let t = subst false false x inst (t :> nf) in
115 (*prerr_endline ("SUBSTITUTED t:" ^ print (t :> nf));*)
116 let freshno,new_t,acc_new_ps =
117 expand_match (freshno,acc_ps@`Var(max_int/3,-666)::todo_ps,acc_new_ps) t
119 aux (freshno,acc_ps@[new_t],acc_new_ps) todo_ps
121 (* cut&paste from aux above *)
122 and aux' ps ((freshno,acc_conv,acc_new_ps) as acc) =
126 (*prerr_endline ("EXPAND t:" ^ print (t :> nf));*)
128 let t = subst false false x inst (t :> nf) in
129 (*prerr_endline ("SUBSTITUTED t:" ^ print (t :> nf));*)
130 let freshno,new_t,acc_new_ps =
131 expand_match (freshno,ps,acc_new_ps) t
133 aux' ps (freshno,acc_conv@[new_t],acc_new_ps) todo_conv
134 (* with ExpandedToLambda -> aux' ps (freshno,acc_conv@[`N(-1)],acc_new_ps) todo_conv *)
136 (* cut&paste from aux' above *)
137 and aux'' ps (freshno,acc_new_ps) =
139 | None -> freshno, None, acc_new_ps
141 let t = subst false false x inst (t :> nf) in
142 let freshno,new_t,acc_new_ps =
143 expand_match (freshno,ps,acc_new_ps) t
145 freshno,Some new_t,acc_new_ps
147 and expand_match ((freshno,acc_ps,acc_new_ps) as acc) t =
149 | `Match(u',orig,bs_lift,bs,args) ->
150 let freshno,u,acc_new_ps = expand_match acc (u' :> nf) in
153 | `N i -> acc_new_ps,i
155 let ps = List.map (fun t -> cast_to_i_num_var (subst false false x inst (t:> nf))) (acc_ps@acc_new_ps) in
156 let super_simplified_ps = super_simplify_ps ps ps in
157 (*prerr_endline ("CERCO u:" ^ print (fst u :> nf));
158 List.iter (fun x -> prerr_endline ("IN: " ^ print (fst x :> nf))) ps;
159 List.iter (fun x -> prerr_endline ("IN2: " ^ print (fst x :> nf))) super_simplified_ps;*)
160 match index_of_opt ~eq:eta_eq super_simplified_ps u with
161 Some i -> acc_new_ps, i
162 | None -> acc_new_ps@[u], len_ps + List.length acc_new_ps
165 if List.exists (fun (j,_) -> i=j) !bs then
168 let freshno,v = freshno+1, `Var (freshno+1, snd orig - 1) in (* make_fresh_var freshno in *)
171 (*prerr_endlie ("t DA RIDURRE:" ^ print (`Match(`N i,arity,bs_lift,bs,args) :> nf) ^ " more_args=" ^ string_of_int more_args);*)
172 let t = mk_match (`N i) orig bs_lift bs args in
173 (*prerr_endline ("NUOVO t:" ^ print (fst t :> nf) ^ " more_args=" ^ string_of_int (snd t));*)
174 expand_match (freshno,acc_ps,acc_new_ps) t
175 | `Lam _ -> raise ExpandedToLambda
177 let x = simple_expand_match (acc_ps@acc_new_ps) x in
178 freshno,cast_to_i_num_var x,acc_new_ps in
180 let freshno,old_ps,new_ps = aux (freshno,[],[]) (ps :> i_num_var list) in
181 let freshno,conv,new_ps = aux' old_ps (freshno,[],new_ps) (conv :> i_num_var list) in
182 let freshno,div,new_ps = aux'' old_ps (freshno,new_ps) (div :> i_num_var option) in
183 let div = option_map cast_to_i_var div in
184 let ps = List.map cast_to_i_n_var (old_ps @ new_ps) in
185 let conv = List.map cast_to_i_n_var conv in
186 (let l = Array.to_list (Array.init (freshno + 1) string_of_var) in
187 prerr_endline ("# INST: " ^ string_of_var x ^ " := " ^ print ~l inst));
188 let p = {p with freshno; div; conv; ps} in
189 ( (* check if double substituting a variable *)
190 if List.exists (fun (x',_) -> x = x') sigma
191 then failwithProblem p "Variable replaced twice"
193 let p = {p with sigma = sigma@[x,inst]} in
194 let p = super_simplify p in
195 prerr_endline (print_problem "instantiate" p);
201 let arity_of arities k =
202 let _,pos,y = List.find (fun (v,_,_) -> v=k) arities in
203 let arity = match y with `Var _ -> 0 | `I(_,args) -> Listx.length args | _ -> assert false in
204 arity + if pos = -1 then - 1 else 0
207 let rec dangerous arities showstoppers =
212 | `Match(t,_,liftno,bs,args) ->
213 (* CSC: XXX partial dependency on the encoding *)
215 `N _ -> List.iter (dangerous arities showstoppers) args
216 | `Match _ as t -> dangerous arities showstoppers t ; List.iter (dangerous arities showstoppers) args
217 | `Var(x,_) -> dangerous_inert arities showstoppers x args 2 (* 2 coming from Scott's encoding *)
218 | `I((x,_),args') -> dangerous_inert arities showstoppers x (Listx.to_list args' @ args) 2 (* 2 coming from Scott's encoding *)
220 | `I((k,_),args) -> dangerous_inert arities showstoppers k (Listx.to_list args) 0
222 and dangerous_inert arities showstoppers k args more_args =
223 List.iter (dangerous arities showstoppers) args ;
224 if List.mem k showstoppers then raise Dangerous else
226 let arity = arity_of arities k in
227 if List.length args + more_args > arity then raise Dangerous else ()
231 (* cut & paste from above *)
232 let rec dangerous_conv arities showstoppers =
237 | `Match(t,_,liftno,bs,args) ->
238 (* CSC: XXX partial dependency on the encoding *)
240 `N _ -> concat_map (dangerous_conv arities showstoppers) args
241 | `Match _ as t -> dangerous_conv arities showstoppers t @ concat_map (dangerous_conv arities showstoppers) args
242 | `Var(x,_) -> dangerous_inert_conv arities showstoppers x args 2 (* 2 coming from Scott's encoding *)
243 | `I((x,_),args') -> dangerous_inert_conv arities showstoppers x (Listx.to_list args' @ args) 2 (* 2 coming from Scott's encoding *)
245 | `I((k,_),args) -> dangerous_inert_conv arities showstoppers k (Listx.to_list args) 0
247 and dangerous_inert_conv arities showstoppers k args more_args =
248 concat_map (dangerous_conv arities showstoppers) args @
249 if List.mem k showstoppers then k :: concat_map free_vars args else
251 let arity = arity_of arities k in
252 prerr_endline ("dangerous_inert_conv: ar=" ^ string_of_int arity ^ " k="^string_of_var k ^ " listlenargs=" ^ (string_of_int (List.length args)) );
253 if List.length args + more_args > arity then k :: concat_map free_vars args else []
257 (* inefficient algorithm *)
258 let rec edible arities div ps conv showstoppers =
259 let rec aux showstoppers =
262 | x::xs when List.exists (fun y -> hd_of x = Some y) showstoppers ->
263 (* se la testa di x e' uno show-stopper *)
264 let new_showstoppers = sort_uniq (showstoppers @ free_vars (x :> nf)) in
265 (* aggiungi tutte le variabili libere di x *)
266 if List.length showstoppers <> List.length new_showstoppers then
267 aux new_showstoppers ps
272 None -> aux showstoppers xs
275 dangerous arities showstoppers (x : i_n_var :> nf) ;
279 aux (sort_uniq (h::showstoppers)) ps
281 let showstoppers = sort_uniq (aux showstoppers ps) in
283 List.map (dangerous_conv arities showstoppers) (conv :> nf list) in
285 prerr_endline ("dangerous_conv lenght:" ^ string_of_int (List.length dangerous_conv));
286 List.iter (fun l -> prerr_endline (String.concat " " (List.map string_of_var l))) dangerous_conv;
287 let showstoppers' = showstoppers @ List.concat dangerous_conv in
288 let showstoppers' = sort_uniq (match div with
289 | None -> showstoppers'
291 if List.exists ((=) (hd_of_i_var div)) showstoppers'
292 then showstoppers' @ free_vars (div :> nf) else showstoppers') in
293 if showstoppers <> showstoppers' then edible arities div ps conv showstoppers' else showstoppers', dangerous_conv
296 let precompute_edible_data {ps; div} xs =
297 (match div with None -> [] | Some div -> [hd_of_i_var div, -1, (div :> i_n_var)]) @
299 let i, tm = Util.findi (fun y -> hd_of y = Some hd) ps in
304 let critical_showstoppers p =
305 let p = super_simplify p in
306 let hd_of_div = match p.div with None -> [] | Some t -> [hd_of_i_var t] in
307 let showstoppers_step =
308 concat_map (fun bs ->
309 let heads = List.map (fun (i,_) -> List.nth p.ps i) !bs in
310 let heads = List.sort compare (hd_of_div @ filter_map hd_of heads) in
311 snd (split_duplicates heads)
313 if List.exists (fun t -> [hd_of t] = List.map (fun x -> Some x) hd_of_div) p.conv
314 then hd_of_div else [] in
315 let showstoppers_step = sort_uniq showstoppers_step in
316 let showstoppers_eat =
317 let heads_and_arities =
318 List.sort (fun (k,_) (h,_) -> compare k h)
319 (filter_map (function `Var(k,_) -> Some (k,0) | `I((k,_),args) -> Some (k,Listx.length args) | _ -> None ) p.ps) in
320 let rec multiple_arities =
324 | (x,i)::(y,j)::tl when x = y && i <> j ->
325 x::multiple_arities tl
326 | _::tl -> multiple_arities tl in
327 multiple_arities heads_and_arities in
329 let showstoppers_eat = sort_uniq showstoppers_eat in
330 let showstoppers_eat = List.filter
331 (fun x -> not (List.mem x showstoppers_step))
333 List.iter (fun v -> prerr_endline ("DANGEROUS STEP: " ^ string_of_var v)) showstoppers_step;
334 List.iter (fun v -> prerr_endline ("DANGEROUS EAT: " ^ string_of_var v)) showstoppers_eat;
335 p, showstoppers_step, showstoppers_eat
339 let ({ps} as p), showstoppers_step, showstoppers_eat = critical_showstoppers p in
340 let showstoppers = showstoppers_step @ showstoppers_eat in
341 let heads = List.sort compare (filter_map hd_of ps) in
342 let arities = precompute_edible_data p (uniq heads) in
343 let showstoppers, showstoppers_conv =
344 edible arities p.div ps p.conv showstoppers in
345 let l = List.filter (fun (x,_,_) -> not (List.mem x showstoppers)) arities in
347 List.fold_left (fun p (x,pos,(xx : i_n_var)) -> if pos = -1 then p else
348 let n = match xx with `I(_,args) -> Listx.length args | _ -> 0 in
350 let inst = make_lams v n in
351 (let l = Array.to_list (Array.init (p.freshno + 1) string_of_var) in
352 prerr_endline ("# INST_IN_EAT: " ^ string_of_var x ^ " := " ^ print ~l inst));
353 { p with sigma = p.sigma @ [x,inst] }
355 (* to avoid applied numbers in safe positions that
356 trigger assert failures subst_in_problem x inst p*)
360 let _,j,_ = List.find (fun (h,_,_) -> hd_of t = Some h) l in
364 let p = match p.div with
367 if List.mem (hd_of_i_var div) showstoppers
370 let n = match div with `I(_,args) -> Listx.length args | `Var _ -> 0 in
371 let p, bomb' = make_fresh_var p (-666) in
372 (if !bomb <> `Var (-1,-666) then
374 ("Bomb was duplicated! It was " ^ string_of_nf !bomb ^
375 ", tried to change it to " ^ string_of_nf bomb'));
377 prerr_endline ("Just created bomb var: " ^ string_of_nf !bomb);
378 let x = hd_of_i_var div in
379 let inst = make_lams !bomb n in
380 prerr_endline ("# INST (div): " ^ string_of_var x ^ " := " ^ string_of_nf inst);
381 let p = {p with div=None} in
382 (* subst_in_problem (hd_of_i_var div) inst p in *)
383 {p with sigma=p.sigma@[x,inst]} in
384 let dangerous_conv = showstoppers_conv in
385 let _ = prerr_endline ("dangerous_conv lenght:" ^ string_of_int (List.length dangerous_conv));
386 List.iter (fun l -> prerr_endline (String.concat " " (List.map string_of_var l))) dangerous_conv; in
388 List.map (function s,t ->
390 if s <> [] then t else (
391 (match t with | `Var _ -> raise Not_found | _ -> ());
392 let _ = List.find (fun h -> hd_of t = Some h) showstoppers in
394 with Not_found -> match hd_of t with
395 | None -> assert (t = `N ~-1); t
397 prerr_endline ("FREEZING " ^ string_of_var h);
398 `N ~-1 (* convergent dummy*)
399 ) (List.combine showstoppers_conv p.conv) in
405 match List.nth ps n with
410 let old_conv = p.conv in
411 let p = { p with ps; conv } in
412 if l <> [] || old_conv <> conv
413 then prerr_endline (print_problem "eat" p);
414 if List.for_all (function `N _ -> true | _ -> false) ps && p.div = None then
419 let instantiate p x n =
420 (if hd_of_i_var (cast_to_i_var !bomb) = x
421 then failwithProblem p ("BOMB (" ^ string_of_nf !bomb ^ ") cannot be instantiated!"));
422 let arity_of_x = max_arity_tms x (all_terms p) in
423 (if arity_of_x = None then failwithProblem p "step on var non occurring in problem");
424 (if Util.option_get(arity_of_x) = min_int then failwithProblem p "step on fake variable");
425 (if Util.option_get(arity_of_x) <= 0 then failwithProblem p "step on var of non-positive arity");
426 let n = (prerr_endline "WARNING: using constant initialSpecialK"); p.initialSpecialK in
427 (* AC: Once upon a time, it was:
428 let arities = Num.compute_arities x (n+1) (all_terms p :> nf list) in *)
429 (* let arities = Array.to_list (Array.make (n+1) 0) in *)
430 let arities = Array.to_list (Array.make (n+1) min_int) in
431 let p,vars = make_fresh_vars p arities in
432 let args = Listx.from_list (vars :> nf list) in
434 (* 666, since it will be replaced anyway during subst: *)
435 let inst = `Lam(false,`Match(`I((0,n+2),Listx.map (lift 1) args),(x,666),1,bs,[])) in
436 let p = {p with deltas=bs::p.deltas} in
437 subst_in_problem x inst p
440 let compute_special_k tms =
441 let rec aux k (t: nf) = Pervasives.max k (match t with
442 | `Lam(b,t) -> aux (k + if b then 1 else 0) t
443 | `I(n, tms) -> Listx.max (Listx.map (aux 0) tms)
444 | `Match(t, _, liftno, bs, args) ->
445 List.fold_left max 0 (List.map (aux 0) ((t :> nf)::args@List.map snd !bs))
448 ) in Listx.max (Listx.map (aux 0) tms)
451 let auto_instantiate (n,p) =
452 let p, showstoppers_step, showstoppers_eat = critical_showstoppers p in
454 match showstoppers_step, showstoppers_eat with
456 prerr_endline ("INSTANTIATING CRITICAL TO EAT " ^ string_of_var y); y
459 List.sort compare (filter_map (
460 fun t -> match t with `Var _ -> None | x -> if arity_of_hd x < 0 then None else hd_of x
461 ) ((match p.div with Some t -> [(t :> i_n_var)] | _ -> []) @ p.ps)) in
465 prerr_endline ("INSTANTIATING TO EAT " ^ string_of_var x);
468 prerr_endline ("INSTANTIATING " ^ string_of_var x);
470 (* Strategy that decreases the special_k to 0 first (round robin)
471 1:11m42 2:14m5 3:11m16s 4:14m46s 5:12m7s 6:6m31s *)
474 match hd_of (List.find (fun t ->
475 compute_special_k (Listx.Nil (t :> nf)) > 0 && arity_of_hd t >= 0
476 ) (all_terms p)) with
479 prerr_endline ("INSTANTIATING AND HOPING " ^ string_of_var x);
484 (* Instantiate in decreasing order of compute_special_k
485 1:15m14s 2:13m14s 3:4m55s 4:4m43s 5:4m34s 6:6m28s 7:3m31s
488 (match hd_of (snd (List.hd (List.sort (fun c1 c2 -> - compare (fst c1) (fst c2)) (filter_map (function `I _ as t -> Some (compute_special_k (Listx.Nil (t :> nf)),t) | _ -> None) (all_terms p))))) with
491 prerr_endline ("INSTANTIATING AND HOPING " ^ string_of_var x);
497 compute_special_k (Listx.from_list (all_terms p :> nf list) )in
498 if special_k < n then
499 prerr_endline ("@@@@ NEW INSTANTIATE PHASE (" ^ string_of_int special_k ^ ") @@@@");
500 let p = instantiate p x special_k in
504 let rec auto_eat (n,({ps} as p)) =
505 prerr_endline "{{{{{{{{ Computing measure before auto_instantiate }}}}}}";
506 let m = problem_measure p in
507 let (n,p') = auto_instantiate (n,p) in
511 prerr_endline "{{{{{{{{ Computing measure inafter auto_instantiate }}}}}}";
512 let delta = m - problem_measure p' in
514 (* failwithProblem p' *)
516 ("Measure did not decrease (delta=" ^ string_of_int delta ^ ")"))
517 else prerr_endline ("$ Measure decreased by " ^ string_of_int delta);
522 prerr_endline ("@@@@ FIRST INSTANTIATE PHASE (" ^ string_of_int n ^ ") @@@@");
525 | `Continue p -> auto_eat (n,p)
531 x y = y 0 a y = k k z = z 0 c y = k y u = u h1 h2 0 h2 a = h3
532 1 x a c 1 a 0 c 1 k c 1 c 0 1 k 1 k 1 k
533 2 x a y 2 a 0 y 2 k y 2 y 0 2 y 0 2 h2 0 2 h3
534 3 x b y 3 b 0 y 3 b 0 y 3 b 0 y 3 b 0 y 3 b 0 (\u. u h1 h2 0) 3 b 0 (\u. u h1 (\w.h3) 0)
535 4 x b c 4 b 0 c 4 b 0 c 4 b 0 c 4 b 0 c 4 b 0 c 4 b 0 c
536 5 x (b e) 5 b e 0 5 b e 0 5 b e 0 5 b e 0 5 b e 0 5 b e 0
537 6 y y 6 y y 6 y y 6 y y 6 y y 6 h1 h1 h2 0 h2 0 6 h1 h1 (\w. h3) 0 (\w. h3) 0
540 b u = u l1 l2 0 e _ _ _ _ = f l3 n = n j 0
543 3 l2 0 (\u. u h1 (\w. h3) 0) 3 l3 (\u. u h1 (\w. h3) 0) 3 j h1 (\w. h3) 0 0
544 4 l2 0 c 4 l3 c 4 c j 0
545 5 e l1 l2 0 0 5 f 5 f
546 6 h1 h1 (\w. h3) 0 (\w. h3) 0 6 h1 h1 (\w. h3) 0 (\w. h3) 0 6 h1 h1 (\w. h3) 0 (\w. h3) 0
551 x a (b (a c)) a 0 = 1 ? (b (a c)) 8
552 x a (b d') a 0 = 1 ? (b d') 7
553 x b (a c) b 0 = 1 ? (a c) 4
554 x b (a c') b 0 = 1 ? (a c') 5
562 b 4 = 8 (* b (a c) *)
567 (************** Tests ************************)
569 let optimize_numerals p =
570 let replace_in_sigma perm =
571 let rec aux = function
572 | `N n -> `N (List.nth perm n)
573 | `I _ -> assert false
575 | `Lam(v,t) -> `Lam(v, aux t)
576 | `Match(_,_,_,bs,_) as t -> (bs := List.map (fun (n,t) -> (List.nth perm n, t)) !bs); t
577 in List.map (fun (n,t) -> (n,aux t))
579 let deltas' = List.mapi (fun n d -> (n, List.map fst !d)) p.deltas in
580 let maxs = Array.to_list (Array.init (List.length deltas') (fun _ -> 0)) in
581 let max = List.fold_left max 0 (concat_map snd deltas') in
582 let perm,_ = List.fold_left (fun (perm, maxs) (curr_n:int) ->
583 let containing = filter_map (fun (i, bs) -> if List.mem curr_n bs then Some i else None) deltas' in
584 (* (prerr_endline (string_of_int curr_n ^ " occurs in: " ^ (String.concat " " (List.map string_of_int containing)))); *)
585 let neww = List.fold_left Pervasives.max 0 (List.mapi (fun n max -> if List.mem n containing then max else 0) maxs) in
586 let maxs = List.mapi (fun i m -> if List.mem i containing then neww+1 else m) maxs in
588 ) ([],maxs) (Array.to_list (Array.init (max+1) (fun x -> x))) in
589 replace_in_sigma (List.rev perm) p.sigma
592 let env_of_sigma freshno sigma should_explode =
599 e,Pure.lift (-n-1) (snd (List.find (fun (i,_) -> i = n) sigma)),[]
602 if should_explode && n = hd_of_i_var (cast_to_i_var !bomb)
603 then ([], (let f t = Pure.A(t,t) in f (Pure.L (f (Pure.V 0)))), [])
604 else ([],Pure.V n,[]))::e
608 prerr_endline "########## main ##########";;
611 v ==> v := \a. a k1 .. kn \^m.0
612 + ==> v := \^k. numero for every v such that ...
613 * ==> tries v as long as possible and then +v as long as possible
616 let rec aux ({ps} as p) n l =
617 if List.for_all (function `N _ -> true | _ -> false) ps && p.div = None then begin
620 let _ = prerr_endline (print_problem "main" p) in
624 | [] -> read_line (),[] in
633 | `DoneWith -> assert false (*aux (eat p) n l*) (* CSC: TODO *)
635 let x = var_of_string x in
636 aux (instantiate p x n) n l
637 | `Auto -> aux (auto p n) n l
641 Console.print_hline();
642 bomb := `Var (-1,-666);
643 let p_finale = aux p n cmds in
644 let freshno,sigma = p_finale.freshno, p_finale.sigma in
645 prerr_endline ("------- <DONE> ------\n ");
646 (* prerr_endline (print_problem "Original problem" p); *)
647 prerr_endline "---------------------";
648 let l = Array.to_list (Array.init (freshno + 1) string_of_var) in
649 prerr_endline (" BOMB == " ^ print ~l !bomb);
650 prerr_endline "---------------------";
651 List.iter (fun (x,inst) -> prerr_endline (string_of_var x ^ " := " ^ print ~l inst)) sigma;
653 prerr_endline "----------------------";
655 List.fold_left (fun ps (x,inst) ->
656 (* CSC: XXXX Is the subst always sorted correctly? Otherwise, implement a recursive subst *)
657 (* In this non-recursive version, the intermediate states may containt Matchs *)
658 List.map (fun t -> let t = subst false x inst (t :> nf) in cast_to_i_num_var t) ps)
659 (p.ps :> i_num_var list) sigma in
660 prerr_endline (print_problem {p with ps= List.map (function t -> cast_to_i_n_var t) ps; freshno});
661 List.iteri (fun i (n,more_args) -> assert (more_args = 0 && n = `N i)) ps ;
663 prerr_endline "---------<OPT>----------";
664 let sigma = optimize_numerals p_finale in (* optimize numerals *)
665 let l = Array.to_list (Array.init (freshno + 1) string_of_var) in
666 List.iter (fun (x,inst) -> prerr_endline (string_of_var x ^ " := " ^ print ~l inst)) sigma;
667 prerr_endline "---------<PURE>---------";
668 let div = option_map (fun div -> ToScott.t_of_nf (div :> nf)) p.div in
669 let conv = List.map (fun t -> ToScott.t_of_nf (t :> nf)) p.conv in
670 let ps = List.map (fun t -> ToScott.t_of_nf (t :> nf)) p.ps in
671 let sigma = List.map (fun (x,inst) -> x, ToScott.t_of_nf inst) sigma in
672 (*let ps_ok = List.fold_left (fun ps (x,inst) ->
673 List.map (Pure.subst false x inst) ps) ps sigma in*)
674 let e = env_of_sigma freshno sigma true in
675 let e' = env_of_sigma freshno sigma false in
678 prerr_endline "---------<PPP>---------";
680 "[" ^ String.concat ";" (List.map (fun (e,t,[]) -> print_e e ^ ":" ^ Pure.print t) e) ^ "]"
682 prerr_endline (print_e e);
683 List.iter (fun (t,t_ok) ->
684 prerr_endline ("T0= " ^ Pure.print t ^ "\nTM= " ^ Pure.print (Pure.unwind (e,t,[])) ^ "\nOM= " ^ Pure.print t_ok);
685 (*assert (Pure.unwind (e,t,[]) = t_ok)*)
686 ) (List.combine ps ps_ok);
688 prerr_endline "--------<REDUCE>---------";
689 (function Some div ->
690 print_endline (Pure.print div);
691 let t = Pure.mwhd (e',div,[]) in
692 prerr_endline ("*:: " ^ (Pure.print t));
693 prerr_endline (print !bomb);
694 assert (t = ToScott.t_of_nf (!bomb:>nf))
697 prerr_endline ("_::: " ^ (Pure.print n));
698 let t = Pure.mwhd (e,n,[]) in
699 prerr_endline ("_:: " ^ (Pure.print t))
701 List.iteri (fun i n ->
702 prerr_endline ((string_of_int i) ^ "::: " ^ (Pure.print n));
703 let t = Pure.mwhd (e,n,[]) in
704 prerr_endline ((string_of_int i) ^ ":: " ^ (Pure.print t));
705 assert (t = Scott.mk_n i)
707 prerr_endline "-------- </DONE> --------"
710 (********************** problems *******************)
712 let zero = `Var(0,0);;
717 | `Var _ as i -> cast_to_i_n_var (mk_app i zero)
721 type t = problem * int * string list;;
723 let magic_conv ~div ~conv ~nums cmds =
724 let all_tms = (match div with None -> [] | Some div -> [div]) @ nums @ conv in
725 let all_tms, var_names = parse' all_tms in
726 let div, (tms, conv) = match div with
727 | None -> None, list_cut (List.length nums, all_tms)
728 | Some _ -> Some (List.hd all_tms), list_cut (List.length nums, List.tl all_tms) in
730 if match div with None -> false | Some div -> List.exists (eta_subterm div) (tms@conv)
732 prerr_endline "--- TEST SKIPPED ---";
733 {freshno=0; div=None; conv=[]; ps=[]; sigma=[]; deltas=[]; initialSpecialK=0}, 0, []
735 let tms = sort_uniq ~compare:eta_compare tms in
736 let special_k = compute_special_k (Listx.from_list all_tms) in (* compute initial special K *)
738 let div = option_map cast_to_i_var div in
739 let conv = Util.filter_map (function #i_n_var as t -> Some (cast_to_i_n_var t) | _ -> None) conv in
740 let tms = List.map cast_to_i_n_var tms in
742 let ps = List.map append_zero tms in (* crea lista applicando zeri o dummies *)
743 let freshno = List.length var_names in
745 let dummy = `Var (max_int / 2, -666) in
746 [ ref (Array.to_list (Array.init (List.length ps) (fun i -> i, dummy))) ] in
748 {freshno; div; conv; ps; sigma=[] ; deltas; initialSpecialK=special_k}, special_k, cmds
751 let magic strings cmds = magic_conv None [] strings cmds;;