6 let bomb = ref(`Var(-1,-666));;
9 The number of arguments which can applied to numbers
10 safely, depending on the encoding of numbers.
11 For Scott's encoding, two.
13 let num_more_args = 2;;
14 let _very_verbose = false;;
17 if _very_verbose then prerr_endline s
20 let convergent_dummy = `N ~-1;
24 ; div: i_var option (* None = bomb *)
25 ; conv: i_n_var list (* the inerts that must converge *)
26 ; ps: i_n_var list (* the n-th inert must become n *)
27 ; sigma: (int * nf) list (* the computed substitution *)
28 ; deltas: (int * nf) list ref list (* collection of all branches *)
29 ; initialSpecialK: int
31 ; var_names : string list (* names of the original free variables *)
34 let label_of_problem {label} = label;;
36 let string_of_var l x =
39 with Failure "nth" -> "`" ^ string_of_int x
41 let string_of_term p t = print ~l:p.var_names (t :> nf);;
44 (match p.div with None -> [] | Some t -> [(t :> i_n_var)])
49 let measure_of_term, measure_of_terms =
50 let rec aux = function
52 | `Var(_,ar) -> if ar = min_int then 0 else max 0 ar (*assert (ar >= 0); ar*)
54 | `I(v,args) -> aux (`Var v) + aux_many (Listx.to_list args :> nf list)
55 | `Match(u,(_,ar),_,_,args) -> aux (u :> nf) + (if ar <= 0 then 0 else ar - 1) + aux_many args
56 and aux_many tms = List.fold_right ((+) ++ aux) tms 0 in
57 (fun t -> aux (t :> nf)), (fun l -> aux_many (l :> nf list))
60 let sum_arities p = measure_of_terms (all_terms p)
62 let count_fakevars p =
63 let rec aux = function
65 | `Var(_,ar) -> if ar = min_int then 1 else 0
67 | `I(v,args) -> aux (`Var v) + aux_many (Listx.to_list args)
68 | `Match(u,v,_,_,args) -> aux (u :> nf) + aux (`Var v) + aux_many args
69 and aux_many tms = List.fold_right ((+) ++ aux) tms 0 in
70 aux_many (all_terms p :> nf list)
73 (* let problem_measure p = count_fakevars p, sum_arities p;;
74 let string_of_measure (a,b) = "(fakevars="^string_of_int a^",sum_arities="^string_of_int b^")" *)
76 let problem_measure p = sum_arities p;;
77 let string_of_measure = string_of_int;;
79 let string_of_problem label ({freshno; div; conv; ps; deltas} as p) =
80 let deltas = String.concat ("\n# ") (List.map (fun r -> String.concat " <> " (List.map (fun (i,_) -> string_of_int i) !r)) deltas) in
81 let l = p.var_names in
84 "# DISPLAY PROBLEM (" ^ label ^ ") " ^ "measure=" ^ string_of_measure (problem_measure p);
85 if List.length p.deltas > 1 then (
86 "# Discriminating sets (deltas):\n" ^
91 (match div with None -> "# no D" | Some div -> "D ("^string_of_int (measure_of_term div)^")"^ print ~l (div :> nf));
93 @ List.map (fun t -> if t = convergent_dummy then "#C" else "C ("^string_of_int (measure_of_term t)^") " ^ print ~l (t :> nf)) conv
94 @ List.mapi (fun i t -> string_of_int i ^ " ("^string_of_int (measure_of_term t)^") " ^ print ~l (t :> nf)) ps
99 let failwithProblem p reason =
100 print_endline (string_of_problem "FAIL" p);
104 let make_fresh_var p arity =
105 let freshno = p.freshno + 1 in
106 {p with freshno}, `Var(freshno,arity)
109 let make_fresh_vars p arities =
111 (fun arity (p, vars) -> let p, var = make_fresh_var p arity in p, var::vars)
116 let simple_expand_match ps =
117 let rec aux level = function
118 | #i_num_var as t -> (aux_i_num_var level t :> nf)
119 | `Lam(b,t) -> `Lam(b,aux (level+1) t)
120 and aux_i_num_var level = function
121 | `Match(u,v,bs_lift,bs,args) as torig ->
122 let (u : i_num_var) = aux_i_num_var level u in
123 bs := List.map (fun (n, x) -> n, aux 0 x) !bs;
127 let i = index_of ~eq:eta_eq (lift (-level) u) (ps :> nf list) in (* can raise Not_found *)
128 let t = cast_to_i_num_var (mk_match (`N i) v bs_lift bs (args :> nf list)) in
130 aux_i_num_var level t
132 | _ -> raise Not_found)
134 cast_to_i_num_var (mk_appl (`Match(u,v,bs_lift,bs,[])) (List.map (aux level) args)))
135 | `I(v,args) -> cast_to_i_num_var (mk_appl (`Var v) (List.map (aux level) (Listx.to_list args)))
136 | `N _ | `Var _ as t -> t
141 let rec aux x = let x' = f x in if x <> x' then aux x' else x in aux
144 let rec super_simplify_ps ps =
145 fixpoint (List.map (fun x -> cast_to_i_n_var (simple_expand_match ps (x :> i_num_var))))
148 let rec super_simplify_ps_with_match ps =
149 fixpoint (List.map (cast_to_i_num_var ++ (simple_expand_match ps)))
152 let super_simplify ({div; ps; conv} as p) =
153 let ps = super_simplify_ps p.ps p.ps in
154 let conv = super_simplify_ps ps p.conv in
155 let div = option_map (fun div ->
156 let divs = super_simplify_ps p.ps ([div] :> i_n_var list) in
158 {p with div=option_map cast_to_i_var div; ps; conv}
160 exception ExpandedToLambda;;
162 let subst_in_problem x inst ({freshno; div; conv; ps; sigma} as p) =
163 let len_ps = List.length ps in
164 (*(let l = Array.to_list (Array.init (freshno + 1) string_of_var) in
165 prerr_endline ("# INST0: " ^ string_of_var x ^ " := " ^ print ~l inst));*)
166 let rec aux ((freshno,acc_ps,acc_new_ps) as acc) =
170 (*prerr_endline ("EXPAND t:" ^ print (t :> nf));*)
171 let t = subst false false x inst (t :> nf) in
172 (*prerr_endline ("SUBSTITUTED t:" ^ print (t :> nf));*)
173 let freshno,new_t,acc_new_ps =
174 expand_match (freshno,acc_ps@`Var(max_int/3,-666)::todo_ps,acc_new_ps) t
176 aux (freshno,acc_ps@[new_t],acc_new_ps) todo_ps
178 (* cut&paste from aux above *)
179 and aux' ps ((freshno,acc_conv,acc_new_ps) as acc) =
183 (*prerr_endline ("EXPAND t:" ^ print (t :> nf));*)
185 let t = subst false false x inst (t :> nf) in
186 (*prerr_endline ("SUBSTITUTED t:" ^ print (t :> nf));*)
187 let freshno,new_t,acc_new_ps =
188 expand_match (freshno,ps,acc_new_ps) t
190 aux' ps (freshno,acc_conv@[new_t],acc_new_ps) todo_conv
191 (* with ExpandedToLambda -> aux' ps (freshno,acc_conv@[`N(-1)],acc_new_ps) todo_conv *)
193 (* cut&paste from aux' above *)
194 and aux'' ps (freshno,acc_new_ps) =
196 | None -> freshno, None, acc_new_ps
198 let t = subst false false x inst (t :> nf) in
199 let freshno,new_t,acc_new_ps =
200 expand_match (freshno,ps,acc_new_ps) t
202 freshno,Some new_t,acc_new_ps
204 and expand_match ((freshno,acc_ps,acc_new_ps) as acc) t =
206 | `Match(u',orig,bs_lift,bs,args) ->
207 let freshno,u,acc_new_ps = expand_match acc (u' :> nf) in
210 | `N i -> acc_new_ps,i
212 let ps = List.map (fun t -> cast_to_i_num_var (subst false false x inst (t:> nf))) (acc_ps@acc_new_ps) in
213 let super_simplified_ps = super_simplify_ps_with_match ps ps in
214 (*prerr_endline ("CERCO u:" ^ print (fst u :> nf));
215 List.iter (fun x -> prerr_endline ("IN: " ^ print (fst x :> nf))) ps;
216 List.iter (fun x -> prerr_endline ("IN2: " ^ print (fst x :> nf))) super_simplified_ps;*)
217 match index_of_opt ~eq:eta_eq super_simplified_ps u with
218 Some i -> acc_new_ps, i
219 | None -> acc_new_ps@[u], len_ps + List.length acc_new_ps
222 if List.exists (fun (j,_) -> i=j) !bs then
225 let freshno,v = freshno+1, `Var (freshno+1, -666) in (* make_fresh_var freshno in *)
228 (*prerr_endlie ("t DA RIDURRE:" ^ print (`Match(`N i,arity,bs_lift,bs,args) :> nf) ^ " more_args=" ^ string_of_int more_args);*)
229 let t = mk_match (`N i) orig bs_lift bs args in
230 (*prerr_endline ("NUOVO t:" ^ print (fst t :> nf) ^ " more_args=" ^ string_of_int (snd t));*)
231 expand_match (freshno,acc_ps,acc_new_ps) t
232 | `Lam _ -> raise ExpandedToLambda
234 let x = simple_expand_match (acc_ps@acc_new_ps) x in
235 freshno,cast_to_i_num_var x,acc_new_ps in
237 let freshno,old_ps,new_ps = aux (freshno,[],[]) (ps :> i_num_var list) in
238 let freshno,conv,new_ps = aux' old_ps (freshno,[],new_ps) (conv :> i_num_var list) in
239 let freshno,div,new_ps = aux'' old_ps (freshno,new_ps) (div :> i_num_var option) in
240 let div = option_map cast_to_i_var div in
241 let ps = List.map cast_to_i_n_var (old_ps @ new_ps) in
242 let conv = List.map cast_to_i_n_var conv in
243 let p = {p with freshno; div; conv; ps} in
244 prerr_endline ("# INST: " ^ string_of_var p.var_names x ^ " := " ^ string_of_term p inst);
245 ( (* check if double substituting a variable *)
246 if List.exists (fun (x',_) -> x = x') sigma
247 then failwithProblem p ("Variable "^ string_of_var p.var_names x ^"replaced twice")
249 let p = {p with sigma = sigma@[x,inst]} in
250 let p = super_simplify p in
251 prerr_endline (string_of_problem "instantiate" p);
257 let arity_of arities hd =
258 let pos,_,nargs = List.find (fun (_,hd',_) -> hd=hd') arities in
259 nargs + if pos = -1 then - 1 else 0
262 let rec dangerous arities showstoppers =
267 | `Match(t,_,liftno,bs,args) ->
268 (* CSC: XXX partial dependency on the encoding *)
270 `N _ -> List.iter (dangerous arities showstoppers) args
271 | `Match _ as t -> dangerous arities showstoppers t ; List.iter (dangerous arities showstoppers) args
272 | `Var(x,_) -> dangerous_inert arities showstoppers x args num_more_args
273 | `I((x,_),args') -> dangerous_inert arities showstoppers x (Listx.to_list args' @ args) num_more_args
275 | `I((k,_),args) -> dangerous_inert arities showstoppers k (Listx.to_list args) 0
277 and dangerous_inert arities showstoppers k args more_args =
278 List.iter (dangerous arities showstoppers) args ;
279 if List.mem k showstoppers then raise Dangerous else
281 let arity = arity_of arities k in
282 if List.length args + more_args > arity then raise Dangerous else ()
286 (* cut & paste from above *)
287 let rec dangerous_conv p arities showstoppers =
292 | `Match(t,_,liftno,bs,args) ->
293 (* CSC: XXX partial dependency on the encoding *)
295 `N _ -> concat_map (dangerous_conv p arities showstoppers) args
296 | `Match _ as t -> dangerous_conv p arities showstoppers t @ concat_map (dangerous_conv p arities showstoppers) args
297 | `Var(x,_) -> dangerous_inert_conv p arities showstoppers x [] args 2
298 | `I((x,_),args') -> dangerous_inert_conv p arities showstoppers x (Listx.to_list args') args 2
300 | `I((k,_),args) -> dangerous_inert_conv p arities showstoppers k (Listx.to_list args) [] 0
302 and dangerous_inert_conv p arities showstoppers k args match_args more_args =
303 let all_args = args @ match_args in
304 let dangerous_args = concat_map (dangerous_conv p arities showstoppers) all_args in
305 let all_args = (all_args :> nf list) in
306 if dangerous_args = [] then (
307 if List.mem k showstoppers then k :: concat_map free_vars all_args else
309 let arity = arity_of arities k in
310 prerr_endline ("dangerous_inert_conv: ar=" ^ string_of_int arity ^ " k="^string_of_var p.var_names k ^ " listlenargs=" ^ (string_of_int (List.length args)) ^ " more_args=" ^ string_of_int more_args);
311 if more_args > 0 (* match argument*) && List.length args = arity then []
312 else if List.length all_args + more_args > arity then k :: concat_map free_vars all_args else []
315 ) else k :: concat_map free_vars all_args
317 (* inefficient algorithm *)
318 let rec edible ({div; conv; ps} as p) arities showstoppers =
319 let rec aux showstoppers =
322 | x::xs when List.exists (fun y -> hd_of x = Some y) showstoppers ->
323 (* se la testa di x e' uno show-stopper *)
324 let new_showstoppers = sort_uniq (showstoppers @ free_vars (x :> nf)) in
325 (* aggiungi tutte le variabili libere di x *)
326 if List.length showstoppers <> List.length new_showstoppers then
327 aux new_showstoppers ps
332 None -> aux showstoppers xs
335 dangerous arities showstoppers (x : i_n_var :> nf) ;
339 aux (sort_uniq (h::showstoppers)) ps in
341 let showstoppers = sort_uniq (aux showstoppers ps) in
343 List.map (dangerous_conv p arities showstoppers) (conv :> nf list) in
345 prerr_endline ("dangerous_conv lenght:" ^ string_of_int (List.length dangerous_conv));
346 List.iter (fun l -> prerr_endline (String.concat " " (List.map (string_of_var p.var_names) l))) dangerous_conv;
348 let showstoppers' = showstoppers @ List.concat dangerous_conv in
349 let showstoppers' = sort_uniq (match div with
350 | None -> showstoppers'
352 if List.exists ((=) (hd_of_i_var div)) showstoppers'
353 then showstoppers' @ free_vars (div :> nf) else showstoppers') in
354 if showstoppers <> showstoppers' then edible p arities showstoppers' else showstoppers', dangerous_conv
357 let precompute_edible_data {ps; div} xs =
358 let aux t = match t with `Var _ -> 0 | `I(_, args) -> Listx.length args | `N _ -> assert false in
359 (fun l -> match div with
361 | Some div -> (-1, hd_of_i_var div, aux div) :: l)
363 let i, tm = Util.findi (fun y -> hd_of y = Some hd) ps in
368 (** Returns (p, showstoppers_step, showstoppers_eat) where:
369 - showstoppers_step are the heads occurring twice
370 in the same discriminating set
371 - showstoppers_eat are the heads in ps having different number
373 let critical_showstoppers p =
374 let p = super_simplify p in
375 let hd_of_div = match p.div with None -> [] | Some t -> [hd_of_i_var t] in
376 let showstoppers_step =
377 concat_map (fun bs ->
378 let heads = List.map (fun (i,_) -> List.nth p.ps i) !bs in
379 let heads = List.sort compare (hd_of_div @ filter_map hd_of heads) in
380 snd (split_duplicates heads)
382 if List.exists (fun t -> [hd_of t] = List.map (fun x -> Some x) hd_of_div) p.conv
383 then hd_of_div else [] in
384 let showstoppers_step = sort_uniq showstoppers_step in
385 let showstoppers_eat =
386 let heads_and_arities =
387 List.sort (fun (k,_) (h,_) -> compare k h)
388 (filter_map (function `Var(k,_) -> Some (k,0) | `I((k,_),args) -> Some (k,Listx.length args) | _ -> None ) p.ps) in
389 let rec multiple_arities =
393 | (x,i)::(y,j)::tl when x = y && i <> j ->
394 x::multiple_arities tl
395 | _::tl -> multiple_arities tl in
396 multiple_arities heads_and_arities in
398 let showstoppers_eat = sort_uniq showstoppers_eat in
399 let showstoppers_eat = List.filter
400 (fun x -> not (List.mem x showstoppers_step))
402 List.iter (fun v -> prerr_endline ("DANGEROUS STEP: " ^ (string_of_var p.var_names) v)) showstoppers_step;
403 List.iter (fun v -> prerr_endline ("DANGEROUS EAT: " ^ (string_of_var p.var_names) v)) showstoppers_eat;
404 p, showstoppers_step, showstoppers_eat
408 let ({ps} as p), showstoppers_step, showstoppers_eat = critical_showstoppers p in
409 let showstoppers = showstoppers_step @ showstoppers_eat in
410 let heads = List.sort compare (filter_map hd_of ps) in
411 let arities = precompute_edible_data p (uniq heads) in
412 let inedible, showstoppers_conv = edible p arities showstoppers in
413 let l = List.filter (fun (_,hd,_) -> not (List.mem hd inedible)) arities in
415 List.fold_left (fun p (pos,hd,nargs) -> if pos = -1 then p else
417 let inst = make_lams v nargs in
418 prerr_endline ("# INST_IN_EAT: " ^ string_of_var p.var_names hd ^ " := " ^ string_of_term p inst);
419 { p with sigma = p.sigma @ [hd,inst] }
421 (* to avoid applied numbers in safe positions that
422 trigger assert failures subst_in_problem x inst p*)
426 let j,_,_ = List.find (fun (_,hd,_) -> hd_of t = Some hd) l in
430 let p = match p.div with
433 if List.mem (hd_of_i_var div) inedible
436 let n = match div with `I(_,args) -> Listx.length args | `Var _ -> 0 in
437 let p, bomb' = make_fresh_var p (-666) in
438 (if !bomb <> `Var (-1,-666) then
440 ("Bomb was duplicated! It was " ^ string_of_nf !bomb ^
441 ", tried to change it to " ^ string_of_nf bomb'));
443 prerr_endline ("Just created bomb var: " ^ string_of_nf !bomb);
444 let x = hd_of_i_var div in
445 let inst = make_lams !bomb n in
446 let p = {p with div=None} in
447 (* subst_in_problem (hd_of_i_var div) inst p in *)
448 {p with sigma=p.sigma@[x,inst]} in
449 let dangerous_conv = showstoppers_conv in
450 prerr_endline ("dangerous_conv lenght:" ^ string_of_int (List.length dangerous_conv));
451 List.iter (fun l -> prerr_endline (String.concat " " (List.map (string_of_var p.var_names) l))) dangerous_conv;
453 List.map (function s,t ->
455 if s <> [] then t else (
456 (match t with | `Var _ -> raise Not_found | _ -> ());
457 let _ = List.find (fun h -> hd_of t = Some h) inedible in
459 with Not_found -> match hd_of t with
460 | None -> assert (t = convergent_dummy); t
462 prerr_endline ("FREEZING " ^ string_of_var p.var_names h);
464 ) (List.combine showstoppers_conv p.conv) in
470 match List.nth ps n with
475 let old_conv = p.conv in
476 let p = { p with ps; conv } in
477 if l <> [] || old_conv <> conv
478 then prerr_endline (string_of_problem "eat" p);
479 if List.for_all (function `N _ -> true | _ -> false) ps && p.div = None then
484 let instantiate p x n =
485 (if hd_of_i_var (cast_to_i_var !bomb) = x
486 then failwithProblem p ("BOMB (" ^ string_of_nf !bomb ^ ") cannot be instantiated!"));
487 let arity_of_x = max_arity_tms x (all_terms p) in
488 (if arity_of_x = None then failwithProblem p "step on var non occurring in problem");
489 (if Util.option_get(arity_of_x) = min_int then failwithProblem p "step on fake variable");
490 (if Util.option_get(arity_of_x) <= 0 then failwithProblem p "step on var of non-positive arity");
491 let n = (prerr_endline "WARNING: using constant initialSpecialK"); p.initialSpecialK in
492 (* AC: Once upon a time, it was:
493 let arities = Num.compute_arities x (n+1) (all_terms p :> nf list) in *)
494 (* let arities = Array.to_list (Array.make (n+1) 0) in *)
495 let arities = Array.to_list (Array.make (n+1) min_int) in
496 let p,vars = make_fresh_vars p arities in
497 let args = Listx.from_list (vars :> nf list) in
499 (* 666, since it will be replaced anyway during subst: *)
500 let inst = `Lam(false,`Match(`I((0,min_int),Listx.map (lift 1) args),(x,-666),1,bs,[])) in
501 let p = {p with deltas=bs::p.deltas} in
502 subst_in_problem x inst p
505 let compute_special_k tms =
506 let rec aux k (t: nf) = Pervasives.max k (match t with
507 | `Lam(b,t) -> aux (k + if b then 1 else 0) t
508 | `I(n, tms) -> Listx.max (Listx.map (aux 0) tms)
509 | `Match(t, _, liftno, bs, args) ->
510 List.fold_left max 0 (List.map (aux 0) ((t :> nf)::args@List.map snd !bs))
513 ) in Listx.max (Listx.map (aux 0) tms)
516 let auto_instantiate (n,p) =
517 let p, showstoppers_step, showstoppers_eat = critical_showstoppers p in
519 match showstoppers_step, showstoppers_eat with
521 prerr_endline ("INSTANTIATING CRITICAL TO EAT " ^ string_of_var p.var_names y); y
524 (* Choose only variables still alive (with arity > 0) *)
525 List.sort compare (filter_map (
526 fun t -> match t with `Var _ -> None | x -> if arity_of_hd x <= 0 then None else hd_of x
527 ) ((match p.div with Some t -> [(t :> i_n_var)] | _ -> []) @ p.ps)) in
531 fst (List.find (((<) 0) ++ snd) (concat_map free_vars' (p.conv :> nf list)))
533 Not_found -> assert false)
535 prerr_endline ("INSTANTIATING TO EAT " ^ string_of_var p.var_names x);
538 prerr_endline ("INSTANTIATING " ^ string_of_var p.var_names x);
540 (* Strategy that decreases the special_k to 0 first (round robin)
541 1:11m42 2:14m5 3:11m16s 4:14m46s 5:12m7s 6:6m31s *)
545 hd_of (List.find (fun t ->
546 compute_special_k (Listx.Nil (t :> nf)) > 0 && arity_of_hd t > 0
549 | None -> assert false
551 prerr_endline ("INSTANTIATING AND HOPING " ^ string_of_var p.var_names x);
555 let arity_of_x = max_arity_tms x (all_terms p) in
556 assert (Util.option_get arity_of_x > 0);
558 (* Instantiate in decreasing order of compute_special_k
559 1:15m14s 2:13m14s 3:4m55s 4:4m43s 5:4m34s 6:6m28s 7:3m31s
562 (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
565 prerr_endline ("INSTANTIATING AND HOPING " ^ string_of_var x);
571 compute_special_k (Listx.from_list (all_terms p :> nf list) )in
572 if special_k < n then
573 prerr_endline ("@@@@ NEW INSTANTIATE PHASE (" ^ string_of_int special_k ^ ") @@@@");
574 let p = instantiate p x special_k in
578 let rec auto_eat (n,p) =
579 prerr_endline "{{{{{{{{ Computing measure before auto_instantiate }}}}}}";
580 let m = problem_measure p in
581 let (n,p') = auto_instantiate (n,p) in
585 prerr_endline "{{{{{{{{ Computing measure inafter auto_instantiate }}}}}}";
586 let delta = problem_measure p - m in
587 (* let delta = m - problem_measure p' in *)
591 ("Measure did not decrease (+=" ^ string_of_int delta ^ ")"))
592 else prerr_endline ("$ Measure decreased of " ^ string_of_int delta);
597 prerr_endline ("@@@@ FIRST INSTANTIATE PHASE (" ^ string_of_int n ^ ") @@@@");
600 | `Continue p -> auto_eat (n,p)
606 x y = y 0 a y = k k z = z 0 c y = k y u = u h1 h2 0 h2 a = h3
607 1 x a c 1 a 0 c 1 k c 1 c 0 1 k 1 k 1 k
608 2 x a y 2 a 0 y 2 k y 2 y 0 2 y 0 2 h2 0 2 h3
609 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)
610 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
611 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
612 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
615 b u = u l1 l2 0 e _ _ _ _ = f l3 n = n j 0
618 3 l2 0 (\u. u h1 (\w. h3) 0) 3 l3 (\u. u h1 (\w. h3) 0) 3 j h1 (\w. h3) 0 0
619 4 l2 0 c 4 l3 c 4 c j 0
620 5 e l1 l2 0 0 5 f 5 f
621 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
626 x a (b (a c)) a 0 = 1 ? (b (a c)) 8
627 x a (b d') a 0 = 1 ? (b d') 7
628 x b (a c) b 0 = 1 ? (a c) 4
629 x b (a c') b 0 = 1 ? (a c') 5
637 b 4 = 8 (* b (a c) *)
642 (************** Tests ************************)
644 let optimize_numerals p =
645 let replace_in_sigma perm =
646 let rec aux = function
647 | `N n -> `N (List.nth perm n)
648 | `I _ -> assert false
650 | `Lam(v,t) -> `Lam(v, aux t)
651 | `Match(_,_,_,bs,_) as t -> (bs := List.map (fun (n,t) -> (List.nth perm n, t)) !bs); t
652 in List.map (fun (n,t) -> (n,aux t))
654 let deltas' = List.mapi (fun n d -> (n, List.map fst !d)) p.deltas in
655 let maxs = Array.to_list (Array.init (List.length deltas') (fun _ -> 0)) in
656 let max = List.fold_left max 0 (concat_map snd deltas') in
657 let perm,_ = List.fold_left (fun (perm, maxs) (curr_n:int) ->
658 let containing = filter_map (fun (i, bs) -> if List.mem curr_n bs then Some i else None) deltas' in
659 (* (prerr_endline (string_of_int curr_n ^ " occurs in: " ^ (String.concat " " (List.map string_of_int containing)))); *)
660 let neww = List.fold_left Pervasives.max 0 (List.mapi (fun n max -> if List.mem n containing then max else 0) maxs) in
661 let maxs = List.mapi (fun i m -> if List.mem i containing then neww+1 else m) maxs in
663 ) ([],maxs) (Array.to_list (Array.init (max+1) (fun x -> x))) in
664 replace_in_sigma (List.rev perm) p.sigma
667 let env_of_sigma freshno sigma should_explode =
674 e,Pure.lift (-n-1) (snd (List.find (fun (i,_) -> i = n) sigma)),[]
677 if should_explode && n = hd_of_i_var (cast_to_i_var !bomb)
678 then ([], (let f t = Pure.A(t,t) in f (Pure.L (f (Pure.V 0)))), [])
679 else ([],Pure.V n,[]))::e
682 (* ************************************************************************** *)
685 | `Separable of (int * Num.nf) list
686 | `Unseparable of string
690 (* TODO check if there are duplicates in p.ps
691 before it was: ps = sort_uniq ~compare:eta_compare (ps :> nf list) *)
692 (* FIXME what about initial fragments? *)
693 if (let rec f = function
695 | hd::tl -> List.exists (eta_eq hd) tl || f tl in
697 then Some "ps contains duplicate entries"
698 (* check if div occurs somewhere in ps@conv *)
699 else match p.div with
702 if (List.exists (eta_subterm div) (p.ps@p.conv))
703 then Some "div occurs as subterm in ps or conv"
708 prerr_endline (string_of_problem "main" p);
710 | Some s -> `Unseparable s
712 bomb := `Var(-1,-666);
713 Console.print_hline();
714 let p_finale = auto p p.initialSpecialK in
715 let freshno,sigma = p_finale.freshno, p_finale.sigma in
716 prerr_endline ("------- <DONE> ------ measure=. \n ");
717 List.iter (fun (x,inst) -> prerr_endline
718 (string_of_var p_finale.var_names x ^ " := " ^ string_of_term p_finale inst)) sigma;
720 prerr_endline "---------<OPT>----------";
721 let sigma = optimize_numerals p_finale in (* optimize numerals *)
722 List.iter (fun (x,inst) -> prerr_endline
723 (string_of_var p_finale.var_names x ^ " := " ^ string_of_term p_finale inst)) sigma;
725 prerr_endline "---------<PURE>---------";
726 let scott_of_nf t = ToScott.t_of_nf (t :> nf) in
727 let div = option_map scott_of_nf p.div in
728 let conv = List.map scott_of_nf p.conv in
729 let ps = List.map scott_of_nf p.ps in
731 let sigma' = List.map (fun (x,inst) -> x, scott_of_nf inst) sigma in
732 let e' = env_of_sigma freshno sigma' false (* FIXME shoudl_explode *) in
734 prerr_endline "--------<REDUCE>---------";
735 let pure_bomb = ToScott.t_of_nf (!bomb) in (* Pure.B *)
738 print_endline (Pure.print div);
739 let t = Pure.mwhd (e',div,[]) in
740 prerr_endline ("*:: " ^ (Pure.print t));
741 assert (t = pure_bomb)
744 verbose ("_::: " ^ (Pure.print n));
745 let t = Pure.mwhd (e',n,[]) in
746 verbose ("_:: " ^ (Pure.print t));
747 assert (t <> pure_bomb)
749 List.iteri (fun i n ->
750 verbose ((string_of_int i) ^ "::: " ^ (Pure.print n));
751 let t = Pure.mwhd (e',n,[]) in
752 verbose ((string_of_int i) ^ ":: " ^ (Pure.print t));
753 assert (t = Scott.mk_n i)
755 prerr_endline "-------- </DONE> --------";
756 `Separable p_finale.sigma
759 let problem_of (label, div, conv, ps, var_names) =
760 (* TODO: replace div with bottom in problem??? *)
761 let all_tms = (match div with None -> [] | Some div -> [(div :> i_n_var)]) @ ps @ conv in
762 if all_tms = [] then failwith "problem_of: empty problem";
763 let initialSpecialK = compute_special_k (Listx.from_list (all_tms :> nf list)) in
764 let freshno = List.length var_names in
766 let dummy = `Var (max_int / 2, -666) in
767 [ ref (Array.to_list (Array.init (List.length ps) (fun i -> i, dummy))) ] in
768 {freshno; div; conv; ps; sigma=[]; deltas; initialSpecialK; var_names; label}