Constrexprtype sort_name_expr = | CSProp | |
| CProp | |
| CSet | |
| CType of Libnames.qualid | |
| CRawType of Univ.Level.t | (* Universes like "foo.1" have no qualid form *) |
Universes
type univ_level_expr = sort_name_expr Glob_term.glob_sort_gentype sort_expr = (sort_name_expr * int) list Glob_term.glob_sort_gentype instance_expr = univ_level_expr listtype univ_constraint_expr = sort_name_expr * Univ.constraint_type * sort_name_exprConstraints don't have anonymous universes
type universe_decl_expr = (Names.lident list, univ_constraint_expr list) UState.gen_universe_decltype cumul_univ_decl_expr = ((Names.lident * Univ.Variance.t option) list, univ_constraint_expr list) UState.gen_universe_decltype ident_decl = Names.lident * universe_decl_expr optiontype cumul_ident_decl = Names.lident * cumul_univ_decl_expr optiontype name_decl = Names.lname * universe_decl_expr optiontype notation = notation_entry * notation_keytype specific_notation = notation_with_optional_scope * (notation_entry * notation_key)type 'a or_by_notation = 'a or_by_notation_r CAst.ttype binder_kind = | Default of Glob_term.binding_kind | |
| Generalized of Glob_term.binding_kind * bool | (* (Inner binding always Implicit) Outer bindings, typeclass-specific flag for implicit generalization of superclasses *) |
type cases_pattern_expr_r = | CPatAlias of cases_pattern_expr * Names.lname | |
| CPatCstr of Libnames.qualid * cases_pattern_expr list option * cases_pattern_expr list | (*
|
| CPatAtom of Libnames.qualid option | |
| CPatOr of cases_pattern_expr list | |
| CPatNotation of notation_with_optional_scope option * notation * cases_pattern_notation_substitution * cases_pattern_expr list | (* CPatNotation (_, n, l1 ,l2) represents (notation n applied with substitution l1) applied to arguments l2 *) |
| CPatPrim of prim_token | |
| CPatRecord of (Libnames.qualid * cases_pattern_expr) list | |
| CPatDelimiters of string * cases_pattern_expr | |
| CPatCast of cases_pattern_expr * constr_expr |
constr_expr is the abstract syntax tree produced by the parser
and cases_pattern_expr = cases_pattern_expr_r CAst.tand kinded_cases_pattern_expr = cases_pattern_expr * Glob_term.binding_kindand cases_pattern_notation_substitution = cases_pattern_expr list * cases_pattern_expr list listand constr_expr_r = and constr_expr = constr_expr_r CAst.tand case_expr = constr_expr * Names.lname option * cases_pattern_expr optionand branch_expr = (cases_pattern_expr list list * constr_expr) CAst.tand fix_expr = Names.lident * recursion_order_expr option * local_binder_expr list * constr_expr * constr_exprand cofix_expr = Names.lident * local_binder_expr list * constr_expr * constr_exprand recursion_order_expr_r = | CStructRec of Names.lident | |
| CWfRec of Names.lident * constr_expr | |
| CMeasureRec of Names.lident option * constr_expr * constr_expr option | (* argument, measure, relation *) |
and recursion_order_expr = recursion_order_expr_r CAst.tand local_binder_expr = | CLocalAssum of Names.lname list * binder_kind * constr_expr |
| CLocalDef of Names.lname * constr_expr * constr_expr option |
| CLocalPattern of cases_pattern_expr |
and constr_notation_substitution = constr_expr list * constr_expr list list * kinded_cases_pattern_expr list * local_binder_expr list listtype constr_pattern_expr = constr_exprConcrete syntax for modules and module types
type with_declaration_ast = | CWith_Module of Names.Id.t list CAst.t * Libnames.qualid |
| CWith_Definition of Names.Id.t list CAst.t * universe_decl_expr option * constr_expr |
type module_ast_r = | CMident of Libnames.qualid |
| CMapply of module_ast * Libnames.qualid |
| CMwith of module_ast * with_declaration_ast |
and module_ast = module_ast_r CAst.t