2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
24 module BE = BrgEnvironment
27 e: B.lenv; (* environment *)
28 s: (B.lenv * B.term) list; (* stack *)
30 d: int; (* inferred type iterations *)
31 n: int option; (* expected type iterations *)
34 type message = (kam, B.term) L.message
36 (* Internal functions *******************************************************)
41 let sc, st = s ^ " in the environment", "the term" in
42 L.log BO.specs level (L.et_items1 sc c st t)
44 let log2 s cu u ct t =
45 let s1, s2, s3 = s ^ " in the environment (expected)", "the term", "and in the environment (inferred)" in
46 L.log BO.specs level (L.et_items2 s1 cu s2 u ~sc2:s3 ~c2:ct s2 t)
48 let rec list_and map = function
49 | hd1 :: tl1, hd2 :: tl2 ->
50 if map hd1 hd2 then list_and map (tl1, tl2) else false
56 let are_alpha_convertible err f t1 t2 =
57 let rec aux f = function
58 | B.Sort (_, p1), B.Sort (_, p2)
59 | B.LRef (_, p1), B.LRef (_, p2) ->
60 if p1 = p2 then f () else err ()
61 | B.GRef (_, u1), B.GRef (_, u2) ->
62 if U.eq u1 u2 then f () else err ()
63 | B.Cast (_, v1, t1), B.Cast (_, v2, t2)
64 | B.Appl (_, v1, t1), B.Appl (_, v2, t2) ->
65 let f _ = aux f (t1, t2) in
67 | B.Bind (_, b1, t1), B.Bind (_, b2, t2) ->
68 let f _ = aux f (t1, t2) in
71 and aux_bind f = function
72 | B.Abbr v1, B.Abbr v2 -> aux f (v1, v2)
73 | B.Abst (n1, v1), B.Abst (n2, v2) when n1 = n2 -> aux f (v1, v2)
74 | B.Void, B.Void -> f ()
77 if W.eq t1 t2 then f () else aux f (t1, t2)
79 let assert_tstep m vo = match m.n with
83 let tstep m = {m with d = succ m.d}
86 let _, c, a, b = B.get m.e i in c, a, b
91 log1 (Printf.sprintf "entering R.step: l:%u d:%i n:%s" m.l m.d (match m.n with Some n -> string_of_int n | None -> "infinite")) m.e x;
95 if assert_tstep m false then
96 step st (tstep m) (B.Sort (a, H.apply h))
99 begin match BE.get_entity uri with
100 | _, _, _, E.Abbr v ->
101 if st.S.delta then begin
102 if !G.summary then O.add ~gdelta:1 ();
106 | _, _, _, E.Abst w ->
107 if assert_tstep m true then begin
108 if !G.summary then O.add ~grt:1 ();
116 begin match get m i with
118 if !G.summary then O.add ~ldelta:1 ();
119 step st {m with e = c} v
120 | c, a, B.Abst (_, w) ->
121 if assert_tstep m true then begin
122 if !G.summary then O.add ~lrt:1 ();
123 step st {(tstep m) with e = c} w
125 m, B.LRef (a, i), None
129 | B.Cast (_, u, t) ->
130 if assert_tstep m false then begin
131 if !G.summary then O.add ~e:1 ();
134 if !G.summary then O.add ~epsilon:1 ();
137 | B.Appl (_, v, t) ->
138 step st {m with s = (m.e, v) :: m.s} t
139 | B.Bind (a, B.Abst (n, w), t) ->
142 if n = N.infinite || m.d = 0 then m, x, None else
143 let n = N.minus n m.d in
144 m, B.Bind (a, B.Abst (n, w), t), None
146 (* if N.is_zero n then Q.add_nonzero st.S.cc a; *)
147 if !G.summary then O.add ~beta:1 ~theta:(List.length s) ();
148 let v = if assert_tstep m false then B.Cast (E.empty_node, w, v) else v in
149 let e = B.push m.e c a (B.abbr v) in
150 step st {m with e = e; s = s} t
152 | B.Bind (a, b, t) ->
153 if !G.summary then O.add ~theta:(List.length m.s) ();
154 let e = B.push m.e m.e a b in
155 step st {m with e = e} t
157 let reset m ?(e=m.e) n =
158 {m with e = e; n = n; s = []; d = 0}
160 let assert_iterations m1 m2 = match m1.n, m2.n with
161 | Some n1, Some n2 -> n1 - m1.d = n2 - m2.d
165 let a, l = match b with
166 | B.Abst _ -> {a with E.n_apix = Some m.l}, succ m.l
169 let e = B.push m.e m.e a b in
170 {m with e = e; l = l}
172 let rec ac_nfs st (m1, t1, r1) (m2, t2, r2) =
173 if !G.trace >= level then log2 "Now converting nfs" m1.e t1 m2.e t2;
174 match t1, r1, t2, r2 with
175 | B.Sort (_, h1), _, B.Sort (_, h2), _ ->
177 | B.LRef ({E.n_apix = Some e1}, _), _,
178 B.LRef ({E.n_apix = Some e2}, _), _ ->
179 if e1 = e2 then ac_stacks st m1 m2 else false
180 | B.GRef (_, u1), None, B.GRef (_, u2), None ->
181 if U.eq u1 u2 && assert_iterations m1 m2 then ac_stacks st m1 m2 else false
182 | B.GRef ({E.n_apix = Some e1}, u1), Some v1,
183 B.GRef ({E.n_apix = Some e2}, u2), Some v2 ->
184 if e1 < e2 then begin
185 if !G.summary then O.add ~gdelta:1 ();
186 ac_nfs st (m1, t1, r1) (step st m2 v2)
187 end else if e2 < e1 then begin
188 if !G.summary then O.add ~gdelta:1 ();
189 ac_nfs st (step st m1 v1) (m2, t2, r2)
190 end else if U.eq u1 u2 && assert_iterations m1 m2 && ac_stacks st m1 m2 then true
192 if !G.summary then O.add ~gdelta:2 ();
195 | _, _, B.GRef _, Some v2 ->
196 if !G.summary then O.add ~gdelta:1 ();
197 ac_nfs st (m1, t1, r1) (step st m2 v2)
198 | B.GRef _, Some v1, _, _ ->
199 if !G.summary then O.add ~gdelta:1 ();
200 ac_nfs st (step st m1 v1) (m2, t2, r2)
201 | B.Bind (a1, (B.Abst (n1, w1) as b1), t1), _,
202 B.Bind (a2, (B.Abst (n2, w2) as b2), t2), _ ->
203 (* if n1 = n2 then () else Q.add_equal st.S.cc a1 a2; *)
204 if ac {st with S.si = false} (reset m1 zero) w1 (reset m2 zero) w2 then
205 ac st (push m1 a1 b1) t1 (push m2 a2 b2) t2
207 | B.Sort _, _, B.Bind (a, (B.Abst (n, _) as b), t), _ ->
208 if st.S.si then begin
209 (* if N.is_zero n then () else Q.add_zero st.S.cc a; *)
210 if !G.summary then O.add ~si:1 ();
211 ac st (push m1 a b) t1 (push m2 a b) t
215 and ac st m1 t1 m2 t2 =
216 (* L.warn "entering R.are_convertible"; *)
217 ac_nfs st (step st m1 t1) (step st m2 t2)
219 and ac_stacks st m1 m2 =
220 (* L.warn "entering R.are_convertible_stacks"; *)
221 if List.length m1.s <> List.length m2.s then false else
222 let map (c1, v1) (c2, v2) =
223 let m1, m2 = reset m1 ~e:c1 zero, reset m2 ~e:c2 zero in
224 ac {st with S.si = false} m1 v1 m2 v2
226 list_and map (m1.s, m2.s)
228 (* Interface functions ******************************************************)
231 e = B.empty; s = []; l = 0; d = 0; n = None
236 let _, _, _, b = B.get m.e i in b
239 if !G.trace >= level then log1 "Now scanning" m.e t;
240 let m, t, _ = step {st with S.delta = true} (reset m n) t in
243 let are_convertible st m1 n1 t1 m2 n2 t2 =
244 if !G.trace >= level then log2 "Now converting" m1.e t1 m2.e t2;
245 let r = ac {st with S.delta = !G.expand} (reset m1 n1) t1 (reset m2 n2) t2 in
248 if W.eq mu mw then are_alpha_convertible err f u w else err () *)
250 (* error reporting **********************************************************)
252 let pp_term m frm t = BO.specs.L.pp_term m.e frm t
254 let pp_lenv frm m = BO.specs.L.pp_lenv frm m.e
257 L.pp_term = pp_term; L.pp_lenv = pp_lenv