typing.ml 56.8 KB
Newer Older
Andrei Paskevich's avatar
Andrei Paskevich committed
1 2 3
(********************************************************************)
(*                                                                  *)
(*  The Why3 Verification Platform   /   The Why3 Development Team  *)
Guillaume Melquiond's avatar
Guillaume Melquiond committed
4
(*  Copyright 2010-2018   --   Inria - CNRS - Paris-Sud University  *)
Andrei Paskevich's avatar
Andrei Paskevich committed
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
(*                                                                  *)
Andrei Paskevich's avatar
Andrei Paskevich committed
10
(********************************************************************)
11

12
open Wstdlib
13
open Ident
14
open Ptree
15
open Ty
16
open Term
Andrei Paskevich's avatar
Andrei Paskevich committed
17
open Decl
18
open Theory
19
open Dterm
Andrei Paskevich's avatar
Andrei Paskevich committed
20
open Ity
21
open Expr
22 23
open Pdecl
open Pmodule
Andrei Paskevich's avatar
Andrei Paskevich committed
24

25
(** debug flags *)
26

27
let debug_parse_only = Debug.register_flag "parse_only"
Andrei Paskevich's avatar
Andrei Paskevich committed
28
  ~desc:"Stop@ after@ parsing."
29

30
let debug_type_only  = Debug.register_flag "type_only"
Andrei Paskevich's avatar
Andrei Paskevich committed
31
  ~desc:"Stop@ after@ type-checking."
32

33 34 35
let debug_useless_at = Debug.register_flag "ignore_useless_at"
  ~desc:"Remove@ warning@ for@ useless@ at/old."

36
(** symbol lookup *)
37 38

let rec qloc = function
39 40 41
  | Qdot (p, id) -> Loc.join (qloc p) id.id_loc
  | Qident id    -> id.id_loc

42 43 44
let qloc_last = function
  | Qdot (_, id) | Qident id -> id.id_loc

45
let rec print_qualid fmt = function
46
  | Qdot (p, id) ->
47 48
      Format.fprintf fmt "%a.%a" print_qualid p Ident.print_decoded id.id_str
  | Qident id -> Ident.print_decoded fmt id.id_str
49

50 51
let string_list_of_qualid q =
  let rec sloq acc = function
52 53
    | Qdot (p, id) -> sloq (id.id_str :: acc) p
    | Qident id -> id.id_str :: acc in
54
  sloq [] q
55

56
exception UnboundSymbol of qualid
57

58
let find_qualid get_id find ns q =
59 60 61
  let sl = string_list_of_qualid q in
  let r = try find ns sl with Not_found ->
    Loc.error ~loc:(qloc q) (UnboundSymbol q) in
62
  if Debug.test_flag Glob.flag then Glob.use ~kind:"" (qloc_last q) (get_id r);
63
  r
64

65 66 67
let find_prop_ns     ns q = find_qualid (fun pr -> pr.pr_name) ns_find_pr ns q
let find_tysymbol_ns ns q = find_qualid (fun ts -> ts.ts_name) ns_find_ts ns q
let find_lsymbol_ns  ns q = find_qualid (fun ls -> ls.ls_name) ns_find_ls ns q
68

69 70
let find_fsymbol_ns ns q =
  let ls = find_lsymbol_ns ns q in
71 72
  if ls.ls_value <> None then ls else
    Loc.error ~loc:(qloc q) (FunctionSymbolExpected ls)
73

74 75
let find_psymbol_ns ns q =
  let ls = find_lsymbol_ns ns q in
76 77
  if ls.ls_value = None then ls else
    Loc.error ~loc:(qloc q) (PredicateSymbolExpected ls)
78

79 80 81 82
let find_tysymbol tuc q = find_tysymbol_ns (Theory.get_namespace tuc) q
let find_lsymbol  tuc q = find_lsymbol_ns  (Theory.get_namespace tuc) q
let find_fsymbol  tuc q = find_fsymbol_ns  (Theory.get_namespace tuc) q
let find_psymbol  tuc q = find_psymbol_ns  (Theory.get_namespace tuc) q
83 84 85 86
let find_prop     tuc q = find_prop_ns     (Theory.get_namespace tuc) q

let find_prop_of_kind k tuc q =
  let pr = find_prop tuc q in
Andrei Paskevich's avatar
Andrei Paskevich committed
87
  match (Mid.find pr.pr_name tuc.uc_known).d_node with
88
  | Dind _ when k = Paxiom -> pr
89 90 91
  | Dprop (l,_,_) when l = k -> pr
  | _ -> Loc.errorm ~loc:(qloc q) "proposition %a is not %s"
      print_qualid q (match k with
92
        | Plemma -> "a lemma" | Paxiom -> "an axiom" | Pgoal -> "a goal")
93

Andrei Paskevich's avatar
Andrei Paskevich committed
94 95 96
let find_itysymbol_ns ns q =
  find_qualid (fun s -> s.its_ts.ts_name) Pmodule.ns_find_its ns q

97 98 99
let find_xsymbol_ns ns q =
  find_qualid (fun s -> s.xs_name) Pmodule.ns_find_xs ns q

100 101 102
let find_prog_symbol_ns ns p =
  let get_id_ps = function
    | PV pv -> pv.pv_vs.vs_name
103 104 105 106
    | RS rs -> rs.rs_name
      (* FIXME: this is incorrect, but we cannot
        know the correct symbol at this stage *)
    | OO ss -> (Srs.choose ss).rs_name in
107 108
  find_qualid get_id_ps ns_find_prog_symbol ns p

109 110
(** Parsing types *)

111 112 113 114 115 116 117 118 119 120
let rec ty_of_pty ns = function
  | PTtyvar {id_str = x} ->
      ty_var (tv_of_string x)
  | PTtyapp (q, tyl) ->
      let ts = find_tysymbol_ns ns q in
      let tyl = List.map (ty_of_pty ns) tyl in
      Loc.try2 ~loc:(qloc q) ty_app ts tyl
  | PTtuple tyl ->
      let s = its_tuple (List.length tyl) in
      ty_app s.its_ts (List.map (ty_of_pty ns) tyl)
121 122
  | PTref tyl ->
      ty_app ts_ref (List.map (ty_of_pty ns) tyl)
123 124 125 126 127 128 129
  | PTarrow (ty1, ty2) ->
      ty_func (ty_of_pty ns ty1) (ty_of_pty ns ty2)
  | PTscope (q, ty) ->
      let ns = import_namespace ns (string_list_of_qualid q) in
      ty_of_pty ns ty
  | PTpure ty | PTparen ty ->
      ty_of_pty ns ty
130

131 132
let dty_of_pty ns pty =
  Dterm.dty_of_ty (ty_of_pty ns pty)
133

134 135
let dty_of_opt ns = function
  | Some pty -> dty_of_pty ns pty
136 137
  | None -> Dterm.dty_fresh ()

138
(** typing using destructive type variables
139

140 141 142 143 144 145
    parsed trees        intermediate trees       typed trees
      (Ptree)                (Dterm)               (Term)
   -----------------------------------------------------------
     ppure_type  ---dty--->   dty       ---ty--->    ty
      lexpr      --dterm-->   dterm     --term-->    term
*)
146

147 148
(** Typing patterns, terms, and formulas *)

Andrei Paskevich's avatar
Andrei Paskevich committed
149 150 151 152 153
let create_user_id {id_str = n; id_ats = attrs; id_loc = loc} =
  let get_attrs (attrs, loc) = function
    | ATstr attr -> Sattr.add attr attrs, loc | ATpos loc -> attrs, loc in
  let attrs, loc = List.fold_left get_attrs (Sattr.empty, loc) attrs in
  id_user ~attrs n loc
154

155 156 157
let parse_record ~loc ns km get_val fl =
  let fl = List.map (fun (q,e) -> find_lsymbol_ns ns q, e) fl in
  let cs,pjl,flm = Loc.try2 ~loc parse_record km fl in
158 159 160
  let get_val pj = get_val cs pj (Mls.find_opt pj flm) in
  cs, List.map get_val pjl

161
let rec dpattern ns km { pat_desc = desc; pat_loc = loc } =
162 163
  match desc with
    | Ptree.Pparen p -> dpattern ns km p
164 165 166
    | Ptree.Pscope (q,p) ->
        let ns = import_namespace ns (string_list_of_qualid q) in
        dpattern ns km p
167
    | _ -> (* creative indentation ahead *)
168
  Dterm.dpattern ~loc (match desc with
169 170
    | Ptree.Pparen _
    | Ptree.Pscope _ -> assert false (* never *)
171
    | Ptree.Pwild -> DPwild
172 173
    | Ptree.Pvar x -> DPvar (create_user_id x)
    | Ptree.Papp (q,pl) ->
174 175
        let pl = List.map (dpattern ns km) pl in
        DPapp (find_lsymbol_ns ns q, pl)
176
    | Ptree.Ptuple pl ->
177
        let pl = List.map (dpattern ns km) pl in
178
        DPapp (fs_tuple (List.length pl), pl)
179
    | Ptree.Prec fl ->
180
        let get_val _ _ = function
181
          | Some p -> dpattern ns km p
182
          | None -> Dterm.dpattern DPwild in
183
        let cs,fl = parse_record ~loc ns km get_val fl in
184
        DPapp (cs,fl)
185 186 187 188 189
    | Ptree.Pas (p,x,false) -> DPas (dpattern ns km p, create_user_id x)
    | Ptree.Por (p,q) -> DPor (dpattern ns km p, dpattern ns km q)
    | Ptree.Pcast (p,ty) -> DPcast (dpattern ns km p, dty_of_pty ns ty)
    | Ptree.Pghost _ | Ptree.Pas (_,_,true) ->
        Loc.errorm ~loc "ghost patterns are only allowed in programs")
190

191
let quant_var ns (loc, id, gh, ty) =
192
  if gh then Loc.errorm ~loc "ghost variables are only allowed in programs";
193
  Opt.map create_user_id id, dty_of_opt ns ty, Some loc
194

195 196 197 198 199 200
let loc_cutoff loc13 loc23 loc2 =
  let f,l,b,e = Loc.get loc13 in
  let _,_,_,w = Loc.get loc23 in
  let _,_,_,m = Loc.get loc2 in
  Loc.user_position f l b (e - (w - m))

201 202 203 204 205
let is_reusable dt = match dt.dt_node with
  | DTvar _ | DTgvar _ | DTconst _ | DTtrue | DTfalse -> true
  | DTapp (_,[]) -> true
  | _ -> false

206
let mk_var crcmap n dt =
207 208 209
  let dty = match dt.dt_dty with
    | None -> dty_of_ty ty_bool
    | Some dty -> dty in
210
  Dterm.dterm crcmap ?loc:dt.dt_loc (DTvar (n, dty))
211

212 213
let mk_let crcmap ~loc n dt node =
  DTlet (dt, id_user n loc, Dterm.dterm crcmap ~loc node)
214

215 216
let mk_closure crcmap loc ls =
  let mk dt = Dterm.dterm crcmap ~loc dt in
217
  let mk_v i _ =
218 219
    Some (id_user ("y" ^ string_of_int i) loc), dty_fresh (), None in
  let mk_t (id, dty, _) = mk (DTvar ((Opt.get id).pre_name, dty)) in
220
  let vl = Lists.mapi mk_v ls.ls_args in
Andrei Paskevich's avatar
Andrei Paskevich committed
221
  DTquant (DTlambda, vl, [], mk (DTapp (ls, List.map mk_t vl)))
222

223 224 225
(* track the use of labels *)
let at_uses = Hstr.create 5

226
let rec dterm ns km crcmap gvars at denv {term_desc = desc; term_loc = loc} =
227 228
  let func_app e el =
    List.fold_left (fun e1 (loc, e2) ->
229
      DTfapp (Dterm.dterm crcmap ~loc e1, e2)) e el
230
  in
231 232 233
  let rec apply_ls loc ls al l el = match l, el with
    | (_::l), (e::el) -> apply_ls loc ls (e::al) l el
    | [], _ -> func_app (DTapp (ls, List.rev_map snd al)) el
234
    | _, [] -> func_app (mk_closure crcmap loc ls) (List.rev_append al el)
235
  in
236
  let qualid_app q el = match gvars at q with
237 238 239 240 241 242 243 244 245
    | Some v ->
        begin match at with
        | Some l -> (* check for impact *)
            let u = Opt.get (gvars None q) in
            if not (pv_equal v u) then
              Hstr.replace at_uses l true
        | None -> ()
        end;
        func_app (DTgvar v.pv_vs) el
246
    | None ->
247
        let ls = find_lsymbol_ns ns q in
248
        apply_ls (qloc q) ls [] ls.ls_args el
249
  in
250
  let qualid_app q el = match q with
251
    | Qident {id_str = n} ->
252
        (match denv_get_opt denv n with
253 254 255 256
        | Some d -> func_app d el
        | None -> qualid_app q el)
    | _ -> qualid_app q el
  in
257
  let rec unfold_app e1 e2 el = match e1.term_desc with
258
    | Ptree.Tapply (e11,e12) ->
259
        let e12 = dterm ns km crcmap gvars at denv e12 in
260
        unfold_app e11 e12 ((e1.term_loc, e2)::el)
261
    | Ptree.Tident q ->
262
        qualid_app q ((e1.term_loc, e2)::el)
263
    | _ ->
264
        func_app (DTfapp (dterm ns km crcmap gvars at denv e1, e2)) el
265
  in
266
  Dterm.dterm crcmap ~loc (match desc with
267
  | Ptree.Tident q ->
268
      qualid_app q []
269
  | Ptree.Tidapp (q, tl) ->
270
      let tl = List.map (dterm ns km crcmap gvars at denv) tl in
271
      DTapp (find_lsymbol_ns ns q, tl)
272
  | Ptree.Tapply (e1, e2) ->
273
      unfold_app e1 (dterm ns km crcmap gvars at denv e2) []
274
  | Ptree.Ttuple tl ->
275
      let tl = List.map (dterm ns km crcmap gvars at denv) tl in
276
      DTapp (fs_tuple (List.length tl), tl)
277 278 279
  | Ptree.Tinfix (e1, op1, e23)
  | Ptree.Tinnfix (e1, op1, e23) ->
      let apply loc de1 op de2 =
280 281
        if op.id_str = Ident.op_neq then
          let op = { op with id_str = Ident.op_equ } in
282 283
          let ls = find_lsymbol_ns ns (Qident op) in
          DTnot (Dterm.dterm crcmap ~loc (DTapp (ls, [de1;de2])))
284
        else
285
          DTapp (find_lsymbol_ns ns (Qident op), [de1;de2]) in
286 287
      let rec chain loc de1 op1 = function
        | { term_desc = Ptree.Tinfix (e2, op2, e3); term_loc = loc23 } ->
288
            let de2 = dterm ns km crcmap gvars at denv e2 in
289
            let loc12 = loc_cutoff loc loc23 e2.term_loc in
290 291
            let de12 = Dterm.dterm crcmap ~loc:loc12 (apply loc12 de1 op1 de2) in
            let de23 = Dterm.dterm crcmap ~loc:loc23 (chain loc23 de2 op2 e3) in
292
            DTbinop (DTand, de12, de23)
293
        | e23 ->
294 295
            apply loc de1 op1 (dterm ns km crcmap gvars at denv e23) in
      chain loc (dterm ns km crcmap gvars at denv e1) op1 e23
Clément Fumex's avatar
Clément Fumex committed
296
  | Ptree.Tconst (Number.ConstInt _ as c) ->
297
      DTconst (c, dty_int)
Clément Fumex's avatar
Clément Fumex committed
298
  | Ptree.Tconst (Number.ConstReal _ as c) ->
299
      DTconst (c, dty_real)
300
  | Ptree.Tlet (x, e1, e2) ->
301
      let id = create_user_id x in
302
      let e1 = dterm ns km crcmap gvars at denv e1 in
303
      let denv = denv_add_let denv e1 id in
304
      let e2 = dterm ns km crcmap gvars at denv e2 in
305
      DTlet (e1, id, e2)
306
  | Ptree.Tcase (e1, bl) ->
307
      let e1 = dterm ns km crcmap gvars at denv e1 in
308
      let branch (p, e) =
309
        let p = dpattern ns km p in
310
        let denv = denv_add_term_pat denv p e1 in
311
        p, dterm ns km crcmap gvars at denv e in
312
      DTcase (e1, List.map branch bl)
313
  | Ptree.Tif (e1, e2, e3) ->
314 315 316
      let e1 = dterm ns km crcmap gvars at denv e1 in
      let e2 = dterm ns km crcmap gvars at denv e2 in
      let e3 = dterm ns km crcmap gvars at denv e3 in
317
      DTif (e1, e2, e3)
318
  | Ptree.Ttrue ->
319
      DTtrue
320
  | Ptree.Tfalse ->
321
      DTfalse
Andrei Paskevich's avatar
Andrei Paskevich committed
322
  | Ptree.Tnot e1 ->
323
      DTnot (dterm ns km crcmap gvars at denv e1)
Andrei Paskevich's avatar
Andrei Paskevich committed
324 325 326 327
  | Ptree.Tbinop (e1, Dterm.DTiff, e23)
  | Ptree.Tbinnop (e1, Dterm.DTiff, e23) ->
      let rec chain loc de1 = function
        | { term_desc = Ptree.Tbinop (e2, DTiff, e3); term_loc = loc23 } ->
328
            let de2 = dterm ns km crcmap gvars at denv e2 in
Andrei Paskevich's avatar
Andrei Paskevich committed
329
            let loc12 = loc_cutoff loc loc23 e2.term_loc in
330 331
            let de12 = Dterm.dterm crcmap ~loc:loc12 (DTbinop (DTiff, de1, de2)) in
            let de23 = Dterm.dterm crcmap ~loc:loc23 (chain loc23 de2 e3) in
Andrei Paskevich's avatar
Andrei Paskevich committed
332 333 334 335 336
            DTbinop (DTand, de12, de23)
        | { term_desc = Ptree.Tbinop (_, DTimplies, _); term_loc = loc23 } ->
            Loc.errorm ~loc:loc23 "An unparenthesized implication cannot be \
              placed at the right hand side of an equivalence"
        | e23 ->
337 338
            DTbinop (DTiff, de1, (dterm ns km crcmap gvars at denv e23)) in
      chain loc (dterm ns km crcmap gvars at denv e1) e23
Andrei Paskevich's avatar
Andrei Paskevich committed
339 340
  | Ptree.Tbinop (e1, op, e2)
  | Ptree.Tbinnop (e1, op, e2) ->
341 342
      let e1 = dterm ns km crcmap gvars at denv e1 in
      let e2 = dterm ns km crcmap gvars at denv e2 in
343
      DTbinop (op, e1, e2)
344
  | Ptree.Tquant (q, uqu, trl, e1) ->
345
      let qvl = List.map (quant_var ns) uqu in
346
      let denv = denv_add_quant denv qvl in
347
      let dterm e = dterm ns km crcmap gvars at denv e in
348 349
      let trl = List.map (List.map dterm) trl in
      let e1 = dterm e1 in
Andrei Paskevich's avatar
Andrei Paskevich committed
350
      DTquant (q, qvl, trl, e1)
351
  | Ptree.Trecord fl ->
352
      let get_val _cs pj = function
353
        | Some e -> dterm ns km crcmap gvars at denv e
354
        | None -> Loc.error ~loc (RecordFieldMissing pj) in
355
      let cs, fl = parse_record ~loc ns km get_val fl in
356
      DTapp (cs, fl)
357
  | Ptree.Tupdate (e1, fl) ->
358
      let e1 = dterm ns km crcmap gvars at denv e1 in
359
      let re = is_reusable e1 in
360
      let v = if re then e1 else mk_var crcmap "q " e1 in
361
      let get_val _ pj = function
362 363
        | Some e -> dterm ns km crcmap gvars at denv e
        | None -> Dterm.dterm crcmap ~loc (DTapp (pj,[v])) in
364
      let cs, fl = parse_record ~loc ns km get_val fl in
365
      let d = DTapp (cs, fl) in
366
      if re then d else mk_let crcmap ~loc "q " e1 d
367
  | Ptree.Tat (e1, ({id_str = l; id_loc = loc} as id)) ->
368
      Hstr.add at_uses l false;
369 370 371
      let id = { id with id_str = "" } in
      (* check if the label has actually been defined *)
      ignore (Loc.try2 ~loc gvars (Some l) (Qident id));
372
      let e1 = dterm ns km crcmap gvars (Some l) denv e1 in
373 374
      if not (Hstr.find at_uses l) && Debug.test_noflag debug_useless_at then
        Warning.emit ~loc "this `at'/`old' operator is never used";
375
      Hstr.remove at_uses l;
Andrei Paskevich's avatar
Andrei Paskevich committed
376
      DTattr (e1, Sattr.empty)
Andrei Paskevich's avatar
M.()  
Andrei Paskevich committed
377
  | Ptree.Tscope (q, e1) ->
378
      let ns = import_namespace ns (string_list_of_qualid q) in
Andrei Paskevich's avatar
Andrei Paskevich committed
379 380
      DTattr (dterm ns km crcmap gvars at denv e1, Sattr.empty)
  | Ptree.Tattr (ATpos uloc, e1) ->
381
      DTuloc (dterm ns km crcmap gvars at denv e1, uloc)
Andrei Paskevich's avatar
Andrei Paskevich committed
382 383
  | Ptree.Tattr (ATstr attr, e1) ->
      DTattr (dterm ns km crcmap gvars at denv e1, Sattr.singleton attr)
384
  | Ptree.Tcast ({term_desc = Ptree.Tconst c}, pty) ->
385
      DTconst (c, dty_of_pty ns pty)
386
  | Ptree.Tcast (e1, pty) ->
387 388
      let d1 = dterm ns km crcmap gvars at denv e1 in
      DTcast (d1, dty_of_pty ns pty))
Andrei Paskevich's avatar
Andrei Paskevich committed
389

390

391 392 393 394
let no_gvars at q = match at with
  | Some _ -> Loc.errorm ~loc:(qloc q)
      "`at' and `old' can only be used in program annotations"
  | None -> None
395

396 397
let type_term_in_namespace ns km crcmap t =
  let t = dterm ns km crcmap no_gvars None Dterm.denv_empty t in
398 399
  Dterm.term ~strict:true ~keep_loc:true t

400 401
let type_fmla_in_namespace ns km crcmap f =
  let f = dterm ns km crcmap no_gvars None Dterm.denv_empty f in
402
  Dterm.fmla ~strict:true ~keep_loc:true f
Andrei Paskevich's avatar
Andrei Paskevich committed
403

404

405
(** typing program expressions *)
Andrei Paskevich's avatar
Andrei Paskevich committed
406

407 408
open Dexpr

409
let ty_of_pty tuc = ty_of_pty (get_namespace tuc)
410

411
let get_namespace muc = List.hd muc.Pmodule.muc_import
412

413

414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433
let dterm muc =
  let uc = muc.muc_theory in
  dterm (Theory.get_namespace uc) uc.uc_known uc.uc_crcmap

let find_xsymbol     muc q = find_xsymbol_ns     (get_namespace muc) q
let find_itysymbol   muc q = find_itysymbol_ns   (get_namespace muc) q
let find_prog_symbol muc q = find_prog_symbol_ns (get_namespace muc) q

let find_special muc test nm q =
  match find_prog_symbol muc q with
  | RS s when test s -> s
  | OO ss ->
      begin match Srs.elements (Srs.filter test ss) with
      | [s] -> s
      | _::_ -> Loc.errorm ~loc:(qloc q)
                          "Ambiguous %s notation: %a" nm print_qualid q
      | [] -> Loc.errorm ~loc:(qloc q) "Not a %s: %a" nm print_qualid q
      end
  | _ ->      Loc.errorm ~loc:(qloc q) "Not a %s: %a" nm print_qualid q

434 435 436 437 438 439 440 441 442
let rec ity_of_pty muc = function
  | PTtyvar {id_str = x} ->
      ity_var (tv_of_string x)
  | PTtyapp (q, tyl) ->
      let s = find_itysymbol muc q in
      let tyl = List.map (ity_of_pty muc) tyl in
      Loc.try3 ~loc:(qloc q) ity_app s tyl []
  | PTtuple tyl ->
      ity_tuple (List.map (ity_of_pty muc) tyl)
443 444
  | PTref tyl ->
      ity_app its_ref (List.map (ity_of_pty muc) tyl) []
445 446 447 448 449 450 451 452 453 454
  | PTarrow (ty1, ty2) ->
      ity_func (ity_of_pty muc ty1) (ity_of_pty muc ty2)
  | PTpure ty ->
      ity_purify (ity_of_pty muc ty)
  | PTscope (q, ty) ->
      let muc = open_scope muc "dummy" in
      let muc = import_scope muc (string_list_of_qualid q) in
      ity_of_pty muc ty
  | PTparen ty ->
      ity_of_pty muc ty
455 456 457 458 459 460 461 462

let dity_of_pty muc pty =
  Dexpr.dity_of_ity (ity_of_pty muc pty)

let dity_of_opt muc = function
  | Some pty -> dity_of_pty muc pty
  | None -> Dexpr.dity_fresh ()

463 464 465
(* records *)

let find_record_field muc q =
466 467
  let test rs = rs.rs_field <> None in
  find_special muc test "record field" q
468 469 470 471 472 473 474 475 476 477 478 479

let find_record_field2 muc (q,e) = find_record_field muc q, e

let parse_record muc fll =
  (* we assume that every rsymbol in fll was resolved
     using find_record_field, so they are all fields *)
  let ls_of_rs rs = match rs.rs_logic with
    | RLls ls -> ls | _ -> assert false in
  let rs = match fll with
    | (rs, _)::_ -> rs
    | [] -> raise EmptyRecord in
  let its = match rs.rs_cty.cty_args with
480
    | [{pv_ity = {ity_node = (Ityreg {reg_its = s} | Ityapp (s,_,_))}}] -> s
481 482 483 484 485 486 487 488 489 490
    | _ -> raise (BadRecordField (ls_of_rs rs)) in
  let itd = find_its_defn muc.muc_known its in
  let check v s = match s.rs_field with
    | Some u -> pv_equal v u
    | _ -> false in
  let cs = match itd.itd_constructors with
    | [cs] when Lists.equal check cs.rs_cty.cty_args itd.itd_fields -> cs
    | _ -> raise (BadRecordField (ls_of_rs rs)) in
  let pjs = Srs.of_list itd.itd_fields in
  let flm = List.fold_left (fun m (pj,v) -> if Srs.mem pj pjs then
491
    Mrs.add_new (DuplicateRecordField (ls_of_rs pj)) pj v m
492 493 494 495 496 497 498 499 500 501 502
    else raise (BadRecordField (ls_of_rs pj))) Mrs.empty fll in
  cs, itd.itd_fields, flm

let parse_record ~loc muc get_val fl =
  let fl = List.map (find_record_field2 muc) fl in
  let cs,pjl,flm = Loc.try2 ~loc parse_record muc fl in
  let get_val pj = get_val cs pj (Mrs.find_opt pj flm) in
  cs, List.map get_val pjl

(* patterns *)

503 504 505 506 507 508
let find_constructor muc q =
  let test rs = match rs.rs_logic with
    | RLls {ls_constr = c} -> c > 0
    | _ -> false in
  find_special muc test "constructor" q

509 510 511 512
let rec dpattern muc gh { pat_desc = desc; pat_loc = loc } =
  match desc with
    | Ptree.Pparen p -> dpattern muc gh p
    | Ptree.Pghost p -> dpattern muc true p
513 514 515 516
    | Ptree.Pscope (q,p) ->
        let muc = open_scope muc "dummy" in
        let muc = import_scope muc (string_list_of_qualid q) in
        dpattern muc gh p
517
    | _ -> (* creative indentation ahead *)
518
  Dexpr.dpattern ~loc (match desc with
519 520
    | Ptree.Pparen _ | Ptree.Pscope _
    | Ptree.Pghost _ -> assert false (* never *)
521
    | Ptree.Pwild -> DPwild
522 523 524
    | Ptree.Pvar x -> DPvar (create_user_id x, gh)
    | Ptree.Papp (q,pl) ->
        DPapp (find_constructor muc q, List.map (dpattern muc gh) pl)
525 526
    | Ptree.Prec fl ->
        let get_val _ _ = function
527
          | Some p -> dpattern muc gh p
528 529 530 531
          | None -> Dexpr.dpattern DPwild in
        let cs,fl = parse_record ~loc muc get_val fl in
        DPapp (cs,fl)
    | Ptree.Ptuple pl ->
532 533 534 535
        DPapp (rs_tuple (List.length pl), List.map (dpattern muc gh) pl)
    | Ptree.Pcast (p,pty) -> DPcast (dpattern muc gh p, dity_of_pty muc pty)
    | Ptree.Pas (p,x,g) -> DPas (dpattern muc gh p, create_user_id x, gh || g)
    | Ptree.Por (p,q) -> DPor (dpattern muc gh p, dpattern muc gh q))
536

537
let dpattern muc pat = dpattern muc false pat
538

539 540 541 542 543 544 545 546 547 548
(* specifications *)

let find_global_pv muc q = try match find_prog_symbol muc q with
  | PV v -> Some v | _ -> None with _ -> None

let find_local_pv muc lvm q = match q with
  | Qdot _ -> find_global_pv muc q
  | Qident id -> let ovs = Mstr.find_opt id.id_str lvm in
      if ovs = None then find_global_pv muc q else ovs

549 550
let mk_gvars muc lvm old = fun at q ->
  match find_local_pv muc lvm q, at with
551 552 553 554 555 556 557 558 559
  | Some v, Some l -> Some (old l v)
  | None, Some l ->
      begin match q with
      (* normally, we have no reason to call "old" without
         a pvsymbol, but we make an exception for an empty
         ident to check if the label is valid at Tat *)
      | Qident {id_str = ""} -> Opt.map (old l) None
      | _ -> None end
  | v, None -> v
560 561 562

let type_term muc lvm old t =
  let gvars = mk_gvars muc lvm old in
563
  let t = dterm muc gvars None Dterm.denv_empty t in
564
  Dterm.term ~strict:true ~keep_loc:true t
Andrei Paskevich's avatar
Andrei Paskevich committed
565

566 567
let type_fmla muc lvm old f =
  let gvars = mk_gvars muc lvm old in
568
  let f = dterm muc gvars None Dterm.denv_empty f in
569
  Dterm.fmla ~strict:true ~keep_loc:true f
Andrei Paskevich's avatar
Andrei Paskevich committed
570

571 572
let dpre muc pl lvm old =
  let dpre f = type_fmla muc lvm old f in
573 574
  List.map dpre pl

575
let dpost muc ql lvm old ity =
576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603
  let mk_case loc pfl =
    let v = create_pvsymbol (id_fresh "result") ity in
    let i = { id_str = "(null)"; id_loc = loc; id_ats = [] } in
    let t = { term_desc = Tident (Qident i); term_loc = loc } in
    let f = { term_desc = Ptree.Tcase (t, pfl); term_loc = loc } in
    let lvm = Mstr.add "(null)" v lvm in
    v, Loc.try3 ~loc type_fmla muc lvm old f in
  let dpost (loc,pfl) = match pfl with
    | [pat, f] ->
        let rec unfold p = match p.pat_desc with
          | Ptree.Pparen p | Ptree.Pscope (_,p) -> unfold p
          | Ptree.Pcast (p,pty) ->
              let ty = ty_of_ity (ity_of_pty muc pty) in
              Loc.try2 ~loc:p.pat_loc ty_equal_check (ty_of_ity ity) ty;
              unfold p
          | Ptree.Ptuple [] ->
              Loc.try2 ~loc:p.pat_loc ity_equal_check ity ity_unit;
              unfold { p with pat_desc = Ptree.Pwild }
          | Ptree.Pwild ->
              let v = create_pvsymbol (id_fresh "result") ity in
              v, Loc.try3 ~loc type_fmla muc lvm old f
          | Ptree.Pvar id ->
              let v = create_pvsymbol (create_user_id id) ity in
              let lvm = Mstr.add id.id_str v lvm in
              v, Loc.try3 ~loc type_fmla muc lvm old f
          | _ -> mk_case loc pfl in
        unfold pat
    | _ -> mk_case loc pfl in
604 605
  List.map dpost ql

606
let dxpost muc ql lvm xsm old =
Andrei Paskevich's avatar
Andrei Paskevich committed
607
  let add_exn (q,pf) m =
608 609 610 611 612
    let xs = match q with
      | Qident i ->
          begin try Mstr.find i.id_str xsm with
          | Not_found -> find_xsymbol muc q end
      | _ -> find_xsymbol muc q in
613
    Mxs.change (fun l -> match pf, l with
Andrei Paskevich's avatar
Andrei Paskevich committed
614 615 616 617
      | Some pf, Some l -> Some (pf :: l)
      | Some pf, None   -> Some (pf :: [])
      | None,    None   -> Some []
      | None,    Some _ -> l) xs m in
618
  let mk_xpost loc xs pfl =
Andrei Paskevich's avatar
Andrei Paskevich committed
619
    if pfl = [] then [] else
620
    dpost muc [loc,pfl] lvm old xs.xs_ity in
621
  let exn_map (loc,xpfl) =
622 623
    let m = List.fold_right add_exn xpfl Mxs.empty in
    Mxs.mapi (fun xs pfl -> mk_xpost loc xs pfl) m in
624
  let add_map ql m =
625 626
    Mxs.union (fun _ l r -> Some (l @ r)) (exn_map ql) m in
  List.fold_right add_map ql Mxs.empty
627 628 629 630 631 632 633

let dreads muc rl lvm =
  let dreads q = match find_local_pv muc lvm q with Some v -> v
    | None -> Loc.errorm ~loc:(qloc q) "Not a variable: %a" print_qualid q in
  List.map dreads rl

let dwrites muc wl lvm =
634 635 636
  let old _ _ = Loc.errorm
    "`at' and `old' cannot be used in the `writes' clause" in
  let dwrites t = type_term muc lvm old t in
637 638 639 640 641 642
  List.map dwrites wl

let find_variant_ls muc q = match find_lsymbol muc.muc_theory q with
  | { ls_args = [u;v]; ls_value = None } as ls when ty_equal u v -> ls
  | s -> Loc.errorm ~loc:(qloc q) "Not an order relation: %a" Pretty.print_ls s

643
let dvariant muc varl lvm _xsm old =
644
  let dvar t = type_term muc lvm old t in
645 646 647
  let dvar (t,q) = dvar t, Opt.map (find_variant_ls muc) q in
  List.map dvar varl

648
let dspec muc sp lvm xsm old ity = {
649 650
  ds_pre     = dpre muc sp.sp_pre lvm old;
  ds_post    = dpost muc sp.sp_post lvm old ity;
651
  ds_xpost   = dxpost muc sp.sp_xpost lvm xsm old;
652 653 654
  ds_reads   = dreads muc sp.sp_reads lvm;
  ds_writes  = dwrites muc sp.sp_writes lvm;
  ds_checkrw = sp.sp_checkrw;
655 656
  ds_diverge = sp.sp_diverge;
  ds_partial = sp.sp_partial; }
657

Andrei Paskevich's avatar
Andrei Paskevich committed
658 659 660 661 662
let dspec_no_variant muc sp = match sp.sp_variant with
  | ({term_loc = loc},_)::_ ->
      Loc.errorm ~loc "unexpected 'variant' clause"
  | _ -> dspec muc sp

663
let dassert muc f lvm _xsm old = type_fmla muc lvm old f
664

665
let dinvariant muc f lvm _xsm old = dpre muc f lvm old
666 667 668

(* abstract values *)

669 670
let dparam muc (_,id,gh,pty) =
  Opt.map create_user_id id, gh, dity_of_pty muc pty
671

672 673
let dbinder muc (_,id,gh,opt) =
  Opt.map create_user_id id, gh, dity_of_opt muc opt
674 675 676 677

(* expressions *)

let is_reusable de = match de.de_node with
678
  | DEvar _ | DEsym _ -> true | _ -> false
679 680 681 682 683 684 685 686

let mk_var n de =
  Dexpr.dexpr ?loc:de.de_loc (DEvar (n, de.de_dvty))

let mk_let ~loc n de node =
  let de1 = Dexpr.dexpr ~loc node in
  DElet ((id_user n loc, false, RKnone, de), de1)

687
let update_any kind e = match e.expr_desc with
688 689
  | Ptree.Eany (pl, _, pty, msk, sp) ->
      { e with expr_desc = Ptree.Eany (pl, kind, pty, msk, sp) }
690 691 692 693 694 695
  | _ -> e

let local_kind = function
  | RKfunc | RKpred -> RKlocal
  | k -> k

696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722
let rec eff_dterm muc denv {term_desc = desc; term_loc = loc} =
  let expr_app loc e el =
    List.fold_left (fun e1 e2 ->
      DEapp (Dexpr.dexpr ~loc e1, e2)) e el
  in
  let qualid_app loc q el =
    let e = try DEsym (find_prog_symbol muc q) with
      | _ -> DEls_pure (find_lsymbol muc.muc_theory q, false) in
    expr_app loc e el
  in
  let qualid_app loc q el = match q with
    | Qident {id_str = n} ->
        (match denv_get_opt denv n with
        | Some d -> expr_app loc d el
        | None -> qualid_app loc q el)
    | _ -> qualid_app loc q el
  in
  Dexpr.dexpr ~loc (match desc with
  | Ptree.Tident q ->
      qualid_app loc q []
  | Ptree.Tidapp (q, [e1]) ->
      qualid_app loc q [eff_dterm muc denv e1]
  | Ptree.Tapply (e1, e2) ->
      DEapp (eff_dterm muc denv e1, eff_dterm muc denv e2)
  | Ptree.Tscope (q, e1) ->
      let muc = open_scope muc "dummy" in
      let muc = import_scope muc (string_list_of_qualid q) in
Andrei Paskevich's avatar
Andrei Paskevich committed
723 724
      DEattr (eff_dterm muc denv e1, Sattr.empty)
  | Ptree.Tattr (ATpos uloc, e1) ->
725
      DEuloc (eff_dterm muc denv e1, uloc)
Andrei Paskevich's avatar
Andrei Paskevich committed
726 727
  | Ptree.Tattr (ATstr attr, e1) ->
      DEattr (eff_dterm muc denv e1, Sattr.singleton attr)
728 729 730 731 732
  | Ptree.Tcast (e1, pty) ->
      let d1 = eff_dterm muc denv e1 in
      DEcast (d1, dity_of_pty muc pty)
  | Ptree.Tat _ -> Loc.errorm ~loc "`at' and `old' cannot be used here"
  | Ptree.Tidapp _ | Ptree.Tconst _ | Ptree.Tinfix _ | Ptree.Tinnfix _
733
  | Ptree.Ttuple _ | Ptree.Tlet _ | Ptree.Tcase _ | Ptree.Tif _
734 735 736 737
  | Ptree.Ttrue | Ptree.Tfalse | Ptree.Tnot _ | Ptree.Tbinop _ | Ptree.Tbinnop _
  | Ptree.Tquant _ | Ptree.Trecord _ | Ptree.Tupdate _ ->
      Loc.errorm ~loc "unsupported effect expression")

738 739 740 741 742
let rec dexpr muc denv {expr_desc = desc; expr_loc = loc} =
  let expr_app loc e el =
    List.fold_left (fun e1 e2 ->
      DEapp (Dexpr.dexpr ~loc e1, e2)) e el
  in
743
  let qualid_app loc q el =
744
    let e = try DEsym (find_prog_symbol muc q) with
745
      | _ -> DEls_pure (find_lsymbol muc.muc_theory q, false) in
746
    expr_app loc e el
747 748 749 750 751 752 753 754
  in
  let qualid_app loc q el = match q with
    | Qident {id_str = n} ->
        (match denv_get_opt denv n with
        | Some d -> expr_app loc d el
        | None -> qualid_app loc q el)
    | _ -> qualid_app loc q el
  in
755 756
  let qualid_app_pure loc q el =
    let e = match find_global_pv muc q with
757
      | Some v -> DEpv_pure v
758
      | None -> DEls_pure (find_lsymbol muc.muc_theory q, true) in
759 760 761 762 763 764 765 766 767
    expr_app loc e el
  in
  let qualid_app_pure loc q el = match q with
    | Qident {id_str = n} ->
        (match denv_get_pure_opt denv n with
        | Some d -> expr_app loc d el
        | None -> qualid_app_pure loc q el)
    | _ -> qualid_app_pure loc q el
  in
768 769 770 771 772 773
  let find_dxsymbol q = match q with
    | Qident {id_str = n} ->
        (try denv_get_exn denv n with _
        -> DEgexn (find_xsymbol muc q))
    | _ -> DEgexn (find_xsymbol muc q)
  in
774
  Dexpr.dexpr ~loc begin match desc with
775 776
  | Ptree.Eident q ->
      qualid_app loc q []
777 778
  | Ptree.Eidpur q ->
      qualid_app_pure loc q []
779 780 781 782 783
  | Ptree.Eidapp (q, el) ->
      qualid_app loc q (List.map (dexpr muc denv) el)
  | Ptree.Eapply (e1, e2) ->
      DEapp (dexpr muc denv e1, dexpr muc denv e2)
  | Ptree.Etuple el ->
784
      let e = DEsym (RS (rs_tuple (List.length el))) in
785
      expr_app loc e (List.map (dexpr muc denv) el)
786 787 788
  | Ptree.Einfix (e1, op1, e23)
  | Ptree.Einnfix (e1, op1, e23) ->
      let apply loc de1 op de2 =
789 790
        if op.id_str = Ident.op_neq then
          let oq = Qident { op with id_str = Ident.op_equ } in
Andrei Paskevich's avatar