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_______________________________________________________________ *)
22 module BE = BrgEnvironment
25 e: B.lenv; (* environment *)
26 s: (B.lenv * B.term) list; (* stack *)
28 n: int option; (* expected type iterations *)
31 type message = (rtm, B.term) L.message
33 (* Internal functions *******************************************************)
37 let sublevel = succ level
40 let s1, s2 = s ^ " in the environment", "the term" in
41 L.log st BO.specs (pred level) (L.et_items1 s1 c s2 t)
43 let log2 st s cu u ct t =
44 let s1, s2, s3 = s ^ " in the environment (expected)", "the term", "and in the environment (inferred)" in
45 L.log st BO.specs (pred level) (L.et_items2 s1 cu s2 u ~sc2:s3 ~c2:ct s2 t)
47 let rec list_and map = function
48 | hd1 :: tl1, hd2 :: tl2 ->
49 if map hd1 hd2 then list_and map (tl1, tl2) else false
55 let are_alpha_convertible err f t1 t2 =
56 let rec aux f = function
57 | B.Sort (_, p1), B.Sort (_, p2)
58 | B.LRef (_, p1), B.LRef (_, p2) ->
59 if p1 = p2 then f () else err ()
60 | B.GRef (_, u1), B.GRef (_, u2) ->
61 if U.eq u1 u2 then f () else err ()
62 | B.Cast (_, v1, t1), B.Cast (_, v2, t2)
63 | B.Appl (_, v1, t1), B.Appl (_, v2, t2) ->
64 let f _ = aux f (t1, t2) in
66 | B.Bind (_, b1, t1), B.Bind (_, b2, t2) ->
67 let f _ = aux f (t1, t2) in
70 and aux_bind f = function
71 | B.Abbr v1, B.Abbr v2 -> aux f (v1, v2)
72 | B.Abst (x1, n1, v1), B.Abst (x2, n2, v2) when x1 = x2 && n1 = n2 -> aux f (v1, v2)
73 | B.Void, B.Void -> f ()
76 if S.eq t1 t2 then f () else aux f (t1, t2)
78 let assert_tstep m vo = match m.n with
82 let tstep m = match m.n with
83 | Some n -> {m with n = Some (pred n)}
86 let tsteps m = match m.n with
91 let _, c, a, b = B.get m.e i in c, a, b
95 if !G.trace >= sublevel then
96 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;
99 if assert_tstep m false then
100 step st (tstep m) (B.Sort (a, H.apply h))
103 begin match BE.get_entity uri with
104 | _, _, _, E.Abbr v ->
105 if m.n = None || !G.expand then begin
106 if !G.summary then O.add ~gdelta:1 ();
110 | _, _, _, E.Abst w ->
111 if assert_tstep m true then begin
112 if !G.summary then O.add ~grt:1 ();
120 begin match get m i with
122 if !G.summary then O.add ~ldelta:1 ();
123 step st {m with e = c} v
124 | c, a, B.Abst (_, _, w) ->
125 if assert_tstep m true then begin
126 if !G.summary then O.add ~lrt:1 ();
127 step st {(tstep m) with e = c} w
129 m, B.LRef (a, i), None
133 | B.Cast (_, u, t) ->
134 if assert_tstep m false then begin
135 if !G.summary then O.add ~e:1 ();
138 if !G.summary then O.add ~epsilon:1 ();
141 | B.Appl (_, v, t) ->
142 step st {m with s = (m.e, v) :: m.s} t
143 | B.Bind (a, B.Abst (false, n, w), t) ->
145 if !G.summary then O.add ~x:i ();
146 let n = if i = 0 then n else N.minus st n i in
147 let r = B.Bind (a, B.Abst (true, n, w), t) in
149 | B.Bind (a, B.Abst (true, n, w), t) ->
150 if !G.si || N.is_not_zero st n then begin match m.s with
152 m, B.Bind (a, B.Abst (true, n, w), t), None
155 if !G.cc && not (N.assert_not_zero st n) then assert false;
157 if !G.summary then O.add ~beta:1 ~theta:(List.length s) ();
158 let v = B.Cast (E.empty_node, w, v) in
159 let e = B.push m.e c a (B.abbr v) in
160 step st {m with e = e; s = s} t
162 if !G.summary then O.add ~upsilon:1 ();
163 let e = B.push m.e m.e a B.Void in (**) (* this is wrong in general *)
164 step st {m with e = e} t
166 | B.Bind (a, b, t) ->
167 if !G.summary then O.add ~theta:(List.length m.s) ();
168 let e = B.push m.e m.e a b in
169 step st {m with e = e} t
171 let assert_iterations m1 m2 =
174 let reset m ?(e=m.e) n =
175 {m with e = e; n = n; s = []}
178 let a, l = match b with
179 | B.Abst _ -> {a with E.n_apix = m.l}, succ m.l
182 let e = B.push m.e m.e a b in
183 {m with e = e; l = l}
185 let rec ac_nfs st (m1, t1, r1) (m2, t2, r2) =
186 if !G.trace >= level then log2 st "Now converting nfs" m1.e t1 m2.e t2;
187 match t1, r1, t2, r2 with
188 | B.Sort (_, h1), _, B.Sort (_, h2), _ ->
190 | B.LRef ({E.n_apix = e1}, _), _,
191 B.LRef ({E.n_apix = e2}, _), _ ->
192 if e1 = e2 then ac_stacks st m1 m2 else false
193 | B.GRef (_, u1), None, B.GRef (_, u2), None ->
194 if U.eq u1 u2 && assert_iterations m1 m2 then ac_stacks st m1 m2 else false
195 | B.GRef ({E.n_apix = e1}, u1), Some v1,
196 B.GRef ({E.n_apix = e2}, u2), Some v2 ->
197 if e1 < e2 then begin
198 if !G.summary then O.add ~gdelta:1 ();
199 ac_nfs st (m1, t1, r1) (step st m2 v2)
200 end else if e2 < e1 then begin
201 if !G.summary then O.add ~gdelta:1 ();
202 ac_nfs st (step st m1 v1) (m2, t2, r2)
203 end else if U.eq u1 u2 && assert_iterations m1 m2 && ac_stacks st m1 m2 then true
205 if !G.summary then O.add ~gdelta:2 ();
208 | _, _, B.GRef _, Some v2 ->
209 if !G.summary then O.add ~gdelta:1 ();
210 ac_nfs st (m1, t1, r1) (step st m2 v2)
211 | B.GRef _, Some v1, _, _ ->
212 if !G.summary then O.add ~gdelta:1 ();
213 ac_nfs st (step st m1 v1) (m2, t2, r2)
214 | B.Bind (a1, (B.Abst (true, n1, w1) as b1), t1), _,
215 B.Bind (a2, (B.Abst (true, n2, w2) as b2), t2), _ ->
216 if ((!G.cc && N.assert_equal st n1 n2) || N.are_equal st n1 n2) &&
217 ac st (reset m1 zero) w1 (reset m2 zero) w2
218 then ac st (push m1 a1 b1) t1 (push m2 a2 b2) t2
220 | B.Sort _, _, B.Bind (a, B.Abst (true, n, _), t), _ ->
222 if !G.cc && not (N.assert_zero st n) then false else begin
223 if !G.summary then O.add ~upsilon:1 ();
224 ac st (push m1 a B.Void) t1 (push m2 a B.Void) t end
228 and ac st m1 t1 m2 t2 =
229 (* L.warn "entering R.are_convertible"; *)
230 ac_nfs st (step st m1 t1) (step st m2 t2)
232 and ac_stacks st m1 m2 =
233 (* L.warn "entering R.are_convertible_stacks"; *)
234 if List.length m1.s <> List.length m2.s then false else
235 let map (c1, v1) (c2, v2) =
236 let m1, m2 = reset m1 ~e:c1 zero, reset m2 ~e:c2 zero in
239 list_and map (m1.s, m2.s)
241 (* Interface functions ******************************************************)
244 e = B.empty; s = []; l = 0; n = None
249 let _, _, _, b = B.get m.e i in b
252 if !G.trace >= level then log1 st "Now scanning" m.e t;
253 let m, t, _ = step st (reset m n) t in
256 let are_convertible st m1 n1 t1 m2 n2 t2 =
257 if !G.trace >= level then log2 st "Now converting" m1.e t1 m2.e t2;
258 let r = ac st (reset m1 n1) t1 (reset m2 n2) t2 in
261 if S.eq mu mw then are_alpha_convertible err f u w else err () *)
263 (* error reporting **********************************************************)
265 let pp_term st m och t = BO.specs.L.pp_term st m.e och t
267 let pp_lenv st och m = BO.specs.L.pp_lenv st och m.e
270 L.pp_term = pp_term; L.pp_lenv = pp_lenv