typing.ml 31.3 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
let mk_closure loc ls =
  let mk dt = Dterm.dterm ~loc dt 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
Andrei Paskevich's avatar
Andrei Paskevich committed
217
  DTquant (DTlambda, vl, [], mk (DTapp (ls, List.map mk_t vl)))
218

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

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

360 361
let type_term uc gvars t =
  let t = dterm uc gvars denv_empty t in
362
  Dterm.term ~strict:true ~keep_loc:true t
Andrei Paskevich's avatar
Andrei Paskevich committed
363

364 365
let type_fmla uc gvars f =
  let f = dterm uc gvars denv_empty f in
366
  Dterm.fmla ~strict:true ~keep_loc:true f
Andrei Paskevich's avatar
Andrei Paskevich committed
367

368
(** Typing declarations *)
Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
369

Andrei Paskevich's avatar
Andrei Paskevich committed
370
let tyl_of_params ?(noop=false) uc pl =
371 372 373
  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
374
    ty_of_pty ~noop uc ty in
375 376
  List.map ty_of_param pl

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

502 503
let prepare_typedef td =
  if td.td_model then
504
    Loc.errorm ~loc:td.td_loc "model types are not allowed in pure theories";
505
  if td.td_vis <> Public then
506
    Loc.errorm ~loc:td.td_loc "pure types cannot be abstract or private";
507
  if td.td_inv <> [] then
508
    Loc.errorm ~loc:td.td_loc "pure types cannot have invariants";
509
  match td.td_def with
510 511 512
  | TDabstract | TDalgebraic _ | TDalias _ ->
      td
  | TDrecord fl ->
513 514
      let field { f_loc = loc; f_ident = id; f_pty = ty;
                  f_mutable = mut; f_ghost = gh } =
515 516
        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";
517
        loc, Some id, false, ty
518
      in
519
      (* constructor for type t is "mk t" (and not String.capitalize t) *)
520
      let id = { td.td_ident with id_str = "mk " ^ td.td_ident.id_str } in
521 522 523
      { td with td_def = TDalgebraic [td.td_loc, id, List.map field fl] }

let add_types dl th =
524
  add_types (List.map prepare_typedef dl) th
525

526
let add_logics dl th =
527
  let lsymbols = Hstr.create 17 in
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
528
  (* 1. create all symbols and make an environment with these symbols *)
529
  let create_symbol th d =
530
    let id = d.ld_ident.id_str in
531
    let v = create_user_id d.ld_ident in
Andrei Paskevich's avatar
Andrei Paskevich committed
532
    let pl = tyl_of_params th d.ld_params in
533 534 535 536 537 538 539 540
    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
541 542
    let ls = create_lsymbol ~opaque v pl ty in
    Hstr.add lsymbols id ls;
543
    Loc.try2 ~loc:d.ld_loc add_param_decl th ls
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
544 545 546
  in
  let th' = List.fold_left create_symbol th dl in
  (* 2. then type-check all definitions *)
547
  let type_decl d (abst,defn) =
548
    let id = d.ld_ident.id_str in
549
    let ls = Hstr.find lsymbols id in
550
    let create_var (loc,x,_,_) ty =
551
      let id = match x with
552
        | Some id -> create_user_id id
553 554
        | None -> id_user "_" loc in
      create_vsymbol id ty in
555
    let vl = List.map2 create_var d.ld_params ls.ls_args in
556
    let add_var mvs (_,x,_,_) vs = match x with
557
      | Some {id_str = x} -> Mstr.add_new (DuplicateVar x) x (DTgvar vs) mvs
558 559
      | None -> mvs in
    let denv = List.fold_left2 add_var denv_empty d.ld_params vl in
560 561 562
    match d.ld_def, d.ld_type with
    | None, _ -> ls :: abst, defn
    | Some e, None -> (* predicate *)
563
        let f = dterm th' (fun _ -> None) denv e in
564
        let f = fmla ~strict:true ~keep_loc:true f in
565
        abst, (ls, vl, f) :: defn
566
    | Some e, Some ty -> (* function *)
567
        let e = { e with term_desc = Tcast (e, ty) } in
568
        let t = dterm th' (fun _ -> None) denv e in
569
        let t = term ~strict:true ~keep_loc:true t in
570
        abst, (ls, vl, t) :: defn
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
571
  in
572
  let abst,defn = List.fold_right type_decl dl ([],[]) in
573 574 575 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 604
  (* 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
605
  let th = List.fold_left add_param_decl th abst in
606
  let th = if defn = [] then th else add_logic_decl th (ldefns defn) in
607
  th
608

Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
609
let add_prop k loc s f th =
610
  let pr = create_prsymbol (create_user_id s) in
611
  let f = type_fmla th (fun _ -> None) f in
612
  Loc.try4 ~loc add_prop_decl th k pr f
613

614
let loc_of_id id = Opt.get id.Ident.id_loc
615

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

650
(* parse declarations *)
651

652
let find_theory env lenv q = match q with
653
  | Qident { id_str = id } -> (* local theory *)
654
      begin try Mstr.find id lenv
655
      with Not_found -> read_theory env [] id end
656
  | Qdot (p, { id_str = id }) -> (* theory in file f *)
657
      read_theory env (string_list_of_qualid p) id
658

659 660
let rec clone_ns kn sl path ns2 ns1 s =
  let qualid fmt path = Pp.print_list
661 662
    (fun fmt () -> Format.pp_print_char fmt '.')
    Format.pp_print_string fmt (List.rev path) in
663
  let s = Mstr.fold (fun nm ns1 acc ->
664 665
    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
666
  in
667
  let inst_ts = Mstr.fold (fun nm ts1 acc ->
668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688
    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
689
  in
690
  let inst_ls = Mstr.fold (fun nm ls1 acc ->
691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709
    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
710 711 712
  in
  { s with inst_ts = inst_ts; inst_ls = inst_ls }

713
let add_decl loc th = function
714
  | Ptree.Dtype dl ->
715
      add_types dl th
716
  | Ptree.Dlogic dl ->
717
      add_logics dl th
718
  | Ptree.Dind (s, dl) ->
719
      add_inductives s dl th
720 721 722
  | Ptree.Dprop (k, s, f) ->
      add_prop k loc s f th
  | Ptree.Dmeta (id, al) ->
723
      let convert = function
724 725 726 727 728 729 730 731
        | Ptree.Mty (PTtyapp (q,[]))
                       -> MAts (find_tysymbol th q)
        | Ptree.Mty ty -> MAty (ty_of_pty th ty)
        | Ptree.Mfs q  -> MAls (find_fsymbol th q)
        | Ptree.Mps q  -> MAls (find_psymbol th q)
        | Ptree.Mpr q  -> MApr (find_prop th q)
        | Ptree.Mstr s -> MAstr s
        | Ptree.Mint i -> MAint i in
732
      let add s = add_meta th (lookup_meta s) (List.map convert al) in