package coq
Install
dune-project
Dependency
Authors
Maintainers
Sources
sha256=513e953b7183d478acb75fd6e80e4dc32ac1a918cf4343ac31a859cfb4e9aad2
doc/coq-core.pretyping/Glob_term/index.html
Module Glob_termSource
Untyped intermediate terms
glob_constr comes after constr_expr and before constr.
Resolution of names, insertion of implicit arguments placeholder, and notations are done, but coercions, inference of implicit arguments and pattern-matching compilation are not.
Sorts
type glob_sort_name = | GSProp(*representation of
*)SPropliteral| GProp(*representation of
*)Proplevel| GSet(*representation of
*)Setlevel| GUniv of Univ.Level.t| GLocalUniv of Names.lident(*Locally bound universes (may also be nonstrict declaration)
*)| GRawUniv of Univ.Level.t(*Hack for funind, DO NOT USE
Note that producing the similar Constrexpr.CRawType for printing is OK, just don't try to reinterp it.
*)
levels, occurring in universe instances
sort expressions
type 'a cases_pattern_r = | PatVar of Names.Name.t| PatCstr of Names.constructor * 'a cases_pattern_g list * Names.Name.t(*
*)PatCstr(p,C,l,x)= "|'C' 'l' as 'x'"
The kind of patterns that occurs in "match ... with ... end"
locs here refers to the ident's location, not whole pat
type 'a glob_constr_r = | GRef of Names.GlobRef.t * glob_level list option(*An identifier that represents a reference to an object defined either in the (global) environment or in the (local) context.
*)| GVar of Names.Id.t(*An identifier that cannot be regarded as "GRef". Bound variables are typically represented this way.
*)| GEvar of existential_name CAst.t * (Names.lident * 'a glob_constr_g) list| GPatVar of Evar_kinds.matching_var_kind(*Used for patterns only
*)| GApp of 'a glob_constr_g * 'a glob_constr_g list| GLambda of Names.Name.t * binding_kind * 'a glob_constr_g * 'a glob_constr_g| GProd of Names.Name.t * binding_kind * 'a glob_constr_g * 'a glob_constr_g| GLetIn of Names.Name.t * 'a glob_constr_g * 'a glob_constr_g option * 'a glob_constr_g| GCases of Constr.case_style * 'a glob_constr_g option * 'a tomatch_tuples_g * 'a cases_clauses_g(*
*)GCases(style,r,tur,cc)= "match 'tur' return 'r' with 'cc'" (inMatchStyle)| GLetTuple of Names.Name.t list * Names.Name.t * 'a glob_constr_g option * 'a glob_constr_g * 'a glob_constr_g| GIf of 'a glob_constr_g * Names.Name.t * 'a glob_constr_g option * 'a glob_constr_g * 'a glob_constr_g| GRec of glob_fix_kind * Names.Id.t array * 'a glob_decl_g list array * 'a glob_constr_g array * 'a glob_constr_g array| GSort of glob_sort| GHole of Evar_kinds.t * Namegen.intro_pattern_naming_expr * Genarg.glob_generic_argument option| GCast of 'a glob_constr_g * Constr.cast_kind * 'a glob_constr_g| GProj of Names.Constant.t * glob_level list option * 'a glob_constr_g list * 'a glob_constr_g| GInt of Uint63.t| GFloat of Float64.t| GArray of glob_level list option * 'a glob_constr_g array * 'a glob_constr_g * 'a glob_constr_g
Representation of an internalized (or in other words globalized) term.
and 'a predicate_pattern_g =
Names.Name.t * (Names.inductive * Names.Name.t list) CAst.t option(na,id) = "as 'na' in 'id'" where if id is Some(l,I,k,args).
(p,il,cl,t) = "|'cl' => 't'". Precondition: the free variables of t are members of il.
type 'a disjunctive_cases_clause_g =
(Names.Id.t list * 'a cases_pattern_g list list * 'a glob_constr_g) CAst.ttype 'a extended_glob_local_binder_r = | GLocalAssum of Names.Name.t * binding_kind * 'a glob_constr_g| GLocalDef of Names.Name.t * 'a glob_constr_g * 'a glob_constr_g option| GLocalPattern of 'a cases_pattern_disjunction_g * Names.Id.t list * Names.Id.t * binding_kind * 'a glob_constr_g