(****************************************************************************)
-type name = string
+type flavour = Cic.object_flavour
+type name = string option
+type hyp = string
type what = Cic.annterm
type how = bool
type using = Cic.annterm
type count = int
type note = string
-type where = (name * name) option
+type where = (hyp * name) option
type inferred = Cic.annterm
type pattern = Cic.annterm
+type body = Cic.annterm option
+type types = Cic.anninductiveType list
+type lpsno = int
type step = Note of note
- | Theorem of name * what * note
+ | Inductive of types * lpsno * note
+ | Statement of flavour * name * what * body * note
| Qed of note
| Id of note
| Intros of count option * name list * note
- | Cut of name * what * note
- | LetIn of name * what * note
+ | Cut of name * what * note
+ | LetIn of name * what * note
| Rewrite of how * what * where * pattern * note
| Elim of what * using option * pattern * note
+ | Cases of what * pattern * note
| Apply of what * note
- | Change of inferred * what * where * pattern * note
- | ClearBody of name * note
+ | Change of inferred * what * where * pattern * note
+ | Clear of hyp list * note
+ | ClearBody of hyp * note
| Branch of step list list * note
val render_steps:
- (what, inferred, [> `Whd] as 'b, what CicNotationPt.obj, name) GrafiteAst.statement list ->
+ (what, inferred, [> `Whd] as 'b, what CicNotationPt.obj, hyp) GrafiteAst.statement list ->
step list ->
- (what, inferred, 'b, what CicNotationPt.obj, name) GrafiteAst.statement list
+ (what, inferred, 'b, what CicNotationPt.obj, hyp) GrafiteAst.statement list
val count_steps:
int -> step list -> int
+
+val count_nodes:
+ int -> step list -> int