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 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2014 *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
(* Author: Jean-Christophe Filliâtre as part of the rebuilding of Coq
around a purely functional abstract type-checker, Aug 1999 *)
(* Cleaning and lightening of the kernel by Bruno Barras, Nov 2001 *)
(* Flag for predicativity of Set by Hugo Herbelin in Oct 2003 *)
(* Support for virtual machine by Benjamin Grégoire in Oct 2004 *)
(* Support for retroknowledge by Arnaud Spiwack in May 2007 *)
(* Support for assumption dependencies by Arnaud Spiwack in May 2007 *)
(* Miscellaneous maintenance by Bruno Barras, Hugo Herbelin, Jean-Marc
Notin, Matthieu Sozeau *)
(* This file defines the type of environments on which the
type-checker works, together with simple related functions *)
open Util
open Names
open Sign
open Univ
open Term
open Declarations
open Pre_env
(* The type of environments. *)
type named_context_val = Pre_env.named_context_val
type env = Pre_env.env
let pre_env env = env
let env_of_pre_env env = env
let empty_named_context_val = empty_named_context_val
let empty_env = empty_env
let engagement env = env.env_stratification.env_engagement
let universes env = env.env_stratification.env_universes
let named_context env = env.env_named_context
let named_context_val env = env.env_named_context,env.env_named_vals
let rel_context env = env.env_rel_context
let empty_context env =
env.env_rel_context = empty_rel_context
&& env.env_named_context = empty_named_context
(* Rel context *)
let lookup_rel n env =
lookup_rel n env.env_rel_context
let evaluable_rel n env =
match lookup_rel n env with
| (_,Some _,_) -> true
| _ -> false
let nb_rel env = env.env_nb_rel
let push_rel = push_rel
let push_rel_context ctxt x = Sign.fold_rel_context push_rel ctxt ~init:x
let push_rec_types (lna,typarray,_) env =
let ctxt = array_map2_i (fun i na t -> (na, None, lift i t)) lna typarray in
Array.fold_left (fun e assum -> push_rel assum e) env ctxt
let fold_rel_context f env ~init =
let rec fold_right env =
match env.env_rel_context with
| [] -> init
| rd::rc ->
let env =
{ env with
env_rel_context = rc;
env_rel_val = List.tl env.env_rel_val;
env_nb_rel = env.env_nb_rel - 1 } in
f env rd (fold_right env)
in fold_right env
(* Named context *)
let named_context_of_val = fst
let named_vals_of_val = snd
(* [map_named_val f ctxt] apply [f] to the body and the type of
each declarations.
*** /!\ *** [f t] should be convertible with t *)
let map_named_val f (ctxt,ctxtv) =
let ctxt =
List.map (fun (id,body,typ) -> (id, Option.map f body, f typ)) ctxt in
(ctxt,ctxtv)
let empty_named_context = empty_named_context
let push_named = push_named
let push_named_context_val = push_named_context_val
let val_of_named_context ctxt =
List.fold_right push_named_context_val ctxt empty_named_context_val
let lookup_named id env = Sign.lookup_named id env.env_named_context
let lookup_named_val id (ctxt,_) = Sign.lookup_named id ctxt
let eq_named_context_val c1 c2 =
c1 == c2 || named_context_equal (named_context_of_val c1) (named_context_of_val c2)
(* A local const is evaluable if it is defined *)
let named_type id env =
let (_,_,t) = lookup_named id env in t
let named_body id env =
let (_,b,_) = lookup_named id env in b
let evaluable_named id env =
match named_body id env with
| Some _ -> true
| _ -> false
let reset_with_named_context (ctxt,ctxtv) env =
{ env with
env_named_context = ctxt;
env_named_vals = ctxtv;
env_rel_context = empty_rel_context;
env_rel_val = [];
env_nb_rel = 0 }
let reset_context = reset_with_named_context empty_named_context_val
let fold_named_context f env ~init =
let rec fold_right env =
match env.env_named_context with
| [] -> init
| d::ctxt ->
let env =
reset_with_named_context (ctxt,List.tl env.env_named_vals) env in
f env d (fold_right env)
in fold_right env
let fold_named_context_reverse f ~init env =
Sign.fold_named_context_reverse f ~init:init (named_context env)
(* Global constants *)
let lookup_constant = lookup_constant
let add_constant kn cs env =
let new_constants =
Cmap_env.add kn (cs,ref None) env.env_globals.env_constants in
let new_globals =
{ env.env_globals with
env_constants = new_constants } in
{ env with env_globals = new_globals }
(* constant_type gives the type of a constant *)
let constant_type env kn =
let cb = lookup_constant kn env in
cb.const_type
type const_evaluation_result = NoBody | Opaque
exception NotEvaluableConst of const_evaluation_result
let constant_value env kn =
let cb = lookup_constant kn env in
match cb.const_body with
| Def l_body -> Declarations.force l_body
| OpaqueDef _ -> raise (NotEvaluableConst Opaque)
| Undef _ -> raise (NotEvaluableConst NoBody)
let constant_opt_value env cst =
try Some (constant_value env cst)
with NotEvaluableConst _ -> None
(* A global const is evaluable if it is defined and not opaque *)
let evaluable_constant cst env =
try let _ = constant_value env cst in true
with NotEvaluableConst _ -> false
(* Mutual Inductives *)
let lookup_mind = lookup_mind
let add_mind kn mib env =
let new_inds = Mindmap_env.add kn mib env.env_globals.env_inductives in
let new_globals =
{ env.env_globals with
env_inductives = new_inds } in
{ env with env_globals = new_globals }
(* Universe constraints *)
let add_constraints c env =
if is_empty_constraint c then
env
else
let s = env.env_stratification in
{ env with env_stratification =
{ s with env_universes = merge_constraints c s.env_universes } }
let set_engagement c env = (* Unsafe *)
{ env with env_stratification =
{ env.env_stratification with env_engagement = Some c } }
(* Lookup of section variables *)
let lookup_constant_variables c env =
let cmap = lookup_constant c env in
Sign.vars_of_named_context cmap.const_hyps
let lookup_inductive_variables (kn,i) env =
let mis = lookup_mind kn env in
Sign.vars_of_named_context mis.mind_hyps
let lookup_constructor_variables (ind,_) env =
lookup_inductive_variables ind env
(* Returns the list of global variables in a term *)
let vars_of_global env constr =
match kind_of_term constr with
Var id -> [id]
| Const kn -> lookup_constant_variables kn env
| Ind ind -> lookup_inductive_variables ind env
| Construct cstr -> lookup_constructor_variables cstr env
| _ -> raise Not_found
let global_vars_set env constr =
let rec filtrec acc c =
let acc =
match kind_of_term c with
| Var _ | Const _ | Ind _ | Construct _ ->
List.fold_right Idset.add (vars_of_global env c) acc
| _ ->
acc in
fold_constr filtrec acc c
in
filtrec Idset.empty constr
(* [keep_hyps env ids] keeps the part of the section context of [env] which
contains the variables of the set [ids], and recursively the variables
contained in the types of the needed variables. *)
let keep_hyps env needed =
let really_needed =
Sign.fold_named_context_reverse
(fun need (id,copt,t) ->
if Idset.mem id need then
let globc =
match copt with
| None -> Idset.empty
| Some c -> global_vars_set env c in
Idset.union
(global_vars_set env t)
(Idset.union globc need)
else need)
~init:needed
(named_context env) in
Sign.fold_named_context
(fun (id,_,_ as d) nsign ->
if Idset.mem id really_needed then add_named_decl d nsign
else nsign)
(named_context env)
~init:empty_named_context
(* Modules *)
let add_modtype ln mtb env =
let new_modtypes = MPmap.add ln mtb env.env_globals.env_modtypes in
let new_globals =
{ env.env_globals with
env_modtypes = new_modtypes } in
{ env with env_globals = new_globals }
let shallow_add_module mp mb env =
let new_mods = MPmap.add mp mb env.env_globals.env_modules in
let new_globals =
{ env.env_globals with
env_modules = new_mods } in
{ env with env_globals = new_globals }
let lookup_module mp env =
MPmap.find mp env.env_globals.env_modules
let lookup_modtype mp env =
MPmap.find mp env.env_globals.env_modtypes
(*s Judgments. *)
type unsafe_judgment = {
uj_val : constr;
uj_type : types }
let make_judge v tj =
{ uj_val = v;
uj_type = tj }
let j_val j = j.uj_val
let j_type j = j.uj_type
type unsafe_type_judgment = {
utj_val : constr;
utj_type : sorts }
(*s Compilation of global declaration *)
let compile_constant_body = Cbytegen.compile_constant_body
exception Hyp_not_found
let rec apply_to_hyp (ctxt,vals) id f =
let rec aux rtail ctxt vals =
match ctxt, vals with
| (idc,c,ct as d)::ctxt, v::vals ->
if idc = id then
(f ctxt d rtail)::ctxt, v::vals
else
let ctxt',vals' = aux (d::rtail) ctxt vals in
d::ctxt', v::vals'
| [],[] -> raise Hyp_not_found
| _, _ -> assert false
in aux [] ctxt vals
let rec apply_to_hyp_and_dependent_on (ctxt,vals) id f g =
let rec aux ctxt vals =
match ctxt,vals with
| (idc,c,ct as d)::ctxt, v::vals ->
if idc = id then
let sign = ctxt,vals in
push_named_context_val (f d sign) sign
else
let (ctxt,vals as sign) = aux ctxt vals in
push_named_context_val (g d sign) sign
| [],[] -> raise Hyp_not_found
| _,_ -> assert false
in aux ctxt vals
let insert_after_hyp (ctxt,vals) id d check =
let rec aux ctxt vals =
match ctxt, vals with
| (idc,c,ct)::ctxt', v::vals' ->
if idc = id then begin
check ctxt;
push_named_context_val d (ctxt,vals)
end else
let ctxt,vals = aux ctxt vals in
d::ctxt, v::vals
| [],[] -> raise Hyp_not_found
| _, _ -> assert false
in aux ctxt vals
(* To be used in Logic.clear_hyps *)
let remove_hyps ids check_context check_value (ctxt, vals) =
List.fold_right2 (fun (id,_,_ as d) (id',v) (ctxt,vals) ->
if List.mem id ids then
(ctxt,vals)
else
let nd = check_context d in
let nv = check_value v in
(nd::ctxt,(id',nv)::vals))
ctxt vals ([],[])
(*spiwack: the following functions assemble the pieces of the retroknowledge
note that the "consistent" register function is available in the module
Safetyping, Environ only synchronizes the proactive and the reactive parts*)
open Retroknowledge
(* lifting of the "get" functions works also for "mem"*)
let retroknowledge f env =
f env.retroknowledge
let registered env field =
retroknowledge mem env field
(* spiwack: this unregistration function is not in operation yet. It should
not be used *)
(* this unregistration function assumes that no "constr" can hold two different
places in the retroknowledge. There is no reason why it shouldn't be true,
but in case someone needs it, remember to add special branches to the
unregister function *)
let unregister env field =
match field with
| KInt31 (_,Int31Type) ->
(*there is only one matching kind due to the fact that Environ.env
is abstract, and that the only function which add elements to the
retroknowledge is Environ.register which enforces this shape *)
(match retroknowledge find env field with
| Ind i31t -> let i31c = Construct (i31t, 1) in
{env with retroknowledge =
remove (retroknowledge clear_info env i31c) field}
| _ -> assert false)
|_ -> {env with retroknowledge =
try
remove (retroknowledge clear_info env
(retroknowledge find env field)) field
with Not_found ->
retroknowledge remove env field}
(* the Environ.register function syncrhonizes the proactive and reactive
retroknowledge. *)
let register =
(* subfunction used for static decompilation of int31 (after a vm_compute,
see pretyping/vnorm.ml for more information) *)
let constr_of_int31 =
let nth_digit_plus_one i n = (* calculates the nth (starting with 0)
digit of i and adds 1 to it
(nth_digit_plus_one 1 3 = 2) *)
if (land) i ((lsl) 1 n) = 0 then
1
else
2
in
fun ind -> fun digit_ind -> fun tag ->
let array_of_int i =
Array.init 31 (fun n -> mkConstruct
(digit_ind, nth_digit_plus_one i (30-n)))
in
mkApp(mkConstruct(ind, 1), array_of_int tag)
in
(* subfunction which adds the information bound to the constructor of
the int31 type to the reactive retroknowledge *)
let add_int31c retroknowledge c =
let rk = add_vm_constant_static_info retroknowledge c
Cbytegen.compile_structured_int31
in
add_vm_constant_dynamic_info rk c Cbytegen.dynamic_int31_compilation
in
(* subfunction which adds the compiling information of an
int31 operation which has a specific vm instruction (associates
it to the name of the coq definition in the reactive retroknowledge) *)
let add_int31_op retroknowledge v n op kn =
add_vm_compiling_info retroknowledge v (Cbytegen.op_compilation n op kn)
in
fun env field value ->
(* subfunction which shortens the (very often use) registration of binary
operators to the reactive retroknowledge. *)
let add_int31_binop_from_const op =
match value with
| Const kn -> retroknowledge add_int31_op env value 2
op kn
| _ -> anomaly "Environ.register: should be a constant"
in
let add_int31_unop_from_const op =
match value with
| Const kn -> retroknowledge add_int31_op env value 1
op kn
| _ -> anomaly "Environ.register: should be a constant"
in
(* subfunction which completes the function constr_of_int31 above
by performing the actual retroknowledge operations *)
let add_int31_decompilation_from_type rk =
(* invariant : the type of bits is registered, otherwise the function
would raise Not_found. The invariant is enforced in safe_typing.ml *)
match field with
| KInt31 (grp, Int31Type) ->
(match Retroknowledge.find rk (KInt31 (grp,Int31Bits)) with
| Ind i31bit_type ->
(match value with
| Ind i31t ->
Retroknowledge.add_vm_decompile_constant_info rk
value (constr_of_int31 i31t i31bit_type)
| _ -> anomaly "Environ.register: should be an inductive type")
| _ -> anomaly "Environ.register: Int31Bits should be an inductive type")
| _ -> anomaly "Environ.register: add_int31_decompilation_from_type called with an abnormal field"
in
{env with retroknowledge =
let retroknowledge_with_reactive_info =
match field with
| KInt31 (_, Int31Type) ->
let i31c = match value with
| Ind i31t -> (Construct (i31t, 1))
| _ -> anomaly "Environ.register: should be an inductive type"
in
add_int31_decompilation_from_type
(add_vm_before_match_info
(retroknowledge add_int31c env i31c)
value Cbytegen.int31_escape_before_match)
| KInt31 (_, Int31Plus) -> add_int31_binop_from_const Cbytecodes.Kaddint31
| KInt31 (_, Int31PlusC) -> add_int31_binop_from_const Cbytecodes.Kaddcint31
| KInt31 (_, Int31PlusCarryC) -> add_int31_binop_from_const Cbytecodes.Kaddcarrycint31
| KInt31 (_, Int31Minus) -> add_int31_binop_from_const Cbytecodes.Ksubint31
| KInt31 (_, Int31MinusC) -> add_int31_binop_from_const Cbytecodes.Ksubcint31
| KInt31 (_, Int31MinusCarryC) -> add_int31_binop_from_const
Cbytecodes.Ksubcarrycint31
| KInt31 (_, Int31Times) -> add_int31_binop_from_const Cbytecodes.Kmulint31
| KInt31 (_, Int31TimesC) -> add_int31_binop_from_const Cbytecodes.Kmulcint31
| KInt31 (_, Int31Div21) -> (* this is a ternary operation *)
(match value with
| Const kn ->
retroknowledge add_int31_op env value 3
Cbytecodes.Kdiv21int31 kn
| _ -> anomaly "Environ.register: should be a constant")
| KInt31 (_, Int31Div) -> add_int31_binop_from_const Cbytecodes.Kdivint31
| KInt31 (_, Int31AddMulDiv) -> (* this is a ternary operation *)
(match value with
| Const kn ->
retroknowledge add_int31_op env value 3
Cbytecodes.Kaddmuldivint31 kn
| _ -> anomaly "Environ.register: should be a constant")
| KInt31 (_, Int31Compare) -> add_int31_binop_from_const Cbytecodes.Kcompareint31
| KInt31 (_, Int31Head0) -> add_int31_unop_from_const Cbytecodes.Khead0int31
| KInt31 (_, Int31Tail0) -> add_int31_unop_from_const Cbytecodes.Ktail0int31
| _ -> env.retroknowledge
in
Retroknowledge.add_field retroknowledge_with_reactive_info field value
}
|