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