dexpr.ml 44.5 KB
Newer Older
1 2 3
(********************************************************************)
(*                                                                  *)
(*  The Why3 Verification Platform   /   The Why3 Development Team  *)
4
(*  Copyright 2010-2015   --   INRIA - CNRS - Paris-Sud University  *)
5 6 7 8
(*                                                                  *)
(*  This software is distributed under the terms of the GNU Lesser  *)
(*  General Public License version 2.1, with the special exception  *)
(*  on linking described in file LICENSE.                           *)
9
(*                                                                  *)
10 11 12 13 14 15 16 17 18 19 20 21
(********************************************************************)

open Stdlib
open Ident
open Ty
open Term
open Ity
open Expr

(** Program types *)

type dity =
Andrei Paskevich's avatar
Andrei Paskevich committed
22 23 24 25
  | Dutv of tvsymbol          (* undestructible "user" type variable *)
  | Dvar of dvar ref          (* destructible "fresh" type variable *)
  | Durg of ity * dity        (* undestructible "user" region, for global refs *)
  | Dreg of dvar ref * dity   (* destructible "fresh" region *)
26 27 28 29
  | Dapp of itysymbol * dity list * dity list
  | Dpur of itysymbol * dity list

and dvar =
Andrei Paskevich's avatar
Andrei Paskevich committed
30 31 32 33 34 35 36
  | Dtvs of tvsymbol          (* unassigned fresh type variable *)
  | Dval of dity              (* destructive binding *)

(* In Dapp, the second dity list only contains Dreg's and Durg's.
   In Dreg and Durg, the dity field is a Dapp of the region's type.
   In Dreg, the dvar field leads to another Dreg or Durg.
   In Durg, the ity field is an Ityreg. *)
37 38 39

type dvty = dity list * dity (* A -> B -> C == ([A;B],C) *)

Andrei Paskevich's avatar
Andrei Paskevich committed
40 41 42
let dity_of_dvty (argl,res) =
  List.fold_right (fun a d -> Dpur (its_func, [a;d])) argl res

43 44
let dvar_fresh n = ref (Dtvs (create_tvsymbol (id_fresh n)))

Andrei Paskevich's avatar
Andrei Paskevich committed
45
let dreg_fresh dity = Dreg (dvar_fresh "rho", dity)
46 47 48 49 50 51 52 53 54 55 56 57

let dity_of_ity ity =
  let hr = Hreg.create 3 in
  let rec dity ity = match ity.ity_node with
    | Ityapp (s,tl,rl) -> Dapp (s, List.map dity tl, List.map dreg rl)
    | Itypur (s,tl)    -> Dpur (s, List.map dity tl)
    | Ityvar v -> Dutv v
    | Ityreg r -> dreg r
  and dreg reg =
    try Hreg.find hr reg with Not_found ->
    let {reg_its = s; reg_args = tl; reg_regs = rl} = reg in
    let d = Dapp (s, List.map dity tl, List.map dreg rl) in
Andrei Paskevich's avatar
Andrei Paskevich committed
58
    let r = dreg_fresh d in Hreg.add hr reg r; r in
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
  dity ity

let reg_of_ity = function
  | {ity_node = Ityreg reg} -> reg
  | _ -> assert false

let rec ity_of_dity = function
  | Dvar ({contents = Dval d})
  | Dreg ({contents = Dval d}, _) ->
      ity_of_dity d
  | Dvar r ->
      let v = create_tvsymbol (id_fresh "xi") in
      r := Dval (Dutv v); ity_var v
  | Dreg (r, d) ->
      let ity = ity_of_dity d in
      r := Dval (Durg (ity, d)); ity
  | Dutv v -> ity_var v
  | Durg (ity,_) -> ity
  | Dapp (s,tl,rl) ->
      let reg_of_dity r = reg_of_ity (ity_of_dity r) in
      ity_app s (List.map ity_of_dity tl) (List.map reg_of_dity rl)
  | Dpur (s,tl) ->
      ity_pur s (List.map ity_of_dity tl)

(** Destructive type unification *)

let rec occur_check v = function
  | Dvar {contents = Dval d} | Dreg (_,d) | Durg (_,d) -> occur_check v d
  | Dvar {contents = Dtvs u} | Dutv u -> if tv_equal u v then raise Exit
  | Dapp (_,dl,_) | Dpur (_,dl) -> List.iter (occur_check v) dl

let rec dity_unify d1 d2 = match d1,d2 with
  | Dvar {contents = Dval d1}, d2
  | d1, Dvar {contents = Dval d2}
  | Durg (_,d1), Durg (_,d2) | Durg (_,d1), Dreg (_,d2)
  | Dreg (_,d1), Durg (_,d2) | Dreg (_,d1), Dreg (_,d2) ->
      dity_unify d1 d2
  | Dvar {contents = Dtvs u},
    Dvar {contents = Dtvs v} when tv_equal u v ->
      ()
  | Dvar ({contents = Dtvs v} as r), d
  | d, Dvar ({contents = Dtvs v} as r) ->
      occur_check v d;
      r := Dval d
  | Dutv u, Dutv v when tv_equal u v ->
      ()
  |(Dapp (s1,dl1,_), Dapp (s2,dl2,_)
Andrei Paskevich's avatar
Andrei Paskevich committed
106
  | Dpur (s1,dl1),   Dpur (s2,dl2)) when its_equal s1 s2 ->
107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123
      List.iter2 dity_unify dl1 dl2
  | _ -> raise Exit

(** Reunify regions *)

let dtvs_queue : dvar ref Queue.t = Queue.create ()

let unify_queue : (dity * dity) Queue.t = Queue.create ()

let dity_fresh () =
  let r = dvar_fresh "mu" in
  Queue.add r dtvs_queue;
  Dvar r

let rec dity_refresh ht = function
  | Dreg ({contents = Dtvs v},d) ->
      begin try Htv.find ht v with Not_found ->
Andrei Paskevich's avatar
Andrei Paskevich committed
124
      let r = dreg_fresh (dity_refresh ht d) in
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
      Htv.add ht v r; r end
  | Dreg _ -> assert false
  | Dpur (s,dl) ->    Dpur (s, List.map (dity_refresh ht) dl)
  | Dapp (s,dl,rl) -> Dapp (s, List.map (dity_refresh ht) dl,
                               List.map (dity_refresh ht) rl)
  | Dvar {contents = Dval d} -> dity_refresh (Htv.create 3) d
  |(Dvar {contents = Dtvs _} | Dutv _ | Durg _) as d -> d

let dity_refresh d = dity_refresh (Htv.create 3) d

let dity_unify_weak = dity_unify

let dity_unify d1 d2 = dity_unify d1 d2; Queue.add (d1,d2) unify_queue

let rec reunify d1 d2 = match d1,d2 with
  | Dvar {contents = Dval d1}, d2
  | d1, Dvar {contents = Dval d2}
  | Dreg ({contents = Dval d1},_), d2
  | d1, Dreg ({contents = Dval d2},_) ->
      reunify d1 d2
  | Dvar _, Dvar _ | Dutv _, Dutv _ | Durg _, Durg _ ->
      ()
  | Dreg ({contents = Dtvs u},_),
    Dreg ({contents = Dtvs v},_) when tv_equal u v ->
      ()
  | Dreg (r, d1), (Dreg (_, d2) as d)
  | Dreg (r, d1), (Durg (_, d2) as d)
  | (Durg (_, d1) as d), Dreg (r, d2) ->
      reunify d1 d2;
      r := Dval d
  | Dapp (_,dl1,rl1), Dapp (_,dl2,rl2) ->
      List.iter2 reunify dl1 dl2;
      List.iter2 reunify rl1 rl2
  | Dpur (_,dl1), Dpur (_,dl2) ->
      List.iter2 reunify dl1 dl2
  | _ -> assert false

let reunify_regions () =
  Queue.iter (fun r -> match !r with
    | Dval d -> r := Dval (dity_refresh d)
    | Dtvs _ -> ()) dtvs_queue;
  Queue.clear dtvs_queue;
  Queue.iter (fun (d1,d2) -> reunify d1 d2) unify_queue;
  Queue.clear unify_queue

(** Chainable relations *)

let rec dity_is_bool = function
  | Dvar { contents = Dval dty } -> dity_is_bool dty
  | Dpur (s,_) -> its_equal s its_bool
  | _ -> false

let dvty_is_chainable = function
  | [t1;t2],t ->
      dity_is_bool t && not (dity_is_bool t1) && not (dity_is_bool t2)
  | _ -> false

(** Built-in types *)

let dity_int  = Dpur (its_int,  [])
let dity_real = Dpur (its_real, [])
let dity_bool = Dpur (its_bool, [])
let dity_unit = Dpur (its_unit, [])

let dvty_int  = [], dity_int
let dvty_real = [], dity_real
let dvty_bool = [], dity_bool
let dvty_unit = [], dity_unit

(** Pretty-printing *)

let rprinter =
  let sanitizer = Ident.sanitizer Ident.char_to_lalpha Ident.char_to_alnumus in
  Ident.create_ident_printer [] ~sanitizer

let print_args pr fmt tl = if tl <> [] then
  Format.fprintf fmt "@ %a" (Pp.print_list Pp.space pr) tl

let print_regs pr fmt rl = if rl <> [] then
  Format.fprintf fmt "@ <%a>" (Pp.print_list Pp.comma pr) rl

let protect_on x s = if x then "(" ^^ s ^^ ")" else s

let rec print_dity pri fmt = function
  | Dvar {contents = Dval d}
  | Dreg ({contents = Dval d},_) ->
      print_dity pri fmt d
  | Dvar {contents = Dtvs v}
  | Dutv v ->
      Pretty.print_tv fmt v
  | Dreg ({contents = Dtvs v},d) ->
      Format.fprintf fmt (protect_on (pri > 1) "%a@ @@%s")
        (print_dity 0) d (Ident.id_unique rprinter v.tv_name)
  | Durg (ity,d) ->
      Format.fprintf fmt (protect_on (pri > 1) "%a@ @@%s")
        (print_dity 0) d (Ident.id_unique rprinter (reg_of_ity ity).reg_name)
  | Dpur (s,[t1;t2]) when its_equal s its_func ->
      Format.fprintf fmt (protect_on (pri > 0) "%a@ ->@ %a")
        (print_dity 1) t1 (print_dity 0) t2
  | Dpur (s,tl) when is_ts_tuple s.its_ts ->
      Format.fprintf fmt "(%a)" (Pp.print_list Pp.comma (print_dity 0)) tl
226
  | Dpur (s,tl) when its_impure s ->
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
      Format.fprintf fmt (protect_on (pri > 1 && tl <> []) "{%a}%a")
        Pretty.print_ts s.its_ts (print_args (print_dity 2)) tl
  | Dpur (s,tl) ->
      Format.fprintf fmt (protect_on (pri > 1 && tl <> []) "%a%a")
        Pretty.print_ts s.its_ts (print_args (print_dity 2)) tl
  | Dapp (s,tl,rl) ->
      Format.fprintf fmt (protect_on (pri > 1) "%a%a%a")
        Pretty.print_ts s.its_ts (print_args (print_dity 2)) tl
          (print_regs (print_dity 0)) rl

let print_dity fmt d = print_dity 0 fmt d

(* Specialization of symbols *)

let specialize_scheme tvs (argl,res) =
  let hv = Htv.create 3 and hr = Htv.create 3 in
  let rec spec_dity = function
    | Durg _ as d -> d
    | Dvar {contents = Dval d} | Dreg ({contents = Dval d},_) -> spec_dity d
    | Dvar {contents = Dtvs v} | Dutv v as d -> get_tv v d
    | Dreg ({contents = Dtvs v},d) -> get_reg v d
    | Dapp (s,dl,rl) -> Dapp (s, List.map spec_dity dl, List.map spec_dity rl)
    | Dpur (s,dl)    -> Dpur (s, List.map spec_dity dl)
  and get_tv v d = try Htv.find hv v with Not_found ->
    let nd = dity_fresh () in
    (* can't return d, might differ in regions *)
    if not (Stv.mem v tvs) then dity_unify_weak nd d;
    Htv.add hv v nd; nd
  and get_reg v d = try Htv.find hr v with Not_found ->
Andrei Paskevich's avatar
Andrei Paskevich committed
256
    let r = dreg_fresh (spec_dity d) in
257 258 259 260 261 262 263 264 265 266 267 268 269 270 271
    Htv.add hr v r; r in
  List.map spec_dity argl, spec_dity res

let spec_ity hv hr frz ity =
  let rec dity ity = match ity.ity_node with
    | Ityreg r -> dreg r
    | Ityvar v -> if Mtv.mem v frz.isb_tv then Dutv v else get_tv v
    | Ityapp (s,tl,rl) -> Dapp (s, List.map dity tl, List.map dreg rl)
    | Itypur (s,tl)    -> Dpur (s, List.map dity tl)
  and get_tv v = try Htv.find hv v with Not_found ->
    let nd = dity_fresh () in Htv.add hv v nd; nd
  and dreg reg = try Hreg.find hr reg with Not_found ->
    let {reg_its = s; reg_args = tl; reg_regs = rl} = reg in
    let d = Dapp (s, List.map dity tl, List.map dreg rl) in
    let r = if Mreg.mem reg frz.isb_reg then
Andrei Paskevich's avatar
Andrei Paskevich committed
272
      Durg (ity_reg reg, d) else dreg_fresh d in
273 274 275
    Hreg.add hr reg r; r in
  dity ity

Andrei Paskevich's avatar
Andrei Paskevich committed
276
let specialize_pv {pv_ity = ity} =
277 278
  spec_ity (Htv.create 3) (Hreg.create 3) (ity_freeze isb_empty ity) ity

Andrei Paskevich's avatar
Andrei Paskevich committed
279
let specialize_xs {xs_ity = ity} =
280 281
  spec_ity (Htv.create 3) (Hreg.create 3) (ity_freeze isb_empty ity) ity

282
let specialize_rs {rs_cty = cty} =
283 284 285 286 287 288 289
  let hv = Htv.create 3 and hr = Hreg.create 3 in
  let spec ity = spec_ity hv hr cty.cty_freeze ity in
  List.map (fun v -> spec v.pv_ity) cty.cty_args, spec cty.cty_result

(** Patterns *)

type dpattern = {
Andrei Paskevich's avatar
Andrei Paskevich committed
290
  dp_pat  : pre_pattern;
291 292 293 294 295 296 297 298
  dp_dity : dity;
  dp_vars : dity Mstr.t;
  dp_loc  : Loc.position option;
}

type dpattern_node =
  | DPwild
  | DPvar  of preid
299
  | DPapp  of rsymbol * dpattern list
300 301 302 303 304 305 306 307
  | DPor   of dpattern * dpattern
  | DPas   of dpattern * preid
  | DPcast of dpattern * ity

(** Specifications *)

type ghost = bool

Andrei Paskevich's avatar
Andrei Paskevich committed
308
type dbinder = preid option * ghost * dity
309 310 311 312 313 314 315 316 317 318 319 320 321

type 'a later = vsymbol Mstr.t -> 'a
  (* specification terms are parsed and typechecked after the program
     expressions, when the types of locally bound program variables are
     already established. *)

type dspec_final = {
  ds_pre     : term list;
  ds_post    : (vsymbol option * term) list;
  ds_xpost   : (vsymbol option * term) list Mexn.t;
  ds_reads   : vsymbol list;
  ds_writes  : term list;
  ds_diverge : bool;
322
  ds_checkrw : bool;
323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342
}

type dspec = ty -> dspec_final
  (* Computation specification is also parametrized by the result type.
     All vsymbols in the postcondition clauses in the [ds_post] field
     must have this type. All vsymbols in the exceptional postcondition
     clauses must have the type of the corresponding exception. *)

(** Expressions *)

type dinvariant = term list

type dexpr = {
  de_node : dexpr_node;
  de_dvty : dvty;
  de_loc  : Loc.position option;
}

and dexpr_node =
  | DEvar of string * dvty
343 344
  | DEpv of pvsymbol
  | DErs of rsymbol
345
  | DEconst of Number.constant
346
  | DEapp of dexpr * dexpr
Andrei Paskevich's avatar
Andrei Paskevich committed
347
  | DEfun of dbinder list * dspec later * dexpr
348
  | DEany of dbinder list * dspec later * dity
349 350
  | DElet of dlet_defn * dexpr
  | DErec of drec_defn * dexpr
Andrei Paskevich's avatar
Andrei Paskevich committed
351
  | DEnot of dexpr
352 353
  | DEand of dexpr * dexpr
  | DEor of dexpr * dexpr
354 355
  | DEif of dexpr * dexpr * dexpr
  | DEcase of dexpr * (dpattern * dexpr) list
356
  | DEassign of (dexpr * rsymbol * dexpr) list
357
  | DEwhile of dexpr * dinvariant later * variant list later * dexpr
358
  | DEfor of preid * dexpr * for_direction * dexpr * dinvariant later * dexpr
Andrei Paskevich's avatar
Andrei Paskevich committed
359 360 361
  | DEtry of dexpr * (xsymbol * dpattern * dexpr) list
  | DEraise of xsymbol * dexpr
  | DEghost of dexpr
362
  | DEassert of assertion_kind * term later
Andrei Paskevich's avatar
Andrei Paskevich committed
363 364 365 366
  | DEpure of term later
  | DEabsurd
  | DEtrue
  | DEfalse
367 368 369 370 371
  | DEmark of preid * dexpr
  | DEcast of dexpr * ity
  | DEuloc of dexpr * Loc.position
  | DElabel of dexpr * Slab.t

372
and dlet_defn = preid * ghost * rs_kind * dexpr
373 374 375

and drec_defn = { fds : dfun_defn list }

376
and dfun_defn = preid * ghost * rs_kind *
377
  dbinder list * dspec later * variant list later * dexpr
Andrei Paskevich's avatar
Andrei Paskevich committed
378

379 380 381 382 383 384 385 386 387
(** Environment *)

type denv = {
  frozen : dity list;
  locals : (Stv.t option * dvty) Mstr.t;
}

let denv_empty = { frozen = []; locals = Mstr.empty }

Andrei Paskevich's avatar
Andrei Paskevich committed
388 389
let is_frozen frozen v =
  try List.iter (occur_check v) frozen; false with Exit -> true
390 391 392

let freeze_dvty frozen (argl,res) =
  let rec add l = function
Andrei Paskevich's avatar
Andrei Paskevich committed
393
    | Dreg (_,d) | Durg (_,d)
394 395 396 397 398 399 400 401
    | Dvar { contents = Dval d } -> add l d
    | Dvar { contents = Dtvs _ } as d -> d :: l
    | Dutv _ as d -> d :: l
    | Dapp (_,tl,_) | Dpur (_,tl) -> List.fold_left add l tl in
  List.fold_left add (add frozen res) argl

let free_vars frozen (argl,res) =
  let rec add s = function
Andrei Paskevich's avatar
Andrei Paskevich committed
402
    | Dreg (_,d) | Durg (_,d)
403
    | Dvar { contents = Dval d } -> add s d
Andrei Paskevich's avatar
Andrei Paskevich committed
404 405
    | Dvar { contents = Dtvs v }
    | Dutv v -> if is_frozen frozen v then s else Stv.add v s
406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428
    | Dapp (_,tl,_) | Dpur (_,tl) -> List.fold_left add s tl in
  List.fold_left add (add Stv.empty res) argl

let denv_add_mono { frozen = frozen; locals = locals } id dvty =
  let locals = Mstr.add id.pre_name (None, dvty) locals in
  { frozen = freeze_dvty frozen dvty; locals = locals }

let denv_add_poly { frozen = frozen; locals = locals } id dvty =
  let ftvs = free_vars frozen dvty in
  let locals = Mstr.add id.pre_name (Some ftvs, dvty) locals in
  { frozen = frozen; locals = locals }

let denv_add_rec_mono { frozen = frozen; locals = locals } id dvty =
  let locals = Mstr.add id.pre_name (Some Stv.empty, dvty) locals in
  { frozen = freeze_dvty frozen dvty; locals = locals }

let denv_add_rec_poly { frozen = frozen; locals = locals } frozen0 id dvty =
  let ftvs = free_vars frozen0 dvty in
  let locals = Mstr.add id.pre_name (Some ftvs, dvty) locals in
  { frozen = frozen; locals = locals }

let denv_add_rec denv frozen0 id ((argl,res) as dvty) =
  let rec is_explicit = function
Andrei Paskevich's avatar
Andrei Paskevich committed
429
    | Dreg (_,d) | Durg (_,d)
430 431
    | Dvar { contents = Dval d } -> is_explicit d
    | Dvar { contents = Dtvs _ } -> false
Andrei Paskevich's avatar
Andrei Paskevich committed
432 433
    | Dutv _ -> true
    | Dapp (_,tl,_) | Dpur (_,tl) -> List.for_all is_explicit tl in
434 435 436 437 438 439
  if List.for_all is_explicit argl && is_explicit res
  then denv_add_rec_poly denv frozen0 id dvty
  else denv_add_rec_mono denv id dvty

let denv_add_var denv id dity = denv_add_mono denv id ([], dity)

Andrei Paskevich's avatar
Andrei Paskevich committed
440
let denv_add_let denv (id,_,_,({de_dvty = dvty} as de)) =
441 442 443
  if fst dvty = [] then denv_add_mono denv id dvty else
  let rec is_value de = match de.de_node with
    | DEghost de | DEuloc (de,_) | DElabel (de,_) -> is_value de
444
    | DEvar _ | DErs _ | DEfun _ | DEany _ -> true
445 446 447 448 449 450
    | _ -> false in
  if is_value de
  then denv_add_poly denv id dvty
  else denv_add_mono denv id dvty

let denv_add_args { frozen = frozen; locals = locals } bl =
Andrei Paskevich's avatar
Andrei Paskevich committed
451 452
  let l = List.fold_left (fun l (_,_,t) -> t::l) frozen bl in
  let add s (id,_,t) = match id with
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
    | Some {pre_name = n} ->
        Mstr.add_new (Dterm.DuplicateVar n) n (None, ([],t)) s
    | None -> s in
  let s = List.fold_left add Mstr.empty bl in
  { frozen = l; locals = Mstr.set_union s locals }

let denv_add_pat { frozen = frozen; locals = locals } dp =
  let l = Mstr.fold (fun _ t l -> t::l) dp.dp_vars frozen in
  let s = Mstr.map (fun t -> None, ([], t)) dp.dp_vars in
  { frozen = l; locals = Mstr.set_union s locals }

let mk_node n = function
  | Some tvs, dvty -> DEvar (n, specialize_scheme tvs dvty)
  | None,     dvty -> DEvar (n, dvty)

let denv_get denv n =
  mk_node n (Mstr.find_exn (Dterm.UnboundVar n) n denv.locals)

let denv_get_opt denv n =
  Opt.map (mk_node n) (Mstr.find_opt n denv.locals)

(** Unification tools *)

let dity_unify_app ls fn (l1: 'a list) (l2: dity list) =
  try List.iter2 fn l1 l2 with Invalid_argument _ ->
    raise (BadArity (ls, List.length l1))

let dpat_expected_type {dp_dity = dp_dity; dp_loc = loc} dity =
  try dity_unify dp_dity dity with Exit -> Loc.errorm ?loc
    "This pattern has type %a,@ but is expected to have type %a"
    print_dity dp_dity print_dity dity

let dpat_expected_type_weak {dp_dity = dp_dity; dp_loc = loc} dity =
  try dity_unify_weak dp_dity dity with Exit -> Loc.errorm ?loc
    "This pattern has type %a,@ but is expected to have type %a"
    print_dity dp_dity print_dity dity

Andrei Paskevich's avatar
Andrei Paskevich committed
490 491
let dexpr_expected_type {de_dvty = dvty; de_loc = loc} dity =
  let res = dity_of_dvty dvty in
492 493 494 495
  try dity_unify res dity with Exit -> Loc.errorm ?loc
    "This expression has type %a,@ but is expected to have type %a"
    print_dity res print_dity dity

Andrei Paskevich's avatar
Andrei Paskevich committed
496 497
let dexpr_expected_type_weak {de_dvty = dvty; de_loc = loc} dity =
  let res = dity_of_dvty dvty in
498 499 500 501 502 503
  try dity_unify_weak res dity with Exit -> Loc.errorm ?loc
    "This expression has type %a,@ but is expected to have type %a"
    print_dity res print_dity dity

(** Generation of letrec blocks *)

504 505
type pre_fun_defn = preid * ghost * rs_kind * dbinder list *
  dity * (denv -> dspec later * variant list later * dexpr)
506 507 508 509

exception DupId of preid

let drec_defn denv0 prel =
Andrei Paskevich's avatar
Andrei Paskevich committed
510 511
  if prel = [] then invalid_arg "Dexpr.drec_defn: empty function list";
  let add s (id,_,_,_,_,_) = Sstr.add_new (DupId id) id.pre_name s in
512 513
  let _ = try List.fold_left add Sstr.empty prel with DupId id ->
    Loc.errorm ?loc:id.pre_loc "duplicate function name %s" id.pre_name in
Andrei Paskevich's avatar
Andrei Paskevich committed
514 515 516
  let add denv (id,_,_,bl,res,_) =
    if bl = [] then invalid_arg "Dexpr.drec_defn: empty argument list";
    let argl = List.map (fun (_,_,t) -> t) bl in
517 518
    denv_add_rec denv denv0.frozen id (argl,res) in
  let denv1 = List.fold_left add denv0 prel in
Andrei Paskevich's avatar
Andrei Paskevich committed
519
  let parse (id,gh,pk,bl,res,pre) =
520
    let dsp, dvl, de = pre (denv_add_args denv1 bl) in
521
    dexpr_expected_type_weak de res;
522
    (id,gh,pk,bl,dsp,dvl,de) in
523
  let fdl = List.map parse prel in
524
  let add denv (id,_,_,bl,_,_,{de_dvty = dvty}) =
Andrei Paskevich's avatar
Andrei Paskevich committed
525
    (* just in case we linked some polymorphic type var to the outer context *)
526 527 528 529 530 531 532
    let check tv = if is_frozen denv0.frozen tv then Loc.errorm ?loc:id.pre_loc
      "This function is expected to be polymorphic in type variable %a"
      Pretty.print_tv tv in
    begin match Mstr.find_opt id.pre_name denv1.locals with
    | Some (Some tvs, _) -> Stv.iter check tvs
    | Some (None, _) | None -> assert false
    end;
Andrei Paskevich's avatar
Andrei Paskevich committed
533 534
    let argl = List.map (fun (_,_,t) -> t) bl in
    denv_add_poly denv id (argl, dity_of_dvty dvty) in
535 536 537 538 539 540 541 542 543 544 545 546 547
  List.fold_left add denv0 fdl, { fds = fdl }

(** Constructors *)

let dpattern ?loc node =
  let mk_dpat pre dity vars =
    { dp_pat = pre; dp_dity = dity; dp_vars = vars; dp_loc = loc } in
  let dpat = function
    | DPwild ->
        mk_dpat PPwild (dity_fresh ()) Mstr.empty
    | DPvar id ->
        let dity = dity_fresh () in
        mk_dpat (PPvar id) dity (Mstr.singleton id.pre_name dity)
548 549
    | DPapp ({rs_logic = RLls ls} as rs, dpl) when ls.ls_constr > 0 ->
        let argl, res = specialize_rs rs in
550 551 552 553 554
        dity_unify_app ls dpat_expected_type dpl argl;
        let join n _ _ = raise (Dterm.DuplicateVar n) in
        let add acc dp = Mstr.union join acc dp.dp_vars in
        let vars = List.fold_left add Mstr.empty dpl in
        let ppl = List.map (fun dp -> dp.dp_pat) dpl in
555 556 557
        mk_dpat (PPapp (rs, ppl)) res vars
    | DPapp (rs,_) ->
        raise (ConstructorExpected rs);
558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578
    | DPor (dp1,dp2) ->
        dpat_expected_type dp2 dp1.dp_dity;
        let join n dity1 dity2 = try dity_unify dity1 dity2; Some dity1
          with Exit -> Loc.errorm ?loc
            "Variable %s has type %a,@ but is expected to have type %a"
            n print_dity dity1 print_dity dity2 in
        let vars = Mstr.union join dp1.dp_vars dp2.dp_vars in
        mk_dpat (PPor (dp1.dp_pat, dp2.dp_pat)) dp1.dp_dity vars
    | DPas (dp, ({pre_name = n} as id)) ->
        let { dp_pat = pat; dp_dity = dity; dp_vars = vars } = dp in
        let vars = Mstr.add_new (Dterm.DuplicateVar n) n dity vars in
        mk_dpat (PPas (pat, id)) dity vars
    | DPcast (dp, ity) ->
        dpat_expected_type_weak dp (dity_of_ity ity);
        dp
  in
  Loc.try1 ?loc dpat node

let dexpr ?loc node =
  let get_dvty = function
    | DEvar (_,dvty) ->
579
        dvty
580
    | DEpv pv ->
581
        [], specialize_pv pv
582
    | DErs rs ->
583
        specialize_rs rs
584
    | DEconst (Number.ConstInt _) ->
585
        dvty_int
586
    | DEconst (Number.ConstReal _) ->
587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606
        dvty_real
    | DEapp ({de_dvty = (arg::argl, res)}, de2) ->
        dexpr_expected_type de2 arg;
        argl, res
    | DEapp ({de_dvty = ([],res)} as de1, de2) ->
        let f,a,r = match specialize_rs rs_func_app with
          | [f;a],r -> f,a,r | _ -> assert false in
        begin try dity_unify res f with Exit ->
          let rec down n de = match de.de_node with
            | DEapp (de,_) -> down (succ n) de
            | _ when n = 0 -> Loc.errorm ?loc:de.de_loc
                "This expression has type %a,@ it cannot be applied"
                print_dity (dity_of_dvty de.de_dvty)
            | _ -> Loc.errorm ?loc:de.de_loc
                "This expression has type %a,@ but is applied to %d arguments"
                print_dity (dity_of_dvty de.de_dvty) (succ n) in
          down 0 de1
        end;
        dexpr_expected_type de2 a;
        [], r
607
    | DEfun (bl,_,de) ->
608
        List.map (fun (_,_,t) -> t) bl, dity_of_dvty de.de_dvty
609
    | DEany (bl,_,res) ->
610
        List.map (fun (_,_,t) -> t) bl, res
611 612
    | DElet (_,de)
    | DErec (_,de) ->
613
        de.de_dvty
614 615
    | DEnot de ->
        dexpr_expected_type de dity_bool;
616 617 618
        dvty_bool
    | DEand (de1,de2)
    | DEor (de1,de2) ->
619 620
        dexpr_expected_type de1 dity_bool;
        dexpr_expected_type de2 dity_bool;
621
        dvty_bool
622 623 624 625 626
    | DEif (de1,de2,de3) ->
        let res = dity_fresh () in
        dexpr_expected_type de1 dity_bool;
        dexpr_expected_type de2 res;
        dexpr_expected_type de3 res;
627
        [], res
628
    | DEcase (_,[]) ->
Andrei Paskevich's avatar
Andrei Paskevich committed
629
        invalid_arg "Dexpr.dexpr: empty branch list in DEcase"
630 631 632 633
    | DEcase (de,bl) ->
        let ety = dity_fresh () in
        let res = dity_fresh () in
        dexpr_expected_type de ety;
634
        List.iter (fun (dp,de) ->
635
          dpat_expected_type dp ety;
636
          dexpr_expected_type de res) bl;
637
        [], res
638
    | DEassign al ->
639 640 641
        List.iter (fun (de1,rs,de2) ->
          let argl, res = specialize_rs rs in
          let ls = match rs.rs_logic with RLls ls -> ls
642 643 644
            | _ -> invalid_arg "Dexpr.dexpr: not a field" in
          dity_unify_app ls dexpr_expected_type [de1] argl;
          dexpr_expected_type_weak de2 res) al;
645 646
        dvty_unit
    | DEwhile (de1,_,_,de2) ->
647
        dexpr_expected_type de1 dity_bool;
648
        dexpr_expected_type de2 dity_unit;
649
        dvty_unit
650 651 652 653
    | DEfor (_,de_from,_,de_to,_,de) ->
        dexpr_expected_type de_from dity_int;
        dexpr_expected_type de_to dity_int;
        dexpr_expected_type de dity_unit;
654
        dvty_unit
655
    | DEtry (_,[]) ->
Andrei Paskevich's avatar
Andrei Paskevich committed
656
        invalid_arg "Dexpr.dexpr: empty branch list in DEtry"
657 658 659
    | DEtry (de,bl) ->
        let res = dity_fresh () in
        dexpr_expected_type de res;
660 661 662
        List.iter (fun (xs,dp,de) ->
          dpat_expected_type dp (specialize_xs xs);
          dexpr_expected_type de res) bl;
663
        [], res
664 665
    | DEraise (xs,de) ->
        dexpr_expected_type de (specialize_xs xs);
666
        [], dity_fresh ()
667
    | DEghost de ->
668
        de.de_dvty
669
    | DEassert _ ->
670
        dvty_unit
671 672
    | DEpure _
    | DEabsurd ->
673
        [], dity_fresh ()
674 675
    | DEtrue
    | DEfalse ->
676
        dvty_bool
677 678
    | DEcast (de,ity) ->
        dexpr_expected_type_weak de (dity_of_ity ity);
679
        de.de_dvty
680
    | DEmark (_,de)
681 682
    | DEuloc (de,_)
    | DElabel (de,_) ->
683 684 685
        de.de_dvty in
  let dvty = Loc.try1 ?loc get_dvty node in
  { de_node = node; de_dvty = dvty; de_loc = loc }
686 687 688 689 690 691 692

(** Final stage *)

(** Binders *)

let binders bl =
  let sn = ref Sstr.empty in
693
  let binder (id, ghost, dity) =
694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710
    let id = match id with
      | Some ({pre_name = n} as id) ->
          let exn = match id.pre_loc with
            | Some loc -> Loc.Located (loc, Dterm.DuplicateVar n)
            | None -> Dterm.DuplicateVar n in
          sn := Sstr.add_new exn n !sn; id
      | None -> id_fresh "_" in
    create_pvsymbol id ~ghost (ity_of_dity dity) in
  List.map binder bl

(** Specifications *)

let to_fmla f = match f.t_ty with
  | None -> f
  | Some ty when ty_equal ty ty_bool -> t_equ f t_bool_true
  | _ -> Loc.error ?loc:f.t_loc Dterm.FmlaExpected

711 712 713 714 715 716 717 718 719 720
let create_assert = to_fmla

let create_invariant pl = List.map to_fmla pl

let create_pre = create_invariant

let create_post ty ql = List.map (fun (v,f) ->
  let f = (*Mlw_wp.remove_old*) (to_fmla f) in match v with
    | None -> Ity.create_post (create_vsymbol (id_fresh "result") ty) f
    | Some v -> Ty.ty_equal_check ty v.vs_ty; Ity.create_post v f) ql
721 722 723 724 725 726

let create_xpost xql =
  Mexn.mapi (fun xs ql -> create_post (ty_of_ity xs.xs_ity) ql) xql

(** User effects *)

727 728 729 730 731 732
let rec effect_of_term t =
  let quit () = Loc.errorm ?loc:t.t_loc "unsupported effect expression" in
  match t.t_node with
  | Tapp (fs, [ta]) ->
      let v, ity, fa = effect_of_term ta in
      let ity = match fa with
733
        | Some {rs_cty = {cty_args = [arg]; cty_result = res}} ->
734 735 736
            ity_full_inst (ity_match isb_empty arg.pv_ity ity) res
        | Some _ -> assert false
        | None -> ity in
737
      begin try match ity.ity_node, restore_rs fs with
Andrei Paskevich's avatar
Andrei Paskevich committed
738 739
        | Ityreg {reg_its = ts}, ({rs_field = Some f} as rs)
          when List.exists (pv_equal f) ts.its_mfields -> v, ity, Some rs
740
        | _, {rs_cty={cty_args=[arg]; cty_result=res; cty_freeze=frz}} ->
741 742 743 744 745 746
            v, ity_full_inst (ity_match frz arg.pv_ity ity) res, None
        | _ -> quit () with Not_found -> quit () end
  | Tvar v ->
      let v = try restore_pv v with Not_found -> quit () in
      v, v.pv_ity, None
  | _ -> quit ()
747 748

let effect_of_dspec dsp =
749 750 751
  let add_read s v = Spv.add (try restore_pv v with Not_found ->
    Loc.errorm "unsupported effect expression") s in
  let pvs = List.fold_left add_read Spv.empty dsp.ds_reads in
752
  let add_write (l,eff) t = match effect_of_term t with
753 754
    | v, {ity_node = Ityreg reg}, fd ->
        let fs = match fd with
755
          | Some fd -> Spv.singleton (Opt.get fd.rs_field)
756
          | None -> Spv.of_list reg.reg_its.its_mfields in
757 758 759
        let rd = Spv.singleton v and wr = Mreg.singleton reg fs in
        let e = Loc.try2 ?loc:t.t_loc eff_write rd wr in
        (e,t)::l, eff_union_par eff e
760
    | _ ->
761
        Loc.errorm ?loc:t.t_loc "mutable expression expected" in
762 763 764 765
  let wl, eff = List.fold_left add_write ([], eff_read pvs) dsp.ds_writes in
  let eff = Mexn.fold (fun xs _ eff -> eff_raise eff xs) dsp.ds_xpost eff in
  let eff = if dsp.ds_diverge then eff_diverge eff else eff in
  wl, eff
766

Andrei Paskevich's avatar
Andrei Paskevich committed
767
let check_spec dsp ecty e =
768 769 770
  let bad_write weff eff = not (Mreg.submap (fun _ s1 s2 -> Spv.subset s1 s2)
                                            weff.eff_writes eff.eff_writes) in
  let bad_raise xeff eff = not (Sexn.subset xeff.eff_raises eff.eff_raises) in
771
  (* computed effect vs user effect *)
Andrei Paskevich's avatar
Andrei Paskevich committed
772
  let check_rwd = dsp.ds_checkrw in
773
  let uwrl, ue = effect_of_dspec dsp in
Andrei Paskevich's avatar
Andrei Paskevich committed
774
  let ucty = create_cty ecty.cty_args ecty.cty_pre
775 776 777
    ecty.cty_post ecty.cty_xpost ue ecty.cty_result in
  let ueff = ucty.cty_effect and eeff = ecty.cty_effect in
  let urds = ueff.eff_reads and erds = eeff.eff_reads in
778
  (* check that every user effect actually happens *)
779 780 781 782 783 784 785 786 787
  if not (Spv.subset urds erds) then Loc.errorm ?loc:e.e_loc
    "variable@ %a@ does@ not@ occur@ in@ this@ expression"
    Pretty.print_vs (Spv.choose (Spv.diff urds erds)).pv_vs;
  if bad_write ueff eeff then List.iter (fun (weff,t) ->
    if bad_write weff eeff then Loc.errorm ?loc:t.t_loc
      "this@ write@ effect@ does@ not@ happen@ in@ the@ expression") uwrl;
  if bad_raise ueff eeff then Loc.errorm ?loc:e.e_loc
    "this@ expression@ does@ not@ raise@ exception@ %a"
    print_xs (Sexn.choose (Sexn.diff ueff.eff_raises eeff.eff_raises));
788
  if ueff.eff_oneway && not eeff.eff_oneway then Loc.errorm ?loc:e.e_loc
789
    "this@ expression@ does@ not@ diverge";
790
  (* check that every computed effect is listed *)
791 792 793 794 795
  if check_rwd && not (Spv.subset erds urds) then Spv.iter (fun v ->
    Loc.errorm ?loc:e.e_loc
      "this@ expression@ depends@ on@ variable@ %a@ left@ out@ in@ \
      the@ specification" Pretty.print_vs v.pv_vs) (Spv.diff erds urds);
  if check_rwd && bad_write eeff ueff then
796
    Loc.errorm ?loc:(e_locate_effect (fun eff -> bad_write eff ueff) e)
797 798
      "this@ expression@ produces@ an@ unlisted@ write@ effect";
  if ecty.cty_args <> [] && bad_raise eeff ueff then Sexn.iter (fun xs ->
799
    Loc.errorm ?loc:(e_locate_effect (fun eff -> Sexn.mem xs eff.eff_raises) e)
800
      "this@ expression@ raises@ unlisted@ exception@ %a"
801
      print_xs xs) (Sexn.diff eeff.eff_raises ueff.eff_raises);
802 803
  if check_rwd && eeff.eff_oneway && not ueff.eff_oneway then
    Loc.errorm ?loc:(e_locate_effect (fun eff -> eff.eff_oneway) e)
804 805
      "this@ expression@ may@ diverge,@ but@ this@ is@ not@ \
        stated@ in@ the@ specification"
806

Andrei Paskevich's avatar
Andrei Paskevich committed
807
let check_aliases recu c =
808 809 810
  let rds_regs = c.cty_freeze.isb_reg in
  let report r _ _ =
    if Mreg.mem r rds_regs then let spv = Spv.filter
811
        (fun v -> ity_r_occurs r v.pv_ity) (cty_reads c) in
812
      Loc.errorm "The type of this function contains an alias with \
813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829
        external variable %a" print_pv (Spv.choose spv)
    else Loc.errorm "The type of this function contains an alias" in
  (* we allow the value in a non-recursive function to contain
     regions coming the function's arguments, but not from the
     context. It is sometimes useful to write a function around
     a constructor or a projection. For recursive functions, we
     impose the full non-alias discipline, to ensure the safety
     of region polymorphism (see add_rec_mono). We do not track
     aliases inside the type of an argument or a result, which
     may break the type inference, but we have a safety net
     type checking in Expr. *)
  let add_ity regs ity =
    let frz = ity_freeze isb_empty ity in
    Mreg.union report regs frz.isb_reg in
  let add_arg regs v = add_ity regs v.pv_ity in
  let regs = List.fold_left add_arg rds_regs c.cty_args in
  ignore (add_ity (if recu then regs else rds_regs) c.cty_result)
830

831
let check_fun rsym dsp e =
Andrei Paskevich's avatar
Andrei Paskevich committed
832
  let c,e = match e with
833
    | { c_node = Cfun e; c_cty = c } -> c,e
Andrei Paskevich's avatar
Andrei Paskevich committed
834 835 836 837 838 839 840
    | _ -> invalid_arg "Dexpr.check_fun" in
  let c = match rsym with
    | Some s -> s.rs_cty
    | None -> c in
  check_spec dsp c e;
  check_aliases (rsym <> None) c

841 842
(** Environment *)

Andrei Paskevich's avatar
Andrei Paskevich committed
843
type env = {
844
  rsm : rsymbol Mstr.t;
845 846 847 848
  pvm : pvsymbol Mstr.t;
  vsm : vsymbol Mstr.t;
}

849
let env_empty = {
850
  rsm = Mstr.empty;
851 852 853 854
  pvm = Mstr.empty;
  vsm = Mstr.empty;
}

855
let add_rsymbol ({rsm = rsm; vsm = vsm} as env) rs =
856
  let n = rs.rs_name.id_string in
857 858 859 860
  let vsm = match rs.rs_logic with
    | RLpv pv -> Mstr.add n pv.pv_vs vsm
    | _ -> vsm in
  { env with rsm = Mstr.add n rs rsm; vsm = vsm }
861

Andrei Paskevich's avatar
Andrei Paskevich committed
862
let add_pvsymbol ({pvm = pvm; vsm = vsm} as env) pv =
863
  let n = pv.pv_vs.vs_name.id_string in
Andrei Paskevich's avatar
Andrei Paskevich committed
864
  { env with pvm = Mstr.add n pv pvm; vsm = Mstr.add n pv.pv_vs vsm }
865

Andrei Paskevich's avatar
Andrei Paskevich committed
866
let add_pv_map ({pvm = pvm; vsm = vsm} as env) vm =
867
  let um = Mstr.map (fun pv -> pv.pv_vs) vm in
Andrei Paskevich's avatar
Andrei Paskevich committed
868
  { env with pvm = Mstr.set_union vm pvm; vsm = Mstr.set_union um vsm }
869 870 871 872 873

let add_binders env pvl = List.fold_left add_pvsymbol env pvl

(** Abstract values *)

Andrei Paskevich's avatar
Andrei Paskevich committed
874 875 876 877 878 879
let cty_of_spec env bl dsp dity =
  let ity = ity_of_dity dity in
  let ty = ty_of_ity ity in
  let bl = binders bl in
  let env = add_binders env bl in
  let dsp = dsp env.vsm ty in
880 881
  let _,eff = effect_of_dspec dsp in
  let eff = eff_strong eff in
Andrei Paskevich's avatar
Andrei Paskevich committed
882 883 884
  let p = create_pre dsp.ds_pre in
  let q = create_post ty dsp.ds_post in
  let xq = create_xpost dsp.ds_xpost in
885
  create_cty bl p q xq eff ity
886 887 888

(** Expressions *)

Andrei Paskevich's avatar
Andrei Paskevich committed
889
(*
890 891
let implicit_post = Debug.register_flag "implicit_post"
  ~desc:"Generate@ a@ postcondition@ for@ pure@ functions@ without@ one."
Andrei Paskevich's avatar
Andrei Paskevich committed
892
*)
893

Andrei Paskevich's avatar
Andrei Paskevich committed
894 895 896 897
let warn_unused s loc =
  if s = "" || s.[0] <> '_' then
  Warning.emit ?loc "unused variable %s" s

898
let check_used_pv e pv = if not (Spv.mem pv e.e_effect.eff_reads) then
Andrei Paskevich's avatar
Andrei Paskevich committed
899
  warn_unused pv.pv_vs.vs_name.id_string pv.pv_vs.vs_name.id_loc
900

901 902 903 904
let e_let_check ld e = match ld with
  | LDvar (v,_) -> check_used_pv e v; e_let ld e
  | _           -> e_let ld e

905 906
let rec strip uloc labs de = match de.de_node with
  | DEcast (de,_) -> strip uloc labs de
907
  | DEuloc (de,loc) -> strip (Some (Some loc)) labs de
908 909 910
  | DElabel (de,s) -> strip uloc (Slab.union labs s) de
  | _ -> uloc, labs, de

911 912 913 914 915 916 917 918 919
let get_pv env n = Mstr.find_exn (Dterm.UnboundVar n) n env.pvm
let get_rs env n = Mstr.find_exn (Dterm.UnboundVar n) n env.rsm

let rec expr uloc env ({de_loc = loc} as de) =
  let uloc, labs, de = strip uloc Slab.empty de in
  let e = Loc.try3 ?loc try_expr uloc env de in
  let loc = Opt.get_def loc uloc in
  if loc = None && Slab.is_empty labs
  then e else e_label ?loc labs e
Andrei Paskevich's avatar
Andrei Paskevich committed
920

921
and cexp uloc env ghost ({de_loc = loc} as de) =
922
  let uloc, labs, de = strip uloc Slab.empty de in
923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965
  if not (Slab.is_empty labs) then Warning.emit ?loc
    "Ignoring labels over a higher-order expression";
  Loc.try4 ?loc try_cexp uloc env ghost de

and try_cexp uloc env ghost de0 = match de0.de_node with
  | DEvar _ | DErs _ | DEapp _ ->
      let app (ldl,c) el =
        let argl, res = de0.de_dvty in
        ext_c_app (ldl, c_ghostify ghost c) el
          (List.map ity_of_dity argl) (ity_of_dity res) in
      let rec down de el = match de.de_node with
        | DEapp (de1,de2) -> down de1 (expr uloc env de2 :: el)
        | DEvar (n,_) -> app (ext_c_sym (get_rs env n)) el
        | DErs s -> app (ext_c_sym s) el
        | _ -> app (cexp uloc env ghost de) el in
      down de0 []
  | DEfun (bl,dsp,de) ->
      let c, dsp, _ = lambda uloc env (binders bl) dsp de in
      check_fun None dsp c;
      [], c_ghostify ghost c
  | DEany (bl,dsp,dity) ->
      [], c_ghostify ghost (c_any (cty_of_spec env bl dsp dity))
  | DElet ((_,_,_,{de_dvty = ([],_)}) as dldf,de) ->
      let ld, env = var_defn uloc env ghost dldf in
      let ldl, c = cexp uloc env ghost de in
      ld::ldl, c
  | DElet (dldf,de) ->
      let ldl0, env = sym_defn uloc env ghost dldf in
      let ldl, c = cexp uloc env ghost de in
      ldl0 @ ldl, c
  | DErec (drdf,de) ->
      let ld, env = rec_defn uloc env ghost drdf in
      let ldl, c = cexp uloc env ghost de in
      ld::ldl, c
  | DEghost de -> cexp uloc env true de
  | DEmark _ ->
      Loc.errorm "Marks are not allowed over higher-order expressions"
  | DEpv _ | DEconst _ | DEnot _ | DEand _ | DEor _ | DEif _ | DEcase _
  | DEassign _ | DEwhile _ | DEfor _ | DEtry _ | DEraise _ | DEassert _
  | DEpure _ | DEabsurd | DEtrue | DEfalse -> assert false (* expr-only *)
  | DEcast _ | DEuloc _ | DElabel _ -> assert false (* already stripped *)

and try_expr uloc env ({de_dvty = argl,res} as de0) =
966 967
  match de0.de_node with
  | DEvar (n,_) when argl = [] ->
968
      e_var (get_pv env n)
Andrei Paskevich's avatar
Andrei Paskevich committed
969 970
  | DEpv v ->
      e_var v
971 972
  | DEconst c ->
      e_const c
973
  | DEapp ({de_dvty = ([],_)} as de1, de2) ->
974 975 976 977 978 979 980 981 982
      let e1 = expr uloc env de1 in
      let e2 = expr uloc env de2 in
      e_app rs_func_app [e1; e2] [] (ity_of_dity res)
  | DEvar _ | DErs _ | DEapp _ | DEfun _ | DEany _ ->
      let ldl,c = try_cexp uloc env false de0 in
      List.fold_right e_let_check ldl (e_exec c)
  | DElet ((id,_,_,{de_dvty = ([],_)}) as dldf,de) ->
      let ld, env = var_defn uloc env false dldf in
      let e2 = expr uloc env de in
Andrei Paskevich's avatar
Andrei Paskevich committed
983
      let e2 =
984 985 986 987 988
        let v, e1 = match ld with
          | LDvar (v,e1) -> v, e1
          | _ -> assert false in
        let e2_unit = ity_equal e2.e_ity ity_unit in
        let id_in_e2 = Spv.mem v e2.e_effect.eff_reads in
989
        if not id_in_e2 then warn_unused id.pre_name id.pre_loc;
Andrei Paskevich's avatar
Andrei Paskevich committed
990 991 992
        (* if e1 is a recursive call, we may not know yet its effects,
            so we have to rely on an heuristic: if the result of e1 is
            not used in e2, then it was probably called for the effect. *)
993
        let e1_no_eff = eff_pure e1.e_effect && id_in_e2 in
Andrei Paskevich's avatar
Andrei Paskevich committed
994
        if e2_unit (* e2 is unit *)
995 996
          && e_ghost e2 (* and e2 is ghost *)
          && not (e_ghost e1) (* and e1 is non-ghost *)
Andrei Paskevich's avatar
Andrei Paskevich committed
997 998
          && not e1_no_eff (* and e1 has observable effects *)
        then
999
          let ld,_ = let_var (id_fresh "_") e2 in
Andrei Paskevich's avatar
Andrei Paskevich committed
1000 1001 1002 1003
          e_label ?loc:e2.e_loc Slab.empty (e_let ld e_void)
        else e2
      in
      e_let ld e2
1004 1005 1006
  | DElet (dldf,de) ->
      let ldl, env = sym_defn uloc env false dldf in
      List.fold_right e_let_check ldl (expr uloc env de)
1007
  | DErec (drdf,de) ->
1008 1009 1010 1011 1012 1013 1014 1015
      let ld, env = rec_defn uloc env false drdf in
      e_let ld (expr uloc env de)
  | DEnot de ->
      e_not (expr uloc env de)
  | DEand (de1,de2) ->
      e_and (expr uloc env de1) (expr uloc env de2)
  | DEor (de1,de2) ->
      e_or (expr uloc env de1) (expr uloc env de2)
1016
  | DEif (de1,de2,de3) ->
1017
      e_if (expr uloc env de1) (expr uloc env de2) (expr uloc env de3)
1018
  | DEcase (de1,bl) ->
1019 1020 1021 1022 1023
      let e1 = expr uloc env de1 in
      let mk_branch (dp,de) =
        let vm, pat = create_prog_pattern
          dp.dp_pat ~ghost:(e_ghost e1) e1.e_ity in
        let e = expr uloc (add_pv_map env vm) de in
Andrei Paskevich's avatar
Andrei Paskevich committed
1024
        Mstr.iter (fun _ v -> check_used_pv e v) vm;
1025
        pat, e in
1026 1027 1028 1029 1030 1031 1032 1033 1034
      let bl = List.rev_map mk_branch bl in
      let pl = List.rev_map (fun (p,_) -> [p.pp_pat]) bl in
      let v = create_vsymbol (id_fresh "x") (ty_of_ity e1.e_ity) in
      let bl = if Pattern.is_exhaustive [t_var v] pl then bl else begin
        if List.length bl > 1 then Warning.emit ?loc:de0.de_loc
          "Non-exhaustive pattern matching, asserting `absurd'";
        let _,pp = create_prog_pattern PPwild e1.e_ity in
        (pp, e_absurd (ity_of_dity res)) :: bl end in
      e_case e1 (List.rev bl)
Andrei Paskevich's avatar
Andrei Paskevich committed
1035
  | DEassign al ->
1036
      let conv (de1,f,de2) = expr uloc env de1, f, expr uloc env de2 in
Andrei Paskevich's avatar
Andrei Paskevich committed
1037
      e_assign (List.map conv al)
1038
  | DEwhile</