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