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_______________________________________________________________ *)
23 module BE = BrgEnvironment
26 e: B.lenv; (* environment *)
27 s: (B.lenv * B.term) list; (* stack *)
29 n: int option; (* expected type iterations *)
32 type message = (rtm, B.term) L.message
34 (* Internal functions *******************************************************)
38 let sublevel = succ level
41 let s1, s2 = s ^ " in the environment", "the term" in
42 L.log st BO.specs (pred level) (L.et_items1 s1 c s2 t)
44 let log2 st 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 st BO.specs (pred level) (L.et_items2 s1 cu s2 u ~sc2:s3 ~c2:ct s2 t)
48 let rec list_and f map = function
49 | hd1 :: tl1, hd2 :: tl2 ->
50 let f b = f (b && map hd1 hd2) in
51 list_and f map (tl1, tl2)
52 | l1, l2 -> f (l1 = l2)
57 let are_alpha_convertible err f t1 t2 =
58 let rec aux f = function
59 | B.Sort p1, B.Sort p2
60 | B.LRef (_, p1), B.LRef (_, p2) ->
61 if p1 = p2 then f () else err ()
62 | B.GRef (_, u1), B.GRef (_, u2) ->
63 if U.eq u1 u2 then f () else err ()
64 | B.Cast (v1, t1), B.Cast (v2, t2)
65 | B.Appl (_, v1, t1), B.Appl (_, v2, t2) ->
66 let f _ = aux f (t1, t2) in
68 | B.Bind (_, b1, t1), B.Bind (_, b2, t2) ->
69 let f _ = aux f (t1, t2) in
72 and aux_bind f = function
73 | B.Abbr v1, B.Abbr v2 -> aux f (v1, v2)
74 | B.Abst (r1, n1, v1), B.Abst (r2, n2, v2) when r1 = r2 && n1 = n2 -> aux f (v1, v2)
75 | B.Void, B.Void -> f ()
78 if S.eq t1 t2 then f () else aux f (t1, t2)
80 let assert_tstep m vo = match m.n with
84 let tstep m = match m.n with
85 | Some n -> {m with n = Some (pred n)}
88 let tsteps m = match m.n with
93 let _, c, a, _, b = B.get m.e i in c, a, b
98 if !G.ct >= sublevel then
99 log1 st (Printf.sprintf "entering R.step: l=%u, n=%s," m.l (match m.n with Some n -> string_of_int n | None -> "infinite")) m.e r
103 if assert_tstep m false then
104 step st (tstep m) (B.Sort (H.apply k))
107 begin match BE.get_entity u with
108 | _, a, _, E.Abbr v ->
109 m, B.gref a u, Some v
110 | _, _, _, E.Abst w ->
111 if assert_tstep m true then begin
113 if !G.summary then O.add ~grt:1 ()
122 begin match get m i with
125 if !G.summary then O.add ~ldelta:1 ()
127 step st {m with e = c} v
128 | c, a, B.Abst (_, _, w) ->
129 if assert_tstep m true then begin
131 if !G.summary then O.add ~lrt:1 ()
133 step st {(tstep m) with e = c} w
140 if assert_tstep m false then begin
142 if !G.summary then O.add ~e:1 ()
147 if !G.summary then O.add ~epsilon:1 ()
151 | B.Appl (_, v, t) ->
152 step st {m with s = (m.e, v) :: m.s} t
153 | B.Bind (y, B.Abst (false, n, w), t) ->
156 if !G.summary then O.add ~x:i ()
158 let n = if i = 0 then n else N.minus st n i in
159 let r = B.Bind (y, B.Abst (true, n, w), t) in
161 | B.Bind (y, B.Abst (true, n, w), t) ->
162 if !G.si || N.is_not_zero st n then begin match m.s with
164 m, B.Bind (y, B.Abst (true, n, w), t), None
167 if !G.summary then O.add ~beta:1 ~theta:(List.length s) ()
169 let v = B.Cast (w, v) in
170 let e = B.push m.e c E.empty_node y (B.abbr v) in
171 step st {m with e = e; s = s} t
174 if !G.summary then O.add ~upsilon:1 ()
176 let e = B.push m.e m.e E.empty_node y B.Void in (**) (* this is wrong in general *)
177 step st {m with e = e} t
179 | B.Bind (y, b, t) ->
181 if !G.summary then O.add ~theta:(List.length m.s) ()
183 let e = B.push m.e m.e E.empty_node y b in
184 step st {m with e = e} t
186 let assert_iterations m1 m2 =
189 let reset m ?(e=m.e) n =
190 {m with e = e; n = n; s = []}
193 let a, l = match b with
194 | B.Abst _ -> E.node_attrs ~apix:m.l (), succ m.l
195 | _ -> E.empty_node, m.l
197 let e = B.push m.e m.e a y b in
198 {m with e = e; l = l}
200 let rec ac_nfs st (m1, t1, r1) (m2, t2, r2) =
202 if !G.ct >= level then log2 st "Now converting nfs" m1.e t1 m2.e t2
204 match t1, r1, t2, r2 with
205 | B.Sort k1, _, B.Sort k2, _ ->
207 | B.LRef ({E.n_apix = e1}, _), _,
208 B.LRef ({E.n_apix = e2}, _), _ ->
209 if e1 = e2 then ac_stacks st m1 m2 else false
210 | B.GRef (_, u1), None, B.GRef (_, u2), None ->
211 if U.eq u1 u2 && assert_iterations m1 m2 then ac_stacks st m1 m2 else false
212 | B.GRef ({E.n_apix = e1}, u1), Some v1,
213 B.GRef ({E.n_apix = e2}, u2), Some v2 ->
214 if U.eq u1 u2 && assert_iterations m1 m2 && ac_stacks st m1 m2 then true
215 else if e1 < e2 then begin
217 if !G.summary then O.add ~gdelta:1 ()
219 ac_nfs st (m1, t1, r1) (step st m2 v2)
220 end else if e2 < e1 then begin
222 if !G.summary then O.add ~gdelta:1 ()
224 ac_nfs st (step st m1 v1) (m2, t2, r2)
227 if !G.summary then O.add ~gdelta:2 ()
231 | _, _, B.GRef _, Some v2 ->
233 if !G.summary then O.add ~gdelta:1 ()
235 ac_nfs st (m1, t1, r1) (step st m2 v2)
236 | B.GRef _, Some v1, _, _ ->
238 if !G.summary then O.add ~gdelta:1 ()
240 ac_nfs st (step st m1 v1) (m2, t2, r2)
241 | B.Bind (y1, (B.Abst (true, n1, w1) as b1), t1), _,
242 B.Bind (y2, (B.Abst (true, n2, w2) as b2), t2), _ ->
243 if ((!G.cc && N.assert_equal st n1 n2) || N.are_equal st n1 n2) &&
244 ac st (reset m1 zero) w1 (reset m2 zero) w2
245 then ac st (push m1 y1 b1) t1 (push m2 y2 b2) t2
247 | B.Sort _, _, B.Bind (y, B.Abst (true, n, _), t), _ ->
249 if !G.cc && not (N.assert_zero st n) then false else begin
251 if !G.summary then O.add ~upsilon:1 ()
253 ac st (push m1 y B.Void) t1 (push m2 y B.Void) t end
257 and ac st m1 t1 m2 t2 =
258 (* L.warn "entering R.are_convertible"; *)
259 ac_nfs st (step st m1 t1) (step st m2 t2)
261 and ac_stacks st m1 m2 =
262 (* L.warn "entering R.are_convertible_stacks"; *)
263 let map (c1, v1) (c2, v2) =
264 let m1, m2 = reset m1 ~e:c1 zero, reset m2 ~e:c2 zero in
267 list_and C.start map (m1.s, m2.s)
269 let rec ih_nfs st (m, t, r) =
271 | B.GRef _, Some v ->
273 if !G.summary then O.add ~gdelta:1 ()
278 and ih st m t = ih_nfs st (step st m t)
280 (* Interface functions ******************************************************)
283 e = B.empty; s = []; l = 0; n = None
288 let _, _, _, _, b = B.get m.e i in b
292 if !G.ct >= level then log1 st "Now scanning" m.e t
296 let are_convertible st m1 n1 t1 m2 n2 t2 =
298 if !G.ct >= level then log2 st "Now converting" m1.e t1 m2.e t2
300 let r = ac st (reset m1 n1) t1 (reset m2 n2) t2 in
303 if S.eq mu mw then are_alpha_convertible err f u w else err () *)
305 (* error reporting **********************************************************)
307 let pp_term st m och t = BO.specs.L.pp_term st m.e och t
309 let pp_lenv st och m = BO.specs.L.pp_lenv st och m.e
312 L.pp_term = pp_term; L.pp_lenv = pp_lenv