mlw_typing.ml 79.6 KB
Newer Older
Andrei Paskevich's avatar
Andrei Paskevich committed
1 2 3 4 5 6 7 8 9 10
(********************************************************************)
(*                                                                  *)
(*  The Why3 Verification Platform   /   The Why3 Development Team  *)
(*  Copyright 2010-2012   --   INRIA - CNRS - Paris-Sud University  *)
(*                                                                  *)
(*  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.                           *)
(*                                                                  *)
(********************************************************************)
11

12
open Stdlib
13
open Ident
14 15 16
open Ty
open Term
open Decl
17 18 19
open Theory
open Env
open Ptree
20
open Mlw_dtree
21
open Mlw_ty
22
open Mlw_ty.T
23 24
open Mlw_expr
open Mlw_decl
25
open Mlw_pretty
26
open Mlw_module
Andrei Paskevich's avatar
Andrei Paskevich committed
27
open Mlw_wp
28
open Mlw_dty
29

30 31
(** errors *)

32
exception DuplicateProgVar of string
33 34 35 36 37 38 39 40 41 42 43
exception DuplicateTypeVar of string
(*
exception PredicateExpected
exception TermExpected
exception FSymExpected of lsymbol
exception PSymExpected of lsymbol
exception ClashTheory of string
exception UnboundTheory of qualid
exception UnboundType of string list
*)
exception UnboundTypeVar of string
44
(* unused
45
exception UnboundSymbol of qualid
46
*)
47 48 49 50

let error = Loc.error
let errorm = Loc.errorm

51 52
let qloc = Typing.qloc
let print_qualid = Typing.print_qualid
53 54 55

let () = Exn_printer.register (fun fmt e -> match e with
  | DuplicateTypeVar s ->
56 57 58
      Format.fprintf fmt "Type parameter %s is used twice" s
  | DuplicateProgVar s ->
      Format.fprintf fmt "Parameter %s is used twice" s
59 60 61
  | TooLateInvariant ->
      Format.fprintf fmt
        "Cannot add a type invariant after another program declaration"
62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79
(*
  | PredicateExpected ->
      Format.fprintf fmt "syntax error: predicate expected"
  | TermExpected ->
      Format.fprintf fmt "syntax error: term expected"
  | FSymExpected ls ->
      Format.fprintf fmt "%a is not a function symbol" Pretty.print_ls ls
  | PSymExpected ls ->
      Format.fprintf fmt "%a is not a predicate symbol" Pretty.print_ls ls
  | ClashTheory s ->
      Format.fprintf fmt "Clash with previous theory %s" s
  | UnboundTheory q ->
      Format.fprintf fmt "unbound theory %a" print_qualid q
  | UnboundType sl ->
      Format.fprintf fmt "Unbound type '%a'"
        (Pp.print_list Pp.dot Pp.pp_print_string) sl
*)
  | UnboundTypeVar s ->
80
      Format.fprintf fmt "Unbound type variable '%s" s
81
(* unused
82 83
  | UnboundSymbol q ->
      Format.fprintf fmt "Unbound symbol '%a'" print_qualid q
84
*)
85 86 87
  | _ -> raise e)

(* TODO: let type_only = Debug.test_flag Typing.debug_type_only in *)
88 89
let implicit_post = Debug.register_flag "implicit_post"
  ~desc:"Generate@ a@ postcondition@ for@ pure@ functions@ without@ one."
90

91 92
type denv = {
  uc     : module_uc;
93
  locals : (tvars option * dvty) Mstr.t;
94
  tvars  : tvars;
Andrei Paskevich's avatar
Andrei Paskevich committed
95
  uloc   : Ptree.loc option;
96
}
97

98 99 100 101
let create_denv uc = {
  uc     = uc;
  locals = Mstr.empty;
  tvars  = empty_tvars;
Andrei Paskevich's avatar
Andrei Paskevich committed
102
  uloc   = None;
103
}
104

105 106
(* Handle tuple symbols *)

107 108 109
let ht_tuple   = Hint.create 3
let ts_tuple n = Hint.replace ht_tuple n (); ts_tuple n
let fs_tuple n = Hint.replace ht_tuple n (); fs_tuple n
110

111
let check_at f0 =
Andrei Paskevich's avatar
Andrei Paskevich committed
112 113 114 115 116 117 118 119 120 121 122 123
  let rec check f = match f.t_node with
    | Term.Tapp (ls, _) when ls_equal ls fs_at ->
        let d = Mvs.set_diff f.t_vars f0.t_vars in
        if not (Mvs.is_empty d) then errorm ?loc:f.t_loc
          "locally bound variable %a under `at'"
          Pretty.print_vs (fst (Mvs.choose d))
        else true
    | _ ->
        t_all check f
  in
  ignore (check f0)

124 125
let count_term_tuples t =
  let syms_ts _ ts = match is_ts_tuple_id ts.ts_name with
126
    | Some n -> Hint.replace ht_tuple n () | _ -> () in
127 128 129
  let syms_ty _ ty = ty_s_fold syms_ts () ty in
  t_s_fold syms_ty (fun _ _ -> ()) () t

130
let flush_tuples uc =
131 132
  let kn = Theory.get_known (get_theory uc) in
  let add_tuple n _ uc =
Andrei Paskevich's avatar
Andrei Paskevich committed
133
    if Mid.mem (Ty.ts_tuple n).ts_name kn then uc
134
    else use_export_theory uc (tuple_theory n) in
135 136
  let uc = Hint.fold add_tuple ht_tuple uc in
  Hint.clear ht_tuple;
137 138
  uc

139
let add_pdecl_with_tuples ~wp uc pd = add_pdecl ~wp (flush_tuples uc) pd
140
let add_decl_with_tuples uc d = add_decl (flush_tuples uc) d
141

142 143 144
(** Namespace lookup *)

let uc_find_ls uc p =
145 146
  let ns = Theory.get_namespace (get_theory uc) in
  Typing.find_ns (fun ls -> ls.ls_name) Theory.ns_find_ls p ns
147

148
let get_id_ts = function
149
  | PT pt -> pt.its_ts.ts_name
150
  | TS ts -> ts.ts_name
Andrei Paskevich's avatar
Andrei Paskevich committed
151

152
let uc_find_ts uc p =
153
  Typing.find_ns get_id_ts ns_find_type_symbol p (get_namespace uc)
154 155 156 157 158 159 160

let get_id_ps = function
  | PV pv -> pv.pv_vs.vs_name
  | PS ps -> ps.ps_name
  | PL pl -> pl.pl_ls.ls_name
  | XS xs -> xs.xs_name
  | LS ls -> ls.ls_name
Andrei Paskevich's avatar
Andrei Paskevich committed
161

162
let uc_find_ps uc p =
163
  Typing.find_ns get_id_ps ns_find_prog_symbol p (get_namespace uc)
164

165 166
(** Typing type expressions *)

167
let rec dity_of_pty denv = function
168 169
  | Ptree.PPTtyvar id ->
      create_user_type_variable id
170
  | Ptree.PPTtyapp (p, pl) ->
171
      let dl = List.map (dity_of_pty denv) pl in
172
      begin match uc_find_ts denv.uc p with
173
        | PT ts -> its_app ts dl
174
        | TS ts -> ts_app ts dl
175 176
      end
  | Ptree.PPTtuple pl ->
177
      let dl = List.map (dity_of_pty denv) pl in
178
      ts_app (ts_tuple (List.length pl)) dl
179 180 181

(** Typing program expressions *)

Andrei Paskevich's avatar
Andrei Paskevich committed
182
let dity_int  = ts_app ts_int  []
183
let dity_real = ts_app ts_real []
184
let dity_bool = ts_app ts_bool []
Andrei Paskevich's avatar
Andrei Paskevich committed
185
let dity_unit = ts_app ts_unit []
186

187
let unify_loc unify_fn loc x1 x2 = try unify_fn x1 x2 with
Andrei Paskevich's avatar
Andrei Paskevich committed
188
  | TypeMismatch (ity1,ity2,_) -> errorm ~loc
189
      "This expression has type %a,@ but is expected to have type %a"
190
      Mlw_pretty.print_ity ity2 Mlw_pretty.print_ity ity1
Andrei Paskevich's avatar
Andrei Paskevich committed
191 192 193
  | DTypeMismatch (dity1,dity2) -> errorm ~loc
      "This expression has type %a,@ but is expected to have type %a"
      Mlw_dty.print_dity dity2 Mlw_dty.print_dity dity1
194
  | exn when Debug.test_noflag Debug.stack_trace -> error ~loc exn
195

196 197 198 199 200 201 202
let expected_type { de_loc = loc ; de_type = (argl,res) } dity =
  if argl <> [] then errorm ~loc "This expression is not a first-order value";
  unify_loc unify loc dity res

let expected_type_weak { de_loc = loc ; de_type = (argl,res) } dity =
  if argl <> [] then errorm ~loc "This expression is not a first-order value";
  unify_loc unify_weak loc dity res
203

204
let rec extract_labels labs loc e = match e.Ptree.expr_desc with
205
  | Ptree.Enamed (Ptree.Lstr s, e) -> extract_labels (Slab.add s labs) loc e
206 207 208 209
  | Ptree.Enamed (Ptree.Lpos p, e) -> extract_labels labs (Some p) e
  | Ptree.Ecast  (e, ty) ->
      let labs, loc, d = extract_labels labs loc e in
      labs, loc, Ptree.Ecast ({ e with Ptree.expr_desc = d }, ty)
210
  | e -> labs, loc, e
211

212 213 214
let rec decompose_app args e = match e.Ptree.expr_desc with
  | Eapply (e1, e2) -> decompose_app (e2 :: args) e1
  | _ -> e, args
215

216 217 218 219 220 221 222
(* record parsing *)

let parse_record uc fll =
  let pl = match fll with
    | [] -> raise EmptyRecord
    | (pl,_)::_ -> pl in
  let its = match pl.pl_args with
223
    | [{ fd_ity = { ity_node = Ityapp (its,_,_) }}] -> its
224 225
    | _ -> raise (BadRecordField pl.pl_ls) in
  let cs, pjl = match find_constructors (get_known uc) its with
226
    | [cs,pjl] -> cs, List.map (Opt.get_exn (BadRecordField pl.pl_ls)) pjl
227 228 229 230 231 232 233 234 235
    | _ -> raise (BadRecordField pl.pl_ls) in
  let pjs = List.fold_left (fun s pj -> Sls.add pj.pl_ls s) Sls.empty pjl in
  let flm = List.fold_left (fun m (pj,v) -> let pj = pj.pl_ls in
    if not (Sls.mem pj pjs) then raise (BadRecordField pj) else
      Mls.add_new (DuplicateRecordField (cs.pl_ls,pj)) pj v m)
    Mls.empty fll
  in
  cs,pjl,flm

236 237
let find_prog_field uc (p,e) = match uc_find_ps uc p with PL pl -> pl, e
  | _ -> errorm ~loc:(qloc p) "'%a' is not a record field" print_qualid p
238

239
let find_pure_field uc (p,e) = uc_find_ls uc p, e
240

241 242
let is_pure_record uc = function
  | fl :: _ -> (try ignore (find_prog_field uc fl); false with _ -> true)
243
  | [] -> raise Decl.EmptyRecord
244 245

let hidden_pl ~loc pl =
246 247
  { de_desc = DEglobal_pl pl;
    de_type = specialize_plsymbol pl;
248
    de_loc  = loc; de_lab = Slab.empty }
249 250

let hidden_ls ~loc ls =
251
  { de_desc = DEglobal_ls ls;
252
    de_type = Loc.try1 loc specialize_lsymbol ls;
253
    de_loc  = loc; de_lab = Slab.empty }
254 255

(* helper functions for let-expansion *)
256
let test_var e = match e.de_desc with
257
  | DElocal _ | DEglobal_pv _ | DEconstant _ -> true
258 259
  | _ -> false

260
let mk_var name e =
261
  if test_var e then e else
262
  { de_desc = DElocal name;
263 264
    de_type = e.de_type;
    de_loc  = e.de_loc;
265
    de_lab  = Slab.empty }
266

267 268 269
let mk_id s loc =
  { id = s; id_loc = loc; id_lab = [] }

270 271
let mk_dexpr desc dvty loc labs =
  { de_desc = desc; de_type = dvty; de_loc = loc; de_lab = labs }
272

273
let mk_let name ~loc ~uloc e (desc,dvty) =
274
  if test_var e then desc, dvty else
275
  let loc = Opt.get_def loc uloc in
276
  let e1 = mk_dexpr desc dvty loc Slab.empty in
277
  DElet (mk_id name e.de_loc, false, e, e1), dvty
278

279 280
(* patterns *)

281 282 283 284 285 286 287 288 289
let add_poly id dvty denv =
  let locals = Mstr.add id.id (Some denv.tvars, dvty) denv.locals in
  { denv with locals = locals }

let add_mono id dvty denv =
  let locals = Mstr.add id.id (None, dvty) denv.locals in
  { denv with locals = locals; tvars = add_dvty denv.tvars dvty }

let add_var id dity denv = add_mono id ([],dity) denv
290

291
let specialize_qualid uc p = match uc_find_ps uc p with
292
  | PV pv -> DEglobal_pv pv, ([],specialize_pvsymbol pv)
293 294
  | PS ps -> DEglobal_ps ps, specialize_psymbol  ps
  | PL pl -> DEglobal_pl pl, specialize_plsymbol pl
295
  | LS ls -> DEglobal_ls ls, Loc.try1 (qloc p) specialize_lsymbol ls
296
  | XS xs -> errorm ~loc:(qloc p) "unexpected exception symbol %a" print_xs xs
297

298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316
let chainable_qualid uc p = match uc_find_ps uc p with
  | PS { ps_aty = { aty_args = [pv1;pv2]; aty_result = VTvalue ity }}
  | PS { ps_aty = { aty_args = [pv1]; aty_result =
          VTarrow { aty_args = [pv2]; aty_result = VTvalue ity }}} ->
      ity_equal ity ity_bool
      && not (ity_equal pv1.pv_ity ity_bool)
      && not (ity_equal pv2.pv_ity ity_bool)
  | LS { ls_args = [ty1;ty2]; ls_value = ty } ->
      Opt.fold (fun _ ty -> ty_equal ty ty_bool) true ty
      && not (ty_equal ty1 ty_bool)
      && not (ty_equal ty2 ty_bool)
  | PS _ | LS _ | PL _ | PV _ | XS _ -> false

let chainable_op denv op =
  op.id = "infix =" || op.id = "infix <>" ||
  match Mstr.find_opt op.id denv.locals with
  | Some (_, dvty) -> is_chainable dvty
  | None -> chainable_qualid denv.uc (Qident op)

317 318
let find_xsymbol uc p = match uc_find_ps uc p with
  | XS xs -> xs
319
  | _ -> errorm ~loc:(qloc p) "exception symbol expected"
Andrei Paskevich's avatar
Andrei Paskevich committed
320

321
let find_variant_ls uc p = match uc_find_ls uc p with
322 323
  | { ls_args = [u;v]; ls_value = None } as ls when ty_equal u v -> ls
  | ls -> errorm ~loc:(qloc p) "%a is not a binary relation" Pretty.print_ls ls
324

325
let find_global_vs uc p = try match uc_find_ps uc p with
326 327
  | PV pv -> Some pv.pv_vs
  | _ -> None
328
  with _ -> None
329

330 331 332 333 334 335
let find_vs uc lvm p = match p with
  | Qdot _ -> find_global_vs uc p
  | Qident id ->
      let ovs = Mstr.find_opt id.id lvm in
      if ovs = None then find_global_vs uc p else ovs

336
let rec dpattern denv ({ pat_loc = loc } as pp) dity = match pp.pat_desc with
337
  | Ptree.PPpwild ->
338
      PPwild, denv
339
  | Ptree.PPpvar id ->
340
      PPvar (Denv.create_user_id id), add_var id dity denv
341
  | Ptree.PPpapp (q,ppl) ->
342
      let sym, dvty = specialize_qualid denv.uc q in
343
      dpat_app denv loc (mk_dexpr sym dvty loc Slab.empty) ppl dity
344
  | Ptree.PPprec fl when is_pure_record denv.uc fl ->
345
      let kn = Theory.get_known (get_theory denv.uc) in
346
      let fl = List.map (find_pure_field denv.uc) fl in
347 348 349
      let cs,pjl,flm = Loc.try2 loc Decl.parse_record kn fl in
      let wild = { pat_desc = Ptree.PPpwild; pat_loc = loc } in
      let get_val pj = Mls.find_def wild pj flm in
350
      dpat_app denv loc (hidden_ls ~loc cs) (List.map get_val pjl) dity
351
  | Ptree.PPprec fl ->
352
      let fl = List.map (find_prog_field denv.uc) fl in
353 354 355
      let cs,pjl,flm = Loc.try2 loc parse_record denv.uc fl in
      let wild = { pat_desc = Ptree.PPpwild; pat_loc = loc } in
      let get_val pj = Mls.find_def wild pj.pl_ls flm in
356
      dpat_app denv loc (hidden_pl ~loc cs) (List.map get_val pjl) dity
357 358
  | Ptree.PPptuple ppl ->
      let cs = fs_tuple (List.length ppl) in
359
      dpat_app denv loc (hidden_ls ~loc cs) ppl dity
360
  | Ptree.PPpor (lpp1, lpp2) ->
361 362 363
      let pp1, denv = dpattern denv lpp1 dity in
      let pp2, denv = dpattern denv lpp2 dity in
      PPor (pp1, pp2), denv
364
  | Ptree.PPpas (pp, id) ->
365 366 367 368 369 370 371
      let pp, denv = dpattern denv pp dity in
      PPas (pp, Denv.create_user_id id), add_var id dity denv

and dpat_app denv gloc ({ de_loc = loc } as de) ppl dity =
  let ls = match de.de_desc with
    | DEglobal_pl pl -> pl.pl_ls
    | DEglobal_ls ls -> ls
372 373
    | DEglobal_pv pv -> errorm ~loc "%a is not a constructor" print_pv pv
    | DEglobal_ps ps -> errorm ~loc "%a is not a constructor" print_ps ps
374
    | _ -> assert false in
375 376 377
  let argl, res = de.de_type in
  if List.length argl <> List.length ppl then error ~loc:gloc
    (Term.BadArity (ls, List.length argl, List.length ppl));
378 379 380 381 382 383 384 385 386
  unify_loc unify gloc res dity;
  let add_pp lp ty (ppl, denv) =
    let pp, denv = dpattern denv lp ty in pp::ppl, denv in
  let ppl, denv = List.fold_right2 add_pp ppl argl ([],denv) in
  let pp = match de.de_desc with
    | DEglobal_pl pl -> Mlw_expr.PPpapp (pl, ppl)
    | DEglobal_ls ls -> Mlw_expr.PPlapp (ls, ppl)
    | _ -> assert false in
  pp, denv
387

388 389
(* specifications *)

390
let dbinders denv bl =
391
  let hv = Hstr.create 3 in
392
  let dbinder (id,gh,pty) (denv,bl,tyl) =
393 394
    if Hstr.mem hv id.id then raise (DuplicateProgVar id.id);
    Hstr.add hv id.id ();
395
    let dity = match pty with
396
      | Some pty -> dity_of_pty denv pty
397
      | None -> create_type_variable () in
398
    add_var id dity denv, (id,gh,dity)::bl, dity::tyl
399 400
  in
  List.fold_right dbinder bl (denv,[],[])
401

402
let mk_dpost loc = function
403
  | [{ pat_desc = PPpwild | PPptuple [] | PPpvar _ }, _ as p] -> p
404
  | l ->
405 406 407 408
      let i = { id = "(null)"; id_loc = loc; id_lab = [] } in
      let p = { pat_desc = Ptree.PPpvar i; pat_loc = loc } in
      let v = { pp_desc = Ptree.PPvar (Qident i); pp_loc = loc } in
      p, { pp_desc = PPmatch (v,l); pp_loc = loc }
409 410

let dpost ql = List.map (fun (loc, ql) -> mk_dpost loc ql) ql
411 412

let dxpost uc ql =
413
  let add_exn (q,pat,f) m =
414
    let xs = find_xsymbol uc q in
415 416 417 418 419 420
    Mexn.change (function
      | Some l -> Some ((pat,f) :: l)
      | None   -> Some ((pat,f) :: [])) xs m in
  let exn_map (loc,ql) =
    let m = List.fold_right add_exn ql Mexn.empty in
    Mexn.map (fun ql -> [mk_dpost loc ql]) m in
421 422 423
  let add_map ql m =
    Mexn.union (fun _ l r -> Some (l @ r)) (exn_map ql) m in
  List.fold_right add_map ql Mexn.empty
424 425

let dvariant uc var =
426
  List.map (fun (le,q) -> le, Opt.map (find_variant_ls uc) q) var
427 428 429

let dspec uc sp = {
  ds_pre     = sp.sp_pre;
430
  ds_post    = dpost sp.sp_post;
431
  ds_xpost   = dxpost uc sp.sp_xpost;
432 433
  ds_reads   = sp.sp_reads;
  ds_writes  = sp.sp_writes;
434 435
  ds_variant = dvariant uc sp.sp_variant;
}
436

437 438 439
let rec dtype_c denv (tyv, sp) =
  let tyv, dvty = dtype_v denv tyv in
  (tyv, dspec denv.uc sp), dvty
440 441 442

and dtype_v denv = function
  | Tpure pty ->
443
      let dity = dity_of_pty denv pty in
444
      DSpecV dity, ([],dity)
445 446
  | Tarrow (bl,tyc) ->
      let denv,bl,tyl = dbinders denv bl in
447 448
      let tyc,(argl,res) = dtype_c denv tyc in
      DSpecA (bl,tyc), (tyl @ argl,res)
449

450
(* expressions *)
451

452
let de_unit ~loc = hidden_ls ~loc Mlw_expr.fs_void
453

454 455 456 457 458 459 460 461 462 463 464 465 466 467
let de_app _loc e el =
  let argl, res = e.de_type in
  let rec unify_list argl el = match argl, el with
    | arg::argl, e::el when Loc.equal e.de_loc Loc.dummy_position ->
        expected_type e arg; unify_list argl el
    | arg::argl, e::el ->
        let res = unify_list argl el in expected_type e arg; res
    | argl, [] -> argl, res
    | [], _ when fst e.de_type = [] -> errorm ~loc:e.de_loc
        "This expression is not a function and cannot be applied"
    | [], _ -> errorm ~loc:e.de_loc
        "This function is applied to too many arguments"
  in
  DEapply (e, el), unify_list argl el
468

Andrei Paskevich's avatar
Andrei Paskevich committed
469
let rec dexpr denv e =
470
  let loc = e.Ptree.expr_loc in
471
  let labs, uloc, d = extract_labels Slab.empty denv.uloc e in
Andrei Paskevich's avatar
Andrei Paskevich committed
472
  let denv = { denv with uloc = uloc } in
473
  let d, ty = de_desc denv loc d in
474
  let loc = Opt.get_def loc uloc in
475
  mk_dexpr d ty loc labs
476

477
and de_desc denv loc = function
478 479 480 481 482 483
  | Ptree.Eident (Qident {id = x} as p) ->
      begin match Mstr.find_opt x denv.locals with
        | Some (Some tvs, dvty) -> DElocal x, specialize_scheme tvs dvty
        | Some (None,     dvty) -> DElocal x, dvty
        | None                  -> specialize_qualid denv.uc p
      end
484
  | Ptree.Eident p ->
485
      specialize_qualid denv.uc p
486 487
  | Ptree.Eapply (e1, e2) ->
      let e, el = decompose_app [e2] e1 in
Andrei Paskevich's avatar
Andrei Paskevich committed
488
      let el = List.map (dexpr denv) el in
489
      de_app loc (dexpr denv e) el
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
  | Ptree.Einfix (e12, op2, e3)
  | Ptree.Einnfix (e12, op2, e3) ->
      let mk_bool (d,ty) =
        let de = mk_dexpr d ty (Opt.get_def loc denv.uloc) Slab.empty in
        expected_type de dity_bool; de in
      let make_app de1 op de2 =
        let id = Ptree.Eident (Qident op) in
        let e0 = { expr_desc = id; expr_loc = op.id_loc } in
        de_app loc (dexpr denv e0) [de1; de2] in
      let make_app de1 op de2 =
        if op.id <> "infix <>" then make_app de1 op de2 else
          let de12 = mk_bool (make_app de1 { op with id = "infix =" } de2) in
          DEnot de12, de12.de_type in
      let rec make_chain n1 n2 de1 = function
        | [op,de2] ->
            make_app de1 op de2
        | (op,de2) :: ch ->
            let v = mk_var n1 de2 in
            let de12 = mk_bool (make_app de1 op v) in
            let de23 = mk_bool (make_chain n2 n1 v ch) in
            let d = DElazy (LazyAnd, de12, de23) in
            mk_let n1 ~loc ~uloc:denv.uloc de2 (d, de12.de_type)
        | [] -> assert false in
      let rec get_chain e12 acc = match e12.expr_desc with
        | Ptree.Einfix (e1, op1, e2) when chainable_op denv op1 ->
            get_chain e1 ((op1, dexpr denv e2) :: acc)
        | _ -> e12, acc in
      let e1, ch = if chainable_op denv op2
        then get_chain e12 [op2, dexpr denv e3]
        else e12, [op2, dexpr denv e3] in
      make_chain "q1 " "q2 " (dexpr denv e1) ch
521
  | Ptree.Elet (id, gh, e1, e2) ->
Andrei Paskevich's avatar
Andrei Paskevich committed
522
      let e1 = dexpr denv e1 in
523 524 525
      let denv = match e1.de_desc with
        | DEfun _ -> add_poly id e1.de_type denv
        | _       -> add_mono id e1.de_type denv in
Andrei Paskevich's avatar
Andrei Paskevich committed
526
      let e2 = dexpr denv e2 in
527
      DElet (id, gh, e1, e2), e2.de_type
528 529
  | Ptree.Eletrec (fdl, e1) ->
      let fdl = dletrec denv fdl in
530
      let add_one denv (id,_,dvty,_,_) = add_poly id dvty denv in
531
      let denv = List.fold_left add_one denv fdl in
Andrei Paskevich's avatar
Andrei Paskevich committed
532
      let e1 = dexpr denv e1 in
533
      DEletrec (fdl, e1), e1.de_type
Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
534
  | Ptree.Efun (bl, tr) ->
535
      let denv, bl, tyl = dbinders denv bl in
536
      let tr, (argl, res) = dtriple denv tr in
537
      DEfun (bl, tr), (tyl @ argl, res)
538
  | Ptree.Ecast (e1, pty) ->
Andrei Paskevich's avatar
Andrei Paskevich committed
539
      let e1 = dexpr denv e1 in
540
      expected_type_weak e1 (dity_of_pty denv pty);
541
      e1.de_desc, e1.de_type
542 543
  | Ptree.Enamed _ ->
      assert false
544
  | Ptree.Esequence (e1, e2) ->
Andrei Paskevich's avatar
Andrei Paskevich committed
545
      let e1 = dexpr denv e1 in
546
      expected_type e1 dity_unit;
Andrei Paskevich's avatar
Andrei Paskevich committed
547
      let e2 = dexpr denv e2 in
548
      DElet (mk_id "_" loc, false, e1, e2), e2.de_type
549
  | Ptree.Eif (e1, e2, e3) ->
Andrei Paskevich's avatar
Andrei Paskevich committed
550
      let e1 = dexpr denv e1 in
551
      expected_type e1 dity_bool;
Andrei Paskevich's avatar
Andrei Paskevich committed
552 553
      let e2 = dexpr denv e2 in
      let e3 = dexpr denv e3 in
554 555 556
      let res = create_type_variable () in
      expected_type e2 res;
      expected_type e3 res;
557
      DEif (e1, e2, e3), e2.de_type
558 559
  | Ptree.Etuple el ->
      let ls = fs_tuple (List.length el) in
Andrei Paskevich's avatar
Andrei Paskevich committed
560
      let el = List.map (dexpr denv) el in
561
      de_app loc (hidden_ls ~loc ls) el
562
  | Ptree.Erecord fl when is_pure_record denv.uc fl ->
563
      let kn = Theory.get_known (get_theory denv.uc) in
564
      let fl = List.map (find_pure_field denv.uc) fl in
565 566
      let cs,pjl,flm = Loc.try2 loc Decl.parse_record kn fl in
      let get_val pj = match Mls.find_opt pj flm with
Andrei Paskevich's avatar
Andrei Paskevich committed
567
        | Some e -> dexpr denv e
568
        | None -> error ~loc (Decl.RecordFieldMissing (cs,pj)) in
569
      de_app loc (hidden_ls ~loc cs) (List.map get_val pjl)
570
  | Ptree.Erecord fl ->
571
      let fl = List.map (find_prog_field denv.uc) fl in
572 573
      let cs,pjl,flm = Loc.try2 loc parse_record denv.uc fl in
      let get_val pj = match Mls.find_opt pj.pl_ls flm with
Andrei Paskevich's avatar
Andrei Paskevich committed
574
        | Some e -> dexpr denv e
575
        | None -> error ~loc (Decl.RecordFieldMissing (cs.pl_ls,pj.pl_ls)) in
576
      de_app loc (hidden_pl ~loc cs) (List.map get_val pjl)
577
  | Ptree.Eupdate (e1, fl) when is_pure_record denv.uc fl ->
Andrei Paskevich's avatar
Andrei Paskevich committed
578
      let e1 = dexpr denv e1 in
579
      let e0 = mk_var "q " e1 in
580
      let kn = Theory.get_known (get_theory denv.uc) in
581
      let fl = List.map (find_pure_field denv.uc) fl in
582 583
      let cs,pjl,flm = Loc.try2 loc Decl.parse_record kn fl in
      let get_val pj = match Mls.find_opt pj flm with
Andrei Paskevich's avatar
Andrei Paskevich committed
584
        | Some e -> dexpr denv e
585
        | None ->
586
            let loc = Loc.dummy_position in
587 588
            let d, dvty = de_app loc (hidden_ls ~loc pj) [e0] in
            mk_dexpr d dvty loc Slab.empty in
589
      let res = de_app loc (hidden_ls ~loc cs) (List.map get_val pjl) in
590
      mk_let "q " ~loc ~uloc:denv.uloc e1 res
591
  | Ptree.Eupdate (e1, fl) ->
Andrei Paskevich's avatar
Andrei Paskevich committed
592
      let e1 = dexpr denv e1 in
593
      let e0 = mk_var "q " e1 in
594
      let fl = List.map (find_prog_field denv.uc) fl in
595 596
      let cs,pjl,flm = Loc.try2 loc parse_record denv.uc fl in
      let get_val pj = match Mls.find_opt pj.pl_ls flm with
Andrei Paskevich's avatar
Andrei Paskevich committed
597
        | Some e -> dexpr denv e
598
        | None ->
599
            let loc = Loc.dummy_position in
600 601
            let d, dvty = de_app loc (hidden_pl ~loc pj) [e0] in
            mk_dexpr d dvty loc Slab.empty in
602
      let res = de_app loc (hidden_pl ~loc cs) (List.map get_val pjl) in
603
      mk_let "q " ~loc ~uloc:denv.uloc e1 res
Andrei Paskevich's avatar
Andrei Paskevich committed
604
  | Ptree.Eassign (e1, q, e2) ->
605 606 607 608 609
      let fl = dexpr denv { expr_desc = Eident q; expr_loc = qloc q } in
      let pl = match fl.de_desc with
        | DEglobal_pl pl -> pl
        | _ -> Loc.errorm ~loc:(qloc q) "%a is not a field name" print_qualid q
      in
Andrei Paskevich's avatar
Andrei Paskevich committed
610 611
      let e1 = dexpr denv e1 in
      let e2 = dexpr denv e2 in
612 613
      let d, ty = de_app loc fl [e1] in
      let e0 = mk_dexpr d ty loc Slab.empty in
614
      let res = create_type_variable () in
615
      expected_type e0 res;
616
      expected_type_weak e2 res;
617
      DEassign (pl, e1, e2), ([], dity_unit)
618
  | Ptree.Econstant (Number.ConstInt _ as c) ->
619
      DEconstant c, ([], dity_int)
620
  | Ptree.Econstant (Number.ConstReal _ as c) ->
621
      DEconstant c, ([], dity_real)
622
  | Ptree.Enot e1 ->
Andrei Paskevich's avatar
Andrei Paskevich committed
623
      let e1 = dexpr denv e1 in
624
      expected_type e1 dity_bool;
625
      DEnot e1, ([], dity_bool)
626
  | Ptree.Elazy (op, e1, e2) ->
Andrei Paskevich's avatar
Andrei Paskevich committed
627 628
      let e1 = dexpr denv e1 in
      let e2 = dexpr denv e2 in
629 630
      expected_type e1 dity_bool;
      expected_type e2 dity_bool;
631
      DElazy (op, e1, e2), ([], dity_bool)
632
  | Ptree.Ematch (e1, bl) ->
Andrei Paskevich's avatar
Andrei Paskevich committed
633
      let e1 = dexpr denv e1 in
634
      let ety = create_type_variable () in
635
      let res = create_type_variable () in
636
      expected_type e1 ety;
637
      let branch (pp,e) =
638
        let ppat, denv = dpattern denv pp ety in
Andrei Paskevich's avatar
Andrei Paskevich committed
639
        let e = dexpr denv e in
640 641
        expected_type e res;
        ppat, e in
642
      DEmatch (e1, List.map branch bl), ([], res)
Andrei Paskevich's avatar
Andrei Paskevich committed
643
  | Ptree.Eraise (q, e1) ->
644
      let xs = find_xsymbol denv.uc q in
Andrei Paskevich's avatar
Andrei Paskevich committed
645
      let e1 = match e1 with
Andrei Paskevich's avatar
Andrei Paskevich committed
646
        | Some e1 -> dexpr denv e1
647
        | None when ity_equal xs.xs_ity ity_unit -> de_unit ~loc
Andrei Paskevich's avatar
Andrei Paskevich committed
648
        | _ -> errorm ~loc "exception argument expected" in
Andrei Paskevich's avatar
minor  
Andrei Paskevich committed
649
      expected_type e1 (specialize_xsymbol xs);
650
      DEraise (xs, e1), ([], create_type_variable ())
Andrei Paskevich's avatar
Andrei Paskevich committed
651
  | Ptree.Etry (e1, cl) ->
652
      let res = create_type_variable () in
Andrei Paskevich's avatar
Andrei Paskevich committed
653
      let e1 = dexpr denv e1 in
654
      expected_type e1 res;
655
      let branch (q, pp, e) =
656
        let xs = find_xsymbol denv.uc q in
657
        let ety = specialize_xsymbol xs in
658
        let ppat, denv = dpattern denv pp ety in
659
        let e = dexpr denv e in
660
        expected_type e res;
661
        xs, ppat, e in
Andrei Paskevich's avatar
minor  
Andrei Paskevich committed
662
      DEtry (e1, List.map branch cl), e1.de_type
663
  | Ptree.Eabsurd ->
664
      DEabsurd, ([], create_type_variable ())
665
  | Ptree.Eassert (ak, lexpr) ->
666
      DEassert (ak, lexpr), ([], dity_unit)
Andrei Paskevich's avatar
Andrei Paskevich committed
667 668
  | Ptree.Emark (id, e1) ->
      let e1 = dexpr denv e1 in
669
      DEmark (id, e1), e1.de_type
670
  | Ptree.Eany tyc ->
671 672
      let tyc, dvty = dtype_c denv tyc in
      DEany tyc, dvty
673 674 675
  | Ptree.Eghost e1 ->
      let e1 = dexpr denv e1 in
      DEghost e1, e1.de_type
676
  | Ptree.Eabstract (e1, sp) ->
677
      let e1 = dexpr denv e1 in
678 679
      let sp = dspec denv.uc sp in
      DEabstract (e1, sp), e1.de_type
680 681 682 683
  | Ptree.Eloop ({ loop_invariant = inv; loop_variant = var }, e1) ->
      let e1 = dexpr denv e1 in
      let var = dvariant denv.uc var in
      expected_type e1 dity_unit;
Andrei Paskevich's avatar
minor  
Andrei Paskevich committed
684
      DEloop (var, inv, e1), e1.de_type
685 686 687 688 689 690 691 692
  | Ptree.Efor (id, efrom, dir, eto, inv, e1) ->
      let efrom = dexpr denv efrom in
      let eto = dexpr denv eto in
      let denv = add_var id dity_int denv in
      let e1 = dexpr denv e1 in
      expected_type efrom dity_int;
      expected_type eto dity_int;
      expected_type e1 dity_unit;
Andrei Paskevich's avatar
minor  
Andrei Paskevich committed
693
      DEfor (id, efrom, dir, eto, inv, e1), e1.de_type
694

695
and dletrec denv fdl =
696
  (* add all functions into the environment *)
697
  let add_one denv (_,id,_,bl,_) =
698 699
    let argl = List.map (fun _ -> create_type_variable ()) bl in
    let dvty = argl, create_type_variable () in
700
    add_mono id dvty denv, dvty in
701
  let denv, dvtyl = Lists.map_fold_left add_one denv fdl in
702
  (* then unify the binders *)
703
  let bind_one (_,_,_,bl,_) (argl,res) =
704 705 706
    let denv,bl,tyl = dbinders denv bl in
    List.iter2 unify argl tyl;
    denv,bl,tyl,res in
707
  let denvl = List.map2 bind_one fdl dvtyl in
708
  (* then type-check the bodies *)
709 710
  let type_one (loc,id,gh,_,tr) (denv,bl,tyl,tyv) =
    let tr, (argl, res) = dtriple denv tr in
711 712 713
    if argl <> [] then errorm ~loc
      "The body of a recursive function must be a first-order value";
    unify_loc unify loc tyv res;
714
    id, gh, (tyl, tyv), bl, tr in
715
  List.map2 type_one fdl denvl