- | Rel of int (* DeBruijn index, 1 based *)
- | Meta of int * string option * local_context
- | Appl of term list (* arguments *)
- | Prod of name * term * term (* binder, source, target *)
- | Lambda of name * term * term (* binder, source, target *)
- | LetIn of name * term * term * term (* binder, type, term, body *)
- | Const of NUriManager.uri (* uri contains indtypeno/constrno *)
- | Sort of sort (* sort *)
- | Implicit of implicit_annotation (* ... *)
- | MutCase of NUriManager.uri * (* ind. uri, *)
- term * term * (* outtype, ind. term *)
- term list (* patterns *)
-
-and obj =
- | Constant of term option * term
- | InductiveDefinition of inductiveType list (* inductive types, *)
-
-and inductiveType =
- string * bool * term * (* typename, inductive, arity *)
- constructor list (* constructors *)
-
-and constructor =
- string * term (* id, type *)
+ | Rel of int (* DeBruijn index, 1 based *)
+ | Meta of int * local_context
+ | Appl of term list (* arguments *)
+ | Prod of string * term * term (* binder, source, target *)
+ | Lambda of string * term * term (* binder, source, target *)
+ | LetIn of string * term * term * term (* binder, type, term, body *)
+(* Cast \def degenerate LetIn *)
+ | Const of NReference.reference (* ref has (indtype|constr)no *)
+ | Sort of sort (* sort *)
+ | Implicit of implicit_annotation (* ... *)
+ | Match of NReference.reference * (* ind. reference, *)
+ term * term * (* outtype, ind. term *)
+ term list (* patterns *)
+
+
+(********************************* TYPING ***********************************)
+
+type context_entry = (* A declaration or definition *)
+ | Decl of term (* type *)
+ | Def of term * term (* body, type *)
+
+type hypothesis = string * context_entry (* name, entry *)
+
+type context = hypothesis list
+
+type meta_attrs = [`Name of string | `IsSort | `InScope | `OutScope of int] list
+
+type conjecture = meta_attrs * context * term
+
+type metasenv = (int * conjecture) list
+
+type subst_entry = meta_attrs * context * term * term (* name,ctx,bo,ty *)
+
+type substitution = (int * subst_entry) list
+
+
+(******************************** OBJECTS **********************************)
+
+type relevance = bool list (* relevance of arguments for conversion *)
+
+ (* relevance, name, recno, ty, bo *)
+type inductiveFun = relevance * string * int * term * term
+ (* if coinductive, the int has no meaning and must be set to -1 *)
+
+type constructor = relevance * string * term (* id, type *)
+
+type inductiveType =
+ relevance * string * term * constructor list
+ (* relevance, typename, arity, constructors *)
+
+type def_flavour = (* presentational *)
+ [ `Definition | `Fact | `Lemma | `Theorem | `Corollary | `Example ]
+
+type def_pragma = (* pragmatic of the object *)
+ [ `Coercion of int
+ | `Elim of sort (* elimination principle; universe is not relevant *)
+ | `Projection (* record projection *)
+ | `InversionPrinciple (* inversion principle *)
+ | `Variant
+ | `Local
+ | `Regular ] (* Local = hidden technicality *)
+
+type ind_pragma = (* pragmatic of the object *)
+ [ `Record of (string * bool * int) list | `Regular ]
+ (* inductive type that encodes a record; the arguments are the record
+ * fields names and if they are coercions and then the coercion arity *)
+
+type generated = [ `Generated | `Provided ]
+
+type c_attr = generated * def_flavour * def_pragma
+type f_attr = generated * def_flavour * def_pragma
+type i_attr = generated * ind_pragma
+
+ (* invariant: metasenv and substitution have disjoint domains *)
+type obj_kind =
+ | Constant of relevance * string * term option * term * c_attr
+ | Fixpoint of bool * inductiveFun list * f_attr
+ (* true -> fix, funcs, arrts *)
+ | Inductive of bool * int * inductiveType list * i_attr
+ (* true -> inductive, leftno, types *)