src/Pure/Isar/locale.ML
author ballarin
Fri May 27 17:10:41 2005 +0200 (2005-05-27)
changeset 16105 a44801c499cb
parent 16103 323838df22fd
child 16144 e339119f4261
permissions -rw-r--r--
SML/NJ compatibility.
wenzelm@12014
     1
(*  Title:      Pure/Isar/locale.ML
wenzelm@11896
     2
    ID:         $Id$
ballarin@15206
     3
    Author:     Clemens Ballarin, TU Muenchen; Markus Wenzel, LMU/TU Muenchen
wenzelm@11896
     4
wenzelm@12058
     5
Locales -- Isar proof contexts as meta-level predicates, with local
wenzelm@12529
     6
syntax and implicit structures.
wenzelm@12529
     7
ballarin@14215
     8
Draws some basic ideas from Florian Kammueller's original version of
wenzelm@12529
     9
locales, but uses the richer infrastructure of Isar instead of the raw
wenzelm@12529
    10
meta-logic.  Furthermore, we provide structured import of contexts
ballarin@14215
    11
(with merge and rename operations), as well as type-inference of the
wenzelm@13375
    12
signature parts, and predicate definitions of the specification text.
ballarin@14446
    13
ballarin@14446
    14
See also:
ballarin@14446
    15
ballarin@14446
    16
[1] Clemens Ballarin. Locales and Locale Expressions in Isabelle/Isar.
ballarin@14446
    17
    In Stefano Berardi et al., Types for Proofs and Programs: International
ballarin@15099
    18
    Workshop, TYPES 2003, Torino, Italy, LNCS 3085, pages 34-50, 2004.
wenzelm@11896
    19
*)
wenzelm@11896
    20
wenzelm@11896
    21
signature LOCALE =
wenzelm@11896
    22
sig
wenzelm@12046
    23
  type context
wenzelm@15703
    24
  datatype ('typ, 'term, 'fact) elem =
wenzelm@12058
    25
    Fixes of (string * 'typ option * mixfix option) list |
wenzelm@15703
    26
    Assumes of ((string * Attrib.src list) * ('term * ('term list * 'term list)) list) list |
wenzelm@15703
    27
    Defines of ((string * Attrib.src list) * ('term * 'term list)) list |
wenzelm@15703
    28
    Notes of ((string * Attrib.src list) * ('fact * Attrib.src list) list) list
wenzelm@12273
    29
  datatype expr =
wenzelm@12273
    30
    Locale of string |
ballarin@16102
    31
    Rename of expr * (string * mixfix option) option list |
wenzelm@12273
    32
    Merge of expr list
wenzelm@12273
    33
  val empty: expr
ballarin@15206
    34
  datatype 'a elem_expr = Elem of 'a | Expr of expr
ballarin@15206
    35
ballarin@15206
    36
  (* Abstract interface to locales *)
wenzelm@15703
    37
  type element
wenzelm@15703
    38
  type element_i
wenzelm@12046
    39
  type locale
wenzelm@12046
    40
  val intern: Sign.sg -> xstring -> string
wenzelm@12014
    41
  val cond_extern: Sign.sg -> string -> xstring
wenzelm@12502
    42
  val the_locale: theory -> string -> locale
wenzelm@15703
    43
  val intern_attrib_elem: theory ->
wenzelm@15703
    44
    ('typ, 'term, 'fact) elem -> ('typ, 'term, 'fact) elem
wenzelm@15703
    45
  val intern_attrib_elem_expr: theory ->
wenzelm@15703
    46
    ('typ, 'term, 'fact) elem elem_expr -> ('typ, 'term, 'fact) elem elem_expr
ballarin@15206
    47
ballarin@15596
    48
  (* Processing of locale statements *)
wenzelm@15703
    49
  val read_context_statement: xstring option -> element elem_expr list ->
wenzelm@12529
    50
    (string * (string list * string list)) list list -> context ->
ballarin@15206
    51
    string option * (cterm list * cterm list) * context * context * 
ballarin@15206
    52
      (term * (term list * term list)) list list
wenzelm@15703
    53
  val cert_context_statement: string option -> element_i elem_expr list ->
wenzelm@12529
    54
    (term * (term list * term list)) list list -> context ->
ballarin@15206
    55
    string option * (cterm list * cterm list) * context * context *
ballarin@15206
    56
      (term * (term list * term list)) list list
ballarin@15596
    57
ballarin@15596
    58
  (* Diagnostic functions *)
wenzelm@12758
    59
  val print_locales: theory -> unit
wenzelm@15703
    60
  val print_locale: theory -> expr -> element list -> unit
ballarin@15624
    61
  val print_global_registrations: string -> theory -> unit
wenzelm@15703
    62
  val print_local_registrations': string -> context -> unit
ballarin@15624
    63
  val print_local_registrations: string -> context -> unit
ballarin@15596
    64
ballarin@15696
    65
  (* Storing results *)
wenzelm@15703
    66
  val add_locale: bool -> bstring -> expr -> element list -> theory -> theory
wenzelm@15703
    67
  val add_locale_i: bool -> bstring -> expr -> element_i list -> theory -> theory
wenzelm@15703
    68
  val smart_note_thmss: string -> string option ->
wenzelm@12958
    69
    ((bstring * theory attribute list) * (thm list * theory attribute list) list) list ->
wenzelm@12958
    70
    theory -> theory * (bstring * thm list) list
wenzelm@15703
    71
  val note_thmss: string -> xstring ->
wenzelm@15703
    72
    ((bstring * Attrib.src list) * (thmref * Attrib.src list) list) list ->
wenzelm@12711
    73
    theory -> theory * (bstring * thm list) list
wenzelm@15703
    74
  val note_thmss_i: string -> string ->
wenzelm@15703
    75
    ((bstring * Attrib.src list) * (thm list * Attrib.src list) list) list ->
wenzelm@12711
    76
    theory -> theory * (bstring * thm list) list
wenzelm@15703
    77
  val add_thmss: string -> string -> ((string * thm list) * Attrib.src list) list ->
wenzelm@13375
    78
    theory * context -> (theory * context) * (string * thm list) list
ballarin@15596
    79
ballarin@15624
    80
  (* Locale interpretation *)
ballarin@14528
    81
  val instantiate: string -> string * context attribute list
ballarin@14528
    82
    -> thm list option -> context -> context
ballarin@15624
    83
  val prep_global_registration:
wenzelm@15703
    84
    string * Attrib.src list -> expr -> string option list -> theory ->
ballarin@15596
    85
    theory * ((string * term list) * term list) list * (theory -> theory)
ballarin@15624
    86
  val prep_local_registration:
wenzelm@15703
    87
    string * Attrib.src list -> expr -> string option list -> context ->
ballarin@15624
    88
    context * ((string * term list) * term list) list * (context -> context)
ballarin@15624
    89
  val add_global_witness:
ballarin@15596
    90
    string * term list -> thm -> theory -> theory
ballarin@15624
    91
  val add_local_witness:
ballarin@15624
    92
    string * term list -> thm -> context -> context
wenzelm@11896
    93
end;
wenzelm@12839
    94
wenzelm@12289
    95
structure Locale: LOCALE =
wenzelm@11896
    96
struct
wenzelm@11896
    97
wenzelm@12273
    98
(** locale elements and expressions **)
wenzelm@11896
    99
wenzelm@12014
   100
type context = ProofContext.context;
wenzelm@11896
   101
wenzelm@15703
   102
datatype ('typ, 'term, 'fact) elem =
wenzelm@12058
   103
  Fixes of (string * 'typ option * mixfix option) list |
wenzelm@15703
   104
  Assumes of ((string * Attrib.src list) * ('term * ('term list * 'term list)) list) list |
wenzelm@15703
   105
  Defines of ((string * Attrib.src list) * ('term * 'term list)) list |
wenzelm@15703
   106
  Notes of ((string * Attrib.src list) * ('fact * Attrib.src list) list) list;
wenzelm@12273
   107
wenzelm@12273
   108
datatype expr =
wenzelm@12273
   109
  Locale of string |
ballarin@16102
   110
  Rename of expr * (string * mixfix option) option list |
wenzelm@12273
   111
  Merge of expr list;
wenzelm@11896
   112
wenzelm@12273
   113
val empty = Merge [];
wenzelm@12273
   114
ballarin@15206
   115
datatype 'a elem_expr =
ballarin@15206
   116
  Elem of 'a | Expr of expr;
wenzelm@12273
   117
wenzelm@15703
   118
type element = (string, string, thmref) elem;
wenzelm@15703
   119
type element_i = (typ, term, thm list) elem;
wenzelm@12070
   120
wenzelm@12070
   121
type locale =
ballarin@15206
   122
 {predicate: cterm list * thm list,
ballarin@15206
   123
    (* CB: For old-style locales with "(open)" this entry is ([], []).
ballarin@15206
   124
       For new-style locales, which declare predicates, if the locale declares
ballarin@15206
   125
       no predicates, this is also ([], []).
ballarin@15206
   126
       If the locale declares predicates, the record field is
ballarin@15206
   127
       ([statement], axioms), where statement is the locale predicate applied
ballarin@15206
   128
       to the (assumed) locale parameters.  Axioms contains the projections
ballarin@15206
   129
       from the locale predicate to the normalised assumptions of the locale
ballarin@15206
   130
       (cf. [1], normalisation of locale expressions.)
ballarin@15206
   131
    *)
ballarin@15206
   132
  import: expr,                                       (*dynamic import*)
wenzelm@15703
   133
  elems: (element_i * stamp) list,                    (*static content*)
ballarin@16102
   134
  params: ((string * typ option) * mixfix option) list * string list}
ballarin@16102
   135
                                                      (*all/local params*)
wenzelm@12063
   136
wenzelm@11896
   137
wenzelm@15703
   138
(* CB: an internal (Int) locale element was either imported or included,
wenzelm@15703
   139
   an external (Ext) element appears directly in the locale text. *)
wenzelm@15703
   140
wenzelm@15703
   141
datatype ('a, 'b) int_ext = Int of 'a | Ext of 'b;
wenzelm@15703
   142
wenzelm@15703
   143
wenzelm@15703
   144
ballarin@15837
   145
(** term and type instantiation, using symbol tables **)
ballarin@15837
   146
ballarin@15837
   147
(* instantiate TFrees *)
ballarin@15837
   148
ballarin@15837
   149
fun tinst_tab_type tinst T = if Symtab.is_empty tinst
ballarin@15837
   150
      then T
ballarin@15837
   151
      else Term.map_type_tfree
ballarin@15837
   152
        (fn (v as (x, _)) => getOpt (Symtab.lookup (tinst, x), (TFree v))) T;
ballarin@15837
   153
ballarin@15837
   154
fun tinst_tab_term tinst t = if Symtab.is_empty tinst
ballarin@15837
   155
      then t
ballarin@15837
   156
      else Term.map_term_types (tinst_tab_type tinst) t;
ballarin@15837
   157
ballarin@15837
   158
fun tinst_tab_thm sg tinst thm = if Symtab.is_empty tinst
ballarin@15837
   159
      then thm
ballarin@15837
   160
      else let
ballarin@15837
   161
          val cert = Thm.cterm_of sg;
ballarin@15837
   162
          val certT = Thm.ctyp_of sg;
ballarin@15837
   163
          val {hyps, prop, ...} = Thm.rep_thm thm;
ballarin@15837
   164
          val tfrees = foldr Term.add_term_tfree_names [] (prop :: hyps);
ballarin@15837
   165
          val tinst' = Symtab.dest tinst |>
ballarin@15837
   166
                List.filter (fn (a, _) => a mem_string tfrees);
ballarin@15837
   167
        in
ballarin@15837
   168
          if null tinst' then thm
ballarin@15837
   169
          else thm |> Drule.implies_intr_list (map cert hyps)
ballarin@15837
   170
            |> Drule.tvars_intr_list (map #1 tinst')
ballarin@15837
   171
            |> (fn (th, al) => th |> Thm.instantiate
ballarin@15837
   172
                ((map (fn (a, T) => (certT (TVar (valOf (assoc (al, a)))), certT T)) tinst'),
ballarin@15837
   173
                  []))
ballarin@15837
   174
            |> (fn th => Drule.implies_elim_list th
ballarin@15837
   175
                 (map (Thm.assume o cert o tinst_tab_term tinst) hyps))
ballarin@15837
   176
        end;
ballarin@15837
   177
ballarin@15837
   178
ballarin@15837
   179
(* instantiate TFrees and Frees *)
ballarin@15837
   180
ballarin@15837
   181
fun inst_tab_term (inst, tinst) = if Symtab.is_empty inst
ballarin@15837
   182
      then tinst_tab_term tinst
ballarin@15837
   183
      else (* instantiate terms and types simultaneously *)
ballarin@15837
   184
        let
ballarin@15837
   185
          fun instf (Const (x, T)) = Const (x, tinst_tab_type tinst T)
ballarin@15837
   186
            | instf (Free (x, T)) = (case Symtab.lookup (inst, x) of
ballarin@15837
   187
                 NONE => Free (x, tinst_tab_type tinst T)
ballarin@15837
   188
               | SOME t => t)
ballarin@15837
   189
            | instf (Var (xi, T)) = Var (xi, tinst_tab_type tinst T)
ballarin@15837
   190
            | instf (b as Bound _) = b
ballarin@15837
   191
            | instf (Abs (x, T, t)) = Abs (x, tinst_tab_type tinst T, instf t)
ballarin@15837
   192
            | instf (s $ t) = instf s $ instf t
ballarin@15837
   193
        in instf end;
ballarin@15837
   194
ballarin@15837
   195
fun inst_tab_thm sg (inst, tinst) thm = if Symtab.is_empty inst
ballarin@15837
   196
      then tinst_tab_thm sg tinst thm
ballarin@15837
   197
      else let
ballarin@15837
   198
          val cert = Thm.cterm_of sg;
ballarin@15837
   199
          val certT = Thm.ctyp_of sg;
ballarin@15837
   200
          val {hyps, prop, ...} = Thm.rep_thm thm;
ballarin@15837
   201
          (* type instantiations *)
ballarin@15837
   202
          val tfrees = foldr Term.add_term_tfree_names [] (prop :: hyps);
ballarin@15837
   203
          val tinst' = Symtab.dest tinst |>
ballarin@15837
   204
                List.filter (fn (a, _) => a mem_string tfrees);
ballarin@15837
   205
          (* term instantiations;
ballarin@15837
   206
             note: lhss are type instantiated, because
ballarin@15837
   207
                   type insts will be done first*)
ballarin@15837
   208
          val frees = foldr Term.add_term_frees [] (prop :: hyps);
ballarin@15837
   209
          val inst' = Symtab.dest inst |>
ballarin@15837
   210
                List.mapPartial (fn (a, t) =>
ballarin@15837
   211
                  get_first (fn (Free (x, T)) => 
ballarin@15837
   212
                    if a = x then SOME (Free (x, tinst_tab_type tinst T), t)
ballarin@15837
   213
                    else NONE) frees);
ballarin@15837
   214
        in
ballarin@15837
   215
          if null tinst' andalso null inst' then tinst_tab_thm sg tinst thm
ballarin@15837
   216
          else thm |> Drule.implies_intr_list (map cert hyps)
ballarin@15837
   217
            |> Drule.tvars_intr_list (map #1 tinst')
ballarin@15837
   218
            |> (fn (th, al) => th |> Thm.instantiate
ballarin@15837
   219
                ((map (fn (a, T) => (certT (TVar (valOf (assoc (al, a)))), certT T)) tinst'),
ballarin@15837
   220
                  []))
ballarin@15837
   221
            |> Drule.forall_intr_list (map (cert o #1) inst')
ballarin@15837
   222
            |> Drule.forall_elim_list (map (cert o #2) inst') 
ballarin@15837
   223
            |> (fn th => Drule.implies_elim_list th
ballarin@15837
   224
                 (map (Thm.assume o cert o inst_tab_term (inst, tinst)) hyps))
ballarin@15837
   225
        end;
ballarin@15837
   226
ballarin@15837
   227
ballarin@15837
   228
(** registration management **)
wenzelm@11896
   229
ballarin@15837
   230
structure Registrations :
ballarin@15837
   231
  sig
ballarin@15837
   232
    type T
ballarin@15837
   233
    val empty: T
ballarin@15837
   234
    val join: T * T -> T
ballarin@15837
   235
    val dest: T -> (term list * ((string * Attrib.src list) * thm list)) list
ballarin@15837
   236
    val lookup: Sign.sg -> T * term list ->
ballarin@15837
   237
      ((string * Attrib.src list) * thm list) option
ballarin@15837
   238
    val insert: Sign.sg -> term list * (string * Attrib.src list) -> T ->
ballarin@15837
   239
      T * (term list * ((string * Attrib.src list) * thm list)) list
ballarin@15837
   240
    val add_witness: term list -> thm -> T -> T
ballarin@15837
   241
  end =
ballarin@15837
   242
struct
ballarin@15837
   243
  (* a registration consists of theorems instantiating locale assumptions
ballarin@15837
   244
     and prefix and attributes, indexed by parameter instantiation *)
ballarin@15837
   245
  type T = ((string * Attrib.src list) * thm list) Termtab.table;
ballarin@15837
   246
ballarin@15837
   247
  val empty = Termtab.empty;
ballarin@15837
   248
ballarin@15837
   249
  (* term list represented as single term, for simultaneous matching *)
ballarin@15837
   250
  fun termify ts =
ballarin@15837
   251
    Library.foldl (op $) (Const ("", map fastype_of ts ---> propT), ts);
ballarin@15837
   252
  fun untermify t =
ballarin@15837
   253
    let fun ut (Const _) ts = ts
ballarin@15837
   254
          | ut (s $ t) ts = ut s (t::ts)
ballarin@15837
   255
    in ut t [] end;
ballarin@15837
   256
ballarin@15837
   257
  (* joining of registrations: prefix and attributs of left theory,
ballarin@15837
   258
     thms are equal, no attempt to subsumption testing *)
ballarin@16102
   259
  fun join (r1, r2) = Termtab.join (fn (reg, _) => SOME reg) (r1, r2);
ballarin@15837
   260
ballarin@15837
   261
  fun dest regs = map (apfst untermify) (Termtab.dest regs);
ballarin@15837
   262
ballarin@15837
   263
  (* registrations that subsume t *)
ballarin@15837
   264
  fun subsumers tsig t regs =
ballarin@15837
   265
    List.filter (fn (t', _) => Pattern.matches tsig (t', t)) (Termtab.dest regs);
ballarin@15837
   266
ballarin@15837
   267
  (* look up registration, pick one that subsumes the query *)
ballarin@15837
   268
  fun lookup sign (regs, ts) =
ballarin@15837
   269
    let
ballarin@15837
   270
      val tsig = Sign.tsig_of sign;
ballarin@15837
   271
      val t = termify ts;
ballarin@15837
   272
      val subs = subsumers tsig t regs;
ballarin@15837
   273
    in (case subs of
ballarin@15837
   274
        [] => NONE
ballarin@15837
   275
      | ((t', (attn, thms)) :: _) => let
ballarin@15837
   276
            val (tinst, inst) = Pattern.match tsig (t', t);
ballarin@15837
   277
            (* thms contain Frees, not Vars *)
ballarin@15837
   278
            val tinst' = tinst |> Vartab.dest
ballarin@15837
   279
                 |> map (fn ((x, 0), (_, T)) => (x, Type.unvarifyT T))
ballarin@15837
   280
                 |> Symtab.make;
ballarin@15837
   281
            val inst' = inst |> Vartab.dest
ballarin@15837
   282
                 |> map (fn ((x, 0), (_, t)) => (x, Logic.unvarify t))
ballarin@15837
   283
                 |> Symtab.make;
ballarin@15837
   284
          in
ballarin@15837
   285
            SOME (attn, map (inst_tab_thm sign (inst', tinst')) thms)
ballarin@15837
   286
          end)
ballarin@15837
   287
    end;
ballarin@15837
   288
ballarin@15837
   289
  (* add registration if not subsumed by ones already present,
ballarin@15837
   290
     additionally returns registrations that are strictly subsumed *)
ballarin@15837
   291
  fun insert sign (ts, attn) regs =
ballarin@15837
   292
    let
ballarin@15837
   293
      val tsig = Sign.tsig_of sign;
ballarin@15837
   294
      val t = termify ts;
ballarin@15837
   295
      val subs = subsumers tsig t regs ;
ballarin@15837
   296
    in (case subs of
ballarin@15837
   297
        [] => let
ballarin@15837
   298
                val sups =
ballarin@15837
   299
                  List.filter (fn (t', _) => Pattern.matches tsig (t, t')) (Termtab.dest regs);
ballarin@15837
   300
                val sups' = map (apfst untermify) sups
ballarin@15837
   301
              in (Termtab.update ((t, (attn, [])), regs), sups') end
ballarin@15837
   302
      | _ => (regs, []))
ballarin@15837
   303
    end;
ballarin@15837
   304
ballarin@15837
   305
  (* add witness theorem to registration,
ballarin@15837
   306
     only if instantiation is exact, otherwise excpetion Option raised *)
ballarin@15837
   307
  fun add_witness ts thm regs =
ballarin@15837
   308
    let
ballarin@15837
   309
      val t = termify ts;
ballarin@15837
   310
      val (x, thms) = valOf (Termtab.lookup (regs, t));
ballarin@15837
   311
    in
ballarin@15837
   312
      Termtab.update ((t, (x, thm::thms)), regs)
ballarin@15837
   313
    end;
ballarin@15837
   314
end;
ballarin@15837
   315
ballarin@15837
   316
(** theory data **)
ballarin@15596
   317
ballarin@15624
   318
structure GlobalLocalesArgs =
wenzelm@11896
   319
struct
wenzelm@12014
   320
  val name = "Isar/locales";
ballarin@15837
   321
  type T = NameSpace.T * locale Symtab.table * Registrations.T Symtab.table;
ballarin@15596
   322
    (* 1st entry: locale namespace,
ballarin@15596
   323
       2nd entry: locales of the theory,
ballarin@15837
   324
       3rd entry: registrations, indexed by locale name *)
wenzelm@11896
   325
ballarin@15596
   326
  val empty = (NameSpace.empty, Symtab.empty, Symtab.empty);
wenzelm@12063
   327
  val copy = I;
wenzelm@12118
   328
  val prep_ext = I;
wenzelm@12289
   329
ballarin@15596
   330
  fun join_locs ({predicate, import, elems, params}: locale,
ballarin@15596
   331
      {elems = elems', ...}: locale) =
ballarin@15596
   332
    SOME {predicate = predicate, import = import,
ballarin@15596
   333
      elems = gen_merge_lists eq_snd elems elems',
ballarin@15206
   334
      params = params};
ballarin@15596
   335
  fun merge ((space1, locs1, regs1), (space2, locs2, regs2)) =
ballarin@15596
   336
    (NameSpace.merge (space1, space2), Symtab.join join_locs (locs1, locs2),
ballarin@15837
   337
     Symtab.join (SOME o Registrations.join) (regs1, regs2));
wenzelm@12289
   338
ballarin@15596
   339
  fun print _ (space, locs, _) =
wenzelm@12273
   340
    Pretty.strs ("locales:" :: map (NameSpace.cond_extern space o #1) (Symtab.dest locs))
wenzelm@12014
   341
    |> Pretty.writeln;
wenzelm@11896
   342
end;
wenzelm@11896
   343
ballarin@15624
   344
structure GlobalLocalesData = TheoryDataFun(GlobalLocalesArgs);
wenzelm@15801
   345
val _ = Context.add_setup [GlobalLocalesData.init];
wenzelm@15801
   346
wenzelm@15801
   347
ballarin@15624
   348
ballarin@15624
   349
(** context data **)
wenzelm@11896
   350
ballarin@15624
   351
structure LocalLocalesArgs =
ballarin@15624
   352
struct
ballarin@15624
   353
  val name = "Isar/locales";
ballarin@15837
   354
  type T = Registrations.T Symtab.table;
ballarin@15837
   355
    (* registrations, indexed by locale name *)
ballarin@15624
   356
  fun init _ = Symtab.empty;
ballarin@15624
   357
  fun print _ _ = ();
ballarin@15624
   358
end;
ballarin@15624
   359
ballarin@15624
   360
structure LocalLocalesData = ProofDataFun(LocalLocalesArgs);
wenzelm@15801
   361
val _ = Context.add_setup [LocalLocalesData.init];
wenzelm@12289
   362
wenzelm@12277
   363
wenzelm@12277
   364
(* access locales *)
wenzelm@12277
   365
ballarin@15624
   366
val print_locales = GlobalLocalesData.print;
ballarin@15624
   367
ballarin@15624
   368
val intern = NameSpace.intern o #1 o GlobalLocalesData.get_sg;
ballarin@15624
   369
val cond_extern = NameSpace.cond_extern o #1 o GlobalLocalesData.get_sg;
ballarin@15624
   370
wenzelm@12063
   371
fun declare_locale name =
ballarin@15624
   372
  GlobalLocalesData.map (fn (space, locs, regs) =>
ballarin@15596
   373
    (NameSpace.extend (space, [name]), locs, regs));
wenzelm@11896
   374
ballarin@15596
   375
fun put_locale name loc =
ballarin@15624
   376
  GlobalLocalesData.map (fn (space, locs, regs) =>
ballarin@15596
   377
    (space, Symtab.update ((name, loc), locs), regs));
ballarin@15596
   378
ballarin@15624
   379
fun get_locale thy name = Symtab.lookup (#2 (GlobalLocalesData.get thy), name);
wenzelm@11896
   380
wenzelm@12014
   381
fun the_locale thy name =
wenzelm@12014
   382
  (case get_locale thy name of
skalberg@15531
   383
    SOME loc => loc
skalberg@15531
   384
  | NONE => error ("Unknown locale " ^ quote name));
wenzelm@11896
   385
wenzelm@12046
   386
ballarin@15596
   387
(* access registrations *)
ballarin@15596
   388
ballarin@15696
   389
(* Ids of global registrations are varified,
ballarin@15696
   390
   Ids of local registrations are not.
ballarin@15696
   391
   Thms of registrations are never varified. *)
ballarin@15696
   392
ballarin@15624
   393
(* retrieve registration from theory or context *)
ballarin@15624
   394
ballarin@15696
   395
fun gen_get_registrations get thy_ctxt name =
ballarin@15696
   396
  case Symtab.lookup (get thy_ctxt, name) of
ballarin@15696
   397
      NONE => []
ballarin@15837
   398
    | SOME reg => Registrations.dest reg;
ballarin@15696
   399
ballarin@15696
   400
val get_global_registrations =
ballarin@15696
   401
     gen_get_registrations (#3 o GlobalLocalesData.get);
ballarin@15696
   402
val get_local_registrations =
ballarin@15696
   403
     gen_get_registrations LocalLocalesData.get;
ballarin@15696
   404
ballarin@15837
   405
fun gen_get_registration get get_sg thy_ctxt (name, ps) =
ballarin@15624
   406
  case Symtab.lookup (get thy_ctxt, name) of
ballarin@15624
   407
      NONE => NONE
ballarin@15837
   408
    | SOME reg => Registrations.lookup (get_sg thy_ctxt) (reg, ps);
ballarin@15624
   409
ballarin@15624
   410
val get_global_registration =
ballarin@15837
   411
     gen_get_registration (#3 o GlobalLocalesData.get) Theory.sign_of;
ballarin@15624
   412
val get_local_registration =
ballarin@15837
   413
     gen_get_registration LocalLocalesData.get ProofContext.sign_of;
ballarin@15596
   414
ballarin@15624
   415
val test_global_registration = isSome oo get_global_registration;
ballarin@15624
   416
val test_local_registration = isSome oo get_local_registration;
ballarin@15624
   417
fun smart_test_registration ctxt id =
ballarin@15624
   418
  let
ballarin@15624
   419
    val thy = ProofContext.theory_of ctxt;
ballarin@15624
   420
  in
ballarin@15624
   421
    test_global_registration thy id orelse test_local_registration ctxt id
ballarin@15624
   422
  end;
ballarin@15624
   423
ballarin@15624
   424
ballarin@15837
   425
(* add registration to theory or context, ignored if subsumed *)
ballarin@15624
   426
ballarin@15837
   427
fun gen_put_registration map_data get_sg (name, ps) attn thy_ctxt =
ballarin@15837
   428
  map_data (fn regs =>
ballarin@15837
   429
    let
ballarin@15837
   430
      val sg = get_sg thy_ctxt;
ballarin@15837
   431
      val reg = getOpt (Symtab.lookup (regs, name), Registrations.empty);
ballarin@15837
   432
      val (reg', sups) = Registrations.insert sg (ps, attn) reg;
ballarin@15837
   433
      val _ = if not (null sups) then warning
ballarin@15837
   434
                ("Subsumed interpretation(s) of locale " ^
ballarin@15837
   435
                 quote (cond_extern sg name) ^
ballarin@15837
   436
                 "\nby interpretation(s) with the following prefix(es):\n" ^
ballarin@15837
   437
                  commas_quote (map (fn (_, ((s, _), _)) => s) sups))
ballarin@15837
   438
              else ();
ballarin@15837
   439
    in Symtab.update ((name, reg'), regs) end) thy_ctxt;
ballarin@15624
   440
ballarin@15624
   441
val put_global_registration =
ballarin@15624
   442
     gen_put_registration (fn f =>
ballarin@15624
   443
       GlobalLocalesData.map (fn (space, locs, regs) =>
ballarin@15837
   444
         (space, locs, f regs))) Theory.sign_of;
ballarin@15837
   445
val put_local_registration =
ballarin@15837
   446
     gen_put_registration LocalLocalesData.map ProofContext.sign_of;
ballarin@15596
   447
ballarin@15696
   448
(* TODO: needed? *)
ballarin@15837
   449
(*
ballarin@15624
   450
fun smart_put_registration id attn ctxt =
ballarin@15624
   451
  (* ignore registration if already present in theory *)
ballarin@15624
   452
     let
ballarin@15624
   453
       val thy = ProofContext.theory_of ctxt;
ballarin@15624
   454
     in case get_global_registration thy id of
ballarin@15624
   455
          NONE => put_local_registration id attn ctxt
ballarin@15624
   456
        | SOME _ => ctxt
ballarin@15624
   457
     end;
ballarin@15837
   458
*)
ballarin@15624
   459
ballarin@15624
   460
(* add witness theorem to registration in theory or context,
ballarin@15596
   461
   ignored if registration not present *)
ballarin@15596
   462
ballarin@15624
   463
fun gen_add_witness map (name, ps) thm =
ballarin@15624
   464
  map (fn regs =>
ballarin@15624
   465
      let
ballarin@15837
   466
        val reg = valOf (Symtab.lookup (regs, name));
ballarin@15596
   467
      in
ballarin@15837
   468
        Symtab.update ((name, Registrations.add_witness ps thm reg), regs)
ballarin@15624
   469
      end handle Option => regs);
ballarin@15596
   470
ballarin@15624
   471
val add_global_witness =
ballarin@15624
   472
     gen_add_witness (fn f =>
ballarin@15624
   473
       GlobalLocalesData.map (fn (space, locs, regs) =>
ballarin@15624
   474
         (space, locs, f regs)));
ballarin@15624
   475
val add_local_witness = gen_add_witness LocalLocalesData.map;
ballarin@15596
   476
ballarin@15596
   477
ballarin@14215
   478
(* import hierarchy
ballarin@14215
   479
   implementation could be more efficient, eg. by maintaining a database
ballarin@14215
   480
   of dependencies *)
ballarin@14215
   481
ballarin@14215
   482
fun imports thy (upper, lower) =
ballarin@14215
   483
  let
ballarin@14215
   484
    val sign = sign_of thy;
ballarin@14215
   485
    fun imps (Locale name) low = (name = low) orelse
ballarin@14215
   486
      (case get_locale thy name of
skalberg@15531
   487
           NONE => false
skalberg@15531
   488
         | SOME {import, ...} => imps import low)
ballarin@14215
   489
      | imps (Rename (expr, _)) low = imps expr low
ballarin@14215
   490
      | imps (Merge es) low = exists (fn e => imps e low) es;
ballarin@14215
   491
  in
ballarin@14215
   492
    imps (Locale (intern sign upper)) (intern sign lower)
ballarin@14215
   493
  end;
ballarin@14215
   494
ballarin@14215
   495
ballarin@15624
   496
(* printing of registrations *)
ballarin@15596
   497
wenzelm@15703
   498
fun gen_print_registrations get_regs mk_ctxt msg loc thy_ctxt =
ballarin@15596
   499
  let
wenzelm@15703
   500
    val ctxt = mk_ctxt thy_ctxt;
wenzelm@15703
   501
    val thy = ProofContext.theory_of ctxt;
wenzelm@15703
   502
    val sg = Theory.sign_of thy;
wenzelm@15703
   503
wenzelm@15703
   504
    val prt_term = Pretty.quote o ProofContext.pretty_term ctxt;
wenzelm@15703
   505
    val prt_atts = Args.pretty_attribs ctxt;
wenzelm@15703
   506
    fun prt_inst (ts, (("", []), thms)) =
wenzelm@15703
   507
          Pretty.enclose "(" ")" (Pretty.breaks (map prt_term ts))
wenzelm@15703
   508
      | prt_inst (ts, ((prfx, atts), thms)) =
ballarin@15837
   509
          Pretty.block (
ballarin@15837
   510
            (Pretty.breaks (Pretty.str prfx :: prt_atts atts) @
ballarin@15837
   511
              [Pretty.str ":", Pretty.brk 1,
ballarin@15837
   512
                Pretty.enclose "(" ")" (Pretty.breaks (map prt_term ts))]));
wenzelm@15703
   513
ballarin@15596
   514
    val loc_int = intern sg loc;
ballarin@15624
   515
    val regs = get_regs thy_ctxt;
ballarin@15596
   516
    val loc_regs = Symtab.lookup (regs, loc_int);
ballarin@15596
   517
  in
ballarin@15596
   518
    (case loc_regs of
ballarin@15624
   519
        NONE => Pretty.str ("No interpretations in " ^ msg ^ ".")
ballarin@15763
   520
      | SOME r => let
ballarin@15837
   521
            val r' = Registrations.dest r;
ballarin@15763
   522
            val r'' = Library.sort_wrt (fn (_, ((prfx, _), _)) => prfx) r';
ballarin@15763
   523
          in Pretty.big_list ("Interpretations in " ^ msg ^ ":")
ballarin@15763
   524
            (map prt_inst r'')
ballarin@15763
   525
          end)
ballarin@15596
   526
    |> Pretty.writeln
ballarin@15596
   527
  end;
ballarin@15596
   528
ballarin@15624
   529
val print_global_registrations =
ballarin@15624
   530
     gen_print_registrations (#3 o GlobalLocalesData.get)
wenzelm@15703
   531
       ProofContext.init "theory";
ballarin@15624
   532
val print_local_registrations' =
ballarin@15624
   533
     gen_print_registrations LocalLocalesData.get
wenzelm@15703
   534
       I "context";
ballarin@15624
   535
fun print_local_registrations loc ctxt =
ballarin@15624
   536
  (print_global_registrations loc (ProofContext.theory_of ctxt);
ballarin@15624
   537
   print_local_registrations' loc ctxt);
ballarin@15624
   538
ballarin@15596
   539
wenzelm@12277
   540
(* diagnostics *)
wenzelm@12273
   541
wenzelm@12277
   542
fun err_in_locale ctxt msg ids =
wenzelm@12277
   543
  let
wenzelm@12529
   544
    val sign = ProofContext.sign_of ctxt;
wenzelm@12529
   545
    fun prt_id (name, parms) =
wenzelm@12529
   546
      [Pretty.block (Pretty.breaks (map Pretty.str (cond_extern sign name :: parms)))];
skalberg@15570
   547
    val prt_ids = List.concat (separate [Pretty.str " +", Pretty.brk 1] (map prt_id ids));
wenzelm@12502
   548
    val err_msg =
wenzelm@12529
   549
      if forall (equal "" o #1) ids then msg
wenzelm@12502
   550
      else msg ^ "\n" ^ Pretty.string_of (Pretty.block
wenzelm@12502
   551
        (Pretty.str "The error(s) above occurred in locale:" :: Pretty.brk 1 :: prt_ids));
wenzelm@12502
   552
  in raise ProofContext.CONTEXT (err_msg, ctxt) end;
wenzelm@12063
   553
ballarin@15206
   554
(* Version for identifiers with axioms *)
ballarin@15206
   555
ballarin@15206
   556
fun err_in_locale' ctxt msg ids' = err_in_locale ctxt msg (map fst ids');
wenzelm@12277
   557
wenzelm@12277
   558
wenzelm@12529
   559
(** primitives **)
wenzelm@12046
   560
wenzelm@15703
   561
(* map elements *)
wenzelm@15703
   562
wenzelm@15703
   563
fun map_elem {name, var, typ, term, fact, attrib} =
wenzelm@15703
   564
  fn Fixes fixes => Fixes (fixes |> map (fn (x, T, mx) =>
wenzelm@15703
   565
       let val (x', mx') = var (x, mx) in (x', Option.map typ T, mx') end))
wenzelm@15703
   566
   | Assumes asms => Assumes (asms |> map (fn ((a, atts), propps) =>
wenzelm@15703
   567
      ((name a, map attrib atts), propps |> map (fn (t, (ps, qs)) =>
wenzelm@15703
   568
        (term t, (map term ps, map term qs))))))
wenzelm@15703
   569
   | Defines defs => Defines (defs |> map (fn ((a, atts), (t, ps)) =>
wenzelm@15703
   570
      ((name a, map attrib atts), (term t, map term ps))))
wenzelm@15703
   571
   | Notes facts => Notes (facts |> map (fn ((a, atts), bs) =>
wenzelm@15703
   572
      ((name a, map attrib atts), bs |> map (fn (ths, btts) => (fact ths, map attrib btts)))));
wenzelm@15703
   573
wenzelm@15703
   574
fun map_values typ term thm = map_elem
wenzelm@15703
   575
  {name = I, var = I, typ = typ, term = term, fact = map thm,
wenzelm@15703
   576
    attrib = Args.map_values I typ term thm};
wenzelm@15703
   577
wenzelm@15703
   578
wenzelm@15703
   579
(* map attributes *)
wenzelm@15703
   580
wenzelm@15703
   581
fun map_attrib_specs f = map (apfst (apsnd (map f)));
wenzelm@15703
   582
fun map_attrib_facts f = map (apfst (apsnd (map f)) o apsnd (map (apsnd (map f))));
wenzelm@15703
   583
wenzelm@15703
   584
fun map_attrib_elem f = map_elem {name = I, var = I, typ = I, term = I, fact = I, attrib = f};
wenzelm@15703
   585
wenzelm@15703
   586
fun intern_attrib_elem thy = map_attrib_elem (Attrib.intern_src (Theory.sign_of thy));
wenzelm@15703
   587
wenzelm@15703
   588
fun intern_attrib_elem_expr thy (Elem elem) = Elem (intern_attrib_elem thy elem)
wenzelm@15703
   589
  | intern_attrib_elem_expr _ (Expr expr) = Expr expr;
wenzelm@15703
   590
wenzelm@15703
   591
wenzelm@12277
   592
(* renaming *)
wenzelm@12263
   593
ballarin@16102
   594
(* ren maps names to (new) names and syntax; represented as association list *)
wenzelm@12263
   595
wenzelm@15703
   596
fun rename_var ren (x, mx) =
ballarin@16102
   597
  case assoc_string (ren, x) of
ballarin@16102
   598
      NONE => (x, mx)
ballarin@16102
   599
    | SOME (x', NONE) =>
ballarin@16102
   600
        (x', if mx = NONE then mx else SOME Syntax.NoSyn)     (*drop syntax*)
ballarin@16102
   601
    | SOME (x', SOME mx') =>
ballarin@16102
   602
        if mx = NONE then raise ERROR_MESSAGE
ballarin@16102
   603
          ("Attempt to change syntax of structure parameter " ^ quote x)
ballarin@16102
   604
        else (x', SOME mx');                                (*change syntax*)
ballarin@16102
   605
ballarin@16102
   606
fun rename ren x =
ballarin@16102
   607
  case assoc_string (ren, x) of
ballarin@16102
   608
      NONE => x
ballarin@16102
   609
    | SOME (x', _) => x';                                   (*ignore syntax*)
wenzelm@15703
   610
wenzelm@12263
   611
fun rename_term ren (Free (x, T)) = Free (rename ren x, T)
wenzelm@12263
   612
  | rename_term ren (t $ u) = rename_term ren t $ rename_term ren u
wenzelm@12263
   613
  | rename_term ren (Abs (x, T, t)) = Abs (x, T, rename_term ren t)
wenzelm@12263
   614
  | rename_term _ a = a;
wenzelm@12263
   615
wenzelm@12263
   616
fun rename_thm ren th =
wenzelm@12263
   617
  let
wenzelm@12263
   618
    val {sign, hyps, prop, maxidx, ...} = Thm.rep_thm th;
wenzelm@12263
   619
    val cert = Thm.cterm_of sign;
skalberg@15570
   620
    val (xs, Ts) = Library.split_list (Library.foldl Term.add_frees ([], prop :: hyps));
wenzelm@12263
   621
    val xs' = map (rename ren) xs;
wenzelm@12263
   622
    fun cert_frees names = map (cert o Free) (names ~~ Ts);
wenzelm@12263
   623
    fun cert_vars names = map (cert o Var o apfst (rpair (maxidx + 1))) (names ~~ Ts);
wenzelm@12263
   624
  in
wenzelm@12263
   625
    if xs = xs' then th
wenzelm@12263
   626
    else
wenzelm@12263
   627
      th
wenzelm@12263
   628
      |> Drule.implies_intr_list (map cert hyps)
wenzelm@12263
   629
      |> Drule.forall_intr_list (cert_frees xs)
wenzelm@12263
   630
      |> Drule.forall_elim_list (cert_vars xs)
wenzelm@12263
   631
      |> Thm.instantiate ([], cert_vars xs ~~ cert_frees xs')
wenzelm@12263
   632
      |> (fn th' => Drule.implies_elim_list th' (map (Thm.assume o cert o rename_term ren) hyps))
wenzelm@12263
   633
  end;
wenzelm@12263
   634
wenzelm@15703
   635
fun rename_elem ren =
wenzelm@15703
   636
  map_values I (rename_term ren) (rename_thm ren) o
wenzelm@15703
   637
  map_elem {name = I, typ = I, term = I, fact = I, attrib = I, var = rename_var ren};
wenzelm@12263
   638
wenzelm@12529
   639
fun rename_facts prfx elem =
wenzelm@12307
   640
  let
wenzelm@12323
   641
    fun qualify (arg as ((name, atts), x)) =
wenzelm@13394
   642
      if prfx = "" orelse name = "" then arg
wenzelm@13375
   643
      else ((NameSpace.pack [prfx, name], atts), x);
wenzelm@12307
   644
  in
wenzelm@12307
   645
    (case elem of
wenzelm@12307
   646
      Fixes fixes => Fixes fixes
wenzelm@12307
   647
    | Assumes asms => Assumes (map qualify asms)
wenzelm@12307
   648
    | Defines defs => Defines (map qualify defs)
wenzelm@12307
   649
    | Notes facts => Notes (map qualify facts))
wenzelm@12307
   650
  end;
wenzelm@12307
   651
wenzelm@12263
   652
wenzelm@12502
   653
(* type instantiation *)
wenzelm@12502
   654
wenzelm@12502
   655
fun inst_type [] T = T
skalberg@15570
   656
  | inst_type env T = Term.map_type_tfree (fn v => getOpt (assoc (env, v), TFree v)) T;
wenzelm@12502
   657
wenzelm@12502
   658
fun inst_term [] t = t
wenzelm@12502
   659
  | inst_term env t = Term.map_term_types (inst_type env) t;
wenzelm@12502
   660
wenzelm@13211
   661
fun inst_thm _ [] th = th
wenzelm@13211
   662
  | inst_thm ctxt env th =
wenzelm@12502
   663
      let
wenzelm@13211
   664
        val sign = ProofContext.sign_of ctxt;
wenzelm@12575
   665
        val cert = Thm.cterm_of sign;
wenzelm@12575
   666
        val certT = Thm.ctyp_of sign;
wenzelm@13211
   667
        val {hyps, prop, maxidx, ...} = Thm.rep_thm th;
skalberg@15574
   668
        val tfrees = foldr Term.add_term_tfree_names [] (prop :: hyps);
skalberg@15570
   669
        val env' = List.filter (fn ((a, _), _) => a mem_string tfrees) env;
wenzelm@12502
   670
      in
wenzelm@12502
   671
        if null env' then th
wenzelm@12502
   672
        else
wenzelm@12502
   673
          th
wenzelm@12502
   674
          |> Drule.implies_intr_list (map cert hyps)
wenzelm@12575
   675
          |> Drule.tvars_intr_list (map (#1 o #1) env')
wenzelm@12502
   676
          |> (fn (th', al) => th' |>
berghofe@15798
   677
            Thm.instantiate ((map (fn ((a, _), T) =>
berghofe@15798
   678
              (certT (TVar (valOf (assoc (al, a)))), certT T)) env'), []))
wenzelm@12502
   679
          |> (fn th'' => Drule.implies_elim_list th''
wenzelm@12502
   680
              (map (Thm.assume o cert o inst_term env') hyps))
wenzelm@12502
   681
      end;
wenzelm@12502
   682
wenzelm@15703
   683
fun inst_elem ctxt env =
wenzelm@15703
   684
  map_values (inst_type env) (inst_term env) (inst_thm ctxt env);
wenzelm@12502
   685
wenzelm@12502
   686
ballarin@15696
   687
(* term and type instantiation, variant using symbol tables *)
ballarin@15696
   688
ballarin@15696
   689
(* instantiate TFrees *)
ballarin@15696
   690
wenzelm@15749
   691
fun tinst_tab_elem sg tinst =
wenzelm@15749
   692
  map_values (tinst_tab_type tinst) (tinst_tab_term tinst) (tinst_tab_thm sg tinst);
wenzelm@15749
   693
ballarin@15696
   694
(* instantiate TFrees and Frees *)
ballarin@15696
   695
ballarin@15763
   696
fun inst_tab_elem sg (inst as (_, tinst)) =
ballarin@15763
   697
  map_values (tinst_tab_type tinst) (inst_tab_term inst) (inst_tab_thm sg inst);
ballarin@15696
   698
ballarin@15696
   699
fun inst_tab_elems sign inst ((n, ps), elems) =
ballarin@15696
   700
      ((n, map (inst_tab_term inst) ps), map (inst_tab_elem sign inst) elems);
ballarin@15696
   701
wenzelm@12529
   702
wenzelm@12529
   703
(** structured contexts: rename + merge + implicit type instantiation **)
wenzelm@12529
   704
wenzelm@12529
   705
(* parameter types *)
wenzelm@12529
   706
ballarin@14508
   707
(* CB: frozen_tvars has the following type:
berghofe@15798
   708
  ProofContext.context -> Term.typ list -> (Term.indexname * (sort * Term.typ)) list *)
ballarin@14508
   709
wenzelm@12529
   710
fun frozen_tvars ctxt Ts =
wenzelm@12529
   711
  let
skalberg@15570
   712
    val tvars = rev (Library.foldl Term.add_tvarsT ([], Ts));
wenzelm@12529
   713
    val tfrees = map TFree
wenzelm@14695
   714
      (Term.invent_names (ProofContext.used_types ctxt) "'a" (length tvars) ~~ map #2 tvars);
berghofe@15798
   715
  in map (fn ((x, S), y) => (x, (S, y))) (tvars ~~ tfrees) end;
wenzelm@12529
   716
wenzelm@12529
   717
fun unify_frozen ctxt maxidx Ts Us =
wenzelm@12529
   718
  let
skalberg@15531
   719
    fun paramify (i, NONE) = (i, NONE)
skalberg@15531
   720
      | paramify (i, SOME T) = apsnd SOME (TypeInfer.paramify_dummies (i, T));
wenzelm@12529
   721
wenzelm@12529
   722
    val (maxidx', Ts') = foldl_map paramify (maxidx, Ts);
wenzelm@12727
   723
    val (maxidx'', Us') = foldl_map paramify (maxidx', Us);
ballarin@14215
   724
    val tsig = Sign.tsig_of (ProofContext.sign_of ctxt);
ballarin@14215
   725
skalberg@15531
   726
    fun unify (env, (SOME T, SOME U)) = (Type.unify tsig env (U, T)
ballarin@14215
   727
          handle Type.TUNIFY =>
ballarin@14215
   728
            raise TYPE ("unify_frozen: failed to unify types", [U, T], []))
ballarin@14215
   729
      | unify (env, _) = env;
skalberg@15570
   730
    val (unifier, _) = Library.foldl unify ((Vartab.empty, maxidx''), Ts' ~~ Us');
skalberg@15570
   731
    val Vs = map (Option.map (Envir.norm_type unifier)) Us';
skalberg@15570
   732
    val unifier' = Vartab.extend (unifier, frozen_tvars ctxt (List.mapPartial I Vs));
skalberg@15570
   733
  in map (Option.map (Envir.norm_type unifier')) Vs end;
wenzelm@12529
   734
skalberg@15570
   735
fun params_of elemss = gen_distinct eq_fst (List.concat (map (snd o fst) elemss));
skalberg@15570
   736
fun params_of' elemss = gen_distinct eq_fst (List.concat (map (snd o fst o fst) elemss));
ballarin@16102
   737
fun params_syn_of syn elemss =
ballarin@16102
   738
  gen_distinct eq_fst (List.concat (map (snd o fst) elemss)) |>
ballarin@16102
   739
    map (apfst (fn x => (x, valOf (Symtab.lookup (syn, x)))));
ballarin@16102
   740
ballarin@14508
   741
ballarin@14508
   742
(* CB: param_types has the following type:
skalberg@15531
   743
  ('a * 'b option) list -> ('a * 'b) list *)
skalberg@15570
   744
fun param_types ps = List.mapPartial (fn (_, NONE) => NONE | (x, SOME T) => SOME (x, T)) ps;
wenzelm@12529
   745
wenzelm@12529
   746
ballarin@16102
   747
fun merge_syntax ctxt ids ss = Symtab.merge (op =) ss
ballarin@16102
   748
  handle Symtab.DUPS xs => err_in_locale ctxt
ballarin@16105
   749
    ("Conflicting syntax for parameter(s): " ^ commas_quote xs) (map fst ids);
ballarin@16102
   750
ballarin@16102
   751
wenzelm@12529
   752
(* flatten expressions *)
wenzelm@11896
   753
wenzelm@12510
   754
local
wenzelm@12502
   755
ballarin@15206
   756
(* CB: OUTDATED unique_parms has the following type:
ballarin@14508
   757
     'a ->
ballarin@14508
   758
     (('b * (('c * 'd) list * Symtab.key list)) * 'e) list ->
ballarin@14508
   759
     (('b * ('c * 'd) list) * 'e) list  *)
ballarin@14508
   760
wenzelm@12529
   761
fun unique_parms ctxt elemss =
wenzelm@12529
   762
  let
wenzelm@12529
   763
    val param_decls =
skalberg@15570
   764
      List.concat (map (fn (((name, (ps, qs)), _), _) => map (rpair (name, ps)) qs) elemss)
wenzelm@12529
   765
      |> Symtab.make_multi |> Symtab.dest;
wenzelm@12529
   766
  in
wenzelm@12529
   767
    (case find_first (fn (_, ids) => length ids > 1) param_decls of
skalberg@15531
   768
      SOME (q, ids) => err_in_locale ctxt ("Multiple declaration of parameter " ^ quote q)
wenzelm@12529
   769
          (map (apsnd (map fst)) ids)
skalberg@15531
   770
    | NONE => map (apfst (apfst (apsnd #1))) elemss)
wenzelm@12529
   771
  end;
wenzelm@12529
   772
ballarin@16102
   773
fun unify_parms ctxt (fixed_parms : (string * typ) list)
ballarin@16102
   774
  (raw_parmss : (string * typ option) list list) =
wenzelm@12502
   775
  let
ballarin@15206
   776
    val sign = ProofContext.sign_of ctxt;
ballarin@15206
   777
    val tsig = Sign.tsig_of sign;
wenzelm@12502
   778
    val maxidx = length raw_parmss;
wenzelm@12502
   779
    val idx_parmss = (0 upto maxidx - 1) ~~ raw_parmss;
wenzelm@12502
   780
wenzelm@12502
   781
    fun varify i = Term.map_type_tfree (fn (a, S) => TVar ((a, i), S));
wenzelm@12529
   782
    fun varify_parms (i, ps) = map (apsnd (varify i)) (param_types ps);
skalberg@15570
   783
    val parms = fixed_parms @ List.concat (map varify_parms idx_parmss);
wenzelm@12502
   784
ballarin@15206
   785
    fun unify T ((env, maxidx), U) =
ballarin@15206
   786
      Type.unify tsig (env, maxidx) (U, T)
ballarin@15206
   787
      handle Type.TUNIFY =>
ballarin@15206
   788
        let val prt = Sign.string_of_typ sign
ballarin@15206
   789
        in raise TYPE ("unify_parms: failed to unify types " ^
ballarin@15206
   790
          prt U ^ " and " ^ prt T, [U, T], [])
ballarin@15206
   791
        end
skalberg@15570
   792
    fun unify_list (envir, T :: Us) = Library.foldl (unify T) (envir, Us)
wenzelm@12502
   793
      | unify_list (envir, []) = envir;
skalberg@15570
   794
    val (unifier, _) = Library.foldl unify_list
wenzelm@12502
   795
      ((Vartab.empty, maxidx), map #2 (Symtab.dest (Symtab.make_multi parms)));
wenzelm@12502
   796
wenzelm@12502
   797
    val parms' = map (apsnd (Envir.norm_type unifier)) (gen_distinct eq_fst parms);
wenzelm@12502
   798
    val unifier' = Vartab.extend (unifier, frozen_tvars ctxt (map #2 parms'));
wenzelm@12502
   799
wenzelm@12502
   800
    fun inst_parms (i, ps) =
skalberg@15574
   801
      foldr Term.add_typ_tfrees [] (List.mapPartial snd ps)
skalberg@15570
   802
      |> List.mapPartial (fn (a, S) =>
wenzelm@12502
   803
          let val T = Envir.norm_type unifier' (TVar ((a, i), S))
skalberg@15531
   804
          in if T = TFree (a, S) then NONE else SOME ((a, S), T) end)
ballarin@16102
   805
  in map inst_parms idx_parmss end : ((string * Term.sort) * Term.typ) list list;
wenzelm@12502
   806
wenzelm@12529
   807
in
wenzelm@12502
   808
wenzelm@12529
   809
fun unify_elemss _ _ [] = []
wenzelm@12529
   810
  | unify_elemss _ [] [elems] = [elems]
wenzelm@12529
   811
  | unify_elemss ctxt fixed_parms elemss =
wenzelm@12502
   812
      let
ballarin@15206
   813
        val envs = unify_parms ctxt fixed_parms (map (#2 o #1 o #1) elemss);
ballarin@15206
   814
        fun inst ((((name, ps), axs), elems), env) =
skalberg@15570
   815
          (((name, map (apsnd (Option.map (inst_type env))) ps), 
ballarin@15206
   816
            map (inst_thm ctxt env) axs), map (inst_elem ctxt env) elems);
wenzelm@12839
   817
      in map inst (elemss ~~ envs) end;
wenzelm@12502
   818
ballarin@16102
   819
(* like unify_elemss, but does not touch axioms,
ballarin@16102
   820
   additional parameter for enforcing further constraints (eg. syntax) *)
ballarin@16102
   821
ballarin@16102
   822
fun unify_elemss' _ _ [] [] = []
ballarin@16102
   823
  | unify_elemss' _ [] [elems] [] = [elems]
ballarin@16102
   824
  | unify_elemss' ctxt fixed_parms elemss c_parms =
ballarin@16102
   825
      let
ballarin@16102
   826
        val envs = unify_parms ctxt fixed_parms (map (#2 o #1 o #1) elemss @ map single c_parms);
ballarin@16102
   827
        fun inst ((((name, ps), axs), elems), env) =
ballarin@16102
   828
          (((name, map (apsnd (Option.map (inst_type env))) ps),  axs),
ballarin@16102
   829
           map (inst_elem ctxt env) elems);
ballarin@16102
   830
      in map inst (elemss ~~ (Library.take (length elemss, envs))) end;
ballarin@16102
   831
ballarin@15596
   832
(* flatten_expr:
ballarin@15596
   833
   Extend list of identifiers by those new in locale expression expr.
ballarin@15596
   834
   Compute corresponding list of lists of locale elements (one entry per
ballarin@15596
   835
   identifier).
ballarin@15596
   836
ballarin@15596
   837
   Identifiers represent locale fragments and are in an extended form:
ballarin@15596
   838
     ((name, ps), (ax_ps, axs))
ballarin@15596
   839
   (name, ps) is the locale name with all its parameters.
ballarin@15596
   840
   (ax_ps, axs) is the locale axioms with its parameters;
ballarin@15596
   841
     axs are always taken from the top level of the locale hierarchy,
ballarin@15596
   842
     hence axioms may contain additional parameters from later fragments:
ballarin@15596
   843
     ps subset of ax_ps.  axs is either singleton or empty.
ballarin@15596
   844
ballarin@15596
   845
   Elements are enriched by identifier-like information:
ballarin@15596
   846
     (((name, ax_ps), axs), elems)
ballarin@15596
   847
   The parameters in ax_ps are the axiom parameters, but enriched by type
ballarin@15596
   848
   info: now each entry is a pair of string and typ option.  Axioms are
ballarin@15596
   849
   type-instantiated.
ballarin@15596
   850
ballarin@15596
   851
*)
ballarin@15596
   852
ballarin@16102
   853
fun flatten_expr ctxt ((prev_idents, prev_syntax), expr) =
wenzelm@12014
   854
  let
wenzelm@12014
   855
    val thy = ProofContext.theory_of ctxt;
ballarin@15596
   856
    (* thy used for retrieval of locale info,
ballarin@15596
   857
       ctxt for error messages, parameter unification and instantiation
ballarin@15596
   858
       of axioms *)
ballarin@15596
   859
    (* TODO: consider err_in_locale with thy argument *)
wenzelm@12263
   860
skalberg@15531
   861
    fun renaming (SOME x :: xs) (y :: ys) = (y, x) :: renaming xs ys
skalberg@15531
   862
      | renaming (NONE :: xs) (y :: ys) = renaming xs ys
wenzelm@12273
   863
      | renaming [] _ = []
wenzelm@12289
   864
      | renaming xs [] = raise ERROR_MESSAGE ("Too many arguments in renaming: " ^
ballarin@16102
   865
          commas (map (fn NONE => "_" | SOME x => quote (fst x)) xs));
wenzelm@12289
   866
ballarin@15206
   867
    fun rename_parms top ren ((name, ps), (parms, axs)) =
wenzelm@12289
   868
      let val ps' = map (rename ren) ps in
ballarin@15206
   869
        (case duplicates ps' of [] => ((name, ps'),
ballarin@15206
   870
          if top then (map (rename ren) parms, map (rename_thm ren) axs)
ballarin@15206
   871
          else (parms, axs))
wenzelm@12289
   872
        | dups => err_in_locale ctxt ("Duplicate parameters: " ^ commas_quote dups) [(name, ps')])
wenzelm@12289
   873
      end;
wenzelm@12263
   874
ballarin@15206
   875
    fun identify top (Locale name) =
ballarin@15596
   876
    (* CB: ids_ax is a list of tuples of the form ((name, ps), axs),
ballarin@15206
   877
       where name is a locale name, ps a list of parameter names and axs
ballarin@15206
   878
       a list of axioms relating to the identifier, axs is empty unless
ballarin@15206
   879
       identify at top level (top = true);
ballarin@14215
   880
       parms is accumulated list of parameters *)
wenzelm@12289
   881
          let
ballarin@15206
   882
            val {predicate = (_, axioms), import, params, ...} =
ballarin@15206
   883
              the_locale thy name;
ballarin@16102
   884
            val ps = map (#1 o #1) (#1 params);
ballarin@16102
   885
            val (ids', parms', _) = identify false import;
ballarin@15206
   886
                (* acyclic import dependencies *)
ballarin@15206
   887
            val ids'' = ids' @ [((name, ps), ([], []))];
ballarin@15206
   888
            val ids_ax = if top then snd
ballarin@16102
   889
                 (* get the right axioms, only if at top level *)
ballarin@15206
   890
                 (foldl_map (fn (axs, ((name, parms), _)) => let
ballarin@15206
   891
                   val {elems, ...} = the_locale thy name;
skalberg@15570
   892
                   val ts = List.concat (List.mapPartial (fn (Assumes asms, _) =>
skalberg@15570
   893
                     SOME (List.concat (map (map #1 o #2) asms)) | _ => NONE) elems);
ballarin@15206
   894
                   val (axs1, axs2) = splitAt (length ts, axs);
ballarin@15206
   895
                 in (axs2, ((name, parms), (ps, axs1))) end) (axioms, ids''))
ballarin@15206
   896
               else ids'';
ballarin@16102
   897
            val syn = Symtab.make (map (apfst fst) (#1 params));
ballarin@16102
   898
          in (ids_ax, merge_lists parms' ps, syn) end
ballarin@15206
   899
      | identify top (Rename (e, xs)) =
wenzelm@12273
   900
          let
ballarin@16102
   901
            val (ids', parms', syn') = identify top e;
wenzelm@12839
   902
            val ren = renaming xs parms'
ballarin@15206
   903
              handle ERROR_MESSAGE msg => err_in_locale' ctxt msg ids';
ballarin@15206
   904
            val ids'' = gen_distinct eq_fst (map (rename_parms top ren) ids');
skalberg@15570
   905
            val parms'' = distinct (List.concat (map (#2 o #1) ids''));
ballarin@16102
   906
            val syn'' = syn' |> Symtab.dest |> map (rename_var ren) |>
ballarin@16102
   907
                  Symtab.make;
ballarin@16102
   908
            (* check for conflicting syntax? *)
ballarin@16102
   909
          in (ids'', parms'', syn'') end
ballarin@15206
   910
      | identify top (Merge es) =
ballarin@16102
   911
          Library.foldl (fn ((ids, parms, syn), e) => let
ballarin@16102
   912
                     val (ids', parms', syn') = identify top e
ballarin@15206
   913
                   in (gen_merge_lists eq_fst ids ids',
ballarin@16102
   914
                       merge_lists parms parms',
ballarin@16102
   915
                       merge_syntax ctxt ids' (syn, syn')) end)
ballarin@16102
   916
            (([], [], Symtab.empty), es);
wenzelm@12014
   917
ballarin@15206
   918
    (* CB: enrich identifiers by parameter types and 
ballarin@16102
   919
       the corresponding elements (with renamed parameters),
ballarin@16102
   920
       also takes care of parameter syntax *)
ballarin@15206
   921
ballarin@16102
   922
    fun eval syn ((name, xs), axs) =
wenzelm@12273
   923
      let
wenzelm@13308
   924
        val {params = (ps, qs), elems, ...} = the_locale thy name;
ballarin@16102
   925
        val ps' = map #1 ps;
ballarin@16102
   926
        val ren = map #1 ps' ~~
ballarin@16102
   927
              map (fn x => (x, valOf (Symtab.lookup (syn, x)))) xs;
wenzelm@13308
   928
        val (params', elems') =
ballarin@16102
   929
          if null ren then ((ps', qs), map #1 elems)
ballarin@16102
   930
          else ((map (apfst (rename ren)) ps', map (rename ren) qs),
wenzelm@13308
   931
            map (rename_elem ren o #1) elems);
wenzelm@13375
   932
        val elems'' = map (rename_facts (space_implode "_" xs)) elems';
ballarin@15206
   933
      in (((name, params'), axs), elems'') end;
wenzelm@12307
   934
ballarin@16102
   935
    (* type constraint for renamed parameter with syntax *)
ballarin@16102
   936
    fun type_syntax NONE = NONE
ballarin@16102
   937
      | type_syntax (SOME mx) = let
ballarin@16102
   938
            val Ts = map (fn x => TFree (x, [])) (Term.invent_names [] "'mxa"
ballarin@16102
   939
              (Syntax.mixfix_args mx + 1))
ballarin@16102
   940
          in Ts |> Library.split_last |> op ---> |> SOME end;
ballarin@16102
   941
ballarin@16102
   942
    (* compute identifiers and syntax, merge with previous ones *)
ballarin@16102
   943
    val (ids, _, syn) = identify true expr;
ballarin@16102
   944
    val idents = gen_rems eq_fst (ids, prev_idents);
ballarin@16102
   945
    val syntax = merge_syntax ctxt ids (syn, prev_syntax);
ballarin@15206
   946
    (* add types to params, check for unique params and unify them *)
ballarin@16102
   947
    val raw_elemss = unique_parms ctxt (map (eval syntax) idents);
ballarin@16102
   948
    val elemss = unify_elemss' ctxt [] raw_elemss
ballarin@16102
   949
         (map (apsnd type_syntax) (Symtab.dest syntax));
ballarin@15206
   950
    (* replace params in ids by params from axioms,
ballarin@15206
   951
       adjust types in axioms *)
ballarin@15206
   952
    val all_params' = params_of' elemss;
ballarin@15206
   953
    val all_params = param_types all_params';
ballarin@15206
   954
    val elemss' = map (fn (((name, _), (ps, axs)), elems) =>
ballarin@15206
   955
         (((name, map (fn p => (p, assoc (all_params, p))) ps), axs), elems))
ballarin@15206
   956
         elemss;
ballarin@15206
   957
    fun inst_ax th = let
ballarin@15206
   958
         val {hyps, prop, ...} = Thm.rep_thm th;
skalberg@15570
   959
         val ps = map (apsnd SOME) (Library.foldl Term.add_frees ([], prop :: hyps));
ballarin@15206
   960
         val [env] = unify_parms ctxt all_params [ps];
ballarin@15206
   961
         val th' = inst_thm ctxt env th;
ballarin@15206
   962
       in th' end;
ballarin@15206
   963
    val final_elemss = map (fn ((id, axs), elems) =>
ballarin@15206
   964
         ((id, map inst_ax axs), elems)) elemss';
ballarin@16102
   965
  in ((prev_idents @ idents, syntax), final_elemss) end;
wenzelm@12046
   966
wenzelm@12510
   967
end;
wenzelm@12510
   968
wenzelm@12070
   969
wenzelm@12529
   970
(* activate elements *)
wenzelm@12273
   971
wenzelm@12510
   972
local
wenzelm@12510
   973
wenzelm@13399
   974
fun export_axioms axs _ hyps th =
wenzelm@13399
   975
  th |> Drule.satisfy_hyps axs
ballarin@15206
   976
     (* CB: replace meta-hyps, using axs, by a single meta-hyp. *)
wenzelm@13399
   977
  |> Drule.implies_intr_list (Library.drop (length axs, hyps))
ballarin@15206
   978
     (* CB: turn remaining hyps into assumptions. *)
ballarin@15206
   979
  |> Seq.single
wenzelm@12263
   980
wenzelm@14643
   981
fun activate_elem _ ((ctxt, axs), Fixes fixes) =
wenzelm@14643
   982
      ((ctxt |> ProofContext.add_fixes fixes, axs), [])
wenzelm@13399
   983
  | activate_elem _ ((ctxt, axs), Assumes asms) =
wenzelm@13399
   984
      let
wenzelm@15703
   985
        val asms' = map_attrib_specs (Attrib.context_attribute_i ctxt) asms;
wenzelm@15703
   986
        val ts = List.concat (map (map #1 o #2) asms');
wenzelm@15703
   987
        val (ps, qs) = splitAt (length ts, axs);
wenzelm@13420
   988
        val (ctxt', _) =
wenzelm@13399
   989
          ctxt |> ProofContext.fix_frees ts
wenzelm@15703
   990
          |> ProofContext.assume_i (export_axioms ps) asms';
nipkow@13629
   991
      in ((ctxt', qs), []) end
wenzelm@13399
   992
  | activate_elem _ ((ctxt, axs), Defines defs) =
ballarin@15596
   993
      let
wenzelm@15703
   994
        val defs' = map_attrib_specs (Attrib.context_attribute_i ctxt) defs;
ballarin@15596
   995
        val (ctxt', _) =
wenzelm@13399
   996
        ctxt |> ProofContext.assume_i ProofContext.export_def
wenzelm@15703
   997
          (defs' |> map (fn ((name, atts), (t, ps)) =>
wenzelm@13399
   998
            let val (c, t') = ProofContext.cert_def ctxt t
wenzelm@13399
   999
            in ((if name = "" then Thm.def_name c else name, atts), [(t', (ps, []))]) end))
wenzelm@13420
  1000
      in ((ctxt', axs), []) end
wenzelm@13399
  1001
  | activate_elem is_ext ((ctxt, axs), Notes facts) =
ballarin@15596
  1002
      let
wenzelm@15703
  1003
        val facts' = map_attrib_facts (Attrib.context_attribute_i ctxt) facts;
wenzelm@15703
  1004
        val (ctxt', res) = ctxt |> ProofContext.note_thmss_i facts';
wenzelm@13420
  1005
      in ((ctxt', axs), if is_ext then res else []) end;
wenzelm@12502
  1006
ballarin@15206
  1007
fun activate_elems (((name, ps), axs), elems) ctxt =
ballarin@15206
  1008
  let val ((ctxt', _), res) =
wenzelm@13399
  1009
    foldl_map (activate_elem (name = "")) ((ProofContext.qualified true ctxt, axs), elems)
wenzelm@13399
  1010
      handle ProofContext.CONTEXT (msg, ctxt) => err_in_locale ctxt msg [(name, map fst ps)]
ballarin@15696
  1011
    val ctxt'' = if name = "" then ctxt'
ballarin@15696
  1012
          else let
ballarin@15696
  1013
              val ps' = map (fn (n, SOME T) => Free (n, T)) ps;
ballarin@15696
  1014
              val ctxt'' = put_local_registration (name, ps') ("", []) ctxt'
ballarin@15696
  1015
            in foldl (fn (ax, ctxt) =>
ballarin@15696
  1016
              add_local_witness (name, ps') (Thm.assume (Thm.cprop_of ax)) ctxt) ctxt'' axs
ballarin@15696
  1017
            end
ballarin@15696
  1018
  in (ProofContext.restore_qualified ctxt ctxt'', res) end;
wenzelm@13399
  1019
ballarin@15206
  1020
fun activate_elemss prep_facts = foldl_map (fn (ctxt, (((name, ps), axs), raw_elems)) =>
wenzelm@12834
  1021
  let
wenzelm@12834
  1022
    val elems = map (prep_facts ctxt) raw_elems;
skalberg@15570
  1023
    val (ctxt', res) = apsnd List.concat (activate_elems (((name, ps), axs), elems) ctxt);
wenzelm@15703
  1024
    val elems' = map (map_attrib_elem Args.closure) elems;
wenzelm@15703
  1025
  in (ctxt', (((name, ps), elems'), res)) end);
wenzelm@12834
  1026
wenzelm@12546
  1027
in
wenzelm@12546
  1028
ballarin@15206
  1029
(* CB: activate_facts prep_facts (ctxt, elemss),
ballarin@15206
  1030
   where elemss is a list of pairs consisting of identifiers and
ballarin@15206
  1031
   context elements, extends ctxt by the context elements yielding
ballarin@15206
  1032
   ctxt' and returns (ctxt', (elemss', facts)).
ballarin@15206
  1033
   Identifiers in the argument are of the form ((name, ps), axs) and
ballarin@15206
  1034
   assumptions use the axioms in the identifiers to set up exporters
ballarin@15206
  1035
   in ctxt'.  elemss' does not contain identifiers and is obtained
ballarin@15206
  1036
   from elemss and the intermediate context with prep_facts.
wenzelm@15703
  1037
   If read_facts or cert_facts is used for prep_facts, these also remove
ballarin@14508
  1038
   the internal/external markers from elemss. *)
ballarin@14508
  1039
wenzelm@13399
  1040
fun activate_facts prep_facts arg =
skalberg@15570
  1041
  apsnd (apsnd List.concat o Library.split_list) (activate_elemss prep_facts arg);
wenzelm@12546
  1042
wenzelm@15703
  1043
fun activate_note prep_facts (ctxt, args) =
wenzelm@15703
  1044
  let
wenzelm@15703
  1045
    val (ctxt', ([(_, [Notes args'])], facts)) =
wenzelm@15703
  1046
      activate_facts prep_facts (ctxt, [((("", []), []), [Ext (Notes args)])]);
wenzelm@15703
  1047
  in (ctxt', (args', facts)) end;
wenzelm@15703
  1048
wenzelm@12510
  1049
end;
wenzelm@12510
  1050
wenzelm@12307
  1051
ballarin@15696
  1052
(* register elements *)
ballarin@15696
  1053
ballarin@15696
  1054
fun register_elems (((_, ps), (((name, ax_ps), axs), _)), ctxt) =
ballarin@15696
  1055
  if name = "" then ctxt
ballarin@15696
  1056
      else let val ps' = map (fn (n, SOME T) => Free (n, T)) ax_ps
ballarin@15696
  1057
          val ctxt' = put_local_registration (name, ps') ("", []) ctxt
ballarin@15696
  1058
        in foldl (fn (ax, ctxt) =>
ballarin@15696
  1059
          add_local_witness (name, ps') ax ctxt) ctxt' axs
ballarin@15696
  1060
        end;
ballarin@15696
  1061
ballarin@15696
  1062
fun register_elemss id_elemss ctxt = 
ballarin@15696
  1063
  foldl register_elems ctxt id_elemss;
ballarin@15696
  1064
ballarin@15696
  1065
wenzelm@12529
  1066
(** prepare context elements **)
wenzelm@12529
  1067
wenzelm@12529
  1068
(* expressions *)
wenzelm@12529
  1069
wenzelm@12529
  1070
fun intern_expr sg (Locale xname) = Locale (intern sg xname)
wenzelm@12529
  1071
  | intern_expr sg (Merge exprs) = Merge (map (intern_expr sg) exprs)
wenzelm@12529
  1072
  | intern_expr sg (Rename (expr, xs)) = Rename (intern_expr sg expr, xs);
wenzelm@12529
  1073
wenzelm@12529
  1074
wenzelm@12529
  1075
(* parameters *)
wenzelm@12502
  1076
wenzelm@12502
  1077
local
wenzelm@12502
  1078
wenzelm@12529
  1079
fun prep_fixes prep_vars ctxt fixes =
wenzelm@12529
  1080
  let val vars = snd (foldl_map prep_vars (ctxt, map (fn (x, T, _) => ([x], T)) fixes))
wenzelm@12529
  1081
  in map (fn (([x'], T'), (_, _, mx)) => (x', T', mx)) (vars ~~ fixes) end;
wenzelm@12529
  1082
wenzelm@12529
  1083
in
wenzelm@12529
  1084
wenzelm@12529
  1085
fun read_fixes x = prep_fixes ProofContext.read_vars x;
wenzelm@12529
  1086
fun cert_fixes x = prep_fixes ProofContext.cert_vars x;
wenzelm@12529
  1087
wenzelm@12529
  1088
end;
wenzelm@12529
  1089
wenzelm@12529
  1090
wenzelm@12529
  1091
(* propositions and bindings *)
wenzelm@12529
  1092
ballarin@16102
  1093
(* flatten ((ids, syn), expr) normalises expr (which is either a locale
ballarin@14508
  1094
   expression or a single context element) wrt.
ballarin@14508
  1095
   to the list ids of already accumulated identifiers.
ballarin@16102
  1096
   It returns (ids', syn', elemss) where ids' is an extension of ids
ballarin@14508
  1097
   with identifiers generated for expr, and elemss is the list of
ballarin@16102
  1098
   context elements generated from expr.
ballarin@16102
  1099
   syn and syn' are symtabs mapping parameter names to their syntax.  syn'
ballarin@16102
  1100
   is an extension of syn.
ballarin@16102
  1101
   For details, see flatten_expr.
ballarin@16102
  1102
ballarin@15596
  1103
   Additionally, for a locale expression, the elems are grouped into a single
ballarin@15596
  1104
   Int; individual context elements are marked Ext.  In this case, the
ballarin@15596
  1105
   identifier-like information of the element is as follows:
ballarin@15596
  1106
   - for Fixes: (("", ps), []) where the ps have type info NONE
ballarin@15596
  1107
   - for other elements: (("", []), []).
ballarin@15206
  1108
   The implementation of activate_facts relies on identifier names being
ballarin@15206
  1109
   empty strings for external elements.
ballarin@15596
  1110
*)
ballarin@14508
  1111
ballarin@16102
  1112
fun flatten (ctxt, _) ((ids, syn), Elem (Fixes fixes)) = let
ballarin@16102
  1113
	val ids' = ids @ [(("", map #1 fixes), ([], []))]
ballarin@16102
  1114
      in
ballarin@16102
  1115
	((ids',
ballarin@16102
  1116
	 merge_syntax ctxt ids'
ballarin@16102
  1117
	   (syn, Symtab.make (map (fn fx => (#1 fx, #3 fx)) fixes))
ballarin@16102
  1118
	   handle Symtab.DUPS xs => err_in_locale ctxt
ballarin@16102
  1119
	     ("Conflicting syntax for parameters: " ^ commas_quote xs)
ballarin@16102
  1120
             (map #1 ids')),
ballarin@16102
  1121
	 [((("", map (rpair NONE o #1) fixes), []), Ext (Fixes fixes))])
ballarin@16102
  1122
      end
ballarin@16102
  1123
  | flatten _ ((ids, syn), Elem elem) =
ballarin@16102
  1124
      ((ids @ [(("", []), ([], []))], syn), [((("", []), []), Ext elem)])
ballarin@16102
  1125
  | flatten (ctxt, prep_expr) ((ids, syn), Expr expr) =
ballarin@16102
  1126
      apsnd (map (apsnd Int)) (flatten_expr ctxt ((ids, syn), prep_expr expr));
ballarin@14508
  1127
wenzelm@12529
  1128
local
wenzelm@12529
  1129
wenzelm@12839
  1130
local
wenzelm@12839
  1131
wenzelm@12727
  1132
fun declare_int_elem (ctxt, Fixes fixes) =
wenzelm@12575
  1133
      (ctxt |> ProofContext.add_fixes (map (fn (x, T, mx) =>
skalberg@15570
  1134
        (x, Option.map (Term.map_type_tfree (TypeInfer.param 0)) T, mx)) fixes), [])
wenzelm@12727
  1135
  | declare_int_elem (ctxt, _) = (ctxt, []);
wenzelm@12529
  1136
wenzelm@12529
  1137
fun declare_ext_elem prep_fixes (ctxt, Fixes fixes) =
wenzelm@12575
  1138
      (ctxt |> ProofContext.add_fixes (prep_fixes ctxt fixes), [])
wenzelm@12529
  1139
  | declare_ext_elem _ (ctxt, Assumes asms) = (ctxt, map #2 asms)
wenzelm@12529
  1140
  | declare_ext_elem _ (ctxt, Defines defs) = (ctxt, map (fn (_, (t, ps)) => [(t, (ps, []))]) defs)
wenzelm@12529
  1141
  | declare_ext_elem _ (ctxt, Notes facts) = (ctxt, []);
wenzelm@12529
  1142
ballarin@15206
  1143
fun declare_elems prep_fixes (ctxt, (((name, ps), _), elems)) =
wenzelm@12529
  1144
  let val (ctxt', propps) =
wenzelm@12529
  1145
    (case elems of
wenzelm@13308
  1146
      Int es => foldl_map declare_int_elem (ctxt, es)
wenzelm@12546
  1147
    | Ext e => foldl_map (declare_ext_elem prep_fixes) (ctxt, [e]))
wenzelm@12529
  1148
    handle ProofContext.CONTEXT (msg, ctxt) => err_in_locale ctxt msg [(name, map fst ps)]
wenzelm@12727
  1149
  in (ctxt', propps) end;
wenzelm@12727
  1150
wenzelm@12839
  1151
in
wenzelm@12839
  1152
ballarin@14215
  1153
(* CB: only called by prep_elemss. *)
ballarin@14215
  1154
wenzelm@12727
  1155
fun declare_elemss prep_fixes fixed_params raw_elemss ctxt =
wenzelm@12727
  1156
  let
ballarin@14215
  1157
    (* CB: fix of type bug of goal in target with context elements.
ballarin@14215
  1158
       Parameters new in context elements must receive types that are
ballarin@14215
  1159
       distinct from types of parameters in target (fixed_params).  *)
ballarin@14215
  1160
    val ctxt_with_fixed =
wenzelm@16028
  1161
      fold ProofContext.declare_term (map Free fixed_params) ctxt;
wenzelm@12727
  1162
    val int_elemss =
wenzelm@12727
  1163
      raw_elemss
skalberg@15570
  1164
      |> List.mapPartial (fn (id, Int es) => SOME (id, es) | _ => NONE)
ballarin@14215
  1165
      |> unify_elemss ctxt_with_fixed fixed_params;
wenzelm@12727
  1166
    val (_, raw_elemss') =
wenzelm@12727
  1167
      foldl_map (fn ((_, es) :: elemss, (id, Int _)) => (elemss, (id, Int es)) | x => x)
wenzelm@12727
  1168
        (int_elemss, raw_elemss);
wenzelm@12727
  1169
  in foldl_map (declare_elems prep_fixes) (ctxt, raw_elemss') end;
wenzelm@12529
  1170
wenzelm@12839
  1171
end;
wenzelm@12529
  1172
wenzelm@12839
  1173
local
wenzelm@12839
  1174
ballarin@15596
  1175
(* CB: normalise Assumes and Defines wrt. previous definitions *)
ballarin@14508
  1176
wenzelm@12839
  1177
val norm_term = Envir.beta_norm oo Term.subst_atomic;
wenzelm@12839
  1178
ballarin@15596
  1179
(* CB: following code (abstract_term, abstract_thm, bind_def)
ballarin@15596
  1180
   used in eval_text for Defines elements. *)
ballarin@15596
  1181
wenzelm@13336
  1182
fun abstract_term eq =    (*assumes well-formedness according to ProofContext.cert_def*)
wenzelm@12839
  1183
  let
wenzelm@12839
  1184
    val body = Term.strip_all_body eq;
wenzelm@12839
  1185
    val vars = map Free (Term.rename_wrt_term body (Term.strip_all_vars eq));
wenzelm@12839
  1186
    val (lhs, rhs) = Logic.dest_equals (Term.subst_bounds (vars, body));
wenzelm@12839
  1187
    val (f, xs) = Term.strip_comb lhs;
wenzelm@13336
  1188
    val eq' = Term.list_abs_free (map Term.dest_Free xs, rhs);
wenzelm@13336
  1189
  in (Term.dest_Free f, eq') end;
wenzelm@13336
  1190
wenzelm@13336
  1191
fun abstract_thm sign eq =
wenzelm@13336
  1192
  Thm.assume (Thm.cterm_of sign eq) |> Drule.gen_all |> Drule.abs_def;
wenzelm@12502
  1193
wenzelm@13336
  1194
fun bind_def ctxt (name, ps) ((xs, env, ths), eq) =
wenzelm@12839
  1195
  let
wenzelm@13336
  1196
    val ((y, T), b) = abstract_term eq;
wenzelm@13308
  1197
    val b' = norm_term env b;
wenzelm@13336
  1198
    val th = abstract_thm (ProofContext.sign_of ctxt) eq;
wenzelm@13308
  1199
    fun err msg = err_in_locale ctxt (msg ^ ": " ^ quote y) [(name, map fst ps)];
wenzelm@12839
  1200
  in
wenzelm@13308
  1201
    conditional (exists (equal y o #1) xs) (fn () =>
wenzelm@13308
  1202
      err "Attempt to define previously specified variable");
wenzelm@13308
  1203
    conditional (exists (fn (Free (y', _), _) => y = y' | _ => false) env) (fn () =>
wenzelm@13308
  1204
      err "Attempt to redefine variable");
wenzelm@13336
  1205
    (Term.add_frees (xs, b'), (Free (y, T), b') :: env, th :: ths)
wenzelm@12839
  1206
  end;
wenzelm@12575
  1207
ballarin@15206
  1208
(* CB: for finish_elems (Int and Ext) *)
ballarin@15206
  1209
wenzelm@13308
  1210
fun eval_text _ _ _ (text, Fixes _) = text
wenzelm@13394
  1211
  | eval_text _ _ is_ext ((((exts, exts'), (ints, ints')), (xs, env, defs)), Assumes asms) =
wenzelm@13394
  1212
      let
skalberg@15570
  1213
        val ts = List.concat (map (map #1 o #2) asms);
wenzelm@13394
  1214
        val ts' = map (norm_term env) ts;
wenzelm@13394
  1215
        val spec' =
wenzelm@13394
  1216
          if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
wenzelm@13394
  1217
          else ((exts, exts'), (ints @ ts, ints' @ ts'));
skalberg@15570
  1218
      in (spec', (Library.foldl Term.add_frees (xs, ts'), env, defs)) end
ballarin@15206
  1219
  | eval_text ctxt (id, _) _ ((spec, binds), Defines defs) =
skalberg@15570
  1220
      (spec, Library.foldl (bind_def ctxt id) (binds, map (#1 o #2) defs))
wenzelm@13308
  1221
  | eval_text _ _ _ (text, Notes _) = text;
wenzelm@13308
  1222
ballarin@15206
  1223
(* CB: for finish_elems (Ext) *)
ballarin@15206
  1224
wenzelm@13308
  1225
fun closeup _ false elem = elem
wenzelm@13308
  1226
  | closeup ctxt true elem =
wenzelm@12839
  1227
      let
wenzelm@13308
  1228
        fun close_frees t =
wenzelm@13308
  1229
          let val frees = rev (filter_out (ProofContext.is_fixed ctxt o #1)
wenzelm@13308
  1230
            (Term.add_frees ([], t)))
wenzelm@13308
  1231
          in Term.list_all_free (frees, t) end;
wenzelm@13308
  1232
wenzelm@13308
  1233
        fun no_binds [] = []
wenzelm@13308
  1234
          | no_binds _ =
wenzelm@13308
  1235
              raise ProofContext.CONTEXT ("Illegal term bindings in locale element", ctxt);
wenzelm@13308
  1236
      in
wenzelm@13308
  1237
        (case elem of
wenzelm@13308
  1238
          Assumes asms => Assumes (asms |> map (fn (a, propps) =>
wenzelm@13308
  1239
            (a, map (fn (t, (ps, qs)) => (close_frees t, (no_binds ps, no_binds qs))) propps)))
wenzelm@13308
  1240
        | Defines defs => Defines (defs |> map (fn (a, (t, ps)) =>
wenzelm@13308
  1241
            (a, (close_frees (#2 (ProofContext.cert_def ctxt t)), no_binds ps))))
wenzelm@13308
  1242
        | e => e)
wenzelm@13308
  1243
      end;
wenzelm@12839
  1244
wenzelm@12502
  1245
wenzelm@12839
  1246
fun finish_ext_elem parms _ (Fixes fixes, _) = Fixes (map (fn (x, _, mx) =>
wenzelm@12727
  1247
      (x, assoc_string (parms, x), mx)) fixes)
wenzelm@12839
  1248
  | finish_ext_elem _ close (Assumes asms, propp) =
wenzelm@12839
  1249
      close (Assumes (map #1 asms ~~ propp))
wenzelm@12839
  1250
  | finish_ext_elem _ close (Defines defs, propp) =
wenzelm@12727
  1251
      close (Defines (map #1 defs ~~ map (fn [(t, (ps, []))] => (t, ps)) propp))
wenzelm@12839
  1252
  | finish_ext_elem _ _ (Notes facts, _) = Notes facts;
wenzelm@12839
  1253
ballarin@15206
  1254
(* CB: finish_parms introduces type info from parms to identifiers *)
skalberg@15531
  1255
(* CB: only needed for types that have been NONE so far???
ballarin@15206
  1256
   If so, which are these??? *)
ballarin@15206
  1257
ballarin@15206
  1258
fun finish_parms parms (((name, ps), axs), elems) =
ballarin@15206
  1259
  (((name, map (fn (x, _) => (x, assoc (parms, x))) ps), axs), elems);
wenzelm@12839
  1260
wenzelm@13375
  1261
fun finish_elems ctxt parms _ (text, ((id, Int e), _)) =
wenzelm@12839
  1262
      let
ballarin@15206
  1263
        val [(id', es)] = unify_elemss ctxt parms [(id, e)];
skalberg@15570
  1264
        val text' = Library.foldl (eval_text ctxt id' false) (text, es);
ballarin@15206
  1265
      in (text', (id', map Int es)) end
wenzelm@13375
  1266
  | finish_elems ctxt parms do_close (text, ((id, Ext e), [propp])) =
wenzelm@13308
  1267
      let
wenzelm@13308
  1268
        val e' = finish_ext_elem parms (closeup ctxt do_close) (e, propp);
wenzelm@13375
  1269
        val text' = eval_text ctxt id true (text, e');
wenzelm@13308
  1270
      in (text', (id, [Ext e'])) end;
wenzelm@12839
  1271
wenzelm@12839
  1272
in
wenzelm@12510
  1273
ballarin@15206
  1274
(* CB: only called by prep_elemss *)
ballarin@15206
  1275
wenzelm@13375
  1276
fun finish_elemss ctxt parms do_close =
wenzelm@13375
  1277
  foldl_map (apsnd (finish_parms parms) o finish_elems ctxt parms do_close);
wenzelm@12839
  1278
wenzelm@12839
  1279
end;
wenzelm@12839
  1280
ballarin@15127
  1281
(* CB: type inference and consistency checks for locales *)
ballarin@15127
  1282
wenzelm@13375
  1283
fun prep_elemss prep_fixes prepp do_close context fixed_params raw_elemss raw_concl =
wenzelm@12529
  1284
  let
ballarin@15127
  1285
    (* CB: contexts computed in the course of this function are discarded.
ballarin@15127
  1286
       They are used for type inference and consistency checks only. *)
ballarin@15206
  1287
    (* CB: fixed_params are the parameters (with types) of the target locale,
ballarin@15206
  1288
       empty list if there is no target. *)
ballarin@14508
  1289
    (* CB: raw_elemss are list of pairs consisting of identifiers and
ballarin@14508
  1290
       context elements, the latter marked as internal or external. *)
wenzelm@12727
  1291
    val (raw_ctxt, raw_proppss) = declare_elemss prep_fixes fixed_params raw_elemss context;
ballarin@14508
  1292
    (* CB: raw_ctxt is context with additional fixed variables derived from
ballarin@14508
  1293
       the fixes elements in raw_elemss,
ballarin@14508
  1294
       raw_proppss contains assumptions and definitions from the
ballarin@15206
  1295
       external elements in raw_elemss. *)
skalberg@15570
  1296
    val raw_propps = map List.concat raw_proppss;
skalberg@15570
  1297
    val raw_propp = List.concat raw_propps;
ballarin@15206
  1298
wenzelm@16028
  1299
    (* CB: add type information from fixed_params to context (declare_term) *)
ballarin@15206
  1300
    (* CB: process patterns (conclusion and external elements only) *)
wenzelm@12529
  1301
    val (ctxt, all_propp) =
wenzelm@16028
  1302
      prepp (fold ProofContext.declare_term (map Free fixed_params) raw_ctxt, raw_concl @ raw_propp);
ballarin@15206
  1303
    (* CB: add type information from conclusion and external elements
ballarin@15206
  1304
       to context *)
wenzelm@16028
  1305
    val ctxt = fold ProofContext.declare_term (List.concat (map (map fst) all_propp)) ctxt;
wenzelm@12502
  1306
ballarin@15206
  1307
    (* CB: resolve schematic variables (patterns) in conclusion and external
ballarin@15206
  1308
       elements. *)
wenzelm@12529
  1309
    val all_propp' = map2 (op ~~)
wenzelm@12529
  1310
      (#1 (#2 (ProofContext.bind_propp_schematic_i (ctxt, all_propp))), map (map snd) all_propp);
nipkow@13629
  1311
    val (concl, propp) = splitAt(length raw_concl, all_propp');
wenzelm@12529
  1312
    val propps = unflat raw_propps propp;
wenzelm@12839
  1313
    val proppss = map (uncurry unflat) (raw_proppss ~~ propps);
wenzelm@12502
  1314
ballarin@15206
  1315
    (* CB: obtain all parameters from identifier part of raw_elemss *)
ballarin@15206
  1316
    val xs = map #1 (params_of' raw_elemss);
wenzelm@12727
  1317
    val typing = unify_frozen ctxt 0
wenzelm@12529
  1318
      (map (ProofContext.default_type raw_ctxt) xs)
wenzelm@12529
  1319
      (map (ProofContext.default_type ctxt) xs);
wenzelm@12529
  1320
    val parms = param_types (xs ~~ typing);
ballarin@14508
  1321
    (* CB: parms are the parameters from raw_elemss, with correct typing. *)
wenzelm@12273
  1322
ballarin@14508
  1323
    (* CB: extract information from assumes and defines elements
ballarin@14508
  1324
       (fixes and notes in raw_elemss don't have an effect on text and elemss),
ballarin@14508
  1325
       compute final form of context elements. *)
wenzelm@13394
  1326
    val (text, elemss) = finish_elemss ctxt parms do_close
wenzelm@13394
  1327
      (((([], []), ([], [])), ([], [], [])), raw_elemss ~~ proppss);
ballarin@14508
  1328
    (* CB: text has the following structure:
ballarin@14508
  1329
           (((exts, exts'), (ints, ints')), (xs, env, defs))
ballarin@14508
  1330
       where
ballarin@14508
  1331
         exts: external assumptions (terms in external assumes elements)
ballarin@14508
  1332
         exts': dito, normalised wrt. env
ballarin@14508
  1333
         ints: internal assumptions (terms in internal assumes elements)
ballarin@14508
  1334
         ints': dito, normalised wrt. env
ballarin@14508
  1335
         xs: the free variables in exts' and ints' and rhss of definitions,
ballarin@14508
  1336
           this includes parameters except defined parameters
ballarin@14508
  1337
         env: list of term pairs encoding substitutions, where the first term
ballarin@14508
  1338
           is a free variable; substitutions represent defines elements and
ballarin@14508
  1339
           the rhs is normalised wrt. the previous env
ballarin@14508
  1340
         defs: theorems representing the substitutions from defines elements
ballarin@14508
  1341
           (thms are normalised wrt. env).
ballarin@14508
  1342
       elemss is an updated version of raw_elemss:
ballarin@14508
  1343
         - type info added to Fixes
ballarin@14508
  1344
         - axiom and definition statement replaced by corresponding one
ballarin@14508
  1345
           from proppss in Assumes and Defines
ballarin@14508
  1346
         - Facts unchanged
ballarin@14508
  1347
       *)
wenzelm@13308
  1348
  in ((parms, elemss, concl), text) end;
wenzelm@12502
  1349
wenzelm@12502
  1350
in
wenzelm@12502
  1351
wenzelm@12529
  1352
fun read_elemss x = prep_elemss read_fixes ProofContext.read_propp_schematic x;
wenzelm@12529
  1353
fun cert_elemss x = prep_elemss cert_fixes ProofContext.cert_propp_schematic x;
wenzelm@12529
  1354
wenzelm@12529
  1355
end;
wenzelm@12529
  1356
wenzelm@12529
  1357
wenzelm@15703
  1358
(* facts and attributes *)
wenzelm@12529
  1359
wenzelm@12529
  1360
local
wenzelm@12529
  1361
wenzelm@15703
  1362
fun prep_name ctxt name =
ballarin@15206
  1363
  (* CB: reject qualified theorem names in locale declarations *)
wenzelm@12529
  1364
  if NameSpace.is_qualified name then
wenzelm@12529
  1365
    raise ProofContext.CONTEXT ("Illegal qualified name: " ^ quote name, ctxt)
wenzelm@15703
  1366
  else name;
wenzelm@12529
  1367
wenzelm@15703
  1368
fun prep_facts _ _ ctxt (Int elem) =
wenzelm@15703
  1369
      map_values I I (Thm.transfer (ProofContext.theory_of ctxt)) elem
wenzelm@15703
  1370
  | prep_facts get intern ctxt (Ext elem) = elem |> map_elem
wenzelm@15703
  1371
     {var = I, typ = I, term = I,
wenzelm@15703
  1372
      name = prep_name ctxt,
wenzelm@15703
  1373
      fact = get ctxt,
wenzelm@15703
  1374
      attrib = Args.assignable o intern (ProofContext.sign_of ctxt)};
wenzelm@12529
  1375
wenzelm@12529
  1376
in
wenzelm@12529
  1377
wenzelm@15703
  1378
fun read_facts x = prep_facts ProofContext.get_thms Attrib.intern_src x;
wenzelm@15703
  1379
fun cert_facts x = prep_facts (K I) (K I) x;
wenzelm@12529
  1380
wenzelm@12529
  1381
end;
wenzelm@12529
  1382
wenzelm@12529
  1383
wenzelm@12546
  1384
(* full context statements: import + elements + conclusion *)
wenzelm@12529
  1385
wenzelm@12529
  1386
local
wenzelm@12529
  1387
wenzelm@12529
  1388
fun prep_context_statement prep_expr prep_elemss prep_facts
ballarin@15206
  1389
    do_close fixed_params import elements raw_concl context =
wenzelm@12529
  1390
  let
wenzelm@12529
  1391
    val sign = ProofContext.sign_of context;
wenzelm@13375
  1392
ballarin@16102
  1393
    val ((import_ids, import_syn), raw_import_elemss) = flatten (context, prep_expr sign) (([], Symtab.empty), Expr import);
ballarin@14215
  1394
    (* CB: normalise "includes" among elements *)
ballarin@16102
  1395
    val ((ids, syn), raw_elemsss) = foldl_map (flatten (context, prep_expr sign))
ballarin@16102
  1396
      ((import_ids, import_syn), elements);
ballarin@15696
  1397
ballarin@15696
  1398
    val raw_elemss = List.concat raw_elemsss;
ballarin@14508
  1399
    (* CB: raw_import_elemss @ raw_elemss is the normalised list of
ballarin@14508
  1400
       context elements obtained from import and elements. *)
wenzelm@13375
  1401
    val ((parms, all_elemss, concl), (spec, (_, _, defs))) = prep_elemss do_close
wenzelm@13336
  1402
      context fixed_params (raw_import_elemss @ raw_elemss) raw_concl;
ballarin@15696
  1403
    (* replace extended ids (for axioms) by ids *)
ballarin@15696
  1404
    val all_elemss' = map (fn (((_, ps), _), (((n, ps'), ax), elems)) =>
ballarin@15696
  1405
        (((n, List.filter (fn (p, _) => p mem ps) ps'), ax), elems))
ballarin@15696
  1406
      (ids ~~ all_elemss);
ballarin@15696
  1407
ballarin@15206
  1408
    (* CB: all_elemss and parms contain the correct parameter types *)
ballarin@15696
  1409
    val (ps,qs) = splitAt(length raw_import_elemss, all_elemss')
ballarin@15206
  1410
    val (import_ctxt, (import_elemss, _)) =
ballarin@15206
  1411
      activate_facts prep_facts (context, ps);
ballarin@14215
  1412
ballarin@15206
  1413
    val (ctxt, (elemss, _)) =
ballarin@15206
  1414
      activate_facts prep_facts (import_ctxt, qs);
ballarin@15212
  1415
    val stmt = gen_distinct Term.aconv
skalberg@15570
  1416
       (List.concat (map (fn ((_, axs), _) =>
skalberg@15570
  1417
         List.concat (map (#hyps o Thm.rep_thm) axs)) qs));
ballarin@15206
  1418
    val cstmt = map (cterm_of sign) stmt;
wenzelm@12834
  1419
  in
ballarin@16102
  1420
    ((((import_ctxt, import_elemss), (ctxt, elemss, syn)), (parms, spec, defs)), (cstmt, concl))
wenzelm@12834
  1421
  end;
wenzelm@12529
  1422
wenzelm@15703
  1423
val gen_context = prep_context_statement intern_expr read_elemss read_facts;
wenzelm@15703
  1424
val gen_context_i = prep_context_statement (K I) cert_elemss cert_facts;
wenzelm@12529
  1425
wenzelm@12529
  1426
fun gen_statement prep_locale prep_ctxt raw_locale elems concl ctxt =
wenzelm@12529
  1427
  let
wenzelm@12529
  1428
    val thy = ProofContext.theory_of ctxt;
skalberg@15570
  1429
    val locale = Option.map (prep_locale (Theory.sign_of thy)) raw_locale;
ballarin@15206
  1430
    val (target_stmt, fixed_params, import) =
skalberg@15531
  1431
      (case locale of NONE => ([], [], empty)
skalberg@15531
  1432
      | SOME name =>
ballarin@15206
  1433
          let val {predicate = (stmt, _), params = (ps, _), ...} =
ballarin@15206
  1434
            the_locale thy name
ballarin@16102
  1435
          in (stmt, param_types (map fst ps), Locale name) end);
ballarin@16102
  1436
    val ((((locale_ctxt, locale_elemss), (elems_ctxt, _, _)), _), (elems_stmt, concl')) =
ballarin@15206
  1437
      prep_ctxt false fixed_params import elems concl ctxt;
ballarin@15206
  1438
  in (locale, (target_stmt, elems_stmt), locale_ctxt, elems_ctxt, concl') end;
wenzelm@13399
  1439
wenzelm@12529
  1440
in
wenzelm@12529
  1441
ballarin@15127
  1442
(* CB: processing of locales for add_locale(_i) and print_locale *)
ballarin@15127
  1443
  (* CB: arguments are: x->import, y->body (elements), z->context *)
ballarin@15206
  1444
fun read_context x y z = #1 (gen_context true [] x (map Elem y) [] z);
ballarin@15206
  1445
fun cert_context x y z = #1 (gen_context_i true [] x (map Elem y) [] z);
ballarin@14215
  1446
ballarin@15127
  1447
(* CB: processing of locales for note_thmss(_i),
ballarin@15127
  1448
   Proof.multi_theorem(_i) and antiquotations with option "locale" *)
wenzelm@12529
  1449
val read_context_statement = gen_statement intern gen_context;
wenzelm@12529
  1450
val cert_context_statement = gen_statement (K I) gen_context_i;
wenzelm@12502
  1451
wenzelm@12502
  1452
end;
wenzelm@11896
  1453
wenzelm@11896
  1454
ballarin@14508
  1455
(** CB: experimental instantiation mechanism **)
ballarin@14508
  1456
ballarin@14528
  1457
fun instantiate loc_name (prfx, attribs) raw_inst ctxt =
ballarin@14508
  1458
  let
ballarin@14508
  1459
    val thy = ProofContext.theory_of ctxt;
ballarin@14508
  1460
    val sign = Theory.sign_of thy;
ballarin@14508
  1461
    val tsig = Sign.tsig_of sign;
ballarin@14508
  1462
    val cert = cterm_of sign;
ballarin@14508
  1463
ballarin@14508
  1464
    (** process the locale **)
ballarin@14508
  1465
ballarin@15206
  1466
    val {predicate = (_, axioms), params = (ps, _), ...} =
ballarin@14508
  1467
      the_locale thy (intern sign loc_name);
ballarin@16102
  1468
    val fixed_params = param_types (map #1 ps);
ballarin@14528
  1469
    val init = ProofContext.init thy;
ballarin@16102
  1470
    val (_, raw_elemss) = flatten (init, intern_expr sign)
ballarin@16102
  1471
         (([], Symtab.empty), Expr (Locale loc_name));
ballarin@14508
  1472
    val ((parms, all_elemss, concl),
ballarin@14508
  1473
         (spec as (_, (ints, _)), (xs, env, defs))) =
ballarin@14528
  1474
      read_elemss false (* do_close *) init
ballarin@14508
  1475
        fixed_params (* could also put [] here??? *) raw_elemss
ballarin@14508
  1476
        [] (* concl *);
ballarin@14508
  1477
ballarin@14508
  1478
    (** analyse the instantiation theorem inst **)
ballarin@14508
  1479
ballarin@14508
  1480
    val inst = case raw_inst of
skalberg@15531
  1481
        NONE => if null ints
skalberg@15531
  1482
	  then NONE
ballarin@14508
  1483
	  else error "Locale has assumptions but no chained fact was found"
skalberg@15531
  1484
      | SOME [] => if null ints
skalberg@15531
  1485
	  then NONE
ballarin@14508
  1486
	  else error "Locale has assumptions but no chained fact was found"
skalberg@15531
  1487
      | SOME [thm] => if null ints
skalberg@15531
  1488
	  then (warning "Locale has no assumptions: fact ignored"; NONE)
skalberg@15531
  1489
	  else SOME thm
skalberg@15531
  1490
      | SOME _ => error "Multiple facts are not allowed";
ballarin@14508
  1491
ballarin@14508
  1492
    val args = case inst of
skalberg@15531
  1493
            NONE => []
skalberg@15531
  1494
          | SOME thm => thm |> prop_of |> ObjectLogic.drop_judgment sign
ballarin@14528
  1495
              |> Term.strip_comb
ballarin@14528
  1496
              |>> (fn t as (Const (s, _)) => if (intern sign loc_name = s)
ballarin@14528
  1497
                        then t
ballarin@14528
  1498
                        else error ("Constant " ^ quote loc_name ^
ballarin@14528
  1499
                          " expected but constant " ^ quote s ^ " was found")
ballarin@14528
  1500
                    | t => error ("Constant " ^ quote loc_name ^ " expected \
ballarin@14528
  1501
                          \but term " ^ quote (Sign.string_of_term sign t) ^
ballarin@14528
  1502
                          " was found"))
ballarin@14528
  1503
              |> snd;
ballarin@14508
  1504
    val cargs = map cert args;
ballarin@14508
  1505
ballarin@14508
  1506
    (* process parameters: match their types with those of arguments *)
ballarin@14508
  1507
ballarin@14508
  1508
    val def_names = map (fn (Free (s, _), _) => s) env;
skalberg@15570
  1509
    val (defined, assumed) = List.partition
ballarin@14508
  1510
          (fn (s, _) => s mem def_names) fixed_params;
ballarin@14508
  1511
    val cassumed = map (cert o Free) assumed;
ballarin@14508
  1512
    val cdefined = map (cert o Free) defined;
ballarin@14508
  1513
ballarin@14508
  1514
    val param_types = map snd assumed;
ballarin@14508
  1515
    val v_param_types = map Type.varifyT param_types;
ballarin@14508
  1516
    val arg_types = map Term.fastype_of args;
skalberg@15570
  1517
    val Tenv = Library.foldl (Type.typ_match tsig)
ballarin@14508
  1518
          (Vartab.empty, v_param_types ~~ arg_types)
skalberg@15570
  1519
          handle UnequalLengths => error "Number of parameters does not \
ballarin@14528
  1520
            \match number of arguments of chained fact";
ballarin@14508
  1521
    (* get their sorts *)
skalberg@15574
  1522
    val tfrees = foldr Term.add_typ_tfrees [] param_types
ballarin@14508
  1523
    val Tenv' = map
berghofe@15798
  1524
          (fn ((a, i), (S, T)) => ((a, S), T))
ballarin@14508
  1525
          (Vartab.dest Tenv);
ballarin@14508
  1526
ballarin@14508
  1527
    (* process (internal) elements *)
ballarin@14508
  1528
ballarin@14508
  1529
    fun inst_type [] T = T
ballarin@14508
  1530
      | inst_type env T =
skalberg@15570
  1531
          Term.map_type_tfree (fn v => getOpt (assoc (env, v), TFree v)) T;
ballarin@14508
  1532
ballarin@14508
  1533
    fun inst_term [] t = t
ballarin@14508
  1534
      | inst_term env t = Term.map_term_types (inst_type env) t;
ballarin@14508
  1535
ballarin@14508
  1536
    (* parameters with argument types *)
ballarin@14508
  1537
ballarin@14508
  1538
    val cparams' = map (cterm_of sign o inst_term Tenv' o term_of) cassumed;
ballarin@14508
  1539
    val cdefined' = map (cert o inst_term Tenv' o term_of) cdefined;
ballarin@14508
  1540
    val cdefining = map (cert o inst_term Tenv' o snd) env;
ballarin@14508
  1541
ballarin@14508
  1542
    fun inst_thm _ [] th = th
ballarin@14508
  1543
      | inst_thm ctxt Tenv th =
ballarin@14508
  1544
	  let
ballarin@14508
  1545
	    val sign = ProofContext.sign_of ctxt;
ballarin@14508
  1546
	    val cert = Thm.cterm_of sign;
ballarin@14508
  1547
	    val certT = Thm.ctyp_of sign;
ballarin@14508
  1548
	    val {hyps, prop, maxidx, ...} = Thm.rep_thm th;
skalberg@15574
  1549
	    val tfrees = foldr Term.add_term_tfree_names [] (prop :: hyps);
skalberg@15570
  1550
	    val Tenv' = List.filter (fn ((a, _), _) => a mem_string tfrees) Tenv;
ballarin@14508
  1551
	  in
ballarin@14508
  1552
	    if null Tenv' then th
ballarin@14508
  1553
	    else
ballarin@14508
  1554
	      th
ballarin@14508
  1555
	      |> Drule.implies_intr_list (map cert hyps)
ballarin@14508
  1556
	      |> Drule.tvars_intr_list (map (#1 o #1) Tenv')
ballarin@14508
  1557
	      |> (fn (th', al) => th' |>
ballarin@14508
  1558
		Thm.instantiate ((map (fn ((a, _), T) =>
berghofe@15798
  1559
                  (certT (TVar (valOf (assoc (al, a)))), certT T)) Tenv'), []))
ballarin@14508
  1560
	      |> (fn th'' => Drule.implies_elim_list th''
ballarin@14508
  1561
		  (map (Thm.assume o cert o inst_term Tenv') hyps))
ballarin@14508
  1562
	  end;
ballarin@14508
  1563
wenzelm@15703
  1564
    val inst_type' = inst_type Tenv';
wenzelm@15703
  1565
wenzelm@15703
  1566
    val inst_term' = Term.subst_atomic
wenzelm@15703
  1567
        (map (pairself term_of) ((cparams' @ cdefined') ~~ (cargs @ cdefining)))
wenzelm@15703
  1568
      o inst_term Tenv';
wenzelm@15703
  1569
ballarin@14508
  1570
    fun inst_thm' thm =
ballarin@14508
  1571
      let
ballarin@14508
  1572
        (* not all axs are normally applicable *)
ballarin@14508
  1573
        val hyps = #hyps (rep_thm thm);
ballarin@14508
  1574
        val ass = map (fn ax => (prop_of ax, ax)) axioms;
skalberg@15570
  1575
        val axs' = Library.foldl (fn (axs, hyp) => 
skalberg@15531
  1576
              (case gen_assoc (op aconv) (ass, hyp) of NONE => axs
skalberg@15531
  1577
                 | SOME ax => axs @ [ax])) ([], hyps);
ballarin@14508
  1578
        val thm' = Drule.satisfy_hyps axs' thm;
ballarin@14508
  1579
        (* instantiate types *)
ballarin@14508
  1580
        val thm'' = inst_thm ctxt Tenv' thm';
ballarin@14508
  1581
        (* substitute arguments and discharge hypotheses *)
ballarin@14508
  1582
        val thm''' = case inst of
skalberg@15531
  1583
                NONE => thm''
skalberg@15531
  1584
              | SOME inst_thm => let
ballarin@14508
  1585
		    val hyps = #hyps (rep_thm thm'');
ballarin@14508
  1586
		    val th = thm'' |> implies_intr_hyps
ballarin@14508
  1587
		      |> forall_intr_list (cparams' @ cdefined')
ballarin@14508
  1588
		      |> forall_elim_list (cargs @ cdefining)
ballarin@14508
  1589
		    (* th has premises of the form either inst_thm or x==x *)
ballarin@14508
  1590
		    fun mk hyp = if Logic.is_equals hyp
ballarin@14508
  1591
			  then hyp |> Logic.dest_equals |> snd |> cert
ballarin@14508
  1592
				 |> reflexive
ballarin@14508
  1593
			  else inst_thm
ballarin@14508
  1594
                  in implies_elim_list th (map mk hyps)
ballarin@14508
  1595
                  end;
wenzelm@15703
  1596
      in thm''' end
wenzelm@15703
  1597
      handle THM (msg, n, thms) => error ("Exception THM " ^
wenzelm@15703
  1598
        string_of_int n ^ " raised\n" ^
wenzelm@15703
  1599
	  "Note: instantiate does not support old-style locales \
wenzelm@15703
  1600
          \declared with (open)\n" ^ msg ^ "\n" ^
wenzelm@15703
  1601
	cat_lines (map string_of_thm thms));
ballarin@14508
  1602
ballarin@14528
  1603
    val prefix_fact =
ballarin@14528
  1604
      if prfx = "" then I
ballarin@14528
  1605
      else (fn "" => ""
ballarin@14528
  1606
             | s => NameSpace.append prfx s);
ballarin@14528
  1607
ballarin@14508
  1608
    fun inst_elem (ctxt, (Ext _)) = ctxt
ballarin@14508
  1609
      | inst_elem (ctxt, (Int (Notes facts))) =
ballarin@14508
  1610
              (* instantiate fact *)
wenzelm@15703
  1611
          let
wenzelm@15703
  1612
              val facts = facts |> map_attrib_facts
wenzelm@15703
  1613
                (Attrib.context_attribute_i ctxt o
wenzelm@15703
  1614
                  Args.map_values I inst_type' inst_term' inst_thm');
ballarin@15596
  1615
              val facts' =
ballarin@14528
  1616
                map (apsnd (map (apfst (map inst_thm')))) facts
ballarin@14508
  1617
              (* rename fact *)
ballarin@14528
  1618
              val facts'' = map (apfst (apfst prefix_fact)) facts'
ballarin@14528
  1619
              (* add attributes *)
ballarin@14528
  1620
              val facts''' = map (apfst (apsnd (fn atts => atts @ attribs))) facts''
wenzelm@14564
  1621
          in fst (ProofContext.note_thmss_i facts''' ctxt)
ballarin@14508
  1622
          end
ballarin@14508
  1623
      | inst_elem (ctxt, (Int _)) = ctxt;
ballarin@14508
  1624
skalberg@15570
  1625
    fun inst_elems (ctxt, (id, elems)) = Library.foldl inst_elem (ctxt, elems);
ballarin@14508
  1626
skalberg@15570
  1627
    fun inst_elemss ctxt elemss = Library.foldl inst_elems (ctxt, elemss);
ballarin@14508
  1628
ballarin@14508
  1629
    (* main part *)
ballarin@14508
  1630
ballarin@14508
  1631
    val ctxt' = ProofContext.qualified true ctxt;
ballarin@14508
  1632
  in ProofContext.restore_qualified ctxt (inst_elemss ctxt' all_elemss)
ballarin@14508
  1633
  end;
ballarin@14508
  1634
wenzelm@11896
  1635
wenzelm@13336
  1636
(** define locales **)
wenzelm@13336
  1637
wenzelm@13336
  1638
(* print locale *)
wenzelm@12070
  1639
wenzelm@12758
  1640
fun print_locale thy import body =
wenzelm@12070
  1641
  let
wenzelm@12289
  1642
    val thy_ctxt = ProofContext.init thy;
ballarin@16102
  1643
    val (((_, import_elemss), (ctxt, elemss, _)), _) = read_context import body thy_ctxt;
skalberg@15570
  1644
    val all_elems = List.concat (map #2 (import_elemss @ elemss));
wenzelm@12070
  1645
wenzelm@12307
  1646
    val prt_typ = Pretty.quote o ProofContext.pretty_typ ctxt;
wenzelm@12307
  1647
    val prt_term = Pretty.quote o ProofContext.pretty_term ctxt;
wenzelm@12307
  1648
    val prt_thm = Pretty.quote o ProofContext.pretty_thm ctxt;
wenzelm@15703
  1649
    val prt_atts = Args.pretty_attribs ctxt;
wenzelm@12070
  1650
wenzelm@12070
  1651
    fun prt_syn syn =
skalberg@15531
  1652
      let val s = (case syn of NONE => "(structure)" | SOME mx => Syntax.string_of_mixfix mx)
wenzelm@12575
  1653
      in if s = "" then [] else [Pretty.brk 2, Pretty.str s] end;
skalberg@15531
  1654
    fun prt_fix (x, SOME T, syn) = Pretty.block (Pretty.str (x ^ " ::") :: Pretty.brk 1 ::
wenzelm@12070
  1655
          prt_typ T :: Pretty.brk 1 :: prt_syn syn)
skalberg@15531
  1656
      | prt_fix (x, NONE, syn) = Pretty.block (Pretty.str x :: Pretty.brk 1 :: prt_syn syn);
wenzelm@12070
  1657
wenzelm@15703
  1658
    fun prt_name name = Pretty.str (ProofContext.cond_extern ctxt name);
wenzelm@15703
  1659
    fun prt_name_atts (name, atts) =
wenzelm@15703
  1660
      if name = "" andalso null atts then []
wenzelm@15703
  1661
      else [Pretty.block (Pretty.breaks (prt_name name :: prt_atts atts @ [Pretty.str ":"]))];
wenzelm@15703
  1662
wenzelm@15703
  1663
    fun prt_asm (a, ts) =
wenzelm@15703
  1664
      Pretty.block (Pretty.breaks (prt_name_atts a @ map (prt_term o fst) ts));
wenzelm@15703
  1665
    fun prt_def (a, (t, _)) =
wenzelm@15703
  1666
      Pretty.block (Pretty.breaks (prt_name_atts a @ [prt_term t]));
wenzelm@15703
  1667
wenzelm@15703
  1668
    fun prt_fact (ths, []) = map prt_thm ths
wenzelm@15703
  1669
      | prt_fact (ths, atts) =
wenzelm@15703
  1670
          Pretty.enclose "(" ")" (Pretty.breaks (map prt_thm ths)) :: prt_atts atts;
wenzelm@15703
  1671
    fun prt_note (a, ths) =
wenzelm@15703
  1672
      Pretty.block (Pretty.breaks (List.concat (prt_name_atts a :: map prt_fact ths)));
wenzelm@12070
  1673
wenzelm@12289
  1674
    fun items _ [] = []
wenzelm@12289
  1675
      | items prfx (x :: xs) = Pretty.block [Pretty.str prfx, Pretty.brk 1, x] :: items "  and" xs;
wenzelm@12289
  1676
    fun prt_elem (Fixes fixes) = items "fixes" (map prt_fix fixes)
wenzelm@12289
  1677
      | prt_elem (Assumes asms) = items "assumes" (map prt_asm asms)
wenzelm@12289
  1678
      | prt_elem (Defines defs) = items "defines" (map prt_def defs)
wenzelm@15703
  1679
      | prt_elem (Notes facts) = items "notes" (map prt_note facts);
wenzelm@12277
  1680
  in
wenzelm@13336
  1681
    Pretty.big_list "context elements:" (map (Pretty.chunks o prt_elem) all_elems)
wenzelm@13336
  1682
    |> Pretty.writeln
wenzelm@12277
  1683
  end;
wenzelm@12070
  1684
wenzelm@12070
  1685
wenzelm@12730
  1686
(* store results *)
wenzelm@11896
  1687
wenzelm@12706
  1688
local
wenzelm@12706
  1689
wenzelm@12702
  1690
fun hide_bound_names names thy =
wenzelm@12702
  1691
  thy |> PureThy.hide_thms false
wenzelm@12702
  1692
    (map (Sign.full_name (Theory.sign_of thy)) (filter_out (equal "") names));
wenzelm@12702
  1693
wenzelm@12958
  1694
in
wenzelm@12958
  1695
ballarin@15696
  1696
(* store exported theorem in theory *)
ballarin@15696
  1697
wenzelm@14564
  1698
fun note_thmss_qualified kind name args thy =
wenzelm@12706
  1699
  thy
wenzelm@13375
  1700
  |> Theory.add_path (Sign.base_name name)
wenzelm@14564
  1701
  |> PureThy.note_thmss_i (Drule.kind kind) args
wenzelm@12706
  1702
  |>> hide_bound_names (map (#1 o #1) args)
wenzelm@12706
  1703
  |>> Theory.parent_path;
wenzelm@12706
  1704
ballarin@15696
  1705
(* accesses of interpreted theorems *)
ballarin@15696
  1706
ballarin@15696
  1707
(* fully qualified name in theory is T.p.r.n where
ballarin@15696
  1708
   T: theory name, p: interpretation prefix, r: renaming prefix, n: name *)
ballarin@15696
  1709
ballarin@15696
  1710
fun global_accesses prfx name =
ballarin@15696
  1711
     if prfx = "" then
ballarin@15696
  1712
       case NameSpace.unpack name of
ballarin@15696
  1713
	   [] => [""]
ballarin@15696
  1714
	 | [T, n] => map NameSpace.pack [[T, n], [n]]
ballarin@15696
  1715
	 | [T, r, n] => map NameSpace.pack [[T, r, n], [T, n], [r, n], [n]]
ballarin@15696
  1716
	 | _ => error ("Locale accesses: illegal name " ^ quote name)
ballarin@15696
  1717
     else case NameSpace.unpack name of
ballarin@15696
  1718
           [] => [""]
ballarin@15696
  1719
         | [T, p, n] => map NameSpace.pack [[T, p, n], [p, n]]
ballarin@15696
  1720
         | [T, p, r, n] => map NameSpace.pack
ballarin@15696
  1721
             [[T, p, r, n], [T, p, n], [p, r, n], [p, n]]
ballarin@15696
  1722
         | _ => error ("Locale accesses: illegal name " ^ quote name);
ballarin@15696
  1723
ballarin@15696
  1724
(* fully qualified name in context is p.r.n where
ballarin@15696
  1725
   p: interpretation prefix, r: renaming prefix, n: name *)
ballarin@15696
  1726
ballarin@15696
  1727
fun local_accesses prfx name =
ballarin@15696
  1728
     if prfx = "" then
ballarin@15696
  1729
       case NameSpace.unpack name of
ballarin@15696
  1730
	   [] => [""]
ballarin@15696
  1731
	 | [n] => map NameSpace.pack [[n]]
ballarin@15696
  1732
	 | [r, n] => map NameSpace.pack [[r, n], [n]]
ballarin@15696
  1733
	 | _ => error ("Locale accesses: illegal name " ^ quote name)
ballarin@15696
  1734
     else case NameSpace.unpack name of
ballarin@15696
  1735
           [] => [""]
ballarin@15696
  1736
         | [p, n] => map NameSpace.pack [[p, n]]
ballarin@15696
  1737
         | [p, r, n] => map NameSpace.pack [[p, r, n], [p, n]]
ballarin@15696
  1738
         | _ => error ("Locale accesses: illegal name " ^ quote name);
ballarin@15696
  1739
ballarin@15696
  1740
ballarin@15696
  1741
(* store instantiations of args for all registered interpretations
ballarin@15696
  1742
   of the theory *)
ballarin@15696
  1743
ballarin@15696
  1744
fun note_thmss_registrations kind target args thy =
ballarin@15596
  1745
  let
ballarin@15696
  1746
    val ctxt = ProofContext.init thy;
ballarin@15696
  1747
    val sign = Theory.sign_of thy;
ballarin@15696
  1748
ballarin@15696
  1749
    val (parms, parmTs_o) =
ballarin@16102
  1750
          the_locale thy target |> #params |> fst |> map fst |> split_list;
ballarin@15696
  1751
    val parmvTs = map (Type.varifyT o valOf) parmTs_o;
ballarin@16102
  1752
    val ids = flatten (ctxt, intern_expr sign) (([], Symtab.empty), Expr (Locale target))
ballarin@16102
  1753
          |> fst |> fst |> map fst;
ballarin@15696
  1754
ballarin@15696
  1755
    val regs = get_global_registrations thy target;
ballarin@15696
  1756
ballarin@15696
  1757
    (* add args to thy for all registrations *)
ballarin@15596
  1758
ballarin@15696
  1759
    fun activate (thy, (vts, ((prfx, atts2), _))) =
ballarin@15696
  1760
      let
ballarin@15696
  1761
        val ts = map Logic.unvarify vts;
ballarin@15696
  1762
        (* type instantiation *)
ballarin@15696
  1763
        val vtinst = Library.foldl (Type.typ_match (Sign.tsig_of sign))
ballarin@15696
  1764
             (Vartab.empty, (parmvTs ~~ map Term.fastype_of ts));
berghofe@15798
  1765
        val tinst = Vartab.dest vtinst |> map (fn ((x, 0), (_, T)) => (x, T))
ballarin@15696
  1766
             |> Symtab.make;            
ballarin@15696
  1767
        (* replace parameter names in ids by instantiations *)
ballarin@15696
  1768
        val vinst = Symtab.make (parms ~~ vts);
ballarin@15696
  1769
        fun vinst_names ps = map (fn p => Symtab.lookup (vinst, p) |> valOf) ps;
ballarin@15696
  1770
        val inst = Symtab.make (parms ~~ ts);
ballarin@15696
  1771
        val ids' = map (apsnd vinst_names) ids;
ballarin@15696
  1772
        val prems = List.concat (map (snd o valOf o get_global_registration thy) ids');
ballarin@15696
  1773
        val args' = map (fn ((n, atts), [(ths, [])]) =>
wenzelm@15703
  1774
            ((if prfx = "" orelse n = "" then "" else NameSpace.pack [prfx, n],
wenzelm@15703
  1775
              map (Attrib.global_attribute_i thy) (atts @ atts2)),
ballarin@15696
  1776
             [(map (Drule.standard o Drule.satisfy_hyps prems o inst_tab_thm sign (inst, tinst)) ths, [])]))
ballarin@15696
  1777
          args;
ballarin@15696
  1778
      in
ballarin@15696
  1779
        PureThy.note_thmss_accesses_i (global_accesses prfx) (Drule.kind kind) args' thy |> fst
ballarin@15696
  1780
      end;
ballarin@15696
  1781
  in Library.foldl activate (thy, regs) end;
ballarin@15596
  1782
ballarin@15596
  1783
skalberg@15531
  1784
fun smart_note_thmss kind NONE = PureThy.note_thmss_i (Drule.kind kind)
wenzelm@15703
  1785
  | smart_note_thmss kind (SOME loc) = note_thmss_qualified kind loc;
wenzelm@12958
  1786
wenzelm@12958
  1787
end;
wenzelm@12958
  1788
wenzelm@12958
  1789
local
wenzelm@12958
  1790
ballarin@15696
  1791
(* add facts to locale in theory *)
ballarin@15696
  1792
wenzelm@12958
  1793
fun put_facts loc args thy =
wenzelm@12958
  1794
  let
ballarin@15206
  1795
    val {predicate, import, elems, params} = the_locale thy loc;
wenzelm@15703
  1796
    val note = Notes (map (fn ((a, atts), bs) =>
wenzelm@15703
  1797
      ((a, atts), map (apfst (map (curry Thm.name_thm a))) bs)) args);
wenzelm@15703
  1798
  in
wenzelm@15703
  1799
    thy |> put_locale loc {predicate = predicate, import = import,
wenzelm@15703
  1800
      elems = elems @ [(note, stamp ())], params = params}
wenzelm@15703
  1801
  end;
wenzelm@12958
  1802
ballarin@15696
  1803
(* add theorem to locale and theory,
ballarin@15696
  1804
   base for theorems (in loc) and declare (in loc) *)
ballarin@15696
  1805
wenzelm@15703
  1806
fun gen_note_thmss prep_locale prep_facts kind raw_loc args thy =
wenzelm@12706
  1807
  let
wenzelm@12706
  1808
    val thy_ctxt = ProofContext.init thy;
wenzelm@12706
  1809
    val loc = prep_locale (Theory.sign_of thy) raw_loc;
wenzelm@15703
  1810
    val (_, (stmt, _), loc_ctxt, _, _) = cert_context_statement (SOME loc) [] [] thy_ctxt;
ballarin@15206
  1811
    val export = ProofContext.export_standard stmt loc_ctxt thy_ctxt;
wenzelm@15703
  1812
wenzelm@15703
  1813
    val (args', facts) = #2 (activate_note prep_facts (loc_ctxt, args));
wenzelm@15703
  1814
    val facts' =
wenzelm@15703
  1815
      map (rpair [] o #1 o #1) args' ~~
wenzelm@15703
  1816
      map (single o Thm.no_attributes o map export o #2) facts;
wenzelm@12706
  1817
  in
wenzelm@12706
  1818
    thy
wenzelm@15703
  1819
    |> put_facts loc args'
wenzelm@15703
  1820
    |> note_thmss_registrations kind loc args'
wenzelm@15703
  1821
    |> note_thmss_qualified kind loc facts'
wenzelm@12706
  1822
  end;
wenzelm@12706
  1823
wenzelm@12706
  1824
in
wenzelm@12706
  1825
wenzelm@15703
  1826
val note_thmss = gen_note_thmss intern read_facts;
wenzelm@15703
  1827
val note_thmss_i = gen_note_thmss (K I) cert_facts;
wenzelm@12711
  1828
ballarin@15696
  1829
fun add_thmss kind loc args (thy, ctxt) =
wenzelm@12958
  1830
  let
wenzelm@15703
  1831
    val (ctxt', (args', facts)) = activate_note cert_facts
wenzelm@15703
  1832
      (ctxt, args |> map (fn ((a, ths), atts) => ((a, atts), [(ths, [])])));
wenzelm@15703
  1833
    val thy' =
wenzelm@15703
  1834
      thy
wenzelm@15703
  1835
      |> put_facts loc args'
wenzelm@15703
  1836
      |> note_thmss_registrations kind loc args';
wenzelm@15703
  1837
  in ((thy', ctxt'), facts) end;
wenzelm@12702
  1838
wenzelm@12706
  1839
end;
wenzelm@12063
  1840
wenzelm@11896
  1841
wenzelm@13336
  1842
(* predicate text *)
ballarin@15596
  1843
(* CB: generate locale predicates and delta predicates *)
wenzelm@13336
  1844
wenzelm@13375
  1845
local
wenzelm@13375
  1846
ballarin@15206
  1847
(* introN: name of theorems for introduction rules of locale and
ballarin@15206
  1848
     delta predicates;
ballarin@15206
  1849
   axiomsN: name of theorem set with destruct rules for locale predicates,
ballarin@15206
  1850
     also name suffix of delta predicates. *)
ballarin@15206
  1851
wenzelm@13375
  1852
val introN = "intro";
ballarin@15206
  1853
val axiomsN = "axioms";
wenzelm@13375
  1854
wenzelm@13375
  1855
fun atomize_spec sign ts =
wenzelm@13375
  1856
  let
skalberg@15574
  1857
    val t = foldr1 Logic.mk_conjunction ts;
wenzelm@13375
  1858
    val body = ObjectLogic.atomize_term sign t;
wenzelm@13375
  1859
    val bodyT = Term.fastype_of body;
wenzelm@13375
  1860
  in
wenzelm@13375
  1861
    if bodyT = propT then (t, propT, Thm.reflexive (Thm.cterm_of sign t))
wenzelm@13375
  1862
    else (body, bodyT, ObjectLogic.atomize_rule sign (Thm.cterm_of sign t))
wenzelm@13375
  1863
  end;
wenzelm@13375
  1864
wenzelm@13394
  1865
fun aprop_tr' n c = (c, fn args =>
wenzelm@13394
  1866
  if length args = n then Syntax.const "_aprop" $ Term.list_comb (Syntax.free c, args)
wenzelm@13394
  1867
  else raise Match);
wenzelm@13336
  1868
ballarin@15104
  1869
(* CB: define one predicate including its intro rule and axioms
ballarin@15104
  1870
   - bname: predicate name
ballarin@15104
  1871
   - parms: locale parameters
ballarin@15104
  1872
   - defs: thms representing substitutions from defines elements
ballarin@15104
  1873
   - ts: terms representing locale assumptions (not normalised wrt. defs)
ballarin@15104
  1874
   - norm_ts: terms representing locale assumptions (normalised wrt. defs)
ballarin@15104
  1875
   - thy: the theory
ballarin@15104
  1876
*)
ballarin@15104
  1877
wenzelm@13420
  1878
fun def_pred bname parms defs ts norm_ts thy =
wenzelm@13375
  1879
  let
wenzelm@13375
  1880
    val sign = Theory.sign_of thy;
wenzelm@13375
  1881
    val name = Sign.full_name sign bname;
wenzelm@13375
  1882
wenzelm@13420
  1883
    val (body, bodyT, body_eq) = atomize_spec sign norm_ts;
wenzelm@13394
  1884
    val env = Term.add_term_free_names (body, []);
skalberg@15570
  1885
    val xs = List.filter (fn (x, _) => x mem_string env) parms;
wenzelm@13394
  1886
    val Ts = map #2 xs;
skalberg@15574
  1887
    val extraTs = (Term.term_tfrees body \\ foldr Term.add_typ_tfrees [] Ts)
wenzelm@13394
  1888
      |> Library.sort_wrt #1 |> map TFree;
wenzelm@13399
  1889
    val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
wenzelm@13336
  1890
wenzelm@13394
  1891
    val args = map Logic.mk_type extraTs @ map Free xs;
wenzelm@13394
  1892
    val head = Term.list_comb (Const (name, predT), args);
wenzelm@13375
  1893
    val statement = ObjectLogic.assert_propT sign head;
wenzelm@13375
  1894
wenzelm@13375
  1895
    val (defs_thy, [pred_def]) =
wenzelm@13375
  1896
      thy
wenzelm@13394
  1897
      |> (if bodyT <> propT then I else
wenzelm@13394
  1898
        Theory.add_trfuns ([], [], map (aprop_tr' (length args)) (NameSpace.accesses' name), []))
wenzelm@13375
  1899
      |> Theory.add_consts_i [(bname, predT, Syntax.NoSyn)]
wenzelm@13375
  1900
      |> PureThy.add_defs_i false [((Thm.def_name bname, Logic.mk_equals (head, body)), [])];
wenzelm@13394
  1901
wenzelm@13375
  1902
    val defs_sign = Theory.sign_of defs_thy;
wenzelm@13375
  1903
    val cert = Thm.cterm_of defs_sign;
wenzelm@13375
  1904
wenzelm@13420
  1905
    val intro = Tactic.prove_standard defs_sign [] norm_ts statement (fn _ =>
wenzelm@13375
  1906
      Tactic.rewrite_goals_tac [pred_def] THEN
wenzelm@13375
  1907
      Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
wenzelm@13420
  1908
      Tactic.compose_tac (false, Drule.conj_intr_list (map (Thm.assume o cert) norm_ts), 0) 1);
wenzelm@13375
  1909
wenzelm@13375
  1910
    val conjuncts =
wenzelm@13399
  1911
      Drule.equal_elim_rule1 OF [Thm.symmetric body_eq,
wenzelm@13399
  1912
        Tactic.rewrite_rule [pred_def] (Thm.assume (cert statement))]
wenzelm@13375
  1913
      |> Drule.conj_elim_precise (length ts);
wenzelm@13394
  1914
    val axioms = (ts ~~ conjuncts) |> map (fn (t, ax) =>
wenzelm@13375
  1915
      Tactic.prove defs_sign [] [] t (fn _ =>
wenzelm@13375
  1916
        Tactic.rewrite_goals_tac defs THEN
wenzelm@13375
  1917
        Tactic.compose_tac (false, ax, 0) 1));
wenzelm@13394
  1918
  in (defs_thy, (statement, intro, axioms)) end;
wenzelm@13375
  1919
ballarin@15104
  1920
(* CB: modify the locale elements:
ballarin@15623
  1921
   - assumes elements become notes elements,
ballarin@15104
  1922
   - notes elements are lifted
ballarin@15104
  1923
*)
ballarin@15104
  1924
wenzelm@15703
  1925
fun change_elem (axms, Assumes asms) =
wenzelm@13394
  1926
      apsnd Notes ((axms, asms) |> foldl_map (fn (axs, (a, spec)) =>
nipkow@13629
  1927
        let val (ps,qs) = splitAt(length spec, axs)
nipkow@13629
  1928
        in (qs, (a, [(ps, [])])) end))
wenzelm@15703
  1929
  | change_elem e = e;
wenzelm@13394
  1930
ballarin@15206
  1931
(* CB: changes only "new" elems, these have identifier ("", _). *)
ballarin@15206
  1932
wenzelm@13394
  1933
fun change_elemss axioms elemss = (axioms, elemss) |> foldl_map
wenzelm@13394
  1934
  (fn (axms, (id as ("", _), es)) =>
wenzelm@15703
  1935
    foldl_map change_elem (axms, map (map_values I I (Drule.satisfy_hyps axioms)) es)
wenzelm@15703
  1936
    |> apsnd (pair id)
wenzelm@13394
  1937
  | x => x) |> #2;
wenzelm@13394
  1938
wenzelm@13394
  1939
in
wenzelm@13375
  1940
ballarin@15104
  1941
(* CB: main predicate definition function *)
ballarin@15104
  1942
wenzelm@13394
  1943
fun define_preds bname (parms, ((exts, exts'), (ints, ints')), defs) elemss thy =
wenzelm@13394
  1944
  let
wenzelm@13394
  1945
    val (thy', (elemss', more_ts)) =
skalberg@15531
  1946
      if null exts then (thy, (elemss, []))
wenzelm@13394
  1947
      else
wenzelm@13394
  1948
        let
skalberg@15531
  1949
          val aname = if null ints then bname else bname ^ "_" ^ axiomsN;
wenzelm@13394
  1950
          val (def_thy, (statement, intro, axioms)) =
wenzelm@13394
  1951
            thy |> def_pred aname parms defs exts exts';
wenzelm@13394
  1952
          val elemss' = change_elemss axioms elemss @
wenzelm@13420
  1953
            [(("", []), [Assumes [((bname ^ "_" ^ axiomsN, []), [(statement, ([], []))])]])];
wenzelm@13394
  1954
        in
wenzelm@14564
  1955
          def_thy |> note_thmss_qualified "" aname
ballarin@14254
  1956
            [((introN, []), [([intro], [])])]
wenzelm@13394
  1957
          |> #1 |> rpair (elemss', [statement])
wenzelm@13394
  1958
        end;
ballarin@15206
  1959
    val (thy'', predicate) =
skalberg@15531
  1960
      if null ints then (thy', ([], []))
wenzelm@13394
  1961
      else
wenzelm@13394
  1962
        let
wenzelm@13394
  1963
          val (def_thy, (statement, intro, axioms)) =
wenzelm@13394
  1964
            thy' |> def_pred bname parms defs (ints @ more_ts) (ints' @ more_ts);
wenzelm@13399
  1965
          val cstatement = Thm.cterm_of (Theory.sign_of def_thy) statement;
wenzelm@13394
  1966
        in
wenzelm@14564
  1967
          def_thy |> note_thmss_qualified "" bname
ballarin@14254
  1968
            [((introN, []), [([intro], [])]),
ballarin@14254
  1969
             ((axiomsN, []), [(map Drule.standard axioms, [])])]
wenzelm@13415
  1970
          |> #1 |> rpair ([cstatement], axioms)
wenzelm@13394
  1971
        end;
ballarin@15206
  1972
  in (thy'', (elemss', predicate)) end;
wenzelm@13375
  1973
wenzelm@13375
  1974
end;
wenzelm@13336
  1975
wenzelm@13336
  1976
wenzelm@13297
  1977
(* add_locale(_i) *)
wenzelm@13297
  1978
wenzelm@13297
  1979
local
wenzelm@13297
  1980
wenzelm@13394
  1981
fun gen_add_locale prep_ctxt prep_expr do_pred bname raw_import raw_body thy =
ballarin@15596
  1982
  (* CB: do_pred controls generation of predicates.
ballarin@15596
  1983
         true -> with, false -> without predicates. *)
wenzelm@13297
  1984
  let
wenzelm@13297
  1985
    val sign = Theory.sign_of thy;
wenzelm@13297
  1986
    val name = Sign.full_name sign bname;
skalberg@15570
  1987
    val _ = conditional (isSome (get_locale thy name)) (fn () =>
wenzelm@13297
  1988
      error ("Duplicate definition of locale " ^ quote name));
wenzelm@13297
  1989
wenzelm@13297
  1990
    val thy_ctxt = ProofContext.init thy;
ballarin@16102
  1991
    val (((import_ctxt, import_elemss), (body_ctxt, body_elemss, syn)), text) =
wenzelm@13375
  1992
      prep_ctxt raw_import raw_body thy_ctxt;
wenzelm@13375
  1993
    val elemss = import_elemss @ body_elemss;
wenzelm@13297
  1994
ballarin@15206
  1995
    val (pred_thy, (elemss', predicate as (predicate_statement, predicate_axioms))) =
wenzelm@13394
  1996
      if do_pred then thy |> define_preds bname text elemss
wenzelm@13415
  1997
      else (thy, (elemss, ([], [])));
wenzelm@13375
  1998
    val pred_ctxt = ProofContext.init pred_thy;
wenzelm@13420
  1999
ballarin@15206
  2000
    fun axiomify axioms elemss = 
ballarin@15206
  2001
      (axioms, elemss) |> foldl_map (fn (axs, (id, elems)) => let
skalberg@15570
  2002
                   val ts = List.concat (List.mapPartial (fn (Assumes asms) =>
skalberg@15570
  2003
                     SOME (List.concat (map (map #1 o #2) asms)) | _ => NONE) elems);
ballarin@15206
  2004
                   val (axs1, axs2) = splitAt (length ts, axs);
ballarin@15206
  2005
                 in (axs2, ((id, axs1), elems)) end)
ballarin@15206
  2006
        |> snd;
ballarin@15206
  2007
    val (ctxt, (_, facts)) = activate_facts (K I)
ballarin@15206
  2008
      (pred_ctxt, axiomify predicate_axioms elemss');
ballarin@15206
  2009
    val export = ProofContext.export_standard predicate_statement ctxt pred_ctxt;
wenzelm@13420
  2010
    val facts' = facts |> map (fn (a, ths) => ((a, []), [(map export ths, [])]));
wenzelm@13297
  2011
  in
wenzelm@13375
  2012
    pred_thy
wenzelm@14564
  2013
    |> note_thmss_qualified "" name facts' |> #1
wenzelm@13297
  2014
    |> declare_locale name
ballarin@15206
  2015
    |> put_locale name {predicate = predicate, import = prep_expr sign raw_import,
skalberg@15570
  2016
        elems = map (fn e => (e, stamp ())) (List.concat (map #2 (List.filter (equal "" o #1 o #1) elemss'))),
ballarin@16102
  2017
        params = (params_of elemss' |>
ballarin@16102
  2018
          map (fn (x, T) => ((x, T), valOf (Symtab.lookup (syn, x)))), map #1 (params_of body_elemss))}
wenzelm@13297
  2019
  end;
wenzelm@13297
  2020
wenzelm@13297
  2021
in
wenzelm@13297
  2022
wenzelm@13297
  2023
val add_locale = gen_add_locale read_context intern_expr;
wenzelm@13297
  2024
val add_locale_i = gen_add_locale cert_context (K I);
wenzelm@13297
  2025
wenzelm@13297
  2026
end;
wenzelm@13297
  2027
wenzelm@15801
  2028
val _ = Context.add_setup
wenzelm@15801
  2029
 [add_locale_i true "var" empty [Fixes [(Syntax.internal "x", NONE, SOME Syntax.NoSyn)]],
wenzelm@15801
  2030
  add_locale_i true "struct" empty [Fixes [(Syntax.internal "S", NONE, NONE)]]];
wenzelm@15801
  2031
wenzelm@13297
  2032
wenzelm@12730
  2033
ballarin@15598
  2034
(** Interpretation commands **)
ballarin@15596
  2035
ballarin@15596
  2036
local
ballarin@15596
  2037
ballarin@15596
  2038
(* extract proof obligations (assms and defs) from elements *)
ballarin@15596
  2039
ballarin@15596
  2040
(* check if defining equation has become t == t, these are dropped
ballarin@15596
  2041
   in extract_asms_elem, as they lead to trivial proof obligations *)
ballarin@15596
  2042
(* currently disabled *)
ballarin@15596
  2043
fun check_def (_, (def, _)) = SOME def;
ballarin@15596
  2044
(*
ballarin@15596
  2045
fun check_def (_, (def, _)) =
ballarin@15596
  2046
      if def |> Logic.dest_equals |> op aconv
ballarin@15596
  2047
      then NONE else SOME def;
ballarin@15596
  2048
*)
ballarin@15596
  2049
ballarin@15596
  2050
fun extract_asms_elem (ts, Fixes _) = ts
ballarin@15596
  2051
  | extract_asms_elem (ts, Assumes asms) =
ballarin@15596
  2052
      ts @ List.concat (map (fn (_, ams) => map (fn (t, _) => t) ams) asms)
ballarin@15596
  2053
  | extract_asms_elem (ts, Defines defs) =
ballarin@15596
  2054
      ts @ List.mapPartial check_def defs
ballarin@15596
  2055
  | extract_asms_elem (ts, Notes _) = ts;
ballarin@15596
  2056
ballarin@15596
  2057
fun extract_asms_elems (id, elems) =
ballarin@15596
  2058
      (id, Library.foldl extract_asms_elem ([], elems));
ballarin@15596
  2059
ballarin@15596
  2060
fun extract_asms_elemss elemss =
ballarin@15596
  2061
      map extract_asms_elems elemss;
ballarin@15596
  2062
ballarin@15624
  2063
(* activate instantiated facts in theory or context *)
ballarin@15596
  2064
ballarin@15624
  2065
fun activate_facts_elem _ _ _ _ (thy_ctxt, Fixes _) = thy_ctxt
ballarin@15624
  2066
  | activate_facts_elem _ _ _ _ (thy_ctxt, Assumes _) = thy_ctxt
ballarin@15624
  2067
  | activate_facts_elem _ _ _ _ (thy_ctxt, Defines _) = thy_ctxt
wenzelm@15703
  2068
  | activate_facts_elem note_thmss attrib
ballarin@15624
  2069
        disch (prfx, atts) (thy_ctxt, Notes facts) =
ballarin@15596
  2070
      let
wenzelm@15703
  2071
        val reg_atts = map (attrib thy_ctxt) atts;
ballarin@15763
  2072
        (* discharge hyps in attributes *)
ballarin@15763
  2073
        val facts = map_attrib_facts (attrib thy_ctxt o Args.map_values I I I disch) facts;
wenzelm@15703
  2074
        val facts' = map (apfst (apsnd (fn a => a @ reg_atts))) facts;
wenzelm@15703
  2075
        (* discharge hyps *)
ballarin@15624
  2076
        val facts'' = map (apsnd (map (apfst (map disch)))) facts';
ballarin@15624
  2077
        (* prefix names *)
ballarin@15624
  2078
        val facts''' = map (apfst (apfst (fn name =>
ballarin@15624
  2079
          if prfx = "" orelse name = "" then name
ballarin@15624
  2080
          else NameSpace.pack [prfx, name]))) facts'';
ballarin@15596
  2081
      in
ballarin@15624
  2082
        fst (note_thmss prfx facts''' thy_ctxt)
ballarin@15596
  2083
      end;
ballarin@15596
  2084
wenzelm@15703
  2085
fun activate_facts_elems get_reg note_thmss attrib
ballarin@15624
  2086
        disch (thy_ctxt, (id, elems)) =
ballarin@15596
  2087
      let
ballarin@15624
  2088
        val ((prfx, atts2), _) = valOf (get_reg thy_ctxt id)
ballarin@15596
  2089
          handle Option => error ("(internal) unknown registration of " ^
ballarin@15596
  2090
            quote (fst id) ^ " while activating facts.");
ballarin@15596
  2091
      in
wenzelm@15703
  2092
        Library.foldl (activate_facts_elem note_thmss attrib
ballarin@15624
  2093
          disch (prfx, atts2)) (thy_ctxt, elems)
ballarin@15596
  2094
      end;
ballarin@15596
  2095
wenzelm@15703
  2096
fun gen_activate_facts_elemss get_reg note_thmss attrib standard
ballarin@15624
  2097
        all_elemss new_elemss thy_ctxt =
ballarin@15596
  2098
      let
ballarin@15596
  2099
        val prems = List.concat (List.mapPartial (fn (id, _) =>
ballarin@15624
  2100
              Option.map snd (get_reg thy_ctxt id)
ballarin@15596
  2101
                handle Option => error ("(internal) unknown registration of " ^
ballarin@15596
  2102
                  quote (fst id) ^ " while activating facts.")) all_elemss);
wenzelm@15703
  2103
      in Library.foldl (activate_facts_elems get_reg note_thmss attrib
ballarin@15839
  2104
        (standard o Drule.fconv_rule (Thm.beta_conversion true) o
ballarin@15837
  2105
          Drule.satisfy_hyps prems)) (thy_ctxt, new_elemss) end;
ballarin@15596
  2106
ballarin@15624
  2107
val global_activate_facts_elemss = gen_activate_facts_elemss
ballarin@15696
  2108
      (fn thy => fn (name, ps) =>
ballarin@15696
  2109
        get_global_registration thy (name, map Logic.varify ps))
ballarin@15696
  2110
      (fn prfx => PureThy.note_thmss_accesses_i (global_accesses prfx)
ballarin@15624
  2111
        (Drule.kind ""))
wenzelm@15703
  2112
      Attrib.global_attribute_i Drule.standard;
ballarin@15624
  2113
val local_activate_facts_elemss = gen_activate_facts_elemss
ballarin@15696
  2114
      get_local_registration
ballarin@15696
  2115
      (fn prfx => ProofContext.note_thmss_accesses_i (local_accesses prfx))
wenzelm@15703
  2116
      Attrib.context_attribute_i I;
ballarin@15624
  2117
ballarin@15696
  2118
fun gen_prep_registration mk_ctxt is_local read_terms test_reg put_reg activate
ballarin@15624
  2119
    attn expr insts thy_ctxt =
ballarin@15596
  2120
  let
ballarin@15624
  2121
    val ctxt = mk_ctxt thy_ctxt;
ballarin@15624
  2122
    val sign = ProofContext.sign_of ctxt;
ballarin@15596
  2123
ballarin@15696
  2124
    val ctxt' = ctxt |> ProofContext.theory_of |> ProofContext.init;
ballarin@16102
  2125
    val ((ids, _), raw_elemss) = flatten (ctxt', intern_expr sign)
ballarin@16102
  2126
          (([], Symtab.empty), Expr expr);
ballarin@15596
  2127
    val do_close = false;  (* effect unknown *)
ballarin@15596
  2128
    val ((parms, all_elemss, _), (spec, (xs, defs, _))) =
ballarin@15696
  2129
          read_elemss do_close ctxt' [] raw_elemss [];
ballarin@15596
  2130
ballarin@15596
  2131
ballarin@15596
  2132
    (** compute instantiation **)
ballarin@15596
  2133
ballarin@15696
  2134
    (* user input *)
ballarin@15596
  2135
    val insts = if length parms < length insts
ballarin@15596
  2136
         then error "More arguments than parameters in instantiation."
ballarin@15596
  2137
         else insts @ replicate (length parms - length insts) NONE;
ballarin@15596
  2138
    val (ps, pTs) = split_list parms;
ballarin@15596
  2139
    val pvTs = map Type.varifyT pTs;
ballarin@15598
  2140
ballarin@15598
  2141
    (* instantiations given by user *)
ballarin@15596
  2142
    val given = List.mapPartial (fn (_, (NONE, _)) => NONE
ballarin@15596
  2143
         | (x, (SOME inst, T)) => SOME (x, (inst, T))) (ps ~~ (insts ~~ pvTs));
ballarin@15596
  2144
    val (given_ps, given_insts) = split_list given;
ballarin@15596
  2145
    val tvars = foldr Term.add_typ_tvars [] pvTs;
ballarin@15596
  2146
    val used = foldr Term.add_typ_varnames [] pvTs;
ballarin@15596
  2147
    fun sorts (a, i) = assoc (tvars, (a, i));
ballarin@15624
  2148
    val (vs, vinst) = read_terms thy_ctxt sorts used given_insts;
ballarin@15696
  2149
    val vars = foldl Term.add_term_tvar_ixns [] vs \\ map fst tvars;
ballarin@15696
  2150
    val vars' = Library.foldl Term.add_term_varnames (vars, vs);
ballarin@15696
  2151
    val _ = if null vars' then ()
ballarin@15696
  2152
         else error ("Illegal schematic variable(s) in instantiation: " ^
ballarin@15696
  2153
           commas_quote (map Syntax.string_of_vname vars'));
ballarin@15598
  2154
    (* replace new types (which are TFrees) by ones with new names *)
ballarin@15598
  2155
    val new_Tnames = foldr Term.add_term_tfree_names [] vs;
ballarin@15598
  2156
    val new_Tnames' = Term.invent_names used "'a" (length new_Tnames);
ballarin@15696
  2157
    val renameT =
ballarin@15696
  2158
          if is_local then I
ballarin@15696
  2159
          else Type.unvarifyT o Term.map_type_tfree (fn (a, s) =>
ballarin@15696
  2160
            TFree (valOf (assoc (new_Tnames ~~ new_Tnames', a)), s));
ballarin@15696
  2161
    val rename =
ballarin@15696
  2162
          if is_local then I
ballarin@15696
  2163
          else Term.map_term_types renameT;
ballarin@15598
  2164
ballarin@15598
  2165
    val tinst = Symtab.make (map
ballarin@15696
  2166
                (fn ((x, 0), T) => (x, T |> renameT)
ballarin@15696
  2167
                  | ((_, n), _) => error "Internal error var in prep_registration") vinst);
ballarin@15696
  2168
    val inst = Symtab.make (given_ps ~~ map rename vs);
ballarin@15596
  2169
ballarin@15596
  2170
    (* defined params without user input *)
ballarin@15596
  2171
    val not_given = List.mapPartial (fn (x, (NONE, T)) => SOME (x, T)
ballarin@15596
  2172
         | (_, (SOME _, _)) => NONE) (ps ~~ (insts ~~ pTs));
ballarin@15596
  2173
    fun add_def ((inst, tinst), (p, pT)) =
ballarin@15596
  2174
      let
ballarin@15596
  2175
        val (t, T) = case find_first (fn (Free (a, _), _) => a = p) defs of
ballarin@15596
  2176
               NONE => error ("Instance missing for parameter " ^ quote p)
ballarin@15596
  2177
             | SOME (Free (_, T), t) => (t, T);
ballarin@15696
  2178
        val d = t |> inst_tab_term (inst, tinst) |> Envir.beta_norm;
ballarin@15596
  2179
      in (Symtab.update_new ((p, d), inst), tinst) end;
ballarin@15596
  2180
    val (inst, tinst) = Library.foldl add_def ((inst, tinst), not_given);
ballarin@15696
  2181
    (* Note: inst and tinst contain no vars. *)
ballarin@15596
  2182
ballarin@15596
  2183
    (** compute proof obligations **)
ballarin@15596
  2184
ballarin@15598
  2185
    (* restore "small" ids *)
ballarin@15596
  2186
    val ids' = map (fn ((n, ps), _) =>
ballarin@15596
  2187
          (n, map (fn p => Free (p, valOf (assoc (parms, p)))) ps)) ids;
ballarin@15596
  2188
ballarin@15596
  2189
    (* instantiate ids and elements *)
ballarin@15596
  2190
    val inst_elemss = map
ballarin@15696
  2191
          (fn (id, (_, elems)) => inst_tab_elems sign (inst, tinst) (id, 
ballarin@15596
  2192
            map (fn Int e => e) elems)) 
ballarin@15596
  2193
          (ids' ~~ all_elemss);
ballarin@15596
  2194
ballarin@15624
  2195
    (* remove fragments already registered with theory or context *)
ballarin@15596
  2196
    val new_inst_elemss = List.filter (fn (id, _) =>
ballarin@15624
  2197
          not (test_reg thy_ctxt id)) inst_elemss;
wenzelm@15703
  2198
    val new_ids = map #1 new_inst_elemss;
ballarin@15596
  2199
ballarin@15596
  2200
    val propss = extract_asms_elemss new_inst_elemss;
ballarin@15596
  2201
wenzelm@15703
  2202
    val bind_attrib = Attrib.crude_closure ctxt o Args.assignable;
wenzelm@15703
  2203
    val attn' = apsnd (map (bind_attrib o Attrib.intern_src sign)) attn;
ballarin@15596
  2204
ballarin@15696
  2205
    (** add registrations to theory or context,
ballarin@15596
  2206
        without theorems, these are added after the proof **)
ballarin@15696
  2207
    (* TODO: this is potentially problematic, since a proof of the
ballarin@15696
  2208
       interpretation might contain a reference to the incomplete
ballarin@15696
  2209
       registration. *)
ballarin@15596
  2210
ballarin@15624
  2211
    val thy_ctxt' = Library.foldl (fn (thy_ctxt, (id, _)) =>
wenzelm@15703
  2212
          put_reg id attn' thy_ctxt) (thy_ctxt, new_inst_elemss);
ballarin@15624
  2213
ballarin@15624
  2214
  in (thy_ctxt', propss, activate inst_elemss new_inst_elemss) end;
ballarin@15624
  2215
ballarin@15624
  2216
in
ballarin@15596
  2217
ballarin@15624
  2218
val prep_global_registration = gen_prep_registration
ballarin@15696
  2219
     ProofContext.init false
ballarin@15624
  2220
     (fn thy => fn sorts => fn used =>
ballarin@15624
  2221
       Sign.read_def_terms (Theory.sign_of thy, K NONE, sorts) used true)
ballarin@15696
  2222
     (fn thy => fn (name, ps) =>
ballarin@15696
  2223
       test_global_registration thy (name, map Logic.varify ps))
ballarin@15696
  2224
     (fn (name, ps) => put_global_registration (name, map Logic.varify ps))
ballarin@15624
  2225
     global_activate_facts_elemss;
ballarin@15624
  2226
ballarin@15624
  2227
val prep_local_registration = gen_prep_registration
ballarin@15696
  2228
     I true
ballarin@15624
  2229
     (fn ctxt => ProofContext.read_termTs ctxt (K false) (K NONE))
ballarin@15624
  2230
     smart_test_registration
ballarin@15624
  2231
     put_local_registration
ballarin@15624
  2232
     local_activate_facts_elemss;
ballarin@15596
  2233
ballarin@15596
  2234
end;  (* local *)
ballarin@15596
  2235
ballarin@15596
  2236
wenzelm@11896
  2237
end;