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