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
18 let delta = L(A(V 0, V 0));;
\r
21 let rec aux l1 l2 t1 t2 = match t1, t2 with
\r
22 | L t1, L t2 -> aux l1 l2 t1 t2
\r
23 | L t1, t2 -> aux l1 (l2+1) t1 t2
\r
24 | t1, L t2 -> aux (l1+1) l2 t1 t2
\r
25 | V a, V b -> a + l1 = b + l2
\r
27 | A(t1,t2), A(u1,u2) -> aux l1 l2 t1 u1 && aux l1 l2 t2 u2
\r
32 (* does NOT lift t *)
\r
33 let mk_lams = fold_nat (fun x _ -> L x) ;;
\r
36 let string_of_bvar =
\r
37 let bound_vars = ["x"; "y"; "z"; "w"; "q"] in
\r
38 let bvarsno = List.length bound_vars in
\r
39 fun nn -> if nn < bvarsno then List.nth bound_vars nn else "x" ^ (string_of_int (nn - bvarsno + 1)) in
\r
40 let rec string_of_term_w_pars level = function
\r
41 | V v -> if v >= level then "`" ^ string_of_int (v-level) else
\r
42 string_of_bvar (level - v-1)
\r
43 | C n -> "c" ^ string_of_int n
\r
45 | L _ as t -> "(" ^ string_of_term_no_pars level t ^ ")"
\r
47 and string_of_term_no_pars_app level = function
\r
48 | A(t1,t2) -> string_of_term_no_pars_app level t1 ^ " " ^ string_of_term_w_pars level t2
\r
49 | _ as t -> string_of_term_w_pars level t
\r
50 and string_of_term_no_pars level = function
\r
51 | L t -> "λ" ^ string_of_bvar level ^ ". " ^ string_of_term_no_pars (level+1) t
\r
52 | _ as t -> string_of_term_no_pars_app level t
\r
53 in string_of_term_no_pars 0
\r
61 ; sigma : (var * t) list (* substitutions *)
\r
62 ; stepped : var list
\r
63 ; phase : [`One | `Two] (* :'( *)
\r
66 let string_of_problem p =
\r
68 "[stepped] " ^ String.concat " " (List.map string_of_int p.stepped);
\r
69 "[DV] " ^ string_of_t p.div;
\r
70 "[CV] " ^ string_of_t p.conv;
\r
72 String.concat "\n" lines
\r
75 exception Done of (var * t) list (* substitution *);;
\r
76 exception Fail of int * string;;
\r
78 let problem_fail p reason =
\r
79 print_endline "!!!!!!!!!!!!!!! FAIL !!!!!!!!!!!!!!!";
\r
80 print_endline (string_of_problem p);
\r
81 raise (Fail (-1, reason))
\r
84 let freshvar ({freshno} as p) =
\r
85 {p with freshno=freshno+1}, freshno+1
\r
90 | A(t,_) -> is_inert t
\r
96 let is_var = function V _ -> true | _ -> false;;
\r
97 let is_lambda = function L _ -> true | _ -> false;;
\r
99 let rec no_leading_lambdas = function
\r
100 | L t -> 1 + no_leading_lambdas t
\r
104 let rec get_inert = function
\r
106 | A(t, _) -> let hd,args = get_inert t in hd,args+1
\r
107 | _ -> assert false
\r
110 let rec subst level delift sub =
\r
112 | V v -> if v = level + fst sub then lift level (snd sub) else V (if delift && v > level then v-1 else v)
\r
113 | L t -> let t = subst (level + 1) delift sub t in if t = B then B else L t
\r
115 let t1 = subst level delift sub t1 in
\r
116 let t2 = subst level delift sub t2 in
\r
120 and mk_app t1 t2 = if t2 = B || (t1 = delta && t2 = delta) then B
\r
124 | L t1 -> subst 0 true (0, t2) t1
\r
129 | V m -> V (if m >= lev then m + n else m)
\r
130 | L t -> L (aux (lev+1) t)
\r
131 | A (t1, t2) -> A (aux lev t1, aux lev t2)
\r
136 let subst = subst 0 false;;
\r
138 let subst_in_problem (sub: var * t) (p: problem) =
\r
139 print_endline ("-- SUBST " ^ string_of_t (V (fst sub)) ^ " |-> " ^ string_of_t (snd sub));
\r
141 div=subst sub p.div;
\r
142 conv=subst sub p.conv;
\r
143 stepped=(fst sub)::p.stepped;
\r
144 sigma=sub::p.sigma}
\r
147 let get_subterm_with_head_and_args hd_var n_args =
\r
148 let rec aux lev = function
\r
151 | L t -> aux (lev+1) t
\r
153 let hd_var', n_args' = get_inert t1 in
\r
154 if hd_var' = hd_var + lev && n_args <= 1 + n_args'
\r
155 then Some (lift ~-lev t)
\r
156 else match aux lev t2 with
\r
157 | None -> aux lev t1
\r
158 | Some _ as res -> res
\r
162 let rec purify = function
\r
163 | L t -> Pure.L (purify t)
\r
164 | A (t1,t2) -> Pure.A (purify t1, purify t2)
\r
166 | C _ -> Pure.V max_int (* FIXME *)
\r
170 let check p sigma =
\r
171 print_endline "Checking...";
\r
172 let div = purify p.div in
\r
173 let conv = purify p.conv in
\r
174 let sigma = List.map (fun (v,t) -> v, purify t) sigma in
\r
175 let freshno = List.fold_right (fun (x,_) -> max x) sigma 0 in
\r
176 let env = Pure.env_of_sigma freshno sigma in
\r
177 assert (Pure.diverged (Pure.mwhd (env,div,[])));
\r
178 assert (not (Pure.diverged (Pure.mwhd (env,conv,[]))));
\r
183 print_endline (string_of_problem p); (* non cancellare *)
\r
184 if p.conv = B then problem_fail p "p.conv diverged";
\r
185 if p.div = B then raise (Done p.sigma);
\r
186 if p.phase = `Two && p.div = delta then raise (Done p.sigma);
\r
187 if not (is_inert p.div) then problem_fail p "p.div converged"
\r
190 (* drops the arguments of t after the n-th *)
\r
191 let inert_cut_at n t =
\r
196 let k', t' = aux t1 in
\r
197 if k' = n then n, t'
\r
199 | _ -> assert false
\r
203 let find_eta_difference p t n_args =
\r
204 let t = inert_cut_at n_args t in
\r
205 let rec aux t u k = match t, u with
\r
206 | V _, V _ -> assert false (* div subterm of conv *)
\r
207 | A(t1,t2), A(u1,u2) ->
\r
208 if not (eta_eq t2 u2) then (print_endline((string_of_t t2) ^ " <> " ^ (string_of_t u2)); k)
\r
209 else aux t1 u1 (k-1)
\r
210 | _, _ -> assert false
\r
211 in aux p.div t n_args
\r
214 let compute_max_lambdas_at hd_var j =
\r
215 let rec aux hd = function
\r
217 (if get_inert t1 = (hd, j)
\r
218 then max ( (*FIXME*)
\r
219 if is_inert t2 && let hd', j' = get_inert t2 in hd' = hd
\r
220 then let hd', j' = get_inert t2 in j - j'
\r
221 else no_leading_lambdas t2)
\r
222 else id) (max (aux hd t1) (aux hd t2))
\r
223 | L t -> aux (hd+1) t
\r
225 | _ -> assert false
\r
229 let print_cmd s1 s2 = print_endline (">> " ^ s1 ^ " " ^ s2);;
\r
231 (* eat the arguments of the divergent and explode.
\r
232 It does NOT perform any check, may fail if done unsafely *)
\r
234 print_cmd "EAT" "";
\r
235 let var, k = get_inert p.div in
\r
236 let phase = p.phase in
\r
241 (compute_max_lambdas_at var k p.div)
\r
242 (compute_max_lambdas_at var k p.conv) in
\r
243 (* apply fresh vars *)
\r
244 let p, t = fold_nat (fun (p, t) _ ->
\r
245 let p, v = freshvar p in
\r
248 let p = {p with phase=`Two} in p, A(t, delta)
\r
249 | `Two -> p, delta in
\r
250 let subst = var, mk_lams t k in
\r
251 let p = subst_in_problem subst p in
\r
252 let p = if phase = `One then {p with div = (match p.div with A(t,_) -> t | _ -> assert false)} else p in
\r
256 (* step on the head of div, on the k-th argument, with n fresh vars *)
\r
258 let var, _ = get_inert p.div in
\r
259 print_cmd "STEP" ("on " ^ string_of_t (V var) ^ " (of:" ^ string_of_int n ^ ")");
\r
260 let p, t = (* apply fresh vars *)
\r
261 fold_nat (fun (p, t) _ ->
\r
262 let p, v = freshvar p in
\r
263 p, A(t, V (v + k + 1))
\r
265 let t = (* apply unused bound variables V_{k-1}..V_1 *)
\r
266 fold_nat (fun t m -> A(t, V (k-m+1))) t k in
\r
267 let t = mk_lams t (k+1) in (* make leading lambdas *)
\r
268 let subst = var, t in
\r
269 let p = subst_in_problem subst p in
\r
274 let rec aux level = function
\r
275 | Parser_andrea.Lam t -> L (aux (level + 1) t)
\r
276 | Parser_andrea.App (t1, t2) ->
\r
277 if level = 0 then mk_app (aux level t1) (aux level t2)
\r
278 else A(aux level t1, aux level t2)
\r
279 | Parser_andrea.Var v -> V v in
\r
280 let (tms, free) = Parser_andrea.parse_many strs in
\r
281 (List.map (aux 0) tms, free)
\r
284 let problem_of div conv =
\r
286 let [@warning "-8"] [div; conv], var_names = parse ([div; conv]) in
\r
287 let varno = List.length var_names in
\r
288 let p = {orig_freshno=varno; freshno=1+varno; div; conv; sigma=[]; stepped=[]; phase=`One} in
\r
289 (* initial sanity check *)
\r
293 let exec div conv cmds =
\r
294 let p = problem_of div conv in
\r
296 problem_fail (List.fold_left (|>) p cmds) "Problem not completed"
\r
302 let hd_var, n_args = get_inert p.div in
\r
303 match get_subterm_with_head_and_args hd_var n_args p.conv with
\r
306 let phase = p.phase in
\r
309 then problem_fail p "Auto.2 did not complete the problem"
\r
311 with Done sigma -> sigma)
\r
313 let j = find_eta_difference p t n_args - 1 in
\r
315 (compute_max_lambdas_at hd_var j p.div)
\r
316 (compute_max_lambdas_at hd_var j p.conv) in
\r
317 let p = step j k p in
\r
321 let interactive div conv cmds =
\r
322 let p = problem_of div conv in
\r
324 let p = List.fold_left (|>) p cmds in
\r
326 let nth spl n = int_of_string (List.nth spl n) in
\r
328 let s = read_line () in
\r
329 let spl = Str.split (Str.regexp " +") s in
\r
330 s, let uno = List.hd spl in
\r
331 try if uno = "eat" then eat
\r
332 else if uno = "step" then step (nth spl 1) (nth spl 2)
\r
333 else failwith "Wrong input."
\r
334 with Failure s -> print_endline s; (fun x -> x) in
\r
335 let str, cmd = read_cmd () in
\r
336 let cmds = (" " ^ str ^ ";")::cmds in
\r
338 let p = cmd p in f p cmds
\r
340 | Done _ -> print_endline "Done! Commands history: "; List.iter print_endline (List.rev cmds)
\r
342 ) with Done _ -> ()
\r
345 let rec conv_join = function
\r
347 | x::xs -> conv_join xs ^ " ("^ x ^")"
\r
351 let p = problem_of a (conv_join b) in
\r
352 let sigma = auto p in
\r
356 (* Example usage of exec, interactive:
\r
360 (conv_join["x y"; "y y"; "y x"])
\r
365 "@ (x x) (y x) (y z)" [step 0 1; step 0 2; eat]
\r
370 auto' "x x" ["x y"; "y y"; "y x"] ;;
\r
371 auto' "x y" ["x (_. x)"; "y z"; "y x"] ;;
\r
372 auto' "a (x. x b) (x. x c)" ["a (x. b b) @"; "a @ c"; "a (x. x x) a"; "a (a a a) (a c c)"] ;;
\r
374 auto' "x (y. x y y)" ["x (y. x y x)"] ;;
\r
376 auto' "x a a a a" [
\r
383 (* Controesempio ad usare un conto dei lambda che non considere le permutazioni *)
\r
384 auto' "x a a a a (x (x. x x) @ @ (_._.x. x x) x) b b b" [
\r
385 "x a a a a (_. a) b b b";
\r
386 "x a a a a (_. _. _. _. x. y. x y)";
\r
391 print_endline "ALL DONE. "
\r