1 let (++) f g x = f (g x);;
\r
3 let rec fold_nat f x n = if n = 0 then x else f (fold_nat f x (n-1)) n ;;
\r
5 let print_hline = Console.print_hline;;
\r
17 let delta = L(A(V 0, V 0));;
\r
19 let rec is_stuck = function
\r
21 | A(t,_) -> is_stuck t
\r
26 let rec aux l1 l2 t1 t2 = match t1, t2 with
\r
27 | _, _ when is_stuck t1 || is_stuck t2 -> true
\r
28 | L t1, L t2 -> aux l1 l2 t1 t2
\r
29 | L t1, t2 -> aux l1 (l2+1) t1 t2
\r
30 | t1, L t2 -> aux (l1+1) l2 t1 t2
\r
31 | V a, V b -> a + l1 = b + l2
\r
32 | A(t1,t2), A(u1,u2) -> aux l1 l2 t1 u1 && aux l1 l2 t2 u2
\r
35 let eta_eq = eta_eq' 0 0;;
\r
37 (* is arg1 eta-subterm of arg2 ? *)
\r
39 let rec aux lev t = if t = C then false else (eta_eq' lev 0 u t || match t with
\r
40 | L t -> aux (lev+1) t
\r
41 | A(t1, t2) -> aux lev t1 || aux lev t2
\r
46 (* does NOT lift the argument *)
\r
47 let mk_lams = fold_nat (fun x _ -> L x) ;;
\r
50 let string_of_bvar =
\r
51 let bound_vars = ["x"; "y"; "z"; "w"; "q"] in
\r
52 let bvarsno = List.length bound_vars in
\r
53 fun nn -> if nn < bvarsno then List.nth bound_vars nn else "x" ^ (string_of_int (nn - bvarsno + 1)) in
\r
54 let rec string_of_term_w_pars level = function
\r
55 | V v -> if v >= level then "`" ^ string_of_int (v-level) else
\r
56 string_of_bvar (level - v-1)
\r
59 | L _ as t -> "(" ^ string_of_term_no_pars level t ^ ")"
\r
60 and string_of_term_no_pars_app level = function
\r
61 | A(t1,t2) -> string_of_term_no_pars_app level t1 ^ " " ^ string_of_term_w_pars level t2
\r
62 | _ as t -> string_of_term_w_pars level t
\r
63 and string_of_term_no_pars level = function
\r
64 | L t -> "λ" ^ string_of_bvar level ^ ". " ^ string_of_term_no_pars (level+1) t
\r
65 | _ as t -> string_of_term_no_pars_app level t
\r
66 in string_of_term_no_pars 0
\r
74 ; sigma : (var * t) list (* substitutions *)
\r
77 let string_of_problem p =
\r
79 "[DV] " ^ string_of_t p.div;
\r
80 "[CV] " ^ string_of_t p.conv;
\r
82 String.concat "\n" lines
\r
86 exception Done of (var * t) list (* substitution *);;
\r
87 exception Fail of int * string;;
\r
89 let problem_fail p reason =
\r
90 print_endline "!!!!!!!!!!!!!!! FAIL !!!!!!!!!!!!!!!";
\r
91 print_endline (string_of_problem p);
\r
92 raise (Fail (-1, reason))
\r
95 let freshvar ({freshno} as p) =
\r
96 {p with freshno=freshno+1}, freshno+1
\r
99 (* CSC: rename? is an applied C an inert?
\r
100 is_inert and get_inert work inconsistently *)
\r
103 | A(t,_) -> is_inert t
\r
109 let rec is_constant =
\r
114 | L t -> is_constant t
\r
117 let rec get_inert = function
\r
118 | V _ | C as t -> (t,0)
\r
119 | A(t, _) -> let hd,args = get_inert t in hd,args+1
\r
120 | _ -> assert false
\r
123 let args_of_inert =
\r
127 | A(t, a) -> aux (a::acc) t
\r
128 | _ -> assert false
\r
133 (* precomputes the number of leading lambdas in a term,
\r
134 after replacing _v_ w/ a term starting with n lambdas *)
\r
135 let rec no_leading_lambdas v n = function
\r
136 | L t -> 1 + no_leading_lambdas (v+1) n t
\r
137 | A _ as t -> let v', m = get_inert t in if V v = v' then max 0 (n - m) else 0
\r
138 | V v' -> if v = v' then n else 0
\r
142 let rec subst level delift sub =
\r
144 | V v -> if v = level + fst sub then lift level (snd sub) else V (if delift && v > level then v-1 else v)
\r
145 | L t -> let t = subst (level + 1) delift sub t in if t = B then B else L t
\r
147 let t1 = subst level delift sub t1 in
\r
148 let t2 = subst level delift sub t2 in
\r
151 and mk_app t1 t2 = if t1 = delta && t2 = delta then raise B
\r
153 | L t1 -> subst 0 true (0, t2) t1
\r
158 | V m -> V (if m >= lev then m + n else m)
\r
159 | L t -> L (aux (lev+1) t)
\r
160 | A (t1, t2) -> A (aux lev t1, aux lev t2)
\r
164 let subst = subst 0 false;;
\r
166 let subst_in_problem ((v, t) as sub) p =
\r
167 print_endline ("-- SUBST " ^ string_of_t (V v) ^ " |-> " ^ string_of_t t);
\r
169 div=subst sub p.div;
\r
170 conv=subst sub p.conv;
\r
171 sigma=sub::p.sigma}
\r
174 let get_subterms_with_head hd_var =
\r
175 let rec aux lev inert_done = function
\r
176 | L t -> aux (lev+1) false t
\r
179 let hd_var', n_args' = get_inert t1 in
\r
180 if not inert_done && hd_var' = V (hd_var + lev)
\r
181 then lift ~-lev t :: aux lev true t1 @ aux lev false t2
\r
182 else aux lev true t1 @ aux lev false t2
\r
186 let rec purify = function
\r
187 | L t -> Pure.L (purify t)
\r
188 | A (t1,t2) -> Pure.A (purify t1, purify t2)
\r
190 | C -> Pure.V (min_int/2)
\r
193 let check p sigma =
\r
194 print_endline "Checking...";
\r
195 let div = purify p.div in
\r
196 let conv = purify p.conv in
\r
197 let sigma = List.map (fun (v,t) -> v, purify t) sigma in
\r
198 let freshno = List.fold_right (max ++ fst) sigma 0 in
\r
199 let env = Pure.env_of_sigma freshno sigma in
\r
200 assert (Pure.diverged (Pure.mwhd (env,div,[])));
\r
201 print_endline " D diverged.";
\r
202 assert (not (Pure.diverged (Pure.mwhd (env,conv,[]))));
\r
203 print_endline " C converged.";
\r
208 print_endline (string_of_problem p); (* non cancellare *)
\r
209 if not (is_inert p.div) then problem_fail p "p.div converged";
\r
210 (* Trailing constant args can be removed because do not contribute to eta-diff *)
\r
211 let rec remove_trailing_constant_args = function
\r
212 | A(t1, t2) when is_constant t2 -> remove_trailing_constant_args t1
\r
214 let p = {p with div=remove_trailing_constant_args p.div} in
\r
218 (* drops the arguments of t after the n-th *)
\r
219 let inert_cut_at n t =
\r
224 let k', t' = aux t1 in
\r
225 if k' = n then n, t'
\r
227 | _ -> assert false
\r
231 (* return the index of the first argument with a difference
\r
232 (the first argument is 0) *)
\r
233 let find_eta_difference p t =
\r
234 let divargs = args_of_inert p.div in
\r
235 let conargs = args_of_inert t in
\r
236 let rec aux k divargs conargs =
\r
237 match divargs,conargs with
\r
240 | t1::divargs,t2::conargs ->
\r
241 (if not (eta_eq t1 t2) then [k] else []) @ aux (k+1) divargs conargs
\r
243 aux 0 divargs conargs
\r
246 let compute_max_lambdas_at hd_var j =
\r
247 let rec aux hd = function
\r
249 (if get_inert t1 = (V hd, j)
\r
250 then max ( (*FIXME*)
\r
251 if is_inert t2 && let hd', j' = get_inert t2 in hd' = V hd
\r
252 then let hd', j' = get_inert t2 in j - j'
\r
253 else no_leading_lambdas hd_var j t2)
\r
254 else id) (max (aux hd t1) (aux hd t2))
\r
255 | L t -> aux (hd+1) t
\r
260 let print_cmd s1 s2 = print_endline (">> " ^ s1 ^ " " ^ s2);;
\r
262 (* returns Some i if i is the smallest integer s.t. p holds for the i-th
\r
263 element of the list in input *)
\r
264 let smallest_such_that p =
\r
268 | hd::_ when (print_endline (string_of_t hd) ; p hd) -> Some i
\r
269 | _::tl -> aux (i+1) tl
\r
274 (* step on the head of div, on the k-th argument, with n fresh vars *)
\r
276 let hd, _ = get_inert p.div in
\r
278 | C | L _ | A _ -> assert false
\r
280 print_cmd "STEP" ("on " ^ string_of_t (V var) ^ " (on " ^ string_of_int (k+1) ^ "th)");
\r
281 let p, t = (* apply fresh vars *)
\r
282 fold_nat (fun (p, t) _ ->
\r
283 let p, v = freshvar p in
\r
284 p, A(t, V (v + k + 1))
\r
286 let t = (* apply unused bound variables V_{k-1}..V_1 *)
\r
287 fold_nat (fun t m -> A(t, V (k-m+1))) t k in
\r
288 let t = mk_lams t (k+1) in (* make leading lambdas *)
\r
289 let subst = var, t in
\r
290 let p = subst_in_problem subst p in
\r
295 (* one-step version of eat *)
\r
296 let compute_max_arity =
\r
297 let rec aux n = function
\r
298 | A(t1,t2) -> max (aux (n+1) t1) (aux 0 t2)
\r
299 | L t -> max n (aux 0 t)
\r
302 print_cmd "FINISH" "";
\r
303 (* First, a step on the last argument of the divergent.
\r
304 Because of the sanity check, it will never be a constant term. *)
\r
305 let div_hd, div_nargs = get_inert p.div in
\r
306 let div_hd = match div_hd with V n -> n | _ -> assert false in
\r
307 let j = div_nargs - 1 in
\r
308 let arity = compute_max_arity p.conv in
\r
309 let n = 1 + arity + max
\r
310 (compute_max_lambdas_at div_hd j p.div)
\r
311 (compute_max_lambdas_at div_hd j p.conv) in
\r
312 let p = step j n p in
\r
313 (* Now, find first argument of div that is a variable never applied anywhere.
\r
314 It must exist because of some invariant, since we just did a step,
\r
315 and because of the arity of the divergent *)
\r
316 let div_hd, div_nargs = get_inert p.div in
\r
317 let div_hd = match div_hd with V n -> n | _ -> assert false in
\r
318 let rec aux m = function
\r
319 | A(t, V delta_var) ->
\r
320 if delta_var <> div_hd && get_subterms_with_head delta_var p.conv = []
\r
323 | A(t,_) -> aux (m-1) t
\r
324 | _ -> assert false in
\r
325 let m, delta_var = aux div_nargs p.div in
\r
326 let p = subst_in_problem (delta_var, delta) p in
\r
327 let p = subst_in_problem (div_hd, mk_lams delta (m-1)) p in
\r
333 let hd, n_args = get_inert p.div in
\r
335 | C | L _ | A _ -> assert false
\r
337 let tms = get_subterms_with_head hd_var p.conv in
\r
338 if List.exists (fun t -> snd (get_inert t) >= n_args) tms
\r
340 (* let tms = List.sort (fun t1 t2 -> - compare (snd (get_inert t1)) (snd (get_inert t2))) tms in *)
\r
341 List.iter (fun t -> try
\r
342 let js = find_eta_difference p t in
\r
343 (* print_endline (String.concat ", " (List.map string_of_int js)); *)
\r
344 if js = [] then problem_fail p "no eta difference found (div subterm of conv?)";
\r
345 let js = List.rev js in
\r
350 (compute_max_lambdas_at hd_var j p.div)
\r
351 (compute_max_lambdas_at hd_var j p.conv) in
\r
352 ignore (aux (step j k p))
\r
354 print_endline ("Backtracking (eta_diff) because: " ^ s)) js;
\r
355 raise (Fail(-1, "no eta difference"))
\r
357 print_endline ("Backtracking (get_subterms) because: " ^ s)) tms;
\r
358 raise (Fail(-1, "no similar terms"))
\r
361 problem_fail (finish p) "Finish did not complete the problem"
\r
365 with Done sigma -> sigma
\r
368 let problem_of (label, div, convs, ps, var_names) =
\r
370 let rec aux lev = function
\r
371 | `Lam(_, t) -> L (aux (lev+1) t, [])
\r
372 | `I (v, args) -> Listx.fold_left (fun x y -> fst (mk_app x (aux lev y))) (aux lev (`Var v)) args
\r
373 | `Var(v,_) -> if v >= lev && List.nth var_names (v-lev) = "C" then C else V v
\r
374 | `N _ | `Match _ -> assert false in
\r
375 assert (List.length ps = 0);
\r
376 let convs = List.rev convs in
\r
377 let conv = List.fold_left (fun x y -> fst (mk_app x (aux 0 (y :> Num.nf)))) (V (List.length var_names)) convs in
\r
378 let var_names = "@" :: var_names in
\r
379 let div = match div with
\r
380 | Some div -> aux 0 (div :> Num.nf)
\r
381 | None -> assert false in
\r
382 let varno = List.length var_names in
\r
383 {orig_freshno=varno; freshno=1+varno; div; conv; sigma=[]}
\r
387 if is_constant p.div
\r
388 then print_endline "!!! div is stuck. Problem was not run !!!"
\r
389 else if eta_subterm p.div p.conv
\r
390 then print_endline "!!! div is subterm of conv. Problem was not run !!!"
\r
391 else let p = sanity p (* initial sanity check *) in check p (auto p)
\r
394 Problems.main (solve ++ problem_of);
\r
396 (* Example usage of interactive: *)
\r
398 (* let interactive div conv cmds =
\r
399 let p = problem_of div conv in
\r
401 let p = List.fold_left (|>) p cmds in
\r
403 let nth spl n = int_of_string (List.nth spl n) in
\r
405 let s = read_line () in
\r
406 let spl = Str.split (Str.regexp " +") s in
\r
407 s, let uno = List.hd spl in
\r
408 try if uno = "eat" then eat
\r
409 else if uno = "step" then step (nth spl 1) (nth spl 2)
\r
410 else failwith "Wrong input."
\r
411 with Failure s -> print_endline s; (fun x -> x) in
\r
412 let str, cmd = read_cmd () in
\r
413 let cmds = (" " ^ str ^ ";")::cmds in
\r
415 let p = cmd p in f p cmds
\r
417 | Done _ -> print_endline "Done! Commands history: "; List.iter print_endline (List.rev cmds)
\r
419 ) with Done _ -> ()
\r
422 (* interactive "x y"
\r
423 "@ (x x) (y x) (y z)" [step 0 1; step 0 2; eat]
\r