module U = NUri
module C = Cps
+module S = Share
module L = Log
+module Y = Entity
+module P = Output
module B = Brg
module O = BrgOutput
module E = BrgEnvironment
-module S = BrgSubstitution
-exception LRefNotFound of B.message
-
-type machine = {
- c: B.context;
- s: (B.term * int) list
+type kam = {
+ e: B.lenv; (* environment *)
+ s: (B.lenv * B.term) list; (* stack *)
+ d: int (* depth *)
}
(* Internal functions *******************************************************)
-let reductions = ref O.initial_reductions
-
let level = 5
-let error i = raise (LRefNotFound (L.items1 (string_of_int i)))
-
let log1 s c t =
- let sc, st = s ^ " in the context", "the term" in
- L.log O.specs level (L.ct_items1 sc c st t)
-
-let log2 s c u t =
- let sc, su, st = s ^ " in the context", "the term", "and the term" in
- L.log O.specs level (L.ct_items2 sc c su u st t)
-
-let empty_machine = {
- c = B.empty_context; s = []
-}
-
-let get f c m i =
- let f e = function
- | Some (_, b) -> f e b
- | None -> error i
+ let sc, st = s ^ " in the environment", "the term" in
+ L.log O.specs level (L.et_items1 sc c st t)
+
+let log2 s cu u ct t =
+ let s1, s2, s3 = s ^ " in the environment", "the term", "and in the environment" in
+ L.log O.specs level (L.et_items2 s1 cu s2 u ~sc2:s3 ~c2:ct s2 t)
+
+let rec list_and map = function
+ | hd1 :: tl1, hd2 :: tl2 ->
+ if map hd1 hd2 then list_and map (tl1, tl2) else false
+ | l1, l2 -> l1 = l2
+
+(* check closure *)
+let are_alpha_convertible err f t1 t2 =
+ let rec aux f = function
+ | B.Sort (_, p1), B.Sort (_, p2)
+ | B.LRef (_, p1), B.LRef (_, p2) ->
+ if p1 = p2 then f () else err ()
+ | B.GRef (_, u1), B.GRef (_, u2) ->
+ if U.eq u1 u2 then f () else err ()
+ | B.Cast (_, v1, t1), B.Cast (_, v2, t2)
+ | B.Appl (_, v1, t1), B.Appl (_, v2, t2) ->
+ let f _ = aux f (t1, t2) in
+ aux f (v1, v2)
+ | B.Bind (_, b1, t1), B.Bind (_, b2, t2) ->
+ let f _ = aux f (t1, t2) in
+ aux_bind f (b1, b2)
+ | _ -> err ()
+ and aux_bind f = function
+ | B.Abbr v1, B.Abbr v2
+ | B.Abst v1, B.Abst v2 -> aux f (v1, v2)
+ | B.Void, B.Void -> f ()
+ | _ -> err ()
in
- let f c = B.get f c i in
- B.append f c m.c
+ if S.eq t1 t2 then f () else aux f (t1, t2)
-let lift_stack f s =
- let map f (v, i) = f (v, succ i) in
- Cps.list_map f map s
-
-let unwind_to_term f m t =
- let map f t (a, b) = f (B.Bind (a, b, t)) in
- let f mc = C.list_fold_left f map t mc in
- assert (m.s = []);
- B.contents f m.c
-
-let push f m a b =
- assert (m.s = []);
- f {m with c = (a, b) :: m.c}
+let get m i =
+ let _, c, a, b = B.get m.e i in c, a, b
(* to share *)
-let rec step f ?(delta=false) ?(sty=false) c m x =
+let rec step st m x =
(* L.warn "entering R.step"; *)
match x with
- | B.Sort _ -> f m x
- | B.GRef (a, uri) ->
- let f = function
- | _, _, B.Abbr v when delta ->
- reductions := O.add ~gdelta:1 !reductions;
- step f ~delta ~sty c m v
- | _, _, B.Abst w when sty ->
- step f ~delta ~sty c m w
- | e, _, b ->
- f m (B.GRef (B.Entry (e, b) :: a, uri))
- in
- E.get_obj f uri
- | B.LRef (a, i) ->
- let f e = function
- | B.Abbr v ->
- reductions := O.add ~ldelta:1 !reductions;
- step f ~delta ~sty c m v
- | B.Abst w when sty ->
- step f ~delta ~sty c m w
- | b ->
- f m (B.LRef (B.Entry (e, b) :: a, i))
- in
- let f e = S.lift_bind (f e) (succ i) (0) in
- get f c m i
+ | B.Sort _ -> m, None, x
+ | B.GRef (_, uri) ->
+ begin match E.get_entity uri with
+ | _, _, Y.Abbr v when st.Y.delta ->
+ P.add ~gdelta:1 (); step st m v
+ | _, _, Y.Abst w when st.Y.rt ->
+ P.add ~grt:1 (); step st m w
+ | a, _, Y.Abbr v ->
+ let e = Y.apix C.err C.start a in
+ m, Some (e, a, B.Abbr v), x
+ | a, _, Y.Abst w ->
+ let e = Y.apix C.err C.start a in
+ m, Some (e, a, B.Abst w), x
+ | _, _, Y.Void -> assert false
+ end
+ | B.LRef (_, i) ->
+ begin match get m i with
+ | c, _, B.Abbr v ->
+ P.add ~ldelta:1 ();
+ step st {m with e = c} v
+ | c, _, B.Abst w when st.Y.rt ->
+ P.add ~lrt:1 ();
+ step st {m with e = c} w
+ | c, _, B.Void ->
+ assert false
+ | c, a, (B.Abst _ as b) ->
+ let e = Y.apix C.err C.start a in
+ {m with e = c}, Some (e, a, b), x
+ end
| B.Cast (_, _, t) ->
- reductions := O.add ~tau:1 !reductions;
- step f ~delta ~sty c m t
+ P.add ~tau:1 ();
+ step st m t
| B.Appl (_, v, t) ->
- step f ~delta ~sty c {m with s = (v, 0) :: m.s} t
- | B.Bind (a, B.Abst w, t) ->
+ step st {m with s = (m.e, v) :: m.s} t
+ | B.Bind (a, B.Abst w, t) ->
begin match m.s with
- | [] -> f m x
- | (v, h) :: tl ->
- reductions := O.add ~beta:1 !reductions;
- let f mc = step f ~delta ~sty c {c = mc; s = tl} t in
- let f v = B.push f m.c a (B.Abbr (B.Cast ([], w, v))) in
- S.lift f h (0) v
+ | [] -> m, None, x
+ | (c, v) :: s ->
+ P.add ~beta:1 ~upsilon:(List.length s) ();
+ let e = B.push m.e c a (B.abbr v) (* (B.Cast ([], w, v)) *) in
+ step st {m with e = e; s = s} t
end
- | B.Bind (a, b, t) ->
- reductions := O.add ~upsilon:(List.length m.s) !reductions;
- let f sc mc = step f ~delta ~sty c {c = mc; s = sc} t in
- let f sc = B.push (f sc) m.c a b in
- lift_stack f m.s
+ | B.Bind (a, b, t) ->
+ P.add ~upsilon:(List.length m.s) ();
+ let e = B.push m.e m.e a b in
+ step st {m with e = e} t
-(* Interface functions ******************************************************)
-
-let domain f c t =
- let f r = L.unbox level; f r in
- let f m = function
- | B.Bind (_, B.Abst w, _) ->
- let f w = f (Some w) in unwind_to_term f m w
- | x -> f None
+let push m a b =
+ assert (m.s = []);
+ let a, d = match b with
+ | B.Abst _ -> Y.Apix m.d :: a, succ m.d
+ | b -> a, m.d
in
- L.box level; log1 "Now scanning" c t;
- step f ~delta:true ~sty:true c empty_machine t
-
-let rec ac_nfs f ~si r c m1 u m2 t =
-(* L.warn "entering R.are_convertible_aux"; *)
- log2 "Now converting nfs" c u t;
- match u, t with
- | B.Sort (_, h1), B.Sort (_, h2) ->
- if h1 = h2 then f r else f false
- | B.LRef (B.Entry (e1, B.Abst _) :: _, _),
- B.LRef (B.Entry (e2, B.Abst _) :: _, _) ->
- if e1 = e2 then ac_stacks f ~si r c m1 m2 else f false
- | B.GRef (B.Entry (e1, B.Abst _) :: _, _),
- B.GRef (B.Entry (e2, B.Abst _) :: _, _) ->
- if e1 = e2 then ac_stacks f ~si r c m1 m2 else f false
- | B.GRef (B.Entry (e1, B.Abbr v1) :: _, _),
- B.GRef (B.Entry (e2, B.Abbr v2) :: _, _) ->
+ let e = B.push m.e m.e a b in
+ {m with e = e; d = d}
+
+let rec ac_nfs st (m1, r1, u) (m2, r2, t) =
+ log2 "Now converting nfs" m1.e u m2.e t;
+ match r1, u, r2, t with
+ | _, B.Sort (_, h1), _, B.Sort (_, h2) ->
+ h1 = h2
+ | Some (e1, _, B.Abst _), _, Some (e2, _, B.Abst _), _ ->
+ if e1 = e2 then ac_stacks st m1 m2 else false
+ | Some (e1, _, B.Abbr v1), _, Some (e2, _, B.Abbr v2), _ ->
if e1 = e2 then
- let f r =
- if r then f r
- else begin
- reductions := O.add ~gdelta:2 !reductions;
- ac f ~si true c m1 v1 m2 v2
- end
- in
- ac_stacks f ~si r c m1 m2
+ if ac_stacks st m1 m2 then true else begin
+ P.add ~gdelta:2 (); ac st m1 v1 m2 v2
+ end
else if e1 < e2 then begin
- reductions := O.add ~gdelta:1 !reductions;
- step (ac_nfs f ~si r c m1 u) c m2 v2
+ P.add ~gdelta:1 ();
+ ac_nfs st (m1, r1, u) (step st m2 v2)
end else begin
- reductions := O.add ~gdelta:1 !reductions;
- step (ac_nfs_rev f ~si r c m2 t) c m1 v1
+ P.add ~gdelta:1 ();
+ ac_nfs st (step st m1 v1) (m2, r2, t)
end
- | _, B.GRef (B.Entry (_, B.Abbr v2) :: _, _) ->
- reductions := O.add ~gdelta:1 !reductions;
- step (ac_nfs f ~si r c m1 u) c m2 v2
- | B.GRef (B.Entry (_, B.Abbr v1) :: _, _), _ ->
- reductions := O.add ~gdelta:1 !reductions;
- step (ac_nfs_rev f ~si r c m2 t) c m1 v1
- | B.Bind (a1, (B.Abst w1 as b1), t1),
- B.Bind (a2, (B.Abst w2 as b2), t2) ->
- let g m1 m2 = ac f ~si r c m1 t1 m2 t2 in
- let g m1 = push (g m1) m2 a2 b2 in
- let f r = if r then push g m1 a1 b1 else f false in
- ac f ~si r c m1 w1 m2 w2
- | B.Sort _, B.Bind (a, b, t) when si ->
- let f m1 m2 = ac f ~si r c m1 u m2 t in
- let f m1 = push (f m1) m2 a b in
- push f m1 a b
- | _ -> f false
-
-and ac_nfs_rev f ~si r c m2 t m1 u = ac_nfs f ~si r c m1 u m2 t
-
-and ac f ~si r c m1 t1 m2 t2 =
+ | _, _, Some (_, _, B.Abbr v2), _ ->
+ P.add ~gdelta:1 ();
+ ac_nfs st (m1, r1, u) (step st m2 v2)
+ | Some (_, _, B.Abbr v1), _, _, _ ->
+ P.add ~gdelta:1 ();
+ ac_nfs st (step st m1 v1) (m2, r2, t)
+ | _, B.Bind (a1, (B.Abst w1 as b1), t1),
+ _, B.Bind (a2, (B.Abst w2 as b2), t2) ->
+ if ac {st with Y.si = false} m1 w1 m2 w2 then
+ ac st (push m1 a1 b1) t1 (push m2 a2 b2) t2
+ else false
+ | _, B.Sort _, _, B.Bind (a, b, t) when st.Y.si ->
+ P.add ~si:1 ();
+ ac st (push m1 a b) u (push m2 a b) t
+ | _ -> false
+
+and ac st m1 t1 m2 t2 =
(* L.warn "entering R.are_convertible"; *)
- let g m1 t1 = step (ac_nfs f ~si r c m1 t1) c m2 t2 in
- if r = false then f false else step g c m1 t1
+ ac_nfs st (step st m1 t1) (step st m2 t2)
-and ac_stacks f ~si r c m1 m2 =
+and ac_stacks st m1 m2 =
(* L.warn "entering R.are_convertible_stacks"; *)
- let mm1, mm2 = {m1 with s = []}, {m2 with s = []} in
- let map f r (v1, h1) (v2, h2) =
- let f v1 = S.lift (ac f ~si r c mm1 v1 mm2) h2 (0) v2 in
- S.lift f h1 (0) v1
+ if List.length m1.s <> List.length m2.s then false else
+ let map (c1, v1) (c2, v2) =
+ let m1, m2 = {m1 with e = c1; s = []}, {m2 with e = c2; s = []} in
+ ac {st with Y.si = false} m1 v1 m2 v2
in
- if List.length m1.s <> List.length m2.s then
- begin
-(* L.warn (Printf.sprintf "Different lengths: %u %u"
- (List.length m1.s) (List.length m2.s)
- ); *)
- f false
- end
- else
- C.list_fold_left2 f map r m1.s m2.s
+ list_and map (m1.s, m2.s)
+
+(* Interface functions ******************************************************)
+
+let empty_kam = {
+ e = B.empty; s = []; d = 0
+}
+
+let get m i =
+ assert (m.s = []);
+ let _, _, _, b = B.get m.e i in b
+
+let xwhd st m t =
+ L.box level; log1 "Now scanning" m.e t;
+ let m, _, t = step {st with Y.delta = true; Y.rt = true} m t in
+ L.unbox level; m, t
+
+let are_convertible st mu u mw w =
+ L.box level; log2 "Now converting" mu.e u mw.e w;
+ let r = ac {st with Y.delta = st.Y.expand; Y.rt = false} mu u mw w in
+ L.unbox level; r
+(* let err _ = in
+ if S.eq mu mw then are_alpha_convertible err f u w else err () *)
+
+(* error reporting **********************************************************)
-let are_convertible f ?(si=false) c u t =
- let f b = L.unbox level; f b in
- L.box level; log2 "Now converting" c u t;
- ac f ~si true c empty_machine u empty_machine t
+let pp_term m frm t = O.specs.L.pp_term m.e frm t
+
+let pp_lenv frm m = O.specs.L.pp_lenv frm m.e
+
+let specs = {
+ L.pp_term = pp_term; L.pp_lenv = pp_lenv
+}