typing.ml 32.1 KB
Newer Older
Andrei Paskevich's avatar
Andrei Paskevich committed
1 2 3
(********************************************************************)
(*                                                                  *)
(*  The Why3 Verification Platform   /   The Why3 Development Team  *)
Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
4
(*  Copyright 2010-2014   --   INRIA - CNRS - Paris-Sud University  *)
Andrei Paskevich's avatar
Andrei Paskevich committed
5 6 7 8 9 10
(*                                                                  *)
(*  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
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 Env
Andrei Paskevich's avatar
Andrei Paskevich committed
21

22
(** debug flags *)
23

24
let debug_parse_only = Debug.register_flag "parse_only"
Andrei Paskevich's avatar
Andrei Paskevich committed
25
  ~desc:"Stop@ after@ parsing."
26

27
let debug_type_only  = Debug.register_flag "type_only"
Andrei Paskevich's avatar
Andrei Paskevich committed
28
  ~desc:"Stop@ after@ type-checking."
29

30
(** errors *)
31

32 33 34
exception UnboundTypeVar of string
exception DuplicateTypeVar of string
exception ClashTheory of string
35

36
(** lazy declaration of tuples *)
37

38 39 40 41
let add_decl_with_tuples uc d =
  if Debug.test_flag Glob.flag then Sid.iter Glob.def d.d_news;
  add_decl_with_tuples uc d

42 43 44 45 46 47
let add_ty_decl uc ts      = add_decl_with_tuples uc (create_ty_decl ts)
let add_data_decl uc dl    = add_decl_with_tuples uc (create_data_decl dl)
let add_param_decl uc ls   = add_decl_with_tuples uc (create_param_decl ls)
let add_logic_decl uc dl   = add_decl_with_tuples uc (create_logic_decl dl)
let add_ind_decl uc s dl   = add_decl_with_tuples uc (create_ind_decl s dl)
let add_prop_decl uc k p f = add_decl_with_tuples uc (create_prop_decl k p f)
48

49
(** symbol lookup *)
50 51

let rec qloc = function
52 53 54
  | Qdot (p, id) -> Loc.join (qloc p) id.id_loc
  | Qident id    -> id.id_loc

55 56 57
let qloc_last = function
  | Qdot (_, id) | Qident id -> id.id_loc

58
let rec print_qualid fmt = function
59 60
  | Qdot (p, id) -> Format.fprintf fmt "%a.%s" print_qualid p id.id_str
  | Qident id    -> Format.fprintf fmt "%s" id.id_str
61

62 63
let string_list_of_qualid q =
  let rec sloq acc = function
64 65
    | Qdot (p, id) -> sloq (id.id_str :: acc) p
    | Qident id -> id.id_str :: acc in
66
  sloq [] q
67

68
exception UnboundSymbol of qualid
69

70
let find_qualid get_id find ns q =
71 72 73
  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
74
  if Debug.test_flag Glob.flag then Glob.use (qloc_last q) (get_id r);
75
  r
76

77 78 79
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
80

81 82
let find_fsymbol_ns ns q =
  let ls = find_lsymbol_ns ns q in
83 84
  if ls.ls_value <> None then ls else
    Loc.error ~loc:(qloc q) (FunctionSymbolExpected ls)
85

86 87
let find_psymbol_ns ns q =
  let ls = find_lsymbol_ns ns q in
88 89
  if ls.ls_value = None then ls else
    Loc.error ~loc:(qloc q) (PredicateSymbolExpected ls)
90

91 92 93 94 95
let find_prop     uc q = find_prop_ns     (get_namespace uc) q
let find_tysymbol uc q = find_tysymbol_ns (get_namespace uc) q
let find_lsymbol  uc q = find_lsymbol_ns  (get_namespace uc) q
let find_fsymbol  uc q = find_fsymbol_ns  (get_namespace uc) q
let find_psymbol  uc q = find_psymbol_ns  (get_namespace uc) q
96

97 98
let find_namespace_ns ns q =
  find_qualid (fun _ -> Glob.dummy_id) ns_find_ns ns q
99

100 101
(** Parsing types *)

Andrei Paskevich's avatar
Andrei Paskevich committed
102
let ty_of_pty ?(noop=true) uc pty =
103
  let rec get_ty = function
104
    | PTtyvar ({id_loc = loc}, true) when noop ->
105 106
        Loc.errorm ~loc "Opaqueness@ annotations@ are@ only@ \
          allowed@ in@ function@ and@ predicate@ prototypes"
107
    | PTtyvar ({id_str = x}, _) ->
108
        ty_var (tv_of_string x)
109
    | PTtyapp (q, tyl) ->
110
        let ts = find_tysymbol uc q in
111
        let tyl = List.map get_ty tyl in
112
        Loc.try2 ~loc:(qloc q) ty_app ts tyl
113
    | PTtuple tyl ->
114 115
        let ts = ts_tuple (List.length tyl) in
        ty_app ts (List.map get_ty tyl)
116
    | PTarrow (ty1, ty2) ->
117
        ty_func (get_ty ty1) (get_ty ty2)
118
    | PTparen ty ->
119 120 121 122
        get_ty ty
  in
  get_ty pty

123
let opaque_tvs args =
124
  let rec opaque_tvs acc = function
125 126 127 128 129 130
    | PTtyvar (id, true) -> Stv.add (tv_of_string id.id_str) acc
    | PTtyvar (_, false) -> acc
    | PTtyapp (_, pl)
    | PTtuple pl -> List.fold_left opaque_tvs acc pl
    | PTarrow (ty1, ty2) -> opaque_tvs (opaque_tvs acc ty1) ty2
    | PTparen ty -> opaque_tvs acc ty in
131
  List.fold_left (fun acc (_,_,_,ty) -> opaque_tvs acc ty) Stv.empty args
132

133
(** typing using destructive type variables
134

135 136 137 138 139 140
    parsed trees        intermediate trees       typed trees
      (Ptree)                (Dterm)               (Term)
   -----------------------------------------------------------
     ppure_type  ---dty--->   dty       ---ty--->    ty
      lexpr      --dterm-->   dterm     --term-->    term
*)
141

142 143
(** Typing patterns, terms, and formulas *)

144
let create_user_id {id_str = n; id_lab = label; id_loc = loc} =
145 146 147 148
  let get_labels (label, loc) = function
    | Lstr lab -> Slab.add lab label, loc | Lpos loc -> label, loc in
  let label,loc = List.fold_left get_labels (Slab.empty,loc) label in
  id_user ~label n loc
149 150

let parse_record ~loc uc get_val fl =
151
  let fl = List.map (fun (q,e) -> find_lsymbol uc q, e) fl in
152 153 154 155
  let cs,pjl,flm = Loc.try2 ~loc parse_record (get_known uc) fl in
  let get_val pj = get_val cs pj (Mls.find_opt pj flm) in
  cs, List.map get_val pjl

156 157
let rec dpattern uc { pat_desc = desc; pat_loc = loc } =
  Dterm.dpattern ~loc (match desc with
158 159 160
    | Ptree.Pwild -> DPwild
    | Ptree.Pvar x -> DPvar (create_user_id x)
    | Ptree.Papp (q,pl) ->
161
        let pl = List.map (dpattern uc) pl in
162
        DPapp (find_lsymbol uc q, pl)
163
    | Ptree.Ptuple pl ->
164 165
        let pl = List.map (dpattern uc) pl in
        DPapp (fs_tuple (List.length pl), pl)
166
    | Ptree.Prec fl ->
167 168 169 170 171
        let get_val _ _ = function
          | Some p -> dpattern uc p
          | None -> Dterm.dpattern DPwild in
        let cs,fl = parse_record ~loc uc get_val fl in
        DPapp (cs,fl)
172 173 174 175 176 177 178 179 180
    | Ptree.Pas (p, x) -> DPas (dpattern uc p, create_user_id x)
    | Ptree.Por (p, q) -> DPor (dpattern uc p, dpattern uc q))

let quant_var uc (loc, id, gh, ty) =
  assert (not gh);
  let id = match id with
    | Some x -> create_user_id x
    | None -> id_user "_" loc in
  let ty = match ty with
181
    | Some ty -> dty_of_ty (ty_of_pty uc ty)
182 183
    | None    -> dty_fresh () in
  id, ty
184

185 186 187 188 189 190 191 192 193 194 195 196 197 198
let is_reusable dt = match dt.dt_node with
  | DTvar _ | DTgvar _ | DTconst _ | DTtrue | DTfalse -> true
  | DTapp (_,[]) -> true
  | _ -> false

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

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

199 200
let chainable_op uc op =
  (* non-bool -> non-bool -> bool *)
201
  op.id_str = "infix =" || op.id_str = "infix <>" ||
202 203 204 205 206 207
  match find_lsymbol uc (Qident op) with
  | {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)
  | _ -> false
208

209 210
type global_vs = Ptree.qualid -> vsymbol option

211 212 213 214 215 216 217 218 219 220 221 222 223
let mk_closure loc ls =
  let mk dt = Dterm.dterm ~loc dt in
  let id = id_user "fc" loc and dty = dty_fresh () in
  let mk_v i _ =
    id_user ("y" ^ string_of_int i) loc, dty_fresh () in
  let mk_t (id, dty) = mk (DTvar (id.pre_name, dty)) in
  let vl = Lists.mapi mk_v ls.ls_args in
  let tl = List.map mk_t vl in
  let app e1 e2 = DTapp (fs_func_app, [mk e1; e2]) in
  let e = List.fold_left app (DTvar ("fc", dty)) tl in
  let f = DTapp (ps_equ, [mk e; mk (DTapp (ls, tl))]) in
  DTeps (id, dty, mk (DTquant (Tforall, vl, [], mk f)))

224
let rec dterm uc gvars denv {term_desc = desc; term_loc = loc} =
225 226 227
  let func_app e el =
    List.fold_left (fun e1 (loc, e2) ->
      DTfapp (Dterm.dterm ~loc e1, e2)) e el
228
  in
229 230 231 232
  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
    | _, [] -> func_app (mk_closure loc ls) (List.rev_append al el)
233
  in
234 235
  let qualid_app q el = match gvars q with
    | Some vs -> func_app (DTgvar vs) el
236
    | None ->
237
        let ls = find_lsymbol uc q in
238
        apply_ls (qloc q) ls [] ls.ls_args el
239
  in
240
  let qualid_app q el = match q with
241
    | Qident {id_str = n} ->
242
        (match denv_get_opt denv n with
243 244 245 246
        | Some d -> func_app d el
        | None -> qualid_app q el)
    | _ -> qualid_app q el
  in
247 248
  let rec unfold_app e1 e2 el = match e1.term_desc with
    | Tapply (e11,e12) ->
249
        let e12 = dterm uc gvars denv e12 in
250 251 252
        unfold_app e11 e12 ((e1.term_loc, e2)::el)
    | Tident q ->
        qualid_app q ((e1.term_loc, e2)::el)
253 254
    | _ ->
        func_app (DTfapp (dterm uc gvars denv e1, e2)) el
255
  in
256
  Dterm.dterm ~loc (match desc with
257
  | Ptree.Tident q ->
258
      qualid_app q []
259
  | Ptree.Tidapp (q, tl) ->
260 261
      let tl = List.map (dterm uc gvars denv) tl in
      DTapp (find_lsymbol uc q, tl)
262
  | Ptree.Tapply (e1, e2) ->
263
      unfold_app e1 (dterm uc gvars denv e2) []
264
  | Ptree.Ttuple tl ->
265
      let tl = List.map (dterm uc gvars denv) tl in
266
      DTapp (fs_tuple (List.length tl), tl)
267 268 269 270
  | Ptree.Tinfix (e12, op2, e3)
  | Ptree.Tinnfix (e12, op2, e3) ->
      let make_app de1 op de2 = if op.id_str = "infix <>" then
        let op = { op with id_str = "infix =" } in
271
        let ls = find_lsymbol uc (Qident op) in
272 273
        DTnot (Dterm.dterm ~loc (DTapp (ls, [de1;de2])))
      else
274
        DTapp (find_lsymbol uc (Qident op), [de1;de2])
275 276 277 278 279 280 281
      in
      let rec make_chain de1 = function
        | [op,de2] ->
            make_app de1 op de2
        | (op,de2) :: ch ->
            let de12 = Dterm.dterm ~loc (make_app de1 op de2) in
            let de23 = Dterm.dterm ~loc (make_chain de2 ch) in
282
            DTbinop (DTand, de12, de23)
283
        | [] -> assert false in
284 285
      let rec get_chain e12 acc = match e12.term_desc with
        | Tinfix (e1, op1, e2) when chainable_op uc op1 ->
286
            get_chain e1 ((op1, dterm uc gvars denv e2) :: acc)
287
        | _ -> e12, acc in
288
      let ch = [op2, dterm uc gvars denv e3] in
289 290
      let e1, ch = if chainable_op uc op2
        then get_chain e12 ch else e12, ch in
291
      make_chain (dterm uc gvars denv e1) ch
292
  | Ptree.Tconst c ->
293
      DTconst c
294
  | Ptree.Tlet (x, e1, e2) ->
295
      let id = create_user_id x in
296
      let e1 = dterm uc gvars denv e1 in
297
      let denv = denv_add_let denv e1 id in
298
      let e2 = dterm uc gvars denv e2 in
299
      DTlet (e1, id, e2)
300
  | Ptree.Tmatch (e1, bl) ->
301
      let e1 = dterm uc gvars denv e1 in
302 303 304
      let branch (p, e) =
        let p = dpattern uc p in
        let denv = denv_add_pat denv p in
305
        p, dterm uc gvars denv e in
306
      DTcase (e1, List.map branch bl)
307
  | Ptree.Tif (e1, e2, e3) ->
308 309 310
      let e1 = dterm uc gvars denv e1 in
      let e2 = dterm uc gvars denv e2 in
      let e3 = dterm uc gvars denv e3 in
311
      DTif (e1, e2, e3)
312
  | Ptree.Ttrue ->
313
      DTtrue
314
  | Ptree.Tfalse ->
315
      DTfalse
316
  | Ptree.Tunop (Ptree.Tnot, e1) ->
317
      DTnot (dterm uc gvars denv e1)
318
  | Ptree.Tbinop (e1, op, e2) ->
319 320
      let e1 = dterm uc gvars denv e1 in
      let e2 = dterm uc gvars denv e2 in
321
      let op = match op with
322 323 324 325 326 327
        | Ptree.Tand -> DTand
        | Ptree.Tand_asym -> DTand_asym
        | Ptree.Tor -> DTor
        | Ptree.Tor_asym -> DTor_asym
        | Ptree.Timplies -> DTimplies
        | Ptree.Tiff -> DTiff in
328
      DTbinop (op, e1, e2)
329
  | Ptree.Tquant (q, uqu, trl, e1) ->
330 331
      let qvl = List.map (quant_var uc) uqu in
      let denv = denv_add_quant denv qvl in
332 333 334
      let dterm e = dterm uc gvars denv e in
      let trl = List.map (List.map dterm) trl in
      let e1 = dterm e1 in
335
      begin match q with
336 337 338
        | Ptree.Tforall -> DTquant (Term.Tforall, qvl, trl, e1)
        | Ptree.Texists -> DTquant (Term.Texists, qvl, trl, e1)
        | Ptree.Tlambda ->
339
            let id = id_user "fc" loc and dty = dty_fresh () in
340 341
            let add acc (x, _) =
              let arg = Dterm.dterm ~loc (denv_get denv (preid_name x)) in
342
              DTapp (fs_func_app, [Dterm.dterm ~loc acc; arg]) in
343
            let app = List.fold_left add (DTvar ("fc",dty)) qvl in
344 345 346 347
            let f = DTapp (ps_equ, [Dterm.dterm ~loc app; e1]) in
            let f = DTquant (Tforall, qvl, trl, Dterm.dterm ~loc f) in
            DTeps (id, dty, Dterm.dterm ~loc f)
      end
348
  | Ptree.Trecord fl ->
349
      let get_val cs pj = function
350
        | Some e -> dterm uc gvars denv e
351 352 353
        | None -> Loc.error ~loc (RecordFieldMissing (cs,pj)) in
      let cs, fl = parse_record ~loc uc get_val fl in
      DTapp (cs, fl)
354
  | Ptree.Tupdate (e1, fl) ->
355
      let e1 = dterm uc gvars denv e1 in
356 357
      let re = is_reusable e1 in
      let v = if re then e1 else mk_var "_q " e1 in
358
      let get_val _ pj = function
359
        | Some e -> dterm uc gvars denv e
360
        | None -> Dterm.dterm ~loc (DTapp (pj,[v])) in
361
      let cs, fl = parse_record ~loc uc get_val fl in
362 363
      let d = DTapp (cs, fl) in
      if re then d else mk_let ~loc "_q " e1 d
364
  | Ptree.Tnamed (Lpos uloc, e1) ->
365
      DTuloc (dterm uc gvars denv e1, uloc)
366
  | Ptree.Tnamed (Lstr lab, e1) ->
367
      DTlabel (dterm uc gvars denv e1, Slab.singleton lab)
368
  | Ptree.Tcast (e1, ty) ->
369
      DTcast (dterm uc gvars denv e1, ty_of_pty uc ty))
370 371

(** Export for program parsing *)
Andrei Paskevich's avatar
Andrei Paskevich committed
372

373 374
let type_term uc gvars t =
  let t = dterm uc gvars denv_empty t in
375
  Dterm.term ~strict:true ~keep_loc:true t
Andrei Paskevich's avatar
Andrei Paskevich committed
376

377 378
let type_fmla uc gvars f =
  let f = dterm uc gvars denv_empty f in
379
  Dterm.fmla ~strict:true ~keep_loc:true f
Andrei Paskevich's avatar
Andrei Paskevich committed
380

381
(** Typing declarations *)
Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
382

Andrei Paskevich's avatar
Andrei Paskevich committed
383
let tyl_of_params ?(noop=false) uc pl =
384 385 386
  let ty_of_param (loc,_,gh,ty) =
    if gh then Loc.errorm ~loc
      "ghost parameters are not allowed in pure declarations";
Andrei Paskevich's avatar
Andrei Paskevich committed
387
    ty_of_pty ~noop uc ty in
388 389
  List.map ty_of_param pl

390
let add_types dl th =
391
  let def = List.fold_left
392
    (fun def d ->
393
      let id = d.td_ident.id_str in
394
      Mstr.add_new (Loc.Located (d.td_loc, ClashSymbol id)) id d def)
395
    Mstr.empty dl
396
  in
397
  let tysymbols = Hstr.create 17 in
398
  let rec visit x =
399
    let d = Mstr.find x def in
400
    try
401
      match Hstr.find tysymbols x with
402
        | None -> Loc.errorm ~loc:d.td_loc "Cyclic type definition"
403
        | Some ts -> ts
404
    with Not_found ->
405 406
      Hstr.add tysymbols x None;
      let vars = Hstr.create 17 in
407
      let vl = List.map (fun id ->
408 409 410 411
        if Hstr.mem vars id.id_str then
          Loc.error ~loc:id.id_loc (DuplicateTypeVar id.id_str);
        let i = tv_of_string id.id_str in
        Hstr.add vars id.id_str i;
412
        i) d.td_params
413
      in
414
      let id = create_user_id d.td_ident in
415
      let ts = match d.td_def with
416 417
        | TDalias ty ->
            let rec apply = function
418
              | PTtyvar (v, _) ->
419
                  begin
420 421
                    try ty_var (Hstr.find vars v.id_str) with Not_found ->
                      Loc.error ~loc:v.id_loc (UnboundTypeVar v.id_str)
422
                  end
423
              | PTtyapp (q, tyl) ->
424
                  let ts = match q with
425 426
                    | Qident x when Mstr.mem x.id_str def ->
                        visit x.id_str
427
                    | Qident _ | Qdot _ ->
428
                        find_tysymbol th q
429
                  in
430
                  Loc.try2 ~loc:(qloc q) ty_app ts (List.map apply tyl)
431
              | PTtuple tyl ->
432 433
                  let ts = ts_tuple (List.length tyl) in
                  ty_app ts (List.map apply tyl)
434
              | PTarrow (ty1, ty2) ->
435
                  ty_func (apply ty1) (apply ty2)
436
              | PTparen ty ->
437
                  apply ty
438 439 440 441 442 443
            in
            create_tysymbol id vl (Some (apply ty))
        | TDabstract | TDalgebraic _ ->
            create_tysymbol id vl None
        | TDrecord _ ->
            assert false
444
      in
445
      Hstr.add tysymbols x (Some ts);
446 447
      ts
  in
448 449
  let th' =
    let add_ts (abstr,alias) d =
450
      let ts = visit d.td_ident.id_str in
451 452 453 454 455 456
      if ts.ts_def = None then ts::abstr, alias else abstr, ts::alias in
    let abstr,alias = List.fold_left add_ts ([],[]) dl in
    try
      let th = List.fold_left add_ty_decl th abstr in
      let th = List.fold_left add_ty_decl th alias in
      th
457 458
    with ClashSymbol s ->
      Loc.error ~loc:(Mstr.find s def).td_loc (ClashSymbol s)
459
  in
460
  let csymbols = Hstr.create 17 in
461
  let decl d (abstr,algeb,alias) =
462
    let ts = match Hstr.find tysymbols d.td_ident.id_str with
463
      | None ->
464
          assert false
465
      | Some ts ->
466
          ts
467
    in
468 469 470
    match d.td_def with
      | TDabstract -> ts::abstr, algeb, alias
      | TDalias _ -> abstr, algeb, ts::alias
471
      | TDalgebraic cl ->
472
          let ht = Hstr.create 17 in
473
          let constr = List.length cl in
474
          let opaque = Stv.of_list ts.ts_args in
475
          let ty = ty_app ts (List.map ty_var ts.ts_args) in
476
          let projection (_,id,_,_) fty = match id with
477
            | None -> None
478
            | Some ({ id_str = x; id_loc = loc } as id) ->
479
                try
480
                  let pj = Hstr.find ht x in
481
                  let ty = Opt.get pj.ls_value in
482
                  ignore (Loc.try2 ~loc ty_equal_check ty fty);
483
                  Some pj
484 485
                with Not_found ->
                  let fn = create_user_id id in
486
                  let pj = create_fsymbol ~opaque fn [ty] fty in
487 488
                  Hstr.replace csymbols x loc;
                  Hstr.replace ht x pj;
489
                  Some pj
490
          in
491
          let constructor (loc, id, pl) =
492
            let tyl = tyl_of_params ~noop:true th' pl in
493
            let pjl = List.map2 projection pl tyl in
494
            Hstr.replace csymbols id.id_str loc;
495
            create_fsymbol ~opaque ~constr (create_user_id id) tyl ty, pjl
496
          in
497
          abstr, (ts, List.map constructor cl) :: algeb, alias
498
      | TDrecord _ ->
499
          assert false
500
  in
501 502 503 504 505 506
  let abstr,algeb,alias = List.fold_right decl dl ([],[],[]) in
  try
    let th = List.fold_left add_ty_decl th abstr in
    let th = if algeb = [] then th else add_data_decl th algeb in
    let th = List.fold_left add_ty_decl th alias in
    th
507 508
  with
    | ClashSymbol s ->
509
        Loc.error ~loc:(Hstr.find csymbols s) (ClashSymbol s)
510
    | RecordFieldMissing ({ ls_name = { id_string = s }} as cs,ls) ->
511
        Loc.error ~loc:(Hstr.find csymbols s) (RecordFieldMissing (cs,ls))
512
    | DuplicateRecordField ({ ls_name = { id_string = s }} as cs,ls) ->
513
        Loc.error ~loc:(Hstr.find csymbols s) (DuplicateRecordField (cs,ls))
514

515 516
let prepare_typedef td =
  if td.td_model then
517
    Loc.errorm ~loc:td.td_loc "model types are not allowed in pure theories";
518
  if td.td_vis <> Public then
519
    Loc.errorm ~loc:td.td_loc "pure types cannot be abstract or private";
520
  if td.td_inv <> [] then
521
    Loc.errorm ~loc:td.td_loc "pure types cannot have invariants";
522
  match td.td_def with
523 524 525
  | TDabstract | TDalgebraic _ | TDalias _ ->
      td
  | TDrecord fl ->
526 527
      let field { f_loc = loc; f_ident = id; f_pty = ty;
                  f_mutable = mut; f_ghost = gh } =
528 529
        if mut then Loc.errorm ~loc "a logic record field cannot be mutable";
        if gh then Loc.errorm ~loc "a logic record field cannot be ghost";
530
        loc, Some id, false, ty
531
      in
532
      (* constructor for type t is "mk t" (and not String.capitalize t) *)
533
      let id = { td.td_ident with id_str = "mk " ^ td.td_ident.id_str } in
534 535 536
      { td with td_def = TDalgebraic [td.td_loc, id, List.map field fl] }

let add_types dl th =
537
  add_types (List.map prepare_typedef dl) th
538

539
let add_logics dl th =
540
  let lsymbols = Hstr.create 17 in
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
541
  (* 1. create all symbols and make an environment with these symbols *)
542
  let create_symbol th d =
543
    let id = d.ld_ident.id_str in
544
    let v = create_user_id d.ld_ident in
Andrei Paskevich's avatar
Andrei Paskevich committed
545
    let pl = tyl_of_params th d.ld_params in
546 547 548 549 550 551 552 553
    let ty = Opt.map (ty_of_pty th) d.ld_type in
    let opaque = opaque_tvs d.ld_params in
    (* for abstract lsymbols fresh tyvars are opaque *)
    let opaque = if d.ld_def = None && ty <> None then
      let atvs = List.fold_left ty_freevars Stv.empty pl in
      let vtvs = oty_freevars Stv.empty ty in
      Stv.union opaque (Stv.diff vtvs atvs)
    else opaque in
554 555
    let ls = create_lsymbol ~opaque v pl ty in
    Hstr.add lsymbols id ls;
556
    Loc.try2 ~loc:d.ld_loc add_param_decl th ls
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
557 558 559
  in
  let th' = List.fold_left create_symbol th dl in
  (* 2. then type-check all definitions *)
560
  let type_decl d (abst,defn) =
561
    let id = d.ld_ident.id_str in
562
    let ls = Hstr.find lsymbols id in
563
    let create_var (loc,x,_,_) ty =
564
      let id = match x with
565
        | Some id -> create_user_id id
566 567
        | None -> id_user "_" loc in
      create_vsymbol id ty in
568
    let vl = List.map2 create_var d.ld_params ls.ls_args in
569
    let add_var mvs (_,x,_,_) vs = match x with
570
      | Some {id_str = x} -> Mstr.add_new (DuplicateVar x) x (DTgvar vs) mvs
571 572
      | None -> mvs in
    let denv = List.fold_left2 add_var denv_empty d.ld_params vl in
573 574 575
    match d.ld_def, d.ld_type with
    | None, _ -> ls :: abst, defn
    | Some e, None -> (* predicate *)
576
        let f = dterm th' (fun _ -> None) denv e in
577
        let f = fmla ~strict:true ~keep_loc:true f in
578
        abst, (ls, vl, f) :: defn
579
    | Some e, Some ty -> (* function *)
580
        let e = { e with term_desc = Tcast (e, ty) } in
581
        let t = dterm th' (fun _ -> None) denv e in
582
        let t = term ~strict:true ~keep_loc:true t in
583
        abst, (ls, vl, t) :: defn
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
584
  in
585
  let abst,defn = List.fold_right type_decl dl ([],[]) in
586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617
  (* 3. detect opacity *)
  let ldefns defn =
    let ht = Hls.create 3 in
    let add_ls (ls,_,_) =
      let tvs = oty_freevars Stv.empty ls.ls_value in
      let tvs = List.fold_left ty_freevars tvs ls.ls_args in
      Hls.replace ht ls tvs in
    List.iter add_ls defn;
    let compared s ls args value =
      let sbs = oty_match Mtv.empty ls.ls_value value in
      let sbs = List.fold_left2 ty_match sbs ls.ls_args args in
      let opq = try Hls.find ht ls with Not_found -> ls.ls_opaque in
      Mtv.fold (fun _ ty s -> ty_freevars s ty) (Mtv.set_diff sbs opq) s in
    let check_ld fixp (ls,_,t) =
      let opq = Hls.find ht ls in
      let npq = Stv.diff opq (t_app_fold compared Stv.empty t) in
      Hls.replace ht ls npq;
      fixp && Stv.equal opq npq in
    let rec fixp () =
      if not (List.fold_left check_ld true defn) then fixp () in
    fixp ();
    let mk_sbs sbs ({ls_name = id} as ls,_,_) =
      let opaque = Stv.union ls.ls_opaque (Hls.find ht ls) in
      if Stv.equal ls.ls_opaque opaque then sbs else
      let nls = create_lsymbol ~opaque (id_clone id) ls.ls_args ls.ls_value in
      Mls.add ls nls sbs in
    let sbs = List.fold_left mk_sbs Mls.empty defn in
    let mk_ld (ls,vl,t) =
      let get_ls ls = Mls.find_def ls ls sbs in
      make_ls_defn (get_ls ls) vl (t_s_map (fun ty -> ty) get_ls t) in
    List.map mk_ld defn
  in
618
  let th = List.fold_left add_param_decl th abst in
619
  let th = if defn = [] then th else add_logic_decl th (ldefns defn) in
620
  th
621

Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
622
let add_prop k loc s f th =
623
  let pr = create_prsymbol (create_user_id s) in
624
  let f = type_fmla th (fun _ -> None) f in
625
  Loc.try4 ~loc add_prop_decl th k pr f
626

627
let loc_of_id id = Opt.get id.Ident.id_loc
628

629
let add_inductives s dl th =
630
  (* 1. create all symbols and make an environment with these symbols *)
631
  let psymbols = Hstr.create 17 in
632
  let create_symbol th d =
633
    let id = d.in_ident.id_str in
634
    let v = create_user_id d.in_ident in
Andrei Paskevich's avatar
Andrei Paskevich committed
635
    let pl = tyl_of_params th d.in_params in
636
    let opaque = opaque_tvs d.in_params in
637
    let ps = create_psymbol ~opaque v pl in
638
    Hstr.add psymbols id ps;
639
    Loc.try2 ~loc:d.in_loc add_param_decl th ps
640
  in
641 642
  let th' = List.fold_left create_symbol th dl in
  (* 2. then type-check all definitions *)
643
  let propsyms = Hstr.create 17 in
644
  let type_decl d =
645
    let id = d.in_ident.id_str in
646
    let ps = Hstr.find psymbols id in
647
    let clause (loc, id, f) =
648
      Hstr.replace propsyms id.id_str loc;
649
      let f = type_fmla th' (fun _ -> None) f in
650
      create_prsymbol (create_user_id id), f
651 652 653
    in
    ps, List.map clause d.in_def
  in
654
  try add_ind_decl th s (List.map type_decl dl)
Andrei Paskevich's avatar
Andrei Paskevich committed
655
  with
656
  | ClashSymbol s ->
657
      Loc.error ~loc:(Hstr.find propsyms s) (ClashSymbol s)
658
  | InvalidIndDecl (ls,pr) ->
659
      Loc.error ~loc:(loc_of_id pr.pr_name) (InvalidIndDecl (ls,pr))
660
  | NonPositiveIndDecl (ls,pr,s) ->
661
      Loc.error ~loc:(loc_of_id pr.pr_name) (NonPositiveIndDecl (ls,pr,s))
662

663
(* parse declarations *)
664

665
let find_theory env lenv q = match q with
666
  | Qident { id_str = id } -> (* local theory *)
667
      begin try Mstr.find id lenv
668
      with Not_found -> read_theory env [] id end
669
  | Qdot (p, { id_str = id }) -> (* theory in file f *)
670
      read_theory env (string_list_of_qualid p) id
671

672 673
let rec clone_ns kn sl path ns2 ns1 s =
  let qualid fmt path = Pp.print_list
674 675
    (fun fmt () -> Format.pp_print_char fmt '.')
    Format.pp_print_string fmt (List.rev path) in
676
  let s = Mstr.fold (fun nm ns1 acc ->
677 678
    let ns2 = Mstr.find_def empty_ns nm ns2.ns_ns in
    clone_ns kn sl (nm::path) ns2 ns1 acc) ns1.ns_ns s
679
  in
680
  let inst_ts = Mstr.fold (fun nm ts1 acc ->
681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701
    match Mstr.find_opt nm ns2.ns_ts with
    | Some ts2 when ts_equal ts1 ts2 -> acc
    | Some _ when not (Sid.mem ts1.ts_name sl) ->
        raise (NonLocal ts1.ts_name)
    | Some _ when ts1.ts_def <> None ->
        raise (CannotInstantiate ts1.ts_name)
    | Some ts2 ->
        begin match (Mid.find ts1.ts_name kn).d_node with
          | Decl.Dtype _ -> Mts.add_new (ClashSymbol nm) ts1 ts2 acc
          | _ -> raise (CannotInstantiate ts1.ts_name)
        end
    | None when not (Sid.mem ts1.ts_name sl) -> acc
    | None when ts1.ts_def <> None -> acc
    | None ->
        begin match (Mid.find ts1.ts_name kn).d_node with
          | Decl.Dtype _ -> Loc.errorm
              "type symbol %a not found in the target theory"
              qualid (nm::path)
          | _ -> acc
        end)
    ns1.ns_ts s.inst_ts
702
  in
703
  let inst_ls = Mstr.fold (fun nm ls1 acc ->
704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722
    match Mstr.find_opt nm ns2.ns_ls with
    | Some ls2 when ls_equal ls1 ls2 -> acc
    | Some _ when not (Sid.mem ls1.ls_name sl) ->
       raise (NonLocal ls1.ls_name)
    | Some ls2 ->
        begin match (Mid.find ls1.ls_name kn).d_node with
          | Decl.Dparam _ -> Mls.add_new (ClashSymbol nm) ls1 ls2 acc
          | _ -> raise (CannotInstantiate ls1.ls_name)
        end
    | None when not (Sid.mem ls1.ls_name sl) -> acc
    | None ->
        begin match (Mid.find ls1.ls_name kn).d_node with
          | Decl.Dparam _ -> Loc.errorm
              "%s symbol %a not found in the target theory"
              (if ls1.ls_value <> None then "function" else "predicate")
              qualid (nm::path)
          | _ -> acc
        end)
    ns1.ns_ls s.inst_ls
723 724 725
  in
  { s with inst_ts = inst_ts; inst_ls = inst_ls }

726
let add_decl loc th = function
727
  | Ptree.Dtype dl ->
728
      add_types dl th
729
  | Ptree.Dlogic dl ->
730
      add_logics dl th
731
  | Ptree.Dind (s, dl) ->