| Statement of flavour * name * what * body * note
| Qed of note
| Id of note
+ | Exact of what * note
| Intros of count option * name list * note
| Cut of name * what * note
| LetIn of name * what * note
| Clear of hyp list * note
| ClearBody of hyp * note
| Branch of step list list * note
+ | Reflexivity of note
(* annterm constructors *****************************************************)
let tactic = G.IdTac floc in
mk_tactic tactic punctation
+let mk_exact t punctation =
+ let tactic = G.Exact (floc, t) in
+ mk_tactic tactic punctation
+
let mk_intros xi xids punctation =
let tactic = G.Intros (floc, (xi, xids)) in
mk_tactic tactic punctation
mk_tactic tactic punctation
let mk_apply t punctation =
- let tactic = G.ApplyP (floc, t) in
+ let tactic = G.Apply (floc, t) in
mk_tactic tactic punctation
let mk_change t where pattern punctation =
let tactic = G.ClearBody (floc, id) in
mk_tactic tactic punctation
+let mk_reflexivity punctation =
+ let tactic = G.Reflexivity floc in
+ mk_tactic tactic punctation
+
let mk_ob =
let punctation = G.Branch floc in
mk_punctation punctation
| Statement (f, n, t, v, s) -> mk_statement f n t v :: mk_thnote s a
| Inductive (lps, ts, s) -> mk_inductive lps ts :: mk_thnote s a
| Qed s -> mk_qed :: mk_tacnote s a
+ | Exact (t, s) -> mk_exact t sep :: mk_tacnote s a
| Id s -> mk_id sep :: mk_tacnote s a
| Intros (c, ns, s) -> mk_intros c ns sep :: mk_tacnote s a
| Cut (n, t, s) -> mk_cut n t sep :: mk_tacnote s a
| ClearBody (n, s) -> mk_clearbody n sep :: mk_tacnote s a
| Branch ([], s) -> a
| Branch ([ps], s) -> render_steps sep a ps
- | Branch (ps :: pss, s) ->
+ | Branch (ps :: pss, s) ->
let a = mk_ob :: mk_tacnote s a in
let a = List.fold_left (render_steps mk_vb) a (List.rev pss) in
mk_punctation sep :: render_steps mk_cb a ps
+ | Reflexivity s -> mk_reflexivity sep :: mk_tacnote s a
and render_steps sep a = function
| [] -> a
let rec count_step a = function
| Note _
- | Statement _
- | Qed _ -> a
- | Branch (pps, _) -> List.fold_left count_steps a pps
- | _ -> succ a
+ | Statement _
+ | Inductive _
+ | Qed _ -> a
+(* level A0 *)
+ | Branch (pps, _) -> List.fold_left count_steps a pps
+ | Clear _
+ | ClearBody _
+ | Id _
+ | Intros (Some 0, [], _)
+(* leval A1 *)
+ | Exact _
+(* level B1 *)
+ | Cut _
+ | LetIn _
+(* level B2 *)
+ | Change _ -> a
+(* level C *)
+ | _ -> succ a
and count_steps a = List.fold_left count_step a
+let count = I.count_nodes ~meta:false
+
let rec count_node a = function
| Note _
| Inductive _
| Statement _
- | Qed _
+ | Qed _
+ | Reflexivity _
| Id _
| Intros _
| Clear _
| ClearBody _ -> a
+ | Exact (t, _)
| Cut (_, t, _)
| LetIn (_, t, _)
- | Apply (t, _) -> I.count_nodes a (H.cic t)
+ | Apply (t, _) -> count a (H.cic t)
| Rewrite (_, t, _, p, _)
| Elim (t, _, p, _)
| Cases (t, p, _)
- | Change (t, _, _, p, _) ->
- let a = I.count_nodes a (H.cic t) in
- I.count_nodes a (H.cic p)
+ | Change (t, _, _, p, _) -> let a = count a (H.cic t) in count a (H.cic p)
| Branch (ss, _) -> List.fold_left count_nodes a ss
and count_nodes a = List.fold_left count_node a
+
+(* helpers ******************************************************************)
+
+let rec note_of_step = function
+ | Note s
+ | Statement (_, _, _, _, s)
+ | Inductive (_, _, s)
+ | Qed s
+ | Exact (_, s)
+ | Id s
+ | Intros (_, _, s)
+ | Cut (_, _, s)
+ | LetIn (_, _, s)
+ | Rewrite (_, _, _, _, s)
+ | Elim (_, _, _, s)
+ | Cases (_, _, s)
+ | Apply (_, s)
+ | Change (_, _, _, _, s)
+ | Clear (_, s)
+ | ClearBody (_, s)
+ | Reflexivity s
+ | Branch (_, s) -> s