typing.ml 30 KB
Newer Older
Andrei Paskevich's avatar
Andrei Paskevich committed
1 2 3
(********************************************************************)
(*                                                                  *)
(*  The Why3 Verification Platform   /   The Why3 Development Team  *)
4
(*  Copyright 2010-2013   --   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 42 43
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)
44

45
(** symbol lookup *)
46 47

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

let rec print_qualid fmt = function
  | Qdot (p, id) -> Format.fprintf fmt "%a.%s" print_qualid p id.id
  | Qident id    -> Format.fprintf fmt "%s" id.id
54

55 56 57 58 59
let string_list_of_qualid q =
  let rec sloq acc = function
    | Qdot (p, id) -> sloq (id.id :: acc) p
    | Qident id -> id.id :: acc in
  sloq [] q
60

61
exception UnboundSymbol of qualid
62

63
let find_qualid get_id find ns q =
64 65 66 67 68
  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
  if Debug.test_flag Glob.flag then Glob.use (qloc q) (get_id r);
  r
69

70 71 72
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
73

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

79 80
let find_psymbol_ns ns q =
  let ls = find_lsymbol_ns ns q in
81 82
  if ls.ls_value = None then ls else
    Loc.error ~loc:(qloc q) (PredicateSymbolExpected ls)
83

84 85 86 87 88
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
89

90 91
let find_namespace_ns ns q =
  find_qualid (fun _ -> Glob.dummy_id) ns_find_ns ns q
92

93 94 95
(** Parsing types *)

let create_user_tv =
96 97
  let hs = Hstr.create 17 in fun s ->
  try Hstr.find hs s with Not_found ->
98 99 100
  let tv = create_tvsymbol (id_fresh s) in
  Hstr.add hs s tv;
  tv
101

102 103 104 105 106 107 108
let ty_of_pty_top ~noop uc pty =
  let rec get_ty = function
    | PPTtyvar ({id_loc = loc}, true) when noop ->
        Loc.errorm ~loc "Opaqueness@ annotations@ are@ only@ \
          allowed@ in@ function@ and@ predicate@ prototypes"
    | PPTtyvar ({id = x}, _) ->
        ty_var (create_user_tv x)
109 110
    | PPTtyapp (q, tyl) ->
        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 114 115 116 117 118 119 120 121 122 123
    | PPTtuple tyl ->
        let ts = ts_tuple (List.length tyl) in
        ty_app ts (List.map get_ty tyl)
    | PPTarrow (ty1, ty2) ->
        ty_func (get_ty ty1) (get_ty ty2)
    | PPTparen ty ->
        get_ty ty
  in
  get_ty pty

let ty_of_pty uc pty = ty_of_pty_top ~noop:true uc pty
124

125
let opaque_tvs args =
126 127 128 129 130 131 132
  let rec opaque_tvs acc = function
    | PPTtyvar (id, true) -> Stv.add (create_user_tv id.id) acc
    | PPTtyvar (_, false) -> acc
    | PPTtyapp (_, pl)
    | PPTtuple pl -> List.fold_left opaque_tvs acc pl
    | PPTarrow (ty1, ty2) -> opaque_tvs (opaque_tvs acc ty1) ty2
    | PPTparen ty -> opaque_tvs acc ty in
133
  List.fold_left (fun acc (_,_,_,ty) -> opaque_tvs acc ty) Stv.empty args
134

135
(** typing using destructive type variables
136

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

144 145
(** Typing patterns, terms, and formulas *)

146 147 148 149 150
let create_user_id {id = n; id_lab = label; id_loc = loc} =
  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
151 152

let parse_record ~loc uc get_val fl =
153
  let fl = List.map (fun (q,e) -> find_lsymbol uc q, e) fl in
154 155 156 157
  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

158 159 160 161
let rec dpattern uc { pat_desc = desc; pat_loc = loc } =
  Dterm.dpattern ~loc (match desc with
    | PPpwild -> DPwild
    | PPpvar x -> DPvar (create_user_id x)
162
    | PPpapp (q,pl) ->
163
        let pl = List.map (dpattern uc) pl in
164
        DPapp (find_lsymbol uc q, pl)
165 166 167 168 169 170 171 172 173 174 175
    | PPptuple pl ->
        let pl = List.map (dpattern uc) pl in
        DPapp (fs_tuple (List.length pl), pl)
    | PPprec fl ->
        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)
    | PPpas (p, x) -> DPas (dpattern uc p, create_user_id x)
    | PPpor (p, q) -> DPor (dpattern uc p, dpattern uc q))
176 177 178 179 180 181 182 183 184

let quant_var uc (x,ty) =
  create_user_id x, match ty with
    | Some ty -> dty_of_ty (ty_of_pty uc ty)
    | None -> dty_fresh ()

let chainable_op uc op =
  (* non-bool -> non-bool -> bool *)
  op.id = "infix =" || op.id = "infix <>" ||
185 186 187 188 189 190
  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
191

192 193 194 195 196 197 198
type global_vs = Ptree.qualid -> vsymbol option

let rec dterm uc (gvars: global_vs) denv {pp_desc = desc; pp_loc = loc} =
  let pterm denv pp = dterm uc gvars denv pp in
  let highord_app e1 e2 =
    DTapp (fs_func_app, [Dterm.dterm ~loc e1; pterm denv e2]) in
  let highord_app e1 el = List.fold_left highord_app e1 el in
199
  let qualid_app q el = match gvars q with
200 201 202
    | Some vs ->
        highord_app (DTgvar vs) el
    | None ->
203
        let ls = find_lsymbol uc q in
204 205 206 207 208 209
        let rec take al l el = match l, el with
          | (_::l), (e::el) -> take (pterm denv e :: al) l el
          | _, _ -> List.rev al, el in
        let al, el = take [] ls.ls_args el in
        highord_app (DTapp (ls,al)) el
  in
210
  let qualid_app q el = match q with
211 212 213
    | Qident {id = n} ->
        (match denv_get_opt denv n with
        | Some dt -> highord_app dt el
214 215
        | None -> qualid_app q el)
    | _ -> qualid_app q el
216
  in
217 218 219 220 221 222 223 224 225 226 227 228 229 230
  Dterm.dterm ~loc (match desc with
  | PPvar x ->
      qualid_app x []
  | PPapp (x, tl) ->
      qualid_app x tl
  | PPhoapp (e1, e2) ->
      DTapp (fs_func_app, [pterm denv e1; pterm denv e2])
  | PPtuple tl ->
      let tl = List.map (pterm denv) tl in
      DTapp (fs_tuple (List.length tl), tl)
  | PPinfix (e12, op2, e3)
  | PPinnfix (e12, op2, e3) ->
      let make_app de1 op de2 = if op.id = "infix <>" then
        let op = { op with id = "infix =" } in
231
        let ls = find_lsymbol uc (Qident op) in
232 233
        DTnot (Dterm.dterm ~loc (DTapp (ls, [de1;de2])))
      else
234
        DTapp (find_lsymbol uc (Qident op), [de1;de2])
235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325
      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
            DTbinop (Tand, de12, de23)
        | [] -> assert false in
      let rec get_chain e12 acc = match e12.pp_desc with
        | PPinfix (e1, op1, e2) when chainable_op uc op1 ->
            get_chain e1 ((op1, pterm denv e2) :: acc)
        | _ -> e12, acc in
      let ch = [op2, pterm denv e3] in
      let e1, ch = if chainable_op uc op2
        then get_chain e12 ch else e12, ch in
      make_chain (pterm denv e1) ch
  | PPconst c ->
      DTconst c
  | PPlet (x, e1, e2) ->
      let id = create_user_id x in
      let e1 = pterm denv e1 in
      let denv = denv_add_let denv e1 id in
      let e2 = pterm denv e2 in
      DTlet (e1, id, e2)
  | PPmatch (e1, bl) ->
      let e1 = pterm denv e1 in
      let branch (p, e) =
        let p = dpattern uc p in
        let denv = denv_add_pat denv p in
        p, pterm denv e in
      DTcase (e1, List.map branch bl)
  | PPif (e1, e2, e3) ->
      let e1 = pterm denv e1 in
      let e2 = pterm denv e2 in
      let e3 = pterm denv e3 in
      DTif (e1, e2, e3)
  | PPtrue ->
      DTtrue
  | PPfalse ->
      DTfalse
  | PPunop (PPnot, e1) ->
      DTnot (pterm denv e1)
  | PPbinop (e1, op, e2) ->
      let e1 = pterm denv e1 in
      let e2 = pterm denv e2 in
      let op = match op with
        | PPand -> Tand
        | PPor -> Tor
        | PPimplies -> Timplies
        | PPiff -> Tiff in
      DTbinop (op, e1, e2)
  | PPquant (q, uqu, trl, e1) ->
      let qvl = List.map (quant_var uc) uqu in
      let denv = denv_add_quant denv qvl in
      let trl = List.map (List.map (pterm denv)) trl in
      let e1 = pterm denv e1 in
      begin match q with
        | PPforall -> DTquant (Tforall, qvl, trl, e1)
        | PPexists -> DTquant (Texists, qvl, trl, e1)
        | PPlambda ->
            let id = id_user "fc" loc and dty = dty_fresh () in
            let add acc ({id = x}, _) =
              let arg = Dterm.dterm ~loc (denv_get denv x) in
              DTapp (fs_func_app, [Dterm.dterm ~loc acc; arg]) in
            let app = List.fold_left add (DTvar ("fc",dty)) uqu in
            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
  | PPrecord fl ->
      let get_val cs pj = function
        | Some e -> pterm denv e
        | None -> Loc.error ~loc (RecordFieldMissing (cs,pj)) in
      let cs, fl = parse_record ~loc uc get_val fl in
      DTapp (cs, fl)
  | PPupdate (e1, fl) ->
      let e1 = pterm denv e1 in
      let get_val _ pj = function
        | Some e -> pterm denv e
        | None -> Dterm.dterm ~loc (DTapp (pj,[e1])) in
      let cs, fl = parse_record ~loc uc get_val fl in
      DTapp (cs, fl)
  | PPnamed (Lpos uloc, e1) ->
      DTuloc (pterm denv e1, uloc)
  | PPnamed (Lstr lab, e1) ->
      DTlabel (pterm denv e1, Slab.singleton lab)
  | PPcast (e1, ty) ->
      DTcast (pterm denv e1, ty_of_pty uc ty))

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

327 328
let type_term uc gvars t =
  let t = dterm uc gvars denv_empty t in
329
  Dterm.term ~strict:true ~keep_loc:true t
Andrei Paskevich's avatar
Andrei Paskevich committed
330

331 332
let type_fmla uc gvars f =
  let f = dterm uc gvars denv_empty f in
333
  Dterm.fmla ~strict:true ~keep_loc:true f
Andrei Paskevich's avatar
Andrei Paskevich committed
334

335
(** Typing declarations *)
Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
336

337
let tyl_of_params ~noop uc pl =
338 339 340
  let ty_of_param (loc,_,gh,ty) =
    if gh then Loc.errorm ~loc
      "ghost parameters are not allowed in pure declarations";
341
    ty_of_pty_top ~noop uc ty in
342 343
  List.map ty_of_param pl

344
let add_types dl th =
345
  let def = List.fold_left
346
    (fun def d ->
347
      let id = d.td_ident.id in
348
      Mstr.add_new (Loc.Located (d.td_loc, ClashSymbol id)) id d def)
349
    Mstr.empty dl
350
  in
351
  let tysymbols = Hstr.create 17 in
352
  let rec visit x =
353
    let d = Mstr.find x def in
354
    try
355
      match Hstr.find tysymbols x with
356
        | None -> Loc.errorm ~loc:d.td_loc "Cyclic type definition"
357
        | Some ts -> ts
358
    with Not_found ->
359 360
      Hstr.add tysymbols x None;
      let vars = Hstr.create 17 in
361
      let vl = List.map (fun id ->
362
        if Hstr.mem vars id.id then
363
          Loc.error ~loc:id.id_loc (DuplicateTypeVar id.id);
364
        let i = create_user_tv id.id in
365
        Hstr.add vars id.id i;
366
        i) d.td_params
367
      in
368
      let id = create_user_id d.td_ident in
369
      let ts = match d.td_def with
370 371
        | TDalias ty ->
            let rec apply = function
372
              | PPTtyvar (v, _) ->
373
                  begin
374 375
                    try ty_var (Hstr.find vars v.id) with Not_found ->
                      Loc.error ~loc:v.id_loc (UnboundTypeVar v.id)
376
                  end
377
              | PPTtyapp (q, tyl) ->
378 379 380 381
                  let ts = match q with
                    | Qident x when Mstr.mem x.id def ->
                        visit x.id
                    | Qident _ | Qdot _ ->
382
                        find_tysymbol th q
383
                  in
384
                  Loc.try2 ~loc:(qloc q) ty_app ts (List.map apply tyl)
385 386 387
              | PPTtuple tyl ->
                  let ts = ts_tuple (List.length tyl) in
                  ty_app ts (List.map apply tyl)
388 389 390 391
              | PPTarrow (ty1, ty2) ->
                  ty_func (apply ty1) (apply ty2)
              | PPTparen ty ->
                  apply ty
392 393 394 395 396 397
            in
            create_tysymbol id vl (Some (apply ty))
        | TDabstract | TDalgebraic _ ->
            create_tysymbol id vl None
        | TDrecord _ ->
            assert false
398
      in
399
      Hstr.add tysymbols x (Some ts);
400 401
      ts
  in
402 403 404 405 406 407 408 409 410
  let th' =
    let add_ts (abstr,alias) d =
      let ts = visit d.td_ident.id in
      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
411 412
    with ClashSymbol s ->
      Loc.error ~loc:(Mstr.find s def).td_loc (ClashSymbol s)
413
  in
414
  let csymbols = Hstr.create 17 in
415
  let decl d (abstr,algeb,alias) =
416
    let ts = match Hstr.find tysymbols d.td_ident.id with
417
      | None ->
418
          assert false
419
      | Some ts ->
420
          ts
421
    in
422 423 424
    match d.td_def with
      | TDabstract -> ts::abstr, algeb, alias
      | TDalias _ -> abstr, algeb, ts::alias
425
      | TDalgebraic cl ->
426
          let ht = Hstr.create 17 in
427
          let constr = List.length cl in
428
          let opaque = Stv.of_list ts.ts_args in
429
          let ty = ty_app ts (List.map ty_var ts.ts_args) in
430
          let projection (_,id,_,_) fty = match id with
431
            | None -> None
432
            | Some ({ id = x; id_loc = loc } as id) ->
433
                try
434
                  let pj = Hstr.find ht x in
435
                  let ty = Opt.get pj.ls_value in
436
                  ignore (Loc.try2 ~loc ty_equal_check ty fty);
437
                  Some pj
438 439
                with Not_found ->
                  let fn = create_user_id id in
440
                  let pj = create_fsymbol ~opaque fn [ty] fty in
441 442
                  Hstr.replace csymbols x loc;
                  Hstr.replace ht x pj;
443
                  Some pj
444
          in
445
          let constructor (loc, id, pl) =
446
            let tyl = tyl_of_params ~noop:true th' pl in
447
            let pjl = List.map2 projection pl tyl in
448
            Hstr.replace csymbols id.id loc;
449
            create_fsymbol ~opaque ~constr (create_user_id id) tyl ty, pjl
450
          in
451
          abstr, (ts, List.map constructor cl) :: algeb, alias
452
      | TDrecord _ ->
453
          assert false
454
  in
455 456 457 458 459 460
  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
461 462
  with
    | ClashSymbol s ->
463
        Loc.error ~loc:(Hstr.find csymbols s) (ClashSymbol s)
464
    | RecordFieldMissing ({ ls_name = { id_string = s }} as cs,ls) ->
465
        Loc.error ~loc:(Hstr.find csymbols s) (RecordFieldMissing (cs,ls))
466
    | DuplicateRecordField ({ ls_name = { id_string = s }} as cs,ls) ->
467
        Loc.error ~loc:(Hstr.find csymbols s) (DuplicateRecordField (cs,ls))
468

469 470
let prepare_typedef td =
  if td.td_model then
471
    Loc.errorm ~loc:td.td_loc "model types are not allowed in pure theories";
472
  if td.td_vis <> Public then
473
    Loc.errorm ~loc:td.td_loc "pure types cannot be abstract or private";
474
  if td.td_inv <> [] then
475
    Loc.errorm ~loc:td.td_loc "pure types cannot have invariants";
476
  match td.td_def with
477 478 479
  | TDabstract | TDalgebraic _ | TDalias _ ->
      td
  | TDrecord fl ->
480 481
      let field { f_loc = loc; f_ident = id; f_pty = ty;
                  f_mutable = mut; f_ghost = gh } =
482 483
        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";
484
        loc, Some id, false, ty
485
      in
486 487
      (* constructor for type t is "mk t" (and not String.capitalize t) *)
      let id = { td.td_ident with id = "mk " ^ td.td_ident.id } in
488 489 490
      { td with td_def = TDalgebraic [td.td_loc, id, List.map field fl] }

let add_types dl th =
491
  add_types (List.map prepare_typedef dl) th
492

493
let add_logics dl th =
494
  let lsymbols = Hstr.create 17 in
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
495
  (* 1. create all symbols and make an environment with these symbols *)
496
  let create_symbol th d =
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
497
    let id = d.ld_ident.id in
498
    let v = create_user_id d.ld_ident in
499
    let pl = tyl_of_params ~noop:false th d.ld_params in
500 501 502 503 504 505 506 507
    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
508 509
    let ls = create_lsymbol ~opaque v pl ty in
    Hstr.add lsymbols id ls;
510
    Loc.try2 ~loc:d.ld_loc add_param_decl th ls
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
511 512 513
  in
  let th' = List.fold_left create_symbol th dl in
  (* 2. then type-check all definitions *)
514
  let type_decl d (abst,defn) =
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
515
    let id = d.ld_ident.id in
516
    let ls = Hstr.find lsymbols id in
517
    let create_var (loc,x,_,_) ty =
518
      let id = match x with
519
        | Some id -> create_user_id id
520 521
        | None -> id_user "_" loc in
      create_vsymbol id ty in
522
    let vl = List.map2 create_var d.ld_params ls.ls_args in
523 524 525 526
    let add_var mvs (_,x,_,_) vs = match x with
      | Some {id = id} -> Mstr.add_new (DuplicateVar id) id (DTgvar vs) mvs
      | None -> mvs in
    let denv = List.fold_left2 add_var denv_empty d.ld_params vl in
527 528 529
    match d.ld_def, d.ld_type with
    | None, _ -> ls :: abst, defn
    | Some e, None -> (* predicate *)
530
        let f = dterm th' (fun _ -> None) denv e in
531
        let f = fmla ~strict:true ~keep_loc:true f in
532
        abst, (ls, vl, f) :: defn
533
    | Some e, Some ty -> (* function *)
534 535
        let e = { e with pp_desc = PPcast (e, ty) } in
        let t = dterm th' (fun _ -> None) denv e in
536
        let t = term ~strict:true ~keep_loc:true t in
537
        abst, (ls, vl, t) :: defn
Jean-Christophe Filliâtre's avatar
logic  
Jean-Christophe Filliâtre committed
538
  in
539
  let abst,defn = List.fold_right type_decl dl ([],[]) in
540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571
  (* 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
572
  let th = List.fold_left add_param_decl th abst in
573
  let th = if defn = [] then th else add_logic_decl th (ldefns defn) in
574
  th
575

Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
576
let add_prop k loc s f th =
577
  let pr = create_prsymbol (create_user_id s) in
578
  let f = type_fmla th (fun _ -> None) f in
579
  Loc.try4 ~loc add_prop_decl th k pr f
580

581
let loc_of_id id = Opt.get id.Ident.id_loc
582

583
let add_inductives s dl th =
584
  (* 1. create all symbols and make an environment with these symbols *)
585
  let psymbols = Hstr.create 17 in
586
  let create_symbol th d =
587
    let id = d.in_ident.id in
588
    let v = create_user_id d.in_ident in
589
    let pl = tyl_of_params ~noop:false th d.in_params in
590
    let opaque = opaque_tvs d.in_params in
591
    let ps = create_psymbol ~opaque v pl in
592
    Hstr.add psymbols id ps;
593
    Loc.try2 ~loc:d.in_loc add_param_decl th ps
594
  in
595 596
  let th' = List.fold_left create_symbol th dl in
  (* 2. then type-check all definitions *)
597
  let propsyms = Hstr.create 17 in
598
  let type_decl d =
599
    let id = d.in_ident.id in
600
    let ps = Hstr.find psymbols id in
601
    let clause (loc, id, f) =
602
      Hstr.replace propsyms id.id loc;
603
      let f = type_fmla th' (fun _ -> None) f in
604
      create_prsymbol (create_user_id id), f
605 606 607
    in
    ps, List.map clause d.in_def
  in
608
  try add_ind_decl th s (List.map type_decl dl)
Andrei Paskevich's avatar
Andrei Paskevich committed
609
  with
610
  | ClashSymbol s ->
611
      Loc.error ~loc:(Hstr.find propsyms s) (ClashSymbol s)
612
  | InvalidIndDecl (ls,pr) ->
613
      Loc.error ~loc:(loc_of_id pr.pr_name) (InvalidIndDecl (ls,pr))
614
  | NonPositiveIndDecl (ls,pr,s) ->
615
      Loc.error ~loc:(loc_of_id pr.pr_name) (NonPositiveIndDecl (ls,pr,s))
616

617
(* parse declarations *)
618

Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
619
let prop_kind = function
620 621 622
  | Kaxiom -> Paxiom
  | Kgoal -> Pgoal
  | Klemma -> Plemma
Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
623

624 625
let find_theory env lenv q = match q with
  | Qident { id = id } -> (* local theory *)
626
      begin try Mstr.find id lenv
Andrei Paskevich's avatar
Andrei Paskevich committed
627
      with Not_found -> read_lib_theory env [] id end
628 629
  | Qdot (p, { id = id }) -> (* theory in file f *)
      read_lib_theory env (string_list_of_qualid p) id
630

631 632
let rec clone_ns kn sl path ns2 ns1 s =
  let qualid fmt path = Pp.print_list
633 634
    (fun fmt () -> Format.pp_print_char fmt '.')
    Format.pp_print_string fmt (List.rev path) in
635
  let s = Mstr.fold (fun nm ns1 acc ->
636 637
    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
638
  in
639
  let inst_ts = Mstr.fold (fun nm ts1 acc ->
640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660
    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
661
  in
662
  let inst_ls = Mstr.fold (fun nm ls1 acc ->
663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681
    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
682 683 684
  in
  { s with inst_ts = inst_ts; inst_ls = inst_ls }

685
let add_decl loc th = function
686
  | Ptree.TypeDecl dl ->
687
      add_types dl th
688
  | Ptree.LogicDecl dl ->
689
      add_logics dl th
690
  | Ptree.IndDecl (s, dl) ->
691
      add_inductives s dl th
692
  | Ptree.PropDecl (k, s, f) ->
Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
693
      add_prop (prop_kind k) loc s f th
694
  | Ptree.Meta (id, al) ->
695
      let convert = function
696
        | PMAty (PPTtyapp (q,[]))
697
                   -> MAts (find_tysymbol th q)
698
        | PMAty ty -> MAty (ty_of_pty th ty)
699 700 701
        | PMAfs q  -> MAls (find_fsymbol th q)
        | PMAps q  -> MAls (find_psymbol th q)
        | PMApr q  -> MApr (find_prop th q)
702
        | PMAstr s -> MAstr s
703
        | PMAint i -> MAint i
704
      in
705
      let add s = add_meta th (lookup_meta s) (List.map convert al) in
706
      Loc.try1 ~loc add id.id
Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
707

708 709
let add_decl loc th d =
  if Debug.test_flag debug_parse_only then th else
710
  Loc.try3 ~loc add_decl loc th d
711

712 713 714
let type_inst th t s =
  let add_inst s = function
    | CSns (loc,p,q) ->
715 716
      let ns1 = Opt.fold find_namespace_ns t.th_export p in
      let ns2 = Opt.fold find_namespace_ns (get_namespace th) q in
717
      Loc.try6 ~loc clone_ns t.th_known t.th_local [] ns2 ns1 s
718
    | CStsym (loc,p,[],PPTtyapp (q,[])) ->
719 720
      let ts1 = find_tysymbol_ns t.th_export p in
      let ts2 = find_tysymbol th q in
721
      if Mts.mem ts1 s.inst_ts
722
      then Loc.error ~loc (ClashSymbol ts1.ts_name.id_string);
723
      { s with inst_ts = Mts.add ts1 ts2 s.inst_ts }
724
    | CStsym (loc,p,tvl,pty) ->
725
      let ts1 = find_tysymbol_ns t.th_export p in
726 727 728
      let id = id_user (ts1.ts_name.id_string ^ "_subst") loc in
      let tvl = List.map (fun id -> create_user_tv id.id) tvl in
      let def = Some (ty_of_pty th pty) in
729
      let ts2 = Loc.try3 ~loc create_tysymbol id tvl def in
730
      if Mts.mem ts1 s.inst_ts
731
      then Loc.error ~loc (ClashSymbol ts1.ts_name.id_string);
732
      { s with inst_ts = Mts.add ts1 ts2 s.inst_ts }
733
    | CSfsym (loc,p,q) ->
734 735
      let ls1 = find_fsymbol_ns t.th_export p in
      let ls2 = find_fsymbol th q in
736
      if Mls.mem ls1 s.inst_ls
737
      then Loc.error ~loc (ClashSymbol ls1.ls_name.id_string);
738 739
      { s with inst_ls = Mls.add ls1 ls2 s.inst_ls }
    | CSpsym (loc,p,q) ->
740 741
      let ls1 = find_psymbol_ns t.th_export p in
      let ls2 = find_psymbol th q in
742
      if Mls.mem ls1 s.inst_ls
743
      then Loc.error ~loc (ClashSymbol ls1.ls_name.id_string);
744 745
      { s with inst_ls = Mls.add ls1 ls2 s.inst_ls }
    | CSlemma (loc,p) ->
746
      let pr = find_prop_ns t.th_export p in
747
      if Spr.mem pr s.inst_lemma || Spr.mem pr s.inst_goal
748
      then Loc.error ~loc (ClashSymbol pr.pr_name.id_string);
749 750
      { s with inst_lemma = Spr.add pr s.inst_lemma }
    | CSgoal (loc,p) ->
751
      let pr = find_prop_ns t.th_export p in
752
      if Spr.mem pr s.inst_lemma || Spr.mem pr s.inst_goal
753
      then Loc.error ~loc (ClashSymbol pr.pr_name.id_string);
754 755 756 757
      { s with inst_goal = Spr.add pr s.inst_goal }
  in
  List.fold_left add_inst empty_inst s

758
let add_use_clone env lenv th loc (use, subst) =
759
  if Debug.test_flag debug_parse_only then th else
760
  let use_or_clone th =
761 762
    let t = find_theory env lenv use.use_theory in
    if Debug.test_flag Glob.flag then Glob.use (qloc use.use_theory) t.th_name;
763
    match subst with
764
    | None -> use_export th t
765 766 767
    | Some s ->
        warn_clone_not_abstract loc t;
        clone_export th t (type_inst th t s)
768
  in
769 770
  let use_or_clone th = match use.use_import with
    | Some (import, use_as) ->
771
        (* use T = namespace T use_export T end *)
772
        let th = open_namespace th use_as in
773
        let th = use_or_clone th in
774
        close_namespace th import
775 776
    | None ->
        use_or_clone th
777
  in
778
  Loc.try1 ~loc use_or_clone th
Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
779

780
let close_theory lenv th =
781
  if Debug.test_flag debug_parse_only then lenv else
782 783
  let th = close_theory th in
  let id = th.th_name.id_string in
784
  let loc = th.th_name.Ident.id_loc in
785
  if Mstr.mem id lenv then Loc.error ?loc (ClashTheory id);
786
  Mstr.add id th lenv
Jean-Christophe Filliâtre's avatar
Jean-Christophe Filliâtre committed
787

788
let close_namespace loc import th =
789
  Loc.try2 ~loc close_namespace th import
790

791 792 793 794 795 796 797 798
(* incremental parsing *)

let open_file, close_file =
  let lenv = Stack.create () in
  let uc   = Stack.create () in
  let open_file env path =
    Stack.push Mstr.empty lenv;
    let open_theory id =
799
      Stack.push (Theory.create_theory ~path (create_user_id id)) uc in
800 801
    let close_theory () =
      Stack.push (close_theory (Stack.pop lenv) (Stack.pop uc)) lenv in
802 803 804 805
    let open_namespace name =
      Stack.push (Theory.open_namespace (Stack.pop uc) name) uc in
    let close_namespace loc imp =
      Stack.push (close_namespace loc imp (Stack.pop uc)) uc in
806 807 808 809 810 811 812 813 814 815 816 817 818
    let new_decl loc d =
      Stack.push (add_decl loc (Stack.pop uc) d) uc in
    let use_clone loc use =
      let lenv = Stack.top lenv in
      Stack.push (add_use_clone env lenv (Stack.pop uc) loc use) uc in
    { open_theory = open_theory;
      close_theory = close_theory;
      open_namespace = open_namespace;
      close_namespace = close_namespace;
      new_decl = new_decl;
      use_clone = use_clone;
      open_module = (fun _ -> assert false);
      close_module = (fun _ -> assert false);
819
      new_pdecl = (fun _ -> assert false); }
820 821 822 823
  in
  let close_file () = Stack.pop lenv in
  open_file, close_file

824 825 826 827
(** Exception printing *)

let () = Exn_printer.register (fun fmt e -> match e with
  | UnboundSymbol q ->
828
      Format.fprintf fmt "unbound symbol '%a'" print_qualid q
829
  | UnboundTypeVar s ->
830
      Format.fprintf fmt "unbound type variable '%s" s