src/Pure/Isar/expression.ML
author ballarin
Thu Nov 27 10:29:07 2008 +0100 (2008-11-27)
changeset 28895 4e2914c2f8c5
parent 28885 6f6bf52e75bb
child 28898 530c7d28a962
permissions -rw-r--r--
Sublocale command.
ballarin@28697
     1
(*  Title:      Pure/Isar/expression.ML
ballarin@28697
     2
    ID:         $Id$
ballarin@28697
     3
    Author:     Clemens Ballarin, TU Muenchen
ballarin@28697
     4
ballarin@28795
     5
New locale development --- experimental.
ballarin@28697
     6
*)
ballarin@28697
     7
ballarin@28697
     8
signature EXPRESSION =
ballarin@28697
     9
sig
ballarin@28885
    10
  datatype 'term map = Positional of 'term option list | Named of (string * 'term) list;
ballarin@28885
    11
  type 'term expr = (string * (string * 'term map)) list;
ballarin@28885
    12
  type expression = string expr * (Name.binding * string option * mixfix) list;
ballarin@28885
    13
  type expression_i = term expr * (Name.binding * typ option * mixfix) list;
ballarin@28697
    14
ballarin@28879
    15
  (* Processing of locale statements *)
ballarin@28879
    16
  val read_statement: Element.context list -> (string * string list) list list ->
ballarin@28879
    17
    Proof.context ->  (term * term list) list list * Proof.context;
ballarin@28879
    18
  val cert_statement: Element.context_i list -> (term * term list) list list ->
ballarin@28879
    19
    Proof.context -> (term * term list) list list * Proof.context;
ballarin@28879
    20
ballarin@28795
    21
  (* Declaring locales *)
ballarin@28795
    22
  val add_locale: string -> bstring -> expression -> Element.context list -> theory ->
ballarin@28795
    23
    string * Proof.context
ballarin@28795
    24
  val add_locale_i: string -> bstring -> expression_i -> Element.context_i list -> theory ->
ballarin@28795
    25
    string * Proof.context
ballarin@28885
    26
ballarin@28895
    27
  (* Interpretation *)
ballarin@28895
    28
  val sublocale: (thm list list -> Proof.context -> Proof.context) ->
ballarin@28895
    29
    string -> expression -> theory -> Proof.state;
ballarin@28895
    30
  val sublocale_i: (thm list list -> Proof.context -> Proof.context) ->
ballarin@28895
    31
    string -> expression_i -> theory -> Proof.state;
ballarin@28895
    32
ballarin@28795
    33
  (* Debugging and development *)
ballarin@28795
    34
  val parse_expression: OuterParse.token list -> expression * OuterParse.token list
ballarin@28697
    35
end;
ballarin@28697
    36
ballarin@28697
    37
ballarin@28885
    38
structure Expression : EXPRESSION =
ballarin@28697
    39
struct
ballarin@28697
    40
ballarin@28795
    41
datatype ctxt = datatype Element.ctxt;
ballarin@28795
    42
ballarin@28795
    43
ballarin@28795
    44
(*** Expressions ***)
ballarin@28697
    45
ballarin@28872
    46
datatype 'term map =
ballarin@28872
    47
  Positional of 'term option list |
ballarin@28872
    48
  Named of (string * 'term) list;
ballarin@28697
    49
ballarin@28885
    50
type 'term expr = (string * (string * 'term map)) list;
ballarin@28697
    51
ballarin@28885
    52
type expression = string expr * (Name.binding * string option * mixfix) list;
ballarin@28885
    53
type expression_i = term expr * (Name.binding * typ option * mixfix) list;
ballarin@28795
    54
ballarin@28697
    55
ballarin@28697
    56
(** Parsing and printing **)
ballarin@28697
    57
ballarin@28697
    58
local
ballarin@28697
    59
ballarin@28697
    60
structure P = OuterParse;
ballarin@28697
    61
ballarin@28697
    62
val loc_keyword = P.$$$ "fixes" || P.$$$ "constrains" || P.$$$ "assumes" ||
ballarin@28795
    63
   P.$$$ "defines" || P.$$$ "notes";
ballarin@28697
    64
fun plus1_unless test scan =
ballarin@28697
    65
  scan ::: Scan.repeat (P.$$$ "+" |-- Scan.unless test (P.!!! scan));
ballarin@28697
    66
ballarin@28697
    67
val prefix = P.name --| P.$$$ ":";
ballarin@28697
    68
val named = P.name -- (P.$$$ "=" |-- P.term);
ballarin@28697
    69
val position = P.maybe P.term;
ballarin@28697
    70
val instance = P.$$$ "where" |-- P.and_list1 named >> Named ||
ballarin@28697
    71
  Scan.repeat1 position >> Positional;
ballarin@28697
    72
ballarin@28697
    73
in
ballarin@28697
    74
ballarin@28795
    75
val parse_expression =
ballarin@28697
    76
  let
ballarin@28697
    77
    fun expr2 x = P.xname x;
ballarin@28697
    78
    fun expr1 x = (Scan.optional prefix "" -- expr2 --
ballarin@28697
    79
      Scan.optional instance (Named []) >> (fn ((p, l), i) => (l, (p, i)))) x;
ballarin@28885
    80
    fun expr0 x = (plus1_unless loc_keyword expr1) x;
ballarin@28697
    81
  in expr0 -- P.for_fixes end;
ballarin@28697
    82
ballarin@28697
    83
end;
ballarin@28697
    84
ballarin@28885
    85
fun pretty_expr thy expr =
ballarin@28795
    86
  let
ballarin@28795
    87
    fun pretty_pos NONE = Pretty.str "_"
ballarin@28795
    88
      | pretty_pos (SOME x) = Pretty.str x;
ballarin@28795
    89
    fun pretty_named (x, y) = [Pretty.str x, Pretty.brk 1, Pretty.str "=",
ballarin@28795
    90
          Pretty.brk 1, Pretty.str y] |> Pretty.block;
ballarin@28795
    91
    fun pretty_ren (Positional ps) = take_suffix is_none ps |> snd |>
ballarin@28795
    92
          map pretty_pos |> Pretty.breaks
ballarin@28795
    93
      | pretty_ren (Named []) = []
ballarin@28795
    94
      | pretty_ren (Named ps) = Pretty.str "where" :: Pretty.brk 1 ::
ballarin@28795
    95
          (ps |> map pretty_named |> Pretty.separate "and");
ballarin@28795
    96
    fun pretty_rename (loc, ("", ren)) =
ballarin@28795
    97
          Pretty.block (Pretty.str (NewLocale.extern thy loc) :: Pretty.brk 1 :: pretty_ren ren) 
ballarin@28795
    98
      | pretty_rename (loc, (prfx, ren)) =
ballarin@28795
    99
          Pretty.block (Pretty.str prfx :: Pretty.brk 1 :: Pretty.str (NewLocale.extern thy loc) ::
ballarin@28795
   100
            Pretty.brk 1 :: pretty_ren ren);
ballarin@28795
   101
  in Pretty.separate "+" (map pretty_rename expr) |> Pretty.block end;
ballarin@28795
   102
ballarin@28885
   103
fun err_in_expr thy msg expr =
ballarin@28795
   104
  let
ballarin@28795
   105
    val err_msg =
ballarin@28795
   106
      if null expr then msg
ballarin@28795
   107
      else msg ^ "\n" ^ Pretty.string_of (Pretty.block
ballarin@28795
   108
        [Pretty.str "The above error(s) occurred in expression:", Pretty.brk 1,
ballarin@28885
   109
          pretty_expr thy expr])
ballarin@28795
   110
  in error err_msg end;
ballarin@28697
   111
ballarin@28697
   112
ballarin@28859
   113
(** Internalise locale names in expr **)
ballarin@28697
   114
ballarin@28885
   115
fun intern thy instances =  map (apfst (NewLocale.intern thy)) instances;
ballarin@28697
   116
ballarin@28697
   117
ballarin@28859
   118
(** Parameters of expression.
ballarin@28697
   119
ballarin@28895
   120
   Sanity check of instantiations and extraction of implicit parameters.
ballarin@28895
   121
   The latter only occurs iff strict = false.
ballarin@28895
   122
   Positional instantiations are extended to match full length of parameter list
ballarin@28895
   123
   of instantiated locale. **)
ballarin@28895
   124
ballarin@28895
   125
fun parameters_of thy strict (expr, fixed) =
ballarin@28697
   126
  let
ballarin@28697
   127
    fun reject_dups message xs =
ballarin@28697
   128
      let val dups = duplicates (op =) xs
ballarin@28697
   129
      in
ballarin@28697
   130
        if null dups then () else error (message ^ commas dups)
ballarin@28697
   131
      end;
ballarin@28697
   132
ballarin@28795
   133
    fun match_bind (n, b) = (n = Name.name_of b);
ballarin@28795
   134
    fun bind_eq (b1, b2) = (Name.name_of b1 = Name.name_of b2);
ballarin@28795
   135
      (* FIXME: cannot compare bindings for equality. *)
ballarin@28795
   136
ballarin@28795
   137
    fun params_loc loc =
ballarin@28859
   138
          (NewLocale.params_of thy loc |> map (fn (p, _, mx) => (p, mx)), loc);
ballarin@28795
   139
    fun params_inst (expr as (loc, (prfx, Positional insts))) =
ballarin@28697
   140
          let
ballarin@28795
   141
            val (ps, loc') = params_loc loc;
ballarin@28697
   142
	    val d = length ps - length insts;
ballarin@28697
   143
	    val insts' =
ballarin@28879
   144
	      if d < 0 then error ("More arguments than parameters in instantiation of locale " ^
ballarin@28879
   145
                quote (NewLocale.extern thy loc))
ballarin@28697
   146
	      else insts @ replicate d NONE;
ballarin@28697
   147
            val ps' = (ps ~~ insts') |>
ballarin@28697
   148
              map_filter (fn (p, NONE) => SOME p | (_, SOME _) => NONE);
ballarin@28885
   149
          in (ps', (loc', (prfx, Positional insts'))) end
ballarin@28795
   150
      | params_inst (expr as (loc, (prfx, Named insts))) =
ballarin@28697
   151
          let
ballarin@28697
   152
            val _ = reject_dups "Duplicate instantiation of the following parameter(s): "
ballarin@28859
   153
              (map fst insts);
ballarin@28697
   154
ballarin@28795
   155
            val (ps, loc') = params_loc loc;
ballarin@28697
   156
            val ps' = fold (fn (p, _) => fn ps =>
ballarin@28795
   157
              if AList.defined match_bind ps p then AList.delete match_bind p ps
ballarin@28859
   158
              else error (quote p ^" not a parameter of instantiated expression.")) insts ps;
ballarin@28885
   159
          in (ps', (loc', (prfx, Named insts))) end;
ballarin@28885
   160
    fun params_expr is =
ballarin@28697
   161
          let
ballarin@28697
   162
            val (is', ps') = fold_map (fn i => fn ps =>
ballarin@28697
   163
              let
ballarin@28795
   164
                val (ps', i') = params_inst i;
ballarin@28795
   165
                val ps'' = AList.join bind_eq (fn p => fn (mx1, mx2) =>
ballarin@28795
   166
                  (* FIXME: should check for bindings being the same.
ballarin@28795
   167
                     Instead we check for equal name and syntax. *)
ballarin@28697
   168
                  if mx1 = mx2 then mx1
haftmann@28862
   169
                  else error ("Conflicting syntax for parameter" ^ quote (Name.display p) ^
ballarin@28859
   170
                    " in expression.")) (ps, ps')
ballarin@28697
   171
              in (i', ps'') end) is []
ballarin@28885
   172
          in (ps', is') end;
ballarin@28697
   173
ballarin@28895
   174
    val (implicit, expr') = params_expr expr;
ballarin@28697
   175
ballarin@28895
   176
    val implicit' = map (#1 #> Name.name_of) implicit;
ballarin@28697
   177
    val fixed' = map (#1 #> Name.name_of) fixed;
ballarin@28697
   178
    val _ = reject_dups "Duplicate fixed parameter(s): " fixed';
ballarin@28895
   179
    val implicit'' = if strict then []
ballarin@28895
   180
      else let val _ = reject_dups
ballarin@28895
   181
          "Parameter(s) declared simultaneously in expression and for clause: " (implicit' @ fixed')
ballarin@28895
   182
        in map (fn (b, mx) => (b, NONE, mx)) implicit end;
ballarin@28697
   183
ballarin@28895
   184
  in (expr', implicit'' @ fixed) end;
ballarin@28697
   185
ballarin@28795
   186
ballarin@28795
   187
(** Read instantiation **)
ballarin@28795
   188
ballarin@28872
   189
(* Parse positional or named instantiation *)
ballarin@28872
   190
ballarin@28859
   191
local
ballarin@28859
   192
ballarin@28872
   193
fun prep_inst parse_term parms (Positional insts) ctxt =
ballarin@28872
   194
      (insts ~~ parms) |> map (fn
ballarin@28872
   195
        (NONE, p) => Syntax.parse_term ctxt p |
ballarin@28872
   196
        (SOME t, _) => parse_term ctxt t)
ballarin@28872
   197
  | prep_inst parse_term parms (Named insts) ctxt =
ballarin@28872
   198
      parms |> map (fn p => case AList.lookup (op =) insts p of
ballarin@28872
   199
        SOME t => parse_term ctxt t |
ballarin@28872
   200
        NONE => Syntax.parse_term ctxt p);
ballarin@28872
   201
ballarin@28872
   202
in
ballarin@28872
   203
ballarin@28872
   204
fun parse_inst x = prep_inst Syntax.parse_term x;
ballarin@28872
   205
fun make_inst x = prep_inst (K I) x;
ballarin@28872
   206
ballarin@28872
   207
end;
ballarin@28872
   208
ballarin@28872
   209
ballarin@28872
   210
(* Instantiation morphism *)
ballarin@28872
   211
ballarin@28872
   212
fun inst_morph (parm_names, parm_types) (prfx, insts') ctxt =
ballarin@28795
   213
  let
ballarin@28795
   214
    (* parameters *)
ballarin@28795
   215
    val type_parm_names = fold Term.add_tfreesT parm_types [] |> map fst;
ballarin@28795
   216
ballarin@28795
   217
    (* type inference and contexts *)
ballarin@28795
   218
    val parm_types' = map (TypeInfer.paramify_vars o Logic.varifyT) parm_types;
ballarin@28795
   219
    val type_parms = fold Term.add_tvarsT parm_types' [] |> map (Logic.mk_type o TVar);
ballarin@28795
   220
    val arg = type_parms @ map2 TypeInfer.constrain parm_types' insts';
ballarin@28795
   221
    val res = Syntax.check_terms ctxt arg;
ballarin@28795
   222
    val ctxt' = ctxt |> fold Variable.auto_fixes res;
ballarin@28872
   223
    
ballarin@28795
   224
    (* instantiation *)
ballarin@28795
   225
    val (type_parms'', res') = chop (length type_parms) res;
ballarin@28795
   226
    val insts'' = (parm_names ~~ res') |> map_filter
ballarin@28795
   227
      (fn (inst as (x, Free (y, _))) => if x = y then NONE else SOME inst |
ballarin@28795
   228
        inst => SOME inst);
ballarin@28795
   229
    val instT = Symtab.make (type_parm_names ~~ map Logic.dest_type type_parms'');
ballarin@28795
   230
    val inst = Symtab.make insts'';
ballarin@28795
   231
  in
ballarin@28795
   232
    (Element.inst_morphism (ProofContext.theory_of ctxt) (instT, inst) $>
ballarin@28795
   233
      Morphism.name_morphism (Name.qualified prfx), ctxt')
ballarin@28795
   234
  end;
ballarin@28859
   235
ballarin@28795
   236
ballarin@28795
   237
(*** Locale processing ***)
ballarin@28795
   238
ballarin@28852
   239
(** Parsing **)
ballarin@28852
   240
ballarin@28852
   241
fun parse_elem prep_typ prep_term ctxt elem =
ballarin@28852
   242
  Element.map_ctxt {name = I, var = I, typ = prep_typ ctxt,
ballarin@28852
   243
    term = prep_term ctxt, fact = I, attrib = I} elem;
ballarin@28852
   244
ballarin@28852
   245
fun parse_concl prep_term ctxt concl =
ballarin@28852
   246
  (map o map) (fn (t, ps) =>
ballarin@28852
   247
    (prep_term ctxt, map (prep_term ctxt) ps)) concl;
ballarin@28852
   248
ballarin@28852
   249
ballarin@28885
   250
(** Simultaneous type inference: instantiations + elements + conclusion **)
ballarin@28885
   251
ballarin@28885
   252
local
ballarin@28885
   253
ballarin@28885
   254
fun mk_type T = (Logic.mk_type T, []);
ballarin@28885
   255
fun mk_term t = (t, []);
ballarin@28885
   256
fun mk_propp (p, pats) = (Syntax.type_constraint propT p, pats);
ballarin@28852
   257
ballarin@28885
   258
fun dest_type (T, []) = Logic.dest_type T;
ballarin@28885
   259
fun dest_term (t, []) = t;
ballarin@28885
   260
fun dest_propp (p, pats) = (p, pats);
ballarin@28885
   261
ballarin@28885
   262
fun extract_inst (_, (_, ts)) = map mk_term ts;
ballarin@28885
   263
fun restore_inst ((l, (p, _)), cs) = (l, (p, map dest_term cs));
ballarin@28885
   264
ballarin@28885
   265
fun extract_elem (Fixes fixes) = map (#2 #> the_list #> map mk_type) fixes
ballarin@28885
   266
  | extract_elem (Constrains csts) = map (#2 #> single #> map mk_type) csts
ballarin@28885
   267
  | extract_elem (Assumes asms) = map (#2 #> map mk_propp) asms
ballarin@28885
   268
  | extract_elem (Defines defs) = map (fn (_, (t, ps)) => [mk_propp (t, ps)]) defs
ballarin@28852
   269
  | extract_elem (Notes _) = [];
ballarin@28795
   270
ballarin@28885
   271
fun restore_elem (Fixes fixes, css) =
ballarin@28885
   272
      (fixes ~~ css) |> map (fn ((x, _, mx), cs) =>
ballarin@28885
   273
        (x, cs |> map dest_type |> try hd, mx)) |> Fixes
ballarin@28885
   274
  | restore_elem (Constrains csts, css) =
ballarin@28885
   275
      (csts ~~ css) |> map (fn ((x, _), cs) =>
ballarin@28885
   276
        (x, cs |> map dest_type |> hd)) |> Constrains
ballarin@28885
   277
  | restore_elem (Assumes asms, css) =
ballarin@28885
   278
      (asms ~~ css) |> map (fn ((b, _), cs) => (b, map dest_propp cs)) |> Assumes
ballarin@28885
   279
  | restore_elem (Defines defs, css) =
ballarin@28885
   280
      (defs ~~ css) |> map (fn ((b, _), [c]) => (b, dest_propp c)) |> Defines
ballarin@28852
   281
  | restore_elem (Notes notes, _) = Notes notes;
ballarin@28852
   282
ballarin@28885
   283
fun check cs context =
ballarin@28885
   284
  let
ballarin@28885
   285
    fun prep (_, pats) (ctxt, t :: ts) =
ballarin@28885
   286
      let val ctxt' = Variable.auto_fixes t ctxt
ballarin@28885
   287
      in
ballarin@28885
   288
        ((t, Syntax.check_props (ProofContext.set_mode ProofContext.mode_pattern ctxt') pats),
ballarin@28885
   289
          (ctxt', ts))
ballarin@28885
   290
      end
ballarin@28885
   291
    val (cs', (context', _)) = fold_map prep cs
ballarin@28885
   292
      (context, Syntax.check_terms
ballarin@28885
   293
        (ProofContext.set_mode ProofContext.mode_schematic context) (map fst cs));
ballarin@28885
   294
  in (cs', context') end;
ballarin@28885
   295
ballarin@28885
   296
in
ballarin@28885
   297
ballarin@28872
   298
fun check_autofix insts elems concl ctxt =
ballarin@28852
   299
  let
ballarin@28885
   300
    val inst_cs = map extract_inst insts;
ballarin@28885
   301
    val elem_css = map extract_elem elems;
ballarin@28885
   302
    val concl_cs = (map o map) mk_propp concl;
ballarin@28885
   303
    (* Type inference *)
ballarin@28885
   304
    val (inst_cs' :: css', ctxt') =
ballarin@28885
   305
      (fold_burrow o fold_burrow) check (inst_cs :: elem_css @ [concl_cs]) ctxt;
ballarin@28885
   306
    (* Re-check to resolve bindings, elements and conclusion only *)
ballarin@28885
   307
    val (css'', _) = (fold_burrow o fold_burrow) check css' ctxt';
ballarin@28885
   308
    val (elem_css'', [concl_cs'']) = chop (length elem_css) css'';
ballarin@28885
   309
  in
ballarin@28885
   310
    (map restore_inst (insts ~~ inst_cs'), map restore_elem (elems ~~ elem_css''),
ballarin@28885
   311
      concl_cs'', ctxt')
ballarin@28885
   312
  end;
ballarin@28885
   313
ballarin@28885
   314
end;
ballarin@28852
   315
ballarin@28852
   316
ballarin@28852
   317
(** Prepare locale elements **)
ballarin@28795
   318
ballarin@28795
   319
fun declare_elem prep_vars (Fixes fixes) ctxt =
ballarin@28795
   320
      let val (vars, _) = prep_vars fixes ctxt
ballarin@28852
   321
      in ctxt |> ProofContext.add_fixes_i vars |> snd end
ballarin@28795
   322
  | declare_elem prep_vars (Constrains csts) ctxt =
ballarin@28852
   323
      ctxt |> prep_vars (map (fn (x, T) => (Name.binding x, SOME T, NoSyn)) csts) |> snd
ballarin@28872
   324
  | declare_elem _ (Assumes _) ctxt = ctxt
ballarin@28872
   325
  | declare_elem _ (Defines _) ctxt = ctxt
ballarin@28852
   326
  | declare_elem _ (Notes _) ctxt = ctxt;
ballarin@28795
   327
ballarin@28852
   328
(** Finish locale elements, extract specification text **)
ballarin@28795
   329
ballarin@28795
   330
val norm_term = Envir.beta_norm oo Term.subst_atomic;
ballarin@28795
   331
ballarin@28795
   332
fun abstract_thm thy eq =
ballarin@28795
   333
  Thm.assume (Thm.cterm_of thy eq) |> Drule.gen_all |> Drule.abs_def;
ballarin@28795
   334
ballarin@28795
   335
fun bind_def ctxt eq (xs, env, ths) =
ballarin@28795
   336
  let
ballarin@28795
   337
    val ((y, T), b) = LocalDefs.abs_def eq;
ballarin@28795
   338
    val b' = norm_term env b;
ballarin@28795
   339
    val th = abstract_thm (ProofContext.theory_of ctxt) eq;
ballarin@28795
   340
    fun err msg = error (msg ^ ": " ^ quote y);
ballarin@28795
   341
  in
ballarin@28795
   342
    exists (fn (x, _) => x = y) xs andalso
ballarin@28795
   343
      err "Attempt to define previously specified variable";
ballarin@28795
   344
    exists (fn (Free (y', _), _) => y = y' | _ => false) env andalso
ballarin@28795
   345
      err "Attempt to redefine variable";
ballarin@28795
   346
    (Term.add_frees b' xs, (Free (y, T), b') :: env, th :: ths)
ballarin@28795
   347
  end;
ballarin@28795
   348
ballarin@28872
   349
fun eval_text _ _ (Fixes _) text = text
ballarin@28872
   350
  | eval_text _ _ (Constrains _) text = text
ballarin@28872
   351
  | eval_text _ is_ext (Assumes asms)
ballarin@28795
   352
        (((exts, exts'), (ints, ints')), (xs, env, defs)) =
ballarin@28795
   353
      let
ballarin@28795
   354
        val ts = maps (map #1 o #2) asms;
ballarin@28795
   355
        val ts' = map (norm_term env) ts;
ballarin@28872
   356
        val spec' =
ballarin@28872
   357
          if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
ballarin@28872
   358
          else ((exts, exts'), (ints @ ts, ints' @ ts'));
ballarin@28795
   359
      in (spec', (fold Term.add_frees ts' xs, env, defs)) end
ballarin@28872
   360
  | eval_text ctxt _ (Defines defs) (spec, binds) =
ballarin@28795
   361
      (spec, fold (bind_def ctxt o #1 o #2) defs binds)
ballarin@28872
   362
  | eval_text _ _ (Notes _) text = text;
ballarin@28795
   363
ballarin@28852
   364
fun closeup _ _ false elem = elem
ballarin@28852
   365
  | closeup ctxt parms true elem =
ballarin@28795
   366
      let
ballarin@28795
   367
        fun close_frees t =
ballarin@28795
   368
          let
ballarin@28795
   369
            val rev_frees =
ballarin@28795
   370
              Term.fold_aterms (fn Free (x, T) =>
ballarin@28852
   371
                if AList.defined (op =) parms x then I else insert (op =) (x, T) | _ => I) t [];
ballarin@28795
   372
          in Term.list_all_free (rev rev_frees, t) end;
ballarin@28795
   373
ballarin@28795
   374
        fun no_binds [] = []
ballarin@28852
   375
          | no_binds _ = error "Illegal term bindings in context element";
ballarin@28795
   376
      in
ballarin@28795
   377
        (case elem of
ballarin@28795
   378
          Assumes asms => Assumes (asms |> map (fn (a, propps) =>
ballarin@28795
   379
            (a, map (fn (t, ps) => (close_frees t, no_binds ps)) propps)))
ballarin@28795
   380
        | Defines defs => Defines (defs |> map (fn (a, (t, ps)) =>
ballarin@28795
   381
            (a, (close_frees (#2 (LocalDefs.cert_def ctxt t)), no_binds ps))))
ballarin@28795
   382
        | e => e)
ballarin@28795
   383
      end;
ballarin@28795
   384
ballarin@28872
   385
fun finish_primitive parms _ (Fixes fixes) = Fixes (map (fn (binding, _, mx) =>
ballarin@28795
   386
      let val x = Name.name_of binding
ballarin@28795
   387
      in (binding, AList.lookup (op =) parms x, mx) end) fixes)
ballarin@28872
   388
  | finish_primitive _ _ (Constrains _) = Constrains []
ballarin@28872
   389
  | finish_primitive _ close (Assumes asms) = close (Assumes asms)
ballarin@28872
   390
  | finish_primitive _ close (Defines defs) = close (Defines defs)
ballarin@28872
   391
  | finish_primitive _ _ (Notes facts) = Notes facts;
ballarin@28872
   392
ballarin@28872
   393
fun finish_inst ctxt parms do_close (loc, (prfx, inst)) text =
ballarin@28872
   394
  let
ballarin@28872
   395
    val thy = ProofContext.theory_of ctxt;
ballarin@28872
   396
    val (parm_names, parm_types) = NewLocale.params_of thy loc |>
ballarin@28872
   397
      map (fn (b, SOME T, _) => (Name.name_of b, T)) |> split_list;
ballarin@28872
   398
    val (asm, defs) = NewLocale.specification_of thy loc;
ballarin@28872
   399
    val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst) ctxt;
ballarin@28872
   400
    val asm' = Option.map (Morphism.term morph) asm;
ballarin@28872
   401
    val defs' = map (Morphism.term morph) defs;
ballarin@28872
   402
    val text' = text |>
ballarin@28872
   403
      (if is_some asm
ballarin@28872
   404
        then eval_text ctxt false (Assumes [(Attrib.no_binding, [(the asm', [])])])
ballarin@28872
   405
        else I) |>
ballarin@28872
   406
      (if not (null defs)
ballarin@28872
   407
        then eval_text ctxt false (Defines (map (fn def => (Attrib.no_binding, (def, []))) defs'))
ballarin@28872
   408
        else I)
ballarin@28872
   409
(* FIXME clone from new_locale.ML *)
ballarin@28872
   410
  in ((loc, morph), text') end;
ballarin@28795
   411
ballarin@28852
   412
fun finish_elem ctxt parms do_close elem text =
ballarin@28795
   413
  let
ballarin@28872
   414
    val elem' = finish_primitive parms (closeup ctxt parms do_close) elem;
ballarin@28872
   415
    val text' = eval_text ctxt true elem' text;
ballarin@28795
   416
  in (elem', text') end
ballarin@28795
   417
  
ballarin@28872
   418
fun finish ctxt parms do_close insts elems text =
ballarin@28872
   419
  let
ballarin@28872
   420
    val (deps, text') = fold_map (finish_inst ctxt parms do_close) insts text;
ballarin@28872
   421
    val (elems', text'') = fold_map (finish_elem ctxt parms do_close) elems text';
ballarin@28872
   422
  in (deps, elems', text'') end;
ballarin@28795
   423
ballarin@28795
   424
ballarin@28895
   425
(** Process full context statement: instantiations + elements + conclusion **)
ballarin@28895
   426
ballarin@28895
   427
(* Interleave incremental parsing and type inference over entire parsed stretch. *)
ballarin@28895
   428
ballarin@28795
   429
local
ballarin@28795
   430
ballarin@28895
   431
fun prep_full_context_statement parse_typ parse_prop parse_inst prep_vars prep_expr
ballarin@28895
   432
    strict do_close context raw_import raw_elems raw_concl =
ballarin@28795
   433
  let
ballarin@28872
   434
    val thy = ProofContext.theory_of context;
ballarin@28872
   435
ballarin@28895
   436
    val (raw_insts, fixed) = parameters_of thy strict (apfst (prep_expr thy) raw_import);
ballarin@28895
   437
ballarin@28879
   438
    fun prep_inst (loc, (prfx, inst)) (i, marked, insts, ctxt) =
ballarin@28872
   439
      let
ballarin@28872
   440
        val (parm_names, parm_types) = NewLocale.params_of thy loc |>
ballarin@28872
   441
          map (fn (b, SOME T, _) => (Name.name_of b, T)) |> split_list;
ballarin@28872
   442
        val inst' = parse_inst parm_names inst ctxt;
ballarin@28885
   443
        val parm_types' = map (TypeInfer.paramify_vars o
ballarin@28885
   444
          Term.map_type_tvar (fn ((x, _), S) => TVar ((x, i), S)) o Logic.varifyT) parm_types;
ballarin@28872
   445
        val inst'' = map2 TypeInfer.constrain parm_types' inst';
ballarin@28872
   446
        val insts' = insts @ [(loc, (prfx, inst''))];
ballarin@28872
   447
        val (insts'', _, _, ctxt') = check_autofix insts' [] [] ctxt;
ballarin@28872
   448
        val inst''' = insts'' |> List.last |> snd |> snd;
ballarin@28872
   449
        val (morph, _) = inst_morph (parm_names, parm_types) (prfx, inst''') ctxt;
ballarin@28879
   450
        val (marked', ctxt'') = NewLocale.activate_declarations thy (loc, morph) (marked, ctxt);
ballarin@28879
   451
      in (i+1, marked', insts', ctxt'') end;
ballarin@28872
   452
  
ballarin@28872
   453
    fun prep_elem raw_elem (insts, elems, ctxt) =
ballarin@28852
   454
      let
ballarin@28852
   455
        val ctxt' = declare_elem prep_vars raw_elem ctxt;
ballarin@28852
   456
        val elems' = elems @ [parse_elem parse_typ parse_prop ctxt' raw_elem];
ballarin@28852
   457
        (* FIXME term bindings *)
ballarin@28872
   458
        val (_, _, _, ctxt'') = check_autofix insts elems' [] ctxt';
ballarin@28872
   459
      in (insts, elems', ctxt') end;
ballarin@28795
   460
ballarin@28872
   461
    fun prep_concl raw_concl (insts, elems, ctxt) =
ballarin@28795
   462
      let
ballarin@28852
   463
        val concl = (map o map) (fn (t, ps) =>
ballarin@28852
   464
          (parse_prop ctxt t, map (parse_prop ctxt) ps)) raw_concl;
ballarin@28872
   465
      in check_autofix insts elems concl ctxt end;
ballarin@28795
   466
ballarin@28872
   467
    val fors = prep_vars fixed context |> fst;
ballarin@28872
   468
    val ctxt = context |> ProofContext.add_fixes_i fors |> snd;
ballarin@28872
   469
    val (_, _, insts', ctxt') = fold prep_inst raw_insts (0, NewLocale.empty, [], ctxt);
ballarin@28872
   470
    val (_, elems'', ctxt'') = fold prep_elem raw_elems (insts', [], ctxt');
ballarin@28872
   471
    val (insts, elems, concl, ctxt) = prep_concl raw_concl (insts', elems'', ctxt'');
ballarin@28795
   472
ballarin@28872
   473
    (* Retrieve parameter types *)
ballarin@28795
   474
    val xs = fold (fn Fixes fixes => (fn ps => ps @ map (Name.name_of o #1) fixes) |
ballarin@28872
   475
      _ => fn ps => ps) (Fixes fors :: elems) [];
ballarin@28859
   476
    val (Ts, ctxt') = fold_map ProofContext.inferred_param xs ctxt; 
ballarin@28895
   477
    val parms = xs ~~ Ts;  (* params from expression and elements *)
ballarin@28795
   478
ballarin@28872
   479
    val Fixes fors' = finish_primitive parms I (Fixes fors);
ballarin@28872
   480
    val (deps, elems', text) = finish ctxt' parms do_close insts elems ((([], []), ([], [])), ([], [], []));
ballarin@28852
   481
    (* text has the following structure:
ballarin@28795
   482
           (((exts, exts'), (ints, ints')), (xs, env, defs))
ballarin@28795
   483
       where
ballarin@28872
   484
         exts: external assumptions (terms in assumes elements)
ballarin@28795
   485
         exts': dito, normalised wrt. env
ballarin@28872
   486
         ints: internal assumptions (terms in assumptions from insts)
ballarin@28795
   487
         ints': dito, normalised wrt. env
ballarin@28795
   488
         xs: the free variables in exts' and ints' and rhss of definitions,
ballarin@28795
   489
           this includes parameters except defined parameters
ballarin@28795
   490
         env: list of term pairs encoding substitutions, where the first term
ballarin@28795
   491
           is a free variable; substitutions represent defines elements and
ballarin@28795
   492
           the rhs is normalised wrt. the previous env
ballarin@28795
   493
         defs: theorems representing the substitutions from defines elements
ballarin@28795
   494
           (thms are normalised wrt. env).
ballarin@28795
   495
       elems is an updated version of raw_elems:
ballarin@28795
   496
         - type info added to Fixes and modified in Constrains
ballarin@28795
   497
         - axiom and definition statement replaced by corresponding one
ballarin@28795
   498
           from proppss in Assumes and Defines
ballarin@28795
   499
         - Facts unchanged
ballarin@28795
   500
       *)
ballarin@28852
   501
ballarin@28872
   502
  in ((parms, fors', deps, elems', concl), text) end
ballarin@28795
   503
ballarin@28795
   504
in
ballarin@28795
   505
ballarin@28895
   506
fun read_full_context_statement x =
ballarin@28895
   507
  prep_full_context_statement Syntax.parse_typ Syntax.parse_prop parse_inst
ballarin@28895
   508
  ProofContext.read_vars intern x;
ballarin@28895
   509
fun cert_full_context_statement x =
ballarin@28895
   510
  prep_full_context_statement (K I) (K I) make_inst ProofContext.cert_vars (K I) x;
ballarin@28795
   511
ballarin@28795
   512
end;
ballarin@28795
   513
ballarin@28795
   514
ballarin@28795
   515
(* full context statements: import + elements + conclusion *)
ballarin@28795
   516
ballarin@28795
   517
local
ballarin@28795
   518
ballarin@28895
   519
fun prep_context_statement prep_full_context_statement activate_elems
ballarin@28895
   520
    strict do_close imprt elements raw_concl context =
ballarin@28795
   521
  let
ballarin@28795
   522
    val thy = ProofContext.theory_of context;
ballarin@28795
   523
ballarin@28895
   524
    val ((parms, fixed, deps, elems, concl), (spec, (_, _, defs))) =
ballarin@28895
   525
      prep_full_context_statement strict do_close context imprt elements raw_concl;
ballarin@28879
   526
ballarin@28895
   527
    val (_, ctxt0) = ProofContext.add_fixes_i fixed context;
ballarin@28879
   528
    val (_, ctxt) = fold (NewLocale.activate_facts thy) deps (NewLocale.empty, ctxt0);  
ballarin@28879
   529
    val ((elems', _), ctxt') = activate_elems elems (ProofContext.set_stmt true ctxt);
ballarin@28795
   530
  in
ballarin@28895
   531
    (((fixed, deps), (ctxt', elems'), (parms, spec, defs)), concl)
ballarin@28879
   532
  end;
ballarin@28879
   533
ballarin@28879
   534
fun prep_statement prep_ctxt elems concl ctxt =
ballarin@28879
   535
  let
ballarin@28895
   536
    val (((_, (ctxt', _), _)), concl) = prep_ctxt true false ([], []) elems concl ctxt
ballarin@28879
   537
  in (concl, ctxt') end;
ballarin@28795
   538
ballarin@28795
   539
in
ballarin@28795
   540
ballarin@28879
   541
fun read_statement body concl ctxt =
ballarin@28895
   542
  prep_statement (prep_context_statement read_full_context_statement Element.activate) body concl ctxt;
ballarin@28879
   543
fun cert_statement body concl ctxt =
ballarin@28895
   544
  prep_statement (prep_context_statement cert_full_context_statement Element.activate_i) body concl ctxt;
ballarin@28879
   545
ballarin@28895
   546
fun read_context strict imprt body ctxt =
ballarin@28895
   547
  #1 (prep_context_statement read_full_context_statement Element.activate strict true imprt body [] ctxt);
ballarin@28895
   548
fun cert_context strict imprt body ctxt =
ballarin@28895
   549
  #1 (prep_context_statement cert_full_context_statement Element.activate_i strict true imprt body [] ctxt);
ballarin@28879
   550
ballarin@28795
   551
end;
ballarin@28795
   552
ballarin@28795
   553
ballarin@28795
   554
(*** Locale declarations ***)
ballarin@28795
   555
ballarin@28795
   556
local
ballarin@28795
   557
ballarin@28795
   558
(* introN: name of theorems for introduction rules of locale and
ballarin@28795
   559
     delta predicates;
ballarin@28795
   560
   axiomsN: name of theorem set with destruct rules for locale predicates,
ballarin@28795
   561
     also name suffix of delta predicates. *)
ballarin@28795
   562
ballarin@28795
   563
val introN = "intro";
ballarin@28795
   564
val axiomsN = "axioms";
ballarin@28795
   565
ballarin@28795
   566
fun atomize_spec thy ts =
ballarin@28795
   567
  let
ballarin@28795
   568
    val t = Logic.mk_conjunction_balanced ts;
ballarin@28795
   569
    val body = ObjectLogic.atomize_term thy t;
ballarin@28795
   570
    val bodyT = Term.fastype_of body;
ballarin@28795
   571
  in
ballarin@28795
   572
    if bodyT = propT then (t, propT, Thm.reflexive (Thm.cterm_of thy t))
ballarin@28795
   573
    else (body, bodyT, ObjectLogic.atomize (Thm.cterm_of thy t))
ballarin@28795
   574
  end;
ballarin@28795
   575
ballarin@28795
   576
(* achieve plain syntax for locale predicates (without "PROP") *)
ballarin@28795
   577
ballarin@28795
   578
fun aprop_tr' n c = (Syntax.constN ^ c, fn ctxt => fn args =>
ballarin@28795
   579
  if length args = n then
ballarin@28795
   580
    Syntax.const "_aprop" $
ballarin@28795
   581
      Term.list_comb (Syntax.free (Consts.extern (ProofContext.consts_of ctxt) c), args)
ballarin@28795
   582
  else raise Match);
ballarin@28795
   583
ballarin@28795
   584
(* CB: define one predicate including its intro rule and axioms
ballarin@28795
   585
   - bname: predicate name
ballarin@28795
   586
   - parms: locale parameters
ballarin@28795
   587
   - defs: thms representing substitutions from defines elements
ballarin@28795
   588
   - ts: terms representing locale assumptions (not normalised wrt. defs)
ballarin@28795
   589
   - norm_ts: terms representing locale assumptions (normalised wrt. defs)
ballarin@28795
   590
   - thy: the theory
ballarin@28795
   591
*)
ballarin@28795
   592
ballarin@28795
   593
fun def_pred bname parms defs ts norm_ts thy =
ballarin@28795
   594
  let
ballarin@28795
   595
    val name = Sign.full_name thy bname;
ballarin@28795
   596
ballarin@28795
   597
    val (body, bodyT, body_eq) = atomize_spec thy norm_ts;
ballarin@28795
   598
    val env = Term.add_term_free_names (body, []);
ballarin@28795
   599
    val xs = filter (member (op =) env o #1) parms;
ballarin@28795
   600
    val Ts = map #2 xs;
ballarin@28795
   601
    val extraTs = (Term.term_tfrees body \\ fold Term.add_tfreesT Ts [])
ballarin@28795
   602
      |> Library.sort_wrt #1 |> map TFree;
ballarin@28795
   603
    val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
ballarin@28795
   604
ballarin@28795
   605
    val args = map Logic.mk_type extraTs @ map Free xs;
ballarin@28795
   606
    val head = Term.list_comb (Const (name, predT), args);
ballarin@28795
   607
    val statement = ObjectLogic.ensure_propT thy head;
ballarin@28795
   608
ballarin@28795
   609
    val ([pred_def], defs_thy) =
ballarin@28795
   610
      thy
ballarin@28795
   611
      |> bodyT = propT ? Sign.add_advanced_trfuns ([], [], [aprop_tr' (length args) name], [])
ballarin@28795
   612
      |> Sign.declare_const [] ((Name.binding bname, predT), NoSyn) |> snd
ballarin@28795
   613
      |> PureThy.add_defs false
ballarin@28795
   614
        [((Thm.def_name bname, Logic.mk_equals (head, body)), [Thm.kind_internal])];
ballarin@28795
   615
    val defs_ctxt = ProofContext.init defs_thy |> Variable.declare_term head;
ballarin@28795
   616
ballarin@28795
   617
    val cert = Thm.cterm_of defs_thy;
ballarin@28795
   618
ballarin@28795
   619
    val intro = Goal.prove_global defs_thy [] norm_ts statement (fn _ =>
ballarin@28795
   620
      MetaSimplifier.rewrite_goals_tac [pred_def] THEN
ballarin@28795
   621
      Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
ballarin@28795
   622
      Tactic.compose_tac (false,
ballarin@28795
   623
        Conjunction.intr_balanced (map (Thm.assume o cert) norm_ts), 0) 1);
ballarin@28795
   624
ballarin@28795
   625
    val conjuncts =
ballarin@28795
   626
      (Drule.equal_elim_rule2 OF [body_eq,
ballarin@28795
   627
        MetaSimplifier.rewrite_rule [pred_def] (Thm.assume (cert statement))])
ballarin@28795
   628
      |> Conjunction.elim_balanced (length ts);
ballarin@28795
   629
    val axioms = ts ~~ conjuncts |> map (fn (t, ax) =>
ballarin@28795
   630
      Element.prove_witness defs_ctxt t
ballarin@28795
   631
       (MetaSimplifier.rewrite_goals_tac defs THEN
ballarin@28795
   632
        Tactic.compose_tac (false, ax, 0) 1));
ballarin@28795
   633
  in ((statement, intro, axioms), defs_thy) end;
ballarin@28795
   634
ballarin@28795
   635
in
ballarin@28795
   636
ballarin@28795
   637
(* CB: main predicate definition function *)
ballarin@28795
   638
ballarin@28795
   639
fun define_preds pname (parms, ((exts, exts'), (ints, ints')), defs) thy =
ballarin@28795
   640
  let
ballarin@28795
   641
    val (a_pred, a_intro, a_axioms, thy'') =
ballarin@28795
   642
      if null exts then (NONE, NONE, [], thy)
ballarin@28795
   643
      else
ballarin@28795
   644
        let
ballarin@28795
   645
          val aname = if null ints then pname else pname ^ "_" ^ axiomsN;
ballarin@28795
   646
          val ((statement, intro, axioms), thy') =
ballarin@28795
   647
            thy
ballarin@28795
   648
            |> def_pred aname parms defs exts exts';
ballarin@28795
   649
          val (_, thy'') =
ballarin@28795
   650
            thy'
ballarin@28795
   651
            |> Sign.add_path aname
ballarin@28795
   652
            |> Sign.no_base_names
ballarin@28795
   653
            |> PureThy.note_thmss Thm.internalK [((Name.binding introN, []), [([intro], [])])]
ballarin@28795
   654
            ||> Sign.restore_naming thy';
ballarin@28795
   655
          in (SOME statement, SOME intro, axioms, thy'') end;
ballarin@28795
   656
    val (b_pred, b_intro, b_axioms, thy'''') =
ballarin@28795
   657
      if null ints then (NONE, NONE, [], thy'')
ballarin@28795
   658
      else
ballarin@28795
   659
        let
ballarin@28795
   660
          val ((statement, intro, axioms), thy''') =
ballarin@28795
   661
            thy''
ballarin@28795
   662
            |> def_pred pname parms defs (ints @ the_list a_pred) (ints' @ the_list a_pred);
ballarin@28795
   663
          val (_, thy'''') =
ballarin@28795
   664
            thy'''
ballarin@28795
   665
            |> Sign.add_path pname
ballarin@28795
   666
            |> Sign.no_base_names
ballarin@28795
   667
            |> PureThy.note_thmss Thm.internalK
ballarin@28795
   668
                 [((Name.binding introN, []), [([intro], [])]),
ballarin@28795
   669
                  ((Name.binding axiomsN, []),
ballarin@28795
   670
                    [(map (Drule.standard o Element.conclude_witness) axioms, [])])]
ballarin@28795
   671
            ||> Sign.restore_naming thy''';
ballarin@28795
   672
        in (SOME statement, SOME intro, axioms, thy'''') end;
ballarin@28795
   673
  in ((a_pred, a_intro, a_axioms), (b_pred, b_intro, b_axioms), thy'''') end;
ballarin@28795
   674
ballarin@28795
   675
end;
ballarin@28795
   676
ballarin@28795
   677
ballarin@28795
   678
local
ballarin@28795
   679
ballarin@28795
   680
fun assumes_to_notes (Assumes asms) axms =
ballarin@28795
   681
      fold_map (fn (a, spec) => fn axs =>
ballarin@28795
   682
          let val (ps, qs) = chop (length spec) axs
ballarin@28795
   683
          in ((a, [(ps, [])]), qs) end) asms axms
ballarin@28795
   684
      |> apfst (curry Notes Thm.assumptionK)
ballarin@28795
   685
  | assumes_to_notes e axms = (e, axms);
ballarin@28795
   686
ballarin@28795
   687
fun defines_to_notes thy (Defines defs) defns =
ballarin@28795
   688
    let
ballarin@28795
   689
      val defs' = map (fn (_, (def, _)) => def) defs
ballarin@28795
   690
      val notes = map (fn (a, (def, _)) =>
ballarin@28795
   691
        (a, [([assume (cterm_of thy def)], [])])) defs
ballarin@28795
   692
    in
ballarin@28795
   693
      (Notes (Thm.definitionK, notes), defns @ defs')
ballarin@28795
   694
    end
ballarin@28795
   695
  | defines_to_notes _ e defns = (e, defns);
ballarin@28795
   696
ballarin@28872
   697
fun gen_add_locale prep_context
ballarin@28795
   698
    bname predicate_name raw_imprt raw_body thy =
ballarin@28795
   699
  let
ballarin@28795
   700
    val thy_ctxt = ProofContext.init thy;
ballarin@28795
   701
    val name = Sign.full_name thy bname;
ballarin@28795
   702
    val _ = NewLocale.test_locale thy name andalso
ballarin@28795
   703
      error ("Duplicate definition of locale " ^ quote name);
ballarin@28795
   704
ballarin@28895
   705
    val ((fixed, deps), (_, body_elems), text as (parms, ((_, exts'), _), defs)) =
ballarin@28895
   706
      prep_context false raw_imprt raw_body thy_ctxt;
ballarin@28872
   707
    val ((a_statement, a_intro, a_axioms), (b_statement, b_intro, b_axioms), thy') =
ballarin@28795
   708
      define_preds predicate_name text thy;
ballarin@28795
   709
ballarin@28795
   710
    val extraTs = fold Term.add_tfrees exts' [] \\ fold Term.add_tfreesT (map snd parms) [];
ballarin@28795
   711
    val _ = if null extraTs then ()
ballarin@28795
   712
      else warning ("Additional type variable(s) in locale specification " ^ quote bname);
ballarin@28795
   713
ballarin@28872
   714
    val satisfy = Element.satisfy_morphism b_axioms;
ballarin@28895
   715
    val params = fixed @
ballarin@28872
   716
      (body_elems |> map_filter (fn Fixes fixes => SOME fixes | _ => NONE) |> flat);
ballarin@28795
   717
    val (body_elems', defns) = fold_map (defines_to_notes thy) body_elems [];
ballarin@28795
   718
ballarin@28795
   719
    val notes = body_elems' |>
ballarin@28872
   720
      (fn elems => fold_map assumes_to_notes elems (map Element.conclude_witness a_axioms)) |>
ballarin@28872
   721
      fst |> map (Element.morph_ctxt satisfy) |>
ballarin@28795
   722
      map_filter (fn Notes notes => SOME notes | _ => NONE);
ballarin@28795
   723
ballarin@28872
   724
    val deps' = map (fn (l, morph) => (l, morph $> satisfy)) deps;
ballarin@28872
   725
ballarin@28795
   726
    val loc_ctxt = thy' |>
ballarin@28872
   727
      NewLocale.register_locale name (extraTs, params)
ballarin@28872
   728
        (if is_some b_statement then b_statement else a_statement, map prop_of defs) ([], [])
ballarin@28872
   729
        (map (fn n => (n, stamp ())) notes |> rev) (map (fn d => (d, stamp ())) deps' |> rev) |>
ballarin@28795
   730
      NewLocale.init name
ballarin@28795
   731
  in (name, loc_ctxt) end;
ballarin@28795
   732
ballarin@28795
   733
in
ballarin@28795
   734
ballarin@28795
   735
val add_locale = gen_add_locale read_context;
ballarin@28885
   736
val add_locale_i = gen_add_locale cert_context;
ballarin@28795
   737
ballarin@28795
   738
end;
ballarin@28795
   739
ballarin@28895
   740
ballarin@28895
   741
(*** Interpretation ***)
ballarin@28895
   742
ballarin@28895
   743
(** Witnesses and goals **)
ballarin@28895
   744
ballarin@28895
   745
fun prep_propp propss = propss |> map (map (rpair [] o Element.mark_witness));
ballarin@28895
   746
ballarin@28895
   747
fun prep_result propps thmss =
ballarin@28895
   748
  ListPair.map (fn (props, thms) => map2 Element.make_witness props thms) (propps, thmss);
ballarin@28895
   749
ballarin@28895
   750
ballarin@28895
   751
(** Interpretation between locales: declaring sublocale relationships **)
ballarin@28895
   752
ballarin@28895
   753
local
ballarin@28895
   754
ballarin@28895
   755
fun store_dep target ((name, morph), thms) =
ballarin@28895
   756
  NewLocale.add_dependency target (name, morph $> Element.satisfy_morphism thms);
ballarin@28895
   757
ballarin@28895
   758
fun gen_sublocale prep_expr
ballarin@28895
   759
    after_qed target expression thy =
ballarin@28895
   760
  let
ballarin@28895
   761
    val target_ctxt = NewLocale.init target thy;
ballarin@28895
   762
    val target' = NewLocale.intern thy target;
ballarin@28895
   763
ballarin@28895
   764
    val ((_, fixed, deps, _, _), _) = prep_expr true true target_ctxt expression [] [];
ballarin@28895
   765
    val (_, goal_ctxt) = ProofContext.add_fixes_i fixed target_ctxt;
ballarin@28895
   766
ballarin@28895
   767
    (* proof obligations from deps *)
ballarin@28895
   768
    fun props_of (name, morph) =
ballarin@28895
   769
    let
ballarin@28895
   770
      val (asm, defs) = NewLocale.specification_of thy name;
ballarin@28895
   771
    in
ballarin@28895
   772
      (case asm of NONE => defs | SOME asm => asm :: defs) |> map (Morphism.term morph)
ballarin@28895
   773
    end;
ballarin@28895
   774
    
ballarin@28895
   775
    val propss = map props_of deps;
ballarin@28895
   776
    
ballarin@28895
   777
    fun after_qed' results =
ballarin@28895
   778
      fold (store_dep target') (deps ~~ prep_result propss results) #>
ballarin@28895
   779
      after_qed results;
ballarin@28895
   780
ballarin@28895
   781
  in
ballarin@28895
   782
    goal_ctxt |>
ballarin@28895
   783
      Proof.theorem_i NONE after_qed' (prep_propp propss) |>
ballarin@28895
   784
      Element.refine_witness |> Seq.hd
ballarin@28895
   785
  end;
ballarin@28895
   786
ballarin@28895
   787
in
ballarin@28895
   788
ballarin@28895
   789
fun sublocale x = gen_sublocale read_full_context_statement x;
ballarin@28895
   790
fun sublocale_i x = gen_sublocale cert_full_context_statement x;
ballarin@28895
   791
ballarin@28795
   792
end;
ballarin@28895
   793
ballarin@28895
   794
ballarin@28895
   795
end;