(********************************* TERMS ************************************)
-type universe = (bool * NUri.uri) list
- (* Max of non-empty list of named universes, or their successor (when true) *)
+type univ_algebra = [ `Type | `Succ | `CProp ]
+
+type universe = (univ_algebra * NUri.uri) list
+ (* Max of non-empty list of named universes, or their successor (when true)
+ * The empty list represents type0 *)
type sort = Prop | Type of universe
-type implicit_annotation = [ `Closed | `Type | `Hole | `Term ]
+type implicit_annotation =
+ [ `Closed | `Type | `Hole | `Tagged of string | `Term | `Typeof of int | `Vector ]
+
type lc_kind = Irl of int | Ctx of term list
and local_context = int * lc_kind (* shift (0 -> no shift),
- subst (None means id) *)
+ subst (Irl n means id of
+ length n) *)
and term =
| Rel of int (* DeBruijn index, 1 based *)
| Meta of int * local_context
| Decl of term (* type *)
| Def of term * term (* body, type *)
-type hypothesis = string * context_entry
+type hypothesis = string * context_entry (* name, entry *)
type context = hypothesis list
-type conjecture = string option * context * term
+type meta_attr =
+ [ `Name of string
+ | `IsTerm | `IsType | `IsSort
+ | `InScope | `OutScope of int]
+
+type meta_attrs = meta_attr list
+
+type conjecture = meta_attrs * context * term
type metasenv = (int * conjecture) list
-type subst_entry = string option * context * term * term
+type subst_entry = meta_attrs * context * term * term (* name,ctx,bo,ty *)
type substitution = (int * subst_entry) list
type generated = [ `Generated | `Provided ]
type c_attr = generated * def_flavour * def_pragma
-type f_attr = generated * def_flavour
+type f_attr = generated * def_flavour * def_pragma
type i_attr = generated * ind_pragma
(* invariant: metasenv and substitution have disjoint domains *)