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 d: int; (* inferred type iterations *)
30 n: int option; (* expected type iterations *)
33 type message = (rtm, B.term) L.message
35 (* Internal functions *******************************************************)
39 let sublevel = succ level
42 let s1, s2 = s ^ " in the environment", "the term" in
43 L.log st BO.specs level (L.et_items1 s1 c s2 t)
45 let log2 st s cu u ct t =
46 let s1, s2, s3 = s ^ " in the environment (expected)", "the term", "and in the environment (inferred)" in
47 L.log st BO.specs level (L.et_items2 s1 cu s2 u ~sc2:s3 ~c2:ct s2 t)
49 let rec list_and map = function
50 | hd1 :: tl1, hd2 :: tl2 ->
51 if map hd1 hd2 then list_and map (tl1, tl2) else false
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 (n1, v1), B.Abst (n2, v2) when n1 = n2 -> aux f (v1, v2)
75 | B.Void, B.Void -> f ()
78 if W.eq t1 t2 then f () else aux f (t1, t2)
80 let assert_tstep m vo = match m.n with
84 let tstep m = {m with d = succ m.d}
86 let tsteps m = match m.n with
87 | Some n when n > m.d -> n - m.d
91 let _, c, a, b = B.get m.e i in c, a, b
95 if !G.trace >= sublevel then
96 log1 st.S.lenv (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;
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 (n, w), t) ->
144 (* if not !G.cc && st.S.si && N.to_string st.S.lenv n = "0" then begin
145 if !G.summary then O.add ~upsilon:1 ();
146 let e = B.push m.e m.e a B.Void in
147 step st {m with e = e} t
148 end else *) begin match m.s with
151 if i = 0 then m, x, None else
152 let n = N.minus st.S.lenv n i in
153 m, B.Bind (a, B.Abst (n, w), t), None
155 if !G.cc && not (N.assert_not_zero st.S.lenv n) then assert false;
156 if !G.summary then O.add ~beta:1 ~theta:(List.length s) ();
157 let v = if assert_tstep m false then B.Cast (E.empty_node, w, v) else v in
158 let e = B.push m.e c a (B.abbr v) in
159 step st {m with e = e; s = s} t
161 | B.Bind (a, b, t) ->
162 if !G.summary then O.add ~theta:(List.length m.s) ();
163 let e = B.push m.e m.e a b in
164 step st {m with e = e} t
166 let reset m ?(e=m.e) n =
167 {m with e = e; n = n; s = []; d = 0}
169 let assert_iterations m1 m2 = match m1.n, m2.n with
170 | Some n1, Some n2 -> n1 - m1.d = n2 - m2.d
174 let a, l = match b with
175 | B.Abst _ -> {a with E.n_apix = m.l}, succ m.l
178 let e = B.push m.e m.e a b in
179 {m with e = e; l = l}
181 let rec ac_nfs st (m1, t1, r1) (m2, t2, r2) =
182 if !G.trace >= level then log2 st.S.lenv "Now converting nfs" m1.e t1 m2.e t2;
183 match t1, r1, t2, r2 with
184 | B.Sort (_, h1), _, B.Sort (_, h2), _ ->
186 | B.LRef ({E.n_apix = e1}, _), _,
187 B.LRef ({E.n_apix = e2}, _), _ ->
188 if e1 = e2 then ac_stacks st m1 m2 else false
189 | B.GRef (_, u1), None, B.GRef (_, u2), None ->
190 if U.eq u1 u2 && assert_iterations m1 m2 then ac_stacks st m1 m2 else false
191 | B.GRef ({E.n_apix = e1}, u1), Some v1,
192 B.GRef ({E.n_apix = e2}, u2), Some v2 ->
193 if e1 < e2 then begin
194 if !G.summary then O.add ~gdelta:1 ();
195 ac_nfs st (m1, t1, r1) (step st m2 v2)
196 end else if e2 < e1 then begin
197 if !G.summary then O.add ~gdelta:1 ();
198 ac_nfs st (step st m1 v1) (m2, t2, r2)
199 end else if U.eq u1 u2 && assert_iterations m1 m2 && ac_stacks st m1 m2 then true
201 if !G.summary then O.add ~gdelta:2 ();
204 | _, _, B.GRef _, Some v2 ->
205 if !G.summary then O.add ~gdelta:1 ();
206 ac_nfs st (m1, t1, r1) (step st m2 v2)
207 | B.GRef _, Some v1, _, _ ->
208 if !G.summary then O.add ~gdelta:1 ();
209 ac_nfs st (step st m1 v1) (m2, t2, r2)
210 | B.Bind (a1, (B.Abst (n1, w1) as b1), t1), _,
211 B.Bind (a2, (B.Abst (n2, w2) as b2), t2), _ ->
212 if !G.cc && not (N.assert_equal st.S.lenv n1 n2) then false else
213 if ac {st with S.si = false} (reset m1 zero) w1 (reset m2 zero) w2 then
214 ac st (push m1 a1 b1) t1 (push m2 a2 b2) t2
216 | B.Sort _, _, B.Bind (a, B.Abst (n, _), t), _ ->
218 if !G.cc && not (N.assert_zero st.S.lenv n) then false else begin
219 if !G.summary then O.add ~upsilon:1 ();
220 ac st (push m1 a B.Void) t1 (push m2 a B.Void) t end
224 and ac st m1 t1 m2 t2 =
225 (* L.warn "entering R.are_convertible"; *)
226 ac_nfs st (step st m1 t1) (step st m2 t2)
228 and ac_stacks st m1 m2 =
229 (* L.warn "entering R.are_convertible_stacks"; *)
230 if List.length m1.s <> List.length m2.s then false else
231 let map (c1, v1) (c2, v2) =
232 let m1, m2 = reset m1 ~e:c1 zero, reset m2 ~e:c2 zero in
233 ac {st with S.si = false} m1 v1 m2 v2
235 list_and map (m1.s, m2.s)
237 (* Interface functions ******************************************************)
240 e = B.empty; s = []; l = 0; d = 0; n = None
245 let _, _, _, b = B.get m.e i in b
248 if !G.trace >= level then log1 st.S.lenv "Now scanning" m.e t;
249 let m, t, _ = step st (reset m n) t in
252 let are_convertible st m1 n1 t1 m2 n2 t2 =
253 if !G.trace >= level then log2 st.S.lenv "Now converting" m1.e t1 m2.e t2;
254 let r = ac st (reset m1 n1) t1 (reset m2 n2) t2 in
257 if W.eq mu mw then are_alpha_convertible err f u w else err () *)
259 (* error reporting **********************************************************)
261 let pp_term st m och t = BO.specs.L.pp_term st m.e och t
263 let pp_lenv st och m = BO.specs.L.pp_lenv st och m.e
266 L.pp_term = pp_term; L.pp_lenv = pp_lenv