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