package coq-core
The Coq Proof Assistant -- Core Binaries and Tools
Install
Dune Dependency
Authors
Maintainers
Sources
coq-8.17.0.tar.gz
sha512=2f77bcb5211018b5d46320fd39fd34450eeb654aca44551b28bb50a2364398c4b34587630b6558db867ecfb63b246fd3e29dc2375f99967ff62bc002db9c3250
doc/src/coq-core.kernel/term_typing.ml.html
Source file term_typing.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327
(************************************************************************) (* * The Coq Proof Assistant / The Coq Development Team *) (* v * Copyright INRIA, CNRS and contributors *) (* <O___,, * (see version control and CREDITS file for authors & dates) *) (* \VV/ **************************************************************) (* // * This file is distributed under the terms of the *) (* * GNU Lesser General Public License Version 2.1 *) (* * (see LICENSE file for the text of the license) *) (************************************************************************) (* Created by Jacek Chrzaszcz, Aug 2002 as part of the implementation of the Coq module system *) (* This module provides the main entry points for type-checking basic declarations *) open CErrors open Util open Names open Constr open Declarations open Environ open Entries open Univ module NamedDecl = Context.Named.Declaration (* Insertion of constants and parameters in environment. *) type 'a effect_handler = env -> Constr.t -> 'a -> (Constr.t * ContextSet.t * int) let skip_trusted_seff sl b e = let rec aux sl b e acc = let open Context.Rel.Declaration in if Int.equal sl 0 then b, e, acc else match kind b with | LetIn (n,c,ty,bo) -> aux (sl - 1) bo (Environ.push_rel (LocalDef (n,c,ty)) e) (`Let(n,c,ty)::acc) | App(hd,arg) -> begin match kind hd with | Lambda (n,ty,bo) -> aux (sl - 1) bo (Environ.push_rel (LocalAssum (n,ty)) e) (`Cut(n,ty,arg)::acc) | _ -> assert false end | _ -> assert false in aux sl b e [] let rec unzip ctx j = match ctx with | [] -> j | `Let (n,c,ty) :: ctx -> unzip ctx { j with uj_val = mkLetIn (n,c,ty,j.uj_val) } | `Cut (n,ty,arg) :: ctx -> unzip ctx { j with uj_val = mkApp (mkLambda (n,ty,j.uj_val),arg) } type typing_context = TyCtx of Environ.env * unsafe_type_judgment * Id.Set.t * universe_level_subst * universes let process_universes env = function | Entries.Monomorphic_entry -> env, Univ.empty_level_subst, Univ.Instance.empty, Monomorphic | Entries.Polymorphic_entry uctx -> (** [ctx] must contain local universes, such that it has no impact on the rest of the graph (up to transitivity). *) let env = Environ.push_context ~strict:false uctx env in let inst, auctx = Univ.abstract_universes uctx in let usubst = Univ.make_instance_subst inst in env, usubst, inst, Polymorphic auctx let check_primitive_type env op_t u t = let inft = Typeops.type_of_prim_or_type env u op_t in try Reduction.default_conv Reduction.CONV env inft t with Reduction.NotConvertible -> Type_errors.error_incorrect_primitive env (make_judge op_t inft) t let adjust_primitive_univ_entry p auctx = function | Monomorphic_entry -> assert (AbstractContext.is_empty auctx); (* ensured by ComPrimitive *) Monomorphic_entry | Polymorphic_entry uctx -> assert (not (AbstractContext.is_empty auctx)); (* ensured by ComPrimitive *) (* [push_context] will check that the universes aren't repeated in the instance so comparing the sizes works. No polymorphic primitive uses constraints currently. *) if not (AbstractContext.size auctx = UContext.size uctx && Constraints.is_empty (UContext.constraints uctx)) then CErrors.user_err Pp.(str "Incorrect universes for primitive " ++ str (CPrimitives.op_or_type_to_string p)); Polymorphic_entry (UContext.refine_names (AbstractContext.names auctx) uctx) let infer_primitive env { prim_entry_type = utyp; prim_entry_content = p; } = let open CPrimitives in let auctx = CPrimitives.op_or_type_univs p in let univs, typ = match utyp with | None -> let u = UContext.instance (AbstractContext.repr auctx) in let typ = Typeops.type_of_prim_or_type env u p in let univs = if AbstractContext.is_empty auctx then Monomorphic else Polymorphic auctx in univs, typ | Some (typ,univ_entry) -> let univ_entry = adjust_primitive_univ_entry p auctx univ_entry in let env, usubst, u, univs = process_universes env univ_entry in let typ = (Typeops.infer_type env typ).utj_val in let () = check_primitive_type env p u typ in let typ = Vars.subst_univs_level_constr usubst typ in univs, typ in let body = match p with | OT_op op -> Declarations.Primitive op | OT_type _ -> Undef None | OT_const c -> Def (CPrimitives.body_of_prim_const c) in { Discharge.cook_body = body; cook_type = typ; cook_universes = univs; cook_inline = false; cook_relevance = Sorts.Relevant; cook_flags = Environ.typing_flags env; (* Primitives not allowed in sections *) cook_context = None; cook_univ_hyps = Instance.empty; } let make_univ_hyps = function | None -> Instance.empty | Some us -> Instance.of_array us let infer_parameter ~sec_univs env entry = let env, usubst, _, univs = process_universes env entry.parameter_entry_universes in let j = Typeops.infer env entry.parameter_entry_type in let r = Typeops.assumption_of_judgment env j in let t = Vars.subst_univs_level_constr usubst j.uj_val in { Discharge.cook_body = Undef entry.parameter_entry_inline_code; cook_type = t; cook_universes = univs; cook_relevance = r; cook_inline = false; cook_context = entry.parameter_entry_secctx; cook_univ_hyps = make_univ_hyps sec_univs; cook_flags = Environ.typing_flags env; } let infer_definition ~sec_univs env entry = let env, usubst, _, univs = process_universes env entry.const_entry_universes in let j = Typeops.infer env entry.const_entry_body in let typ = match entry.const_entry_type with | None -> Vars.subst_univs_level_constr usubst j.uj_type | Some t -> let tj = Typeops.infer_type env t in let _ = Typeops.judge_of_cast env j DEFAULTcast tj in Vars.subst_univs_level_constr usubst tj.utj_val in let def = Def (Vars.subst_univs_level_constr usubst j.uj_val) in { Discharge.cook_body = def; cook_type = typ; cook_universes = univs; cook_relevance = Relevanceops.relevance_of_term env j.uj_val; cook_inline = entry.const_entry_inline_code; cook_context = entry.const_entry_secctx; cook_univ_hyps = make_univ_hyps sec_univs; cook_flags = Environ.typing_flags env; } let infer_constant ~sec_univs env = function | PrimitiveEntry entry -> infer_primitive env entry | ParameterEntry entry -> infer_parameter ~sec_univs env entry | DefinitionEntry entry -> infer_definition ~sec_univs env entry (** Definition is opaque (Qed), so we delay the typing of its body. *) let infer_opaque ~sec_univs env entry = let env, usubst, _, univs = process_universes env entry.opaque_entry_universes in let typj = Typeops.infer_type env entry.opaque_entry_type in let context = TyCtx (env, typj, entry.opaque_entry_secctx, usubst, univs) in let def = OpaqueDef () in let typ = Vars.subst_univs_level_constr usubst typj.utj_val in { Discharge.cook_body = def; cook_type = typ; cook_universes = univs; cook_relevance = Sorts.relevance_of_sort typj.utj_type; cook_inline = false; cook_context = Some entry.opaque_entry_secctx; cook_univ_hyps = make_univ_hyps sec_univs; cook_flags = Environ.typing_flags env; }, context let check_section_variables env declared_set typ body = let ids_typ = global_vars_set env typ in let ids_def = global_vars_set env body in let inferred_set = Environ.really_needed env (Id.Set.union ids_typ ids_def) in if not (Id.Set.subset inferred_set declared_set) then let l = Id.Set.elements (Id.Set.diff inferred_set declared_set) in let n = List.length l in let declared_vars = Pp.pr_sequence Id.print (Id.Set.elements declared_set) in let inferred_vars = Pp.pr_sequence Id.print (Id.Set.elements inferred_set) in let missing_vars = Pp.pr_sequence Id.print (List.rev l) in user_err Pp.(prlist str ["The following section "; (String.plural n "variable"); " "; (String.conjugate_verb_to_be n); " used but not declared:"] ++ fnl () ++ missing_vars ++ str "." ++ fnl () ++ fnl () ++ str "You can either update your proof to not depend on " ++ missing_vars ++ str ", or you can update your Proof line from" ++ fnl () ++ str "Proof using " ++ declared_vars ++ fnl () ++ str "to" ++ fnl () ++ str "Proof using " ++ inferred_vars) let build_constant_declaration env result = let open Discharge in let typ = result.cook_type in (* We try to postpone the computation of used section variables *) let hyps, def = let context_ids = List.map NamedDecl.get_id (named_context env) in let def = result.cook_body in match result.cook_context with | None -> if List.is_empty context_ids then (* Empty section context: no need to check *) Id.Set.empty, def else (* No declared section vars, and non-empty section context: we must look at the body NOW, if any *) let ids_typ = global_vars_set env typ in let ids_def = match def with | Undef _ | Primitive _ -> Id.Set.empty | Def cs -> global_vars_set env cs | OpaqueDef _ -> (* Opaque definitions always come with their section variables *) assert false in Environ.really_needed env (Id.Set.union ids_typ ids_def), def | Some declared -> let declared = Environ.really_needed env declared in (* We use the declared set and chain a check of correctness *) declared, match def with | Undef _ | Primitive _ | OpaqueDef _ as x -> x (* nothing to check *) | Def cs as x -> let () = check_section_variables env declared typ cs in x in let univs = result.cook_universes in let hyps = List.filter (fun d -> Id.Set.mem (NamedDecl.get_id d) hyps) (Environ.named_context env) in let tps = Vmbytegen.compile_constant_body ~fail_on_error:false env univs def in { const_hyps = hyps; const_univ_hyps = result.cook_univ_hyps; const_body = def; const_type = typ; const_body_code = tps; const_universes = univs; const_relevance = result.cook_relevance; const_inline_code = result.cook_inline; const_typing_flags = result.cook_flags } let check_delayed (type a) (handle : a effect_handler) tyenv (body : a proof_output) = let TyCtx (env, tyj, declared, usubst, univs) = tyenv in let ((body, uctx), side_eff) = body in let (body, uctx', valid_signatures) = handle env body side_eff in let uctx = ContextSet.union uctx uctx' in let env, univs = match univs with | Monomorphic -> assert (is_empty_level_subst usubst); push_context_set uctx env, Opaqueproof.PrivateMonomorphic uctx | Polymorphic _ -> assert (Int.equal valid_signatures 0); push_subgraph uctx env, let private_univs = on_snd (subst_univs_level_constraints usubst) uctx in Opaqueproof.PrivatePolymorphic private_univs in (* Note: non-trivial trusted side-effects only in monomorphic case *) let body,env,ectx = skip_trusted_seff valid_signatures body env in let j = Typeops.infer env body in let j = unzip ectx j in let _ = Typeops.judge_of_cast env j DEFAULTcast tyj in let () = check_section_variables env declared tyj.utj_val body in (* Note: non-trivial usubst only in polymorphic case *) let def = Vars.subst_univs_level_constr usubst j.uj_val in def, univs (*s Global and local constant declaration. *) let translate_constant ~sec_univs env _kn ce = build_constant_declaration env (infer_constant ~sec_univs env ce) let translate_opaque ~sec_univs env _kn ce = let def, ctx = infer_opaque ~sec_univs env ce in build_constant_declaration env def, ctx let translate_local_assum env t = let j = Typeops.infer env t in let t = Typeops.assumption_of_judgment env j in j.uj_val, t let translate_local_def env _id centry = let open Discharge in let centry = { const_entry_body = centry.secdef_body; const_entry_secctx = centry.secdef_secctx; const_entry_type = centry.secdef_type; const_entry_universes = Monomorphic_entry; const_entry_inline_code = false; } in let decl = infer_constant ~sec_univs:None env (DefinitionEntry centry) in let typ = decl.cook_type in let () = match decl.cook_universes with | Monomorphic -> () | Polymorphic _ -> assert false in let c = match decl.cook_body with | Def c -> c | Undef _ | Primitive _ | OpaqueDef _ -> assert false in c, decl.cook_relevance, typ
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>