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 rec aux l1 l2 t1 t2 = match t1, t2 with
\r
19 | L t1, L t2 -> aux l1 l2 t1 t2
\r
20 | L t1, t2 -> aux l1 (l2+1) t1 t2
\r
21 | t1, L t2 -> aux (l1+1) l2 t1 t2
\r
22 | V a, V b -> a + l1 = b + l2
\r
23 | A(t1,t2), A(u1,u2) -> aux l1 l2 t1 u1 && aux l1 l2 t2 u2
\r
28 (* does NOT lift t *)
\r
29 let mk_lams = fold_nat (fun x _ -> L x) ;;
\r
32 let string_of_bvar =
\r
33 let bound_vars = ["x"; "y"; "z"; "w"; "q"] in
\r
34 let bvarsno = List.length bound_vars in
\r
35 fun nn -> if nn < bvarsno then List.nth bound_vars nn else "x" ^ (string_of_int (nn - bvarsno + 1)) in
\r
36 let rec string_of_term_w_pars level = function
\r
37 | V v -> if v >= level then "`" ^ string_of_int (v-level) else
\r
38 string_of_bvar (level - v-1)
\r
40 | L _ as t -> "(" ^ string_of_term_no_pars level t ^ ")"
\r
42 and string_of_term_no_pars_app level = function
\r
43 | A(t1,t2) -> string_of_term_no_pars_app level t1 ^ " " ^ string_of_term_w_pars level t2
\r
44 | _ as t -> string_of_term_w_pars level t
\r
45 and string_of_term_no_pars level = function
\r
46 | L t -> "λ" ^ string_of_bvar level ^ ". " ^ string_of_term_no_pars (level+1) t
\r
47 | _ as t -> string_of_term_no_pars_app level t
\r
48 in string_of_term_no_pars 0
\r
56 ; sigma : (var * t) list (* substitutions *)
\r
57 ; stepped : var list
\r
60 let string_of_problem p =
\r
62 "[stepped] " ^ String.concat " " (List.map string_of_int p.stepped);
\r
63 "[DV] " ^ string_of_t p.div;
\r
64 "[CV] " ^ string_of_t p.conv;
\r
66 String.concat "\n" lines
\r
69 exception Done of (var * t) list (* substitution *);;
\r
70 exception Fail of int * string;;
\r
72 let problem_fail p reason =
\r
73 print_endline "!!!!!!!!!!!!!!! FAIL !!!!!!!!!!!!!!!";
\r
74 print_endline (string_of_problem p);
\r
75 raise (Fail (-1, reason))
\r
78 let freshvar ({freshno} as p) =
\r
79 {p with freshno=freshno+1}, freshno+1
\r
84 | A(t,_) -> is_inert t
\r
89 let is_var = function V _ -> true | _ -> false;;
\r
90 let is_lambda = function L _ -> true | _ -> false;;
\r
92 let rec no_leading_lambdas = function
\r
93 | L t -> 1 + no_leading_lambdas t
\r
97 let rec get_inert = function
\r
99 | A(t, _) -> let hd,args = get_inert t in hd,args+1
\r
100 | _ -> assert false
\r
103 let rec subst level delift sub =
\r
105 | V v -> if v = level + fst sub then lift level (snd sub) else V (if delift && v > level then v-1 else v)
\r
106 | L t -> L (subst (level + 1) delift sub t)
\r
108 let t1 = subst level delift sub t1 in
\r
109 let t2 = subst level delift sub t2 in
\r
112 and mk_app t1 t2 = match t1 with
\r
113 | B | _ when t2 = B -> B
\r
114 | L t1 -> subst 0 true (0, t2) t1
\r
119 | V m -> V (if m >= lev then m + n else m)
\r
120 | L t -> L (aux (lev+1) t)
\r
121 | A (t1, t2) -> A (aux lev t1, aux lev t2)
\r
125 let subst = subst 0 false;;
\r
127 let subst_in_problem (sub: var * t) (p: problem) =
\r
128 print_endline ("-- SUBST " ^ string_of_t (V (fst sub)) ^ " |-> " ^ string_of_t (snd sub));
\r
130 div=subst sub p.div;
\r
131 conv=subst sub p.conv;
\r
132 stepped=(fst sub)::p.stepped;
\r
133 sigma=sub::p.sigma}
\r
136 let get_subterm_with_head_and_args hd_var n_args =
\r
137 let rec aux lev = function
\r
139 | L t -> aux (lev+1) t
\r
141 let hd_var', n_args' = get_inert t1 in
\r
142 if hd_var' = hd_var + lev && n_args <= 1 + n_args'
\r
143 then Some (lift ~-lev t)
\r
144 else match aux lev t2 with
\r
145 | None -> aux lev t1
\r
146 | Some _ as res -> res
\r
150 let rec purify = function
\r
151 | L t -> Pure.L (purify t)
\r
152 | A (t1,t2) -> Pure.A (purify t1, purify t2)
\r
157 let check p sigma =
\r
158 let div = purify p.div in
\r
159 let conv = purify p.conv in
\r
160 let sigma = List.map (fun (v,t) -> v, purify t) sigma in
\r
161 let freshno = List.fold_right (fun (x,_) -> max x) sigma 0 in
\r
162 let env = Pure.env_of_sigma freshno sigma in
\r
163 assert (Pure.diverged (Pure.mwhd (env,div,[])));
\r
164 assert (not (Pure.diverged (Pure.mwhd (env,conv,[]))));
\r
169 print_endline (string_of_problem p); (* non cancellare *)
\r
170 if p.conv = B then problem_fail p "p.conv diverged";
\r
171 if p.div = B then raise (Done p.sigma);
\r
172 if not (is_inert p.div) then problem_fail p "p.div converged"
\r
175 let print_cmd s1 s2 = print_endline (">> " ^ s1 ^ " " ^ s2);;
\r
177 (* eat the arguments of the divergent and explode.
\r
178 It does NOT perform any check, may fail if done unsafely *)
\r
180 print_cmd "EAT" "";
\r
181 let var, n = get_inert p.div in
\r
182 let subst = var, mk_lams B n in
\r
183 let p = subst_in_problem subst p in
\r
187 (* step on the head of div, on the k-th argument, with n fresh vars *)
\r
189 let var, _ = get_inert p.div in
\r
190 print_cmd "STEP" ("on " ^ string_of_t (V var) ^ " (of:" ^ string_of_int n ^ ")");
\r
191 let p, t = (* apply fresh vars *)
\r
192 fold_nat (fun (p, t) _ ->
\r
193 let p, v = freshvar p in
\r
194 p, A(t, V (v + k + 1))
\r
196 let t = (* apply unused bound variables V_{k-1}..V_1 *)
\r
197 fold_nat (fun t m -> A(t, V (k-m+1))) t k in
\r
198 let t = mk_lams t (k+1) in (* make leading lambdas *)
\r
199 let subst = var, t in
\r
200 let p = subst_in_problem subst p in
\r
205 let rec aux level = function
\r
206 | Parser_andrea.Lam t -> L (aux (level + 1) t)
\r
207 | Parser_andrea.App (t1, t2) ->
\r
208 if level = 0 then mk_app (aux level t1) (aux level t2)
\r
209 else A(aux level t1, aux level t2)
\r
210 | Parser_andrea.Var v -> V v in
\r
211 let (tms, free) = Parser_andrea.parse_many strs in
\r
212 (List.map (aux 0) tms, free)
\r
215 let problem_of div conv =
\r
217 let [@warning "-8"] [div; conv], var_names = parse ([div; conv]) in
\r
218 let varno = List.length var_names in
\r
219 let p = {orig_freshno=varno; freshno=1+varno; div; conv; sigma=[]; stepped=[]} in
\r
220 (* initial sanity check *)
\r
224 let exec div conv cmds =
\r
225 let p = problem_of div conv in
\r
227 problem_fail (List.fold_left (|>) p cmds) "Problem not completed"
\r
232 (* drops the arguments of t after the n-th *)
\r
233 let inert_cut_at n t =
\r
238 let k', t' = aux t1 in
\r
239 if k' = n then n, t'
\r
241 | _ -> assert false
\r
245 let find_eta_difference p t n_args =
\r
246 let t = inert_cut_at n_args t in
\r
247 let rec aux t u k = match t, u with
\r
248 | V _, V _ -> assert false (* div subterm of conv *)
\r
249 | A(t1,t2), A(u1,u2) ->
\r
250 if not (eta_eq t2 u2) then (print_endline((string_of_t t2) ^ " <> " ^ (string_of_t u2)); k)
\r
251 else aux t1 u1 (k-1)
\r
252 | _, _ -> assert false
\r
253 in aux p.div t n_args
\r
256 let compute_max_lambdas_at hd_var j =
\r
257 let rec aux hd = function
\r
259 (if get_inert t1 = (hd, j)
\r
260 then max ( (*FIXME*)
\r
261 if is_inert t2 && let hd', j' = get_inert t2 in hd' = hd
\r
262 then let hd', j' = get_inert t2 in j - j'
\r
263 else no_leading_lambdas t2)
\r
264 else id) (max (aux hd t1) (aux hd t2))
\r
265 | L t -> aux (hd+1) t
\r
267 | _ -> assert false
\r
272 let hd_var, n_args = get_inert p.div in
\r
273 match get_subterm_with_head_and_args hd_var n_args p.conv with
\r
275 (try problem_fail (eat p) "Auto did not complete the problem" with Done sigma -> sigma)
\r
277 let j = find_eta_difference p t n_args - 1 in
\r
279 (compute_max_lambdas_at hd_var j p.div)
\r
280 (compute_max_lambdas_at hd_var j p.conv) in
\r
281 let p = step j k p in
\r
285 let interactive div conv cmds =
\r
286 let p = problem_of div conv in
\r
288 let p = List.fold_left (|>) p cmds in
\r
290 let nth spl n = int_of_string (List.nth spl n) in
\r
292 let s = read_line () in
\r
293 let spl = Str.split (Str.regexp " +") s in
\r
294 s, let uno = List.hd spl in
\r
295 try if uno = "eat" then eat
\r
296 else if uno = "step" then step (nth spl 1) (nth spl 2)
\r
297 else failwith "Wrong input."
\r
298 with Failure s -> print_endline s; (fun x -> x) in
\r
299 let str, cmd = read_cmd () in
\r
300 let cmds = (" " ^ str ^ ";")::cmds in
\r
302 let p = cmd p in f p cmds
\r
304 | Done _ -> print_endline "Done! Commands history: "; List.iter print_endline (List.rev cmds)
\r
306 ) with Done _ -> ()
\r
309 let rec conv_join = function
\r
311 | x::xs -> conv_join xs ^ " ("^ x ^")"
\r
315 let p = problem_of a (conv_join b) in
\r
316 let sigma = auto p in
\r
320 (* Example usage of exec, interactive:
\r
324 (conv_join["x y"; "y y"; "y x"])
\r
329 "@ (x x) (y x) (y z)" [step 0 1; step 0 2; eat]
\r
334 auto' "x x" ["x y"; "y y"; "y x"] ;;
\r
335 auto' "x y" ["x (_. x)"; "y z"; "y x"] ;;
\r
336 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
338 auto' "x (y. x y y)" ["x (y. x y x)"] ;;
\r
340 auto' "x a a a a" [
\r
347 (* Controesempio ad usare un conto dei lambda che non considere le permutazioni *)
\r
348 auto' "x a a a a (x (x. x x) @ @ (_._.x. x x) x) b b b" [
\r
349 "x a a a a (_. a) b b b";
\r
350 "x a a a a (_. _. _. _. x. y. x y)";
\r
355 print_endline "ALL DONE. "
\r