E.name err f a
let rec out_term st p e och = function
- | B.Sort (_, h) ->
+ | B.Sort (_, h) ->
let sort = if h = 0 then "Type[0]" else if h = 1 then "Prop" else assert false in
KP.fprintf och "%s" sort
- | B.LRef (_, i) ->
+ | B.LRef (_, i) ->
let _, _, a, b = B.get e i in
KP.fprintf och "%a" out_name a
- | B.GRef (_, s) ->
+ | B.GRef (_, s) ->
KP.fprintf och "%a" out_uri s
- | B.Cast (_, u, t) ->
+ | B.Cast (_, u, t) ->
KP.fprintf och "(%a : %a)" (out_term st false e) t (out_term st false e) u
- | B.Appl (_, v, t) ->
+ | B.Appl (_, v, t) ->
let pt = match t with B.Appl _ -> false | _ -> true in
let op, cp = if p then "(", ")" else "", "" in
KP.fprintf och "%s%a %a%s" op (out_term st pt e) t (out_term st true e) v cp
- | B.Bind (a, B.Abst (n, w), t) ->
+ | B.Bind (a, B.Abst (x, n, w), t) ->
let op, cp = if p then "(", ")" else "", "" in
let a = R.alpha B.mem e a in
- let ee = B.push e B.empty a (B.abst n w) in
+ let ee = B.push e B.empty a (B.abst x n w) in
let binder = match N.to_string st n, a.E.n_sort with
| "1", 0 -> "Π"
| "1", 1 -> "∀"
in
KP.fprintf och "%s%s%a:%a.%a%s"
op binder out_name a (out_term st false e) w (out_term st false ee) t cp
- | B.Bind (a, B.Abbr v, t) ->
+ | B.Bind (a, B.Abbr v, t) ->
let op, cp = if p then "(", ")" else "", "" in
let a = R.alpha B.mem e a in
let ee = B.push e B.empty a (B.abbr v) in
KP.fprintf och "%slet %a ≝ %a in %a%s"
op out_name a (out_term st false e) v (out_term st false ee) t cp
- | B.Bind (a, B.Void, t) -> C.err ()
+ | B.Bind (a, B.Void, t) -> C.err ()
let close_out och () = close_out och