src/Pure/Isar/locale.ML
author ballarin
Tue Sep 30 15:13:02 2003 +0200 (2003-09-30)
changeset 14215 ebf291f3b449
parent 13629 a46362d2b19b
child 14216 a15951091d5d
permissions -rw-r--r--
Improvements to Isar/Locales: premises generated by "includes" elements
changed. Bugfix "unify_frozen".
wenzelm@12014
     1
(*  Title:      Pure/Isar/locale.ML
wenzelm@11896
     2
    ID:         $Id$
ballarin@14215
     3
    Author:     Markus Wenzel, LMU/TU Muenchen
wenzelm@11896
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
wenzelm@11896
     5
wenzelm@12058
     6
Locales -- Isar proof contexts as meta-level predicates, with local
wenzelm@12529
     7
syntax and implicit structures.
wenzelm@12529
     8
ballarin@14215
     9
Draws some basic ideas from Florian Kammueller's original version of
wenzelm@12529
    10
locales, but uses the richer infrastructure of Isar instead of the raw
wenzelm@12529
    11
meta-logic.  Furthermore, we provide structured import of contexts
ballarin@14215
    12
(with merge and rename operations), as well as type-inference of the
wenzelm@13375
    13
signature parts, and predicate definitions of the specification text.
wenzelm@11896
    14
*)
wenzelm@11896
    15
wenzelm@11896
    16
signature LOCALE =
wenzelm@11896
    17
sig
wenzelm@12046
    18
  type context
wenzelm@12046
    19
  datatype ('typ, 'term, 'fact, 'att) elem =
wenzelm@12058
    20
    Fixes of (string * 'typ option * mixfix option) list |
wenzelm@12046
    21
    Assumes of ((string * 'att list) * ('term * ('term list * 'term list)) list) list |
wenzelm@12046
    22
    Defines of ((string * 'att list) * ('term * 'term list)) list |
wenzelm@12273
    23
    Notes of ((string * 'att list) * ('fact * 'att list) list) list
wenzelm@12273
    24
  datatype expr =
wenzelm@12273
    25
    Locale of string |
wenzelm@12273
    26
    Rename of expr * string option list |
wenzelm@12273
    27
    Merge of expr list
wenzelm@12273
    28
  val empty: expr
wenzelm@12273
    29
  datatype ('typ, 'term, 'fact, 'att) elem_expr =
wenzelm@12273
    30
    Elem of ('typ, 'term, 'fact, 'att) elem | Expr of expr
wenzelm@12046
    31
  type 'att element
wenzelm@12046
    32
  type 'att element_i
wenzelm@12046
    33
  type locale
wenzelm@12046
    34
  val intern: Sign.sg -> xstring -> string
wenzelm@12014
    35
  val cond_extern: Sign.sg -> string -> xstring
wenzelm@12502
    36
  val the_locale: theory -> string -> locale
wenzelm@12273
    37
  val attribute: ('att -> context attribute) -> ('typ, 'term, 'thm, 'att) elem_expr
wenzelm@12273
    38
    -> ('typ, 'term, 'thm, context attribute) elem_expr
wenzelm@12529
    39
  val read_context_statement: xstring option -> context attribute element list ->
wenzelm@12529
    40
    (string * (string list * string list)) list list -> context ->
wenzelm@13415
    41
    string option * cterm list * context * context * (term * (term list * term list)) list list
wenzelm@12529
    42
  val cert_context_statement: string option -> context attribute element_i list ->
wenzelm@12529
    43
    (term * (term list * term list)) list list -> context ->
wenzelm@13415
    44
    string option * cterm list * context * context * (term * (term list * term list)) list list
wenzelm@12758
    45
  val print_locales: theory -> unit
wenzelm@12758
    46
  val print_locale: theory -> expr -> context attribute element list -> unit
wenzelm@13394
    47
  val add_locale: bool -> bstring -> expr -> context attribute element list -> theory -> theory
wenzelm@13394
    48
  val add_locale_i: bool -> bstring -> expr -> context attribute element_i list
wenzelm@13394
    49
    -> theory -> theory
wenzelm@12958
    50
  val smart_have_thmss: string -> (string * 'a) Library.option ->
wenzelm@12958
    51
    ((bstring * theory attribute list) * (thm list * theory attribute list) list) list ->
wenzelm@12958
    52
    theory -> theory * (bstring * thm list) list
wenzelm@12711
    53
  val have_thmss: string -> xstring ->
wenzelm@12711
    54
    ((bstring * context attribute list) * (xstring * context attribute list) list) list ->
wenzelm@12711
    55
    theory -> theory * (bstring * thm list) list
wenzelm@12711
    56
  val have_thmss_i: string -> string ->
wenzelm@12711
    57
    ((bstring * context attribute list) * (thm list * context attribute list) list) list ->
wenzelm@12711
    58
    theory -> theory * (bstring * thm list) list
wenzelm@12958
    59
  val add_thmss: string -> ((string * thm list) * context attribute list) list ->
wenzelm@13375
    60
    theory * context -> (theory * context) * (string * thm list) list
ballarin@14215
    61
  val prune_prems: theory -> thm -> thm
wenzelm@11896
    62
  val setup: (theory -> theory) list
wenzelm@11896
    63
end;
wenzelm@12839
    64
wenzelm@12289
    65
structure Locale: LOCALE =
wenzelm@11896
    66
struct
wenzelm@11896
    67
wenzelm@12273
    68
(** locale elements and expressions **)
wenzelm@11896
    69
wenzelm@12014
    70
type context = ProofContext.context;
wenzelm@11896
    71
wenzelm@12046
    72
datatype ('typ, 'term, 'fact, 'att) elem =
wenzelm@12058
    73
  Fixes of (string * 'typ option * mixfix option) list |
wenzelm@12046
    74
  Assumes of ((string * 'att list) * ('term * ('term list * 'term list)) list) list |
wenzelm@12046
    75
  Defines of ((string * 'att list) * ('term * 'term list)) list |
wenzelm@12273
    76
  Notes of ((string * 'att list) * ('fact * 'att list) list) list;
wenzelm@12273
    77
wenzelm@12273
    78
datatype expr =
wenzelm@12273
    79
  Locale of string |
wenzelm@12273
    80
  Rename of expr * string option list |
wenzelm@12273
    81
  Merge of expr list;
wenzelm@11896
    82
wenzelm@12273
    83
val empty = Merge [];
wenzelm@12273
    84
wenzelm@12273
    85
datatype ('typ, 'term, 'fact, 'att) elem_expr =
wenzelm@12273
    86
  Elem of ('typ, 'term, 'fact, 'att) elem | Expr of expr;
wenzelm@12273
    87
wenzelm@12273
    88
type 'att element = (string, string, string, 'att) elem_expr;
wenzelm@12273
    89
type 'att element_i = (typ, term, thm list, 'att) elem_expr;
wenzelm@12070
    90
wenzelm@12070
    91
type locale =
wenzelm@13415
    92
 {view: cterm list * thm list,                            (*external view on assumptions*)
wenzelm@13399
    93
  import: expr,                                                         (*dynamic import*)
wenzelm@12289
    94
  elems: ((typ, term, thm list, context attribute) elem * stamp) list,  (*static content*)
wenzelm@13399
    95
  params: (string * typ option) list * string list};                  (*all/local params*)
wenzelm@12063
    96
wenzelm@13399
    97
fun make_locale view import elems params =
wenzelm@13399
    98
 {view = view, import = import, elems = elems, params = params}: locale;
wenzelm@12063
    99
wenzelm@11896
   100
wenzelm@11896
   101
(** theory data **)
wenzelm@11896
   102
wenzelm@11896
   103
structure LocalesArgs =
wenzelm@11896
   104
struct
wenzelm@12014
   105
  val name = "Isar/locales";
wenzelm@12063
   106
  type T = NameSpace.T * locale Symtab.table;
wenzelm@11896
   107
wenzelm@12063
   108
  val empty = (NameSpace.empty, Symtab.empty);
wenzelm@12063
   109
  val copy = I;
wenzelm@12118
   110
  val prep_ext = I;
wenzelm@12289
   111
wenzelm@12289
   112
  (*joining of locale elements: only facts may be added later!*)
wenzelm@13399
   113
  fun join ({view, import, elems, params}: locale, {elems = elems', ...}: locale) =
wenzelm@13399
   114
    Some (make_locale view import (gen_merge_lists eq_snd elems elems') params);
wenzelm@12273
   115
  fun merge ((space1, locs1), (space2, locs2)) =
wenzelm@12289
   116
    (NameSpace.merge (space1, space2), Symtab.join join (locs1, locs2));
wenzelm@12289
   117
wenzelm@12273
   118
  fun print _ (space, locs) =
wenzelm@12273
   119
    Pretty.strs ("locales:" :: map (NameSpace.cond_extern space o #1) (Symtab.dest locs))
wenzelm@12014
   120
    |> Pretty.writeln;
wenzelm@11896
   121
end;
wenzelm@11896
   122
wenzelm@11896
   123
structure LocalesData = TheoryDataFun(LocalesArgs);
wenzelm@11896
   124
val print_locales = LocalesData.print;
wenzelm@11896
   125
wenzelm@12289
   126
val intern = NameSpace.intern o #1 o LocalesData.get_sg;
wenzelm@12289
   127
val cond_extern = NameSpace.cond_extern o #1 o LocalesData.get_sg;
wenzelm@12289
   128
wenzelm@12277
   129
wenzelm@12277
   130
(* access locales *)
wenzelm@12277
   131
wenzelm@12063
   132
fun declare_locale name =
wenzelm@12063
   133
  LocalesData.map (apfst (fn space => (NameSpace.extend (space, [name]))));
wenzelm@11896
   134
wenzelm@12273
   135
fun put_locale name loc = LocalesData.map (apsnd (fn locs => Symtab.update ((name, loc), locs)));
wenzelm@12063
   136
fun get_locale thy name = Symtab.lookup (#2 (LocalesData.get thy), name);
wenzelm@11896
   137
wenzelm@12014
   138
fun the_locale thy name =
wenzelm@12014
   139
  (case get_locale thy name of
wenzelm@12014
   140
    Some loc => loc
wenzelm@12014
   141
  | None => error ("Unknown locale " ^ quote name));
wenzelm@11896
   142
wenzelm@12046
   143
ballarin@14215
   144
(* import hierarchy
ballarin@14215
   145
   implementation could be more efficient, eg. by maintaining a database
ballarin@14215
   146
   of dependencies *)
ballarin@14215
   147
ballarin@14215
   148
fun imports thy (upper, lower) =
ballarin@14215
   149
  let
ballarin@14215
   150
    val sign = sign_of thy;
ballarin@14215
   151
    fun imps (Locale name) low = (name = low) orelse
ballarin@14215
   152
      (case get_locale thy name of
ballarin@14215
   153
           None => false
ballarin@14215
   154
         | Some {import, ...} => imps import low)
ballarin@14215
   155
      | imps (Rename (expr, _)) low = imps expr low
ballarin@14215
   156
      | imps (Merge es) low = exists (fn e => imps e low) es;
ballarin@14215
   157
  in
ballarin@14215
   158
    imps (Locale (intern sign upper)) (intern sign lower)
ballarin@14215
   159
  end;
ballarin@14215
   160
ballarin@14215
   161
(** Name suffix of internal delta predicates.
ballarin@14215
   162
    These specify additional assumptions in a locale with import.
ballarin@14215
   163
    Also name of theorem set with destruct rules for locale main
ballarin@14215
   164
    predicates. **)
ballarin@14215
   165
ballarin@14215
   166
val axiomsN = "axioms";
ballarin@14215
   167
ballarin@14215
   168
local
ballarin@14215
   169
ballarin@14215
   170
(* A trie-like structure is used to compute a cover of a normalised
ballarin@14215
   171
   locale specification.  Entries of the trie will be identifiers:
ballarin@14215
   172
   locale names with parameter lists. *)
ballarin@14215
   173
ballarin@14215
   174
datatype 'a trie = Trie of ('a * 'a trie) list;
ballarin@14215
   175
ballarin@14215
   176
(* Subsumption relation on identifiers *)
ballarin@14215
   177
ballarin@14215
   178
fun subsumes thy ((name1, args1), (name2, args2)) =
ballarin@14215
   179
  (name2 = "" andalso null args2) orelse
ballarin@14215
   180
  ((name2 = name1 orelse imports thy (name1, name2)) andalso
ballarin@14215
   181
    (args2 prefix args1));
ballarin@14215
   182
ballarin@14215
   183
(* Insert into trie, wherever possible but avoiding branching *)
ballarin@14215
   184
ballarin@14215
   185
fun insert_ident subs id (Trie trie) =
ballarin@14215
   186
  let
ballarin@14215
   187
    fun insert id [] = [(id, Trie [])]
ballarin@14215
   188
      | insert id ((id', Trie t')::ts) =
ballarin@14215
   189
          if subs (id, id')
ballarin@14215
   190
          then if null ts
ballarin@14215
   191
            then [(id', Trie (insert id t'))] (* avoid new branch *)
ballarin@14215
   192
            else (id', Trie (insert id t'))::insert id ts
ballarin@14215
   193
          else (id', Trie t')::insert id ts
ballarin@14215
   194
  in Trie (insert id trie) end;
ballarin@14215
   195
ballarin@14215
   196
(* List of leaves of a trie, removing duplicates *)
ballarin@14215
   197
ballarin@14215
   198
fun leaves _ (Trie []) = []
ballarin@14215
   199
  | leaves eq (Trie ((id, Trie [])::ts)) =
ballarin@14215
   200
      gen_ins eq (id, leaves eq (Trie ts))
ballarin@14215
   201
  | leaves eq (Trie ((id, ts')::ts)) =
ballarin@14215
   202
      gen_merge_lists eq (leaves eq ts') (leaves eq (Trie ts));
ballarin@14215
   203
ballarin@14215
   204
in 
ballarin@14215
   205
ballarin@14215
   206
(* Prune premises: remove internal delta predicates.
ballarin@14215
   207
ballarin@14215
   208
   Assumes no outer quanfifiers and no flex-flex pairs.
ballarin@14215
   209
   May change names of TVars.
ballarin@14215
   210
   Performs compress and close_derivation on result, if modified. *)
ballarin@14215
   211
ballarin@14215
   212
fun prune_prems thy thm = let
ballarin@14215
   213
  val sign = Theory.sign_of thy;
ballarin@14215
   214
  fun analyse cprem =
ballarin@14215
   215
    (* Returns None if head of premise is not a predicate defined by a locale,
ballarin@14215
   216
       returns also None if locale has import but predicate is not *_axioms
ballarin@14215
   217
       since this is a premise that wasn't generated by includes.  *)
ballarin@14215
   218
    case Term.strip_comb (ObjectLogic.drop_judgment sign (term_of cprem)) of
ballarin@14215
   219
	(Const (raw_name, T), args) => let
ballarin@14215
   220
            val name = unsuffix ("_" ^ axiomsN) raw_name
ballarin@14215
   221
              handle LIST _ => raw_name
ballarin@14215
   222
          in case get_locale thy name of
ballarin@14215
   223
		None => None
ballarin@14215
   224
	      | Some {import, ...} =>
ballarin@14215
   225
                  if name = raw_name andalso import <> empty
ballarin@14215
   226
                  then None
ballarin@14215
   227
                  else Some (((name, args), T), name = raw_name)
ballarin@14215
   228
          end
ballarin@14215
   229
      | _ => None;
ballarin@14215
   230
  val TFrees = add_term_tfree_names (prop_of thm, []);
ballarin@14215
   231
    (* Ignores TFrees in flex-flex pairs ! *)
ballarin@14215
   232
  val (frozen, thaw) = Drule.freeze_thaw thm;
ballarin@14215
   233
  val cprop = cprop_of frozen;
ballarin@14215
   234
  val cprems = Drule.strip_imp_prems cprop;
ballarin@14215
   235
  val analysis = map analyse cprems;
ballarin@14215
   236
in
ballarin@14215
   237
  if foldl (fn (b, None) => b | (b, Some (_, b')) => b andalso b')
ballarin@14215
   238
           (true, analysis)
ballarin@14215
   239
  then thm   (* No premise contains *_axioms predicate
ballarin@14215
   240
                ==> no changes necessary. *)
ballarin@14215
   241
  else let
ballarin@14215
   242
    val ids = map (apsome fst) analysis;
ballarin@14215
   243
    (* Analyse dependencies of locale premises: store in trie. *)
ballarin@14215
   244
    fun subs ((x, _), (y, _)) = subsumes thy (x, y);
ballarin@14215
   245
    val Trie depcs = foldl (fn (trie, None) => trie
ballarin@14215
   246
			     | (trie, Some id) => insert_ident subs id trie)
ballarin@14215
   247
			   (Trie [], ids);
ballarin@14215
   248
    (* Assemble new theorem; new prems will be hyps.
ballarin@14215
   249
       Axioms is an intermeditate list of locale axioms required to
ballarin@14215
   250
       replace old premises by new ones. *)
ballarin@14215
   251
    fun scan ((roots, thm, cprems', axioms), (cprem, id)) =
ballarin@14215
   252
	  case id of
ballarin@14215
   253
	      None => (roots, implies_elim thm (assume cprem),
ballarin@14215
   254
		       cprems' @ [cprem], [])
ballarin@14215
   255
					       (* Normal premise: keep *)
ballarin@14215
   256
	    | Some id =>                       (* Locale premise *)
ballarin@14215
   257
		let
ballarin@14215
   258
		  fun elim_ax [] thm =  (* locale has no axioms *)
ballarin@14215
   259
		      implies_elim thm (assume cprem)
ballarin@14215
   260
		    | elim_ax axs thm = let
ballarin@14215
   261
		    (* Eliminate first premise of thm, which is of the form
ballarin@14215
   262
                       id.  Add hyp of the used axiom to thm. *)
ballarin@14215
   263
		    val ax = the (assoc (axs, fst (fst id)))
ballarin@14215
   264
	              handle _ => error ("Internal error in Locale.prune_\
ballarin@14215
   265
                        \prems: axiom for premise" ^
ballarin@14215
   266
                        fst (fst id) ^ " not found.");
ballarin@14215
   267
		    val [ax_cprem] = Drule.strip_imp_prems (cprop_of ax)
ballarin@14215
   268
		      handle _ => error ("Internal error in Locale.prune_\
ballarin@14215
   269
                        \prems: exactly one premise in axiom expected.");
ballarin@14215
   270
		    val ax_hyp = implies_elim ax (assume (ax_cprem))
ballarin@14215
   271
		  in implies_elim thm ax_hyp
ballarin@14215
   272
		  end
ballarin@14215
   273
		in
ballarin@14215
   274
		  if null roots
ballarin@14215
   275
		  then (roots, elim_ax axioms thm, cprems', axioms)
ballarin@14215
   276
					       (* Remaining premise: drop *)
ballarin@14215
   277
		  else let
ballarin@14215
   278
		      fun mk_cprem ((name, args), T) = cterm_of sign
ballarin@14215
   279
                        (ObjectLogic.assert_propT sign
ballarin@14215
   280
			  (Term.list_comb (Const (name, T), args)));
ballarin@14215
   281
		      fun get_axs ((name, args), _) = let
ballarin@14215
   282
			  val {view = (_, axioms), ...} = the_locale thy name;
ballarin@14215
   283
			  fun inst ax =
ballarin@14215
   284
			    let
ballarin@14215
   285
			      val std = standard ax;
ballarin@14215
   286
                              val (prem, concl) =
ballarin@14215
   287
                                Logic.dest_implies (prop_of std);
ballarin@14215
   288
			      val (Const (name2, _), _) = Term.strip_comb
ballarin@14215
   289
				(ObjectLogic.drop_judgment sign concl);
ballarin@14215
   290
                              val (_, vars) = Term.strip_comb
ballarin@14215
   291
				(ObjectLogic.drop_judgment sign prem);
ballarin@14215
   292
			      val cert = map (cterm_of sign);
ballarin@14215
   293
			    in (unsuffix ("_" ^ axiomsN) name2
ballarin@14215
   294
                                  handle LIST _ => name2,
ballarin@14215
   295
			       cterm_instantiate (cert vars ~~ cert args) std)
ballarin@14215
   296
			    end;
ballarin@14215
   297
			in map inst axioms end;
ballarin@14215
   298
		      val (id', trie) = hd roots;
ballarin@14215
   299
		    in if id = id'
ballarin@14215
   300
		      then                     (* Initial premise *)
ballarin@14215
   301
			let
ballarin@14215
   302
			  val lvs = leaves eq_fst (Trie [(id', trie)]);
ballarin@14215
   303
			  val axioms' = flat (map get_axs lvs)
ballarin@14215
   304
			in (tl roots, elim_ax axioms' thm,
ballarin@14215
   305
                            cprems' @ map (mk_cprem) lvs, axioms')
ballarin@14215
   306
			end
ballarin@14215
   307
		      else (roots, elim_ax axioms thm, cprems', axioms)
ballarin@14215
   308
					       (* Remaining premise: drop *)
ballarin@14215
   309
		    end
ballarin@14215
   310
		end;
ballarin@14215
   311
    val (_, thm', cprems', _) =
ballarin@14215
   312
      (foldl scan ((depcs, frozen, [], []), cprems ~~ ids));
ballarin@14215
   313
    val thm'' = implies_intr_list cprems' thm';
ballarin@14215
   314
  in
ballarin@14215
   315
    fst (varifyT' TFrees (thaw thm''))
ballarin@14215
   316
    |> Thm.compress |> Drule.close_derivation
ballarin@14215
   317
  end
ballarin@14215
   318
end;
ballarin@14215
   319
ballarin@14215
   320
end (* local *)
ballarin@14215
   321
ballarin@14215
   322
wenzelm@12277
   323
(* diagnostics *)
wenzelm@12273
   324
wenzelm@12277
   325
fun err_in_locale ctxt msg ids =
wenzelm@12277
   326
  let
wenzelm@12529
   327
    val sign = ProofContext.sign_of ctxt;
wenzelm@12529
   328
    fun prt_id (name, parms) =
wenzelm@12529
   329
      [Pretty.block (Pretty.breaks (map Pretty.str (cond_extern sign name :: parms)))];
wenzelm@12289
   330
    val prt_ids = flat (separate [Pretty.str " +", Pretty.brk 1] (map prt_id ids));
wenzelm@12502
   331
    val err_msg =
wenzelm@12529
   332
      if forall (equal "" o #1) ids then msg
wenzelm@12502
   333
      else msg ^ "\n" ^ Pretty.string_of (Pretty.block
wenzelm@12502
   334
        (Pretty.str "The error(s) above occurred in locale:" :: Pretty.brk 1 :: prt_ids));
wenzelm@12502
   335
  in raise ProofContext.CONTEXT (err_msg, ctxt) end;
wenzelm@12063
   336
wenzelm@12277
   337
wenzelm@12277
   338
wenzelm@12529
   339
(** primitives **)
wenzelm@12046
   340
wenzelm@12277
   341
(* renaming *)
wenzelm@12263
   342
wenzelm@12263
   343
fun rename ren x = if_none (assoc_string (ren, x)) x;
wenzelm@12263
   344
wenzelm@12263
   345
fun rename_term ren (Free (x, T)) = Free (rename ren x, T)
wenzelm@12263
   346
  | rename_term ren (t $ u) = rename_term ren t $ rename_term ren u
wenzelm@12263
   347
  | rename_term ren (Abs (x, T, t)) = Abs (x, T, rename_term ren t)
wenzelm@12263
   348
  | rename_term _ a = a;
wenzelm@12263
   349
wenzelm@12263
   350
fun rename_thm ren th =
wenzelm@12263
   351
  let
wenzelm@12263
   352
    val {sign, hyps, prop, maxidx, ...} = Thm.rep_thm th;
wenzelm@12263
   353
    val cert = Thm.cterm_of sign;
wenzelm@12502
   354
    val (xs, Ts) = Library.split_list (foldl Term.add_frees ([], prop :: hyps));
wenzelm@12263
   355
    val xs' = map (rename ren) xs;
wenzelm@12263
   356
    fun cert_frees names = map (cert o Free) (names ~~ Ts);
wenzelm@12263
   357
    fun cert_vars names = map (cert o Var o apfst (rpair (maxidx + 1))) (names ~~ Ts);
wenzelm@12263
   358
  in
wenzelm@12263
   359
    if xs = xs' then th
wenzelm@12263
   360
    else
wenzelm@12263
   361
      th
wenzelm@12263
   362
      |> Drule.implies_intr_list (map cert hyps)
wenzelm@12263
   363
      |> Drule.forall_intr_list (cert_frees xs)
wenzelm@12263
   364
      |> Drule.forall_elim_list (cert_vars xs)
wenzelm@12263
   365
      |> Thm.instantiate ([], cert_vars xs ~~ cert_frees xs')
wenzelm@12263
   366
      |> (fn th' => Drule.implies_elim_list th' (map (Thm.assume o cert o rename_term ren) hyps))
wenzelm@12263
   367
  end;
wenzelm@12263
   368
wenzelm@12529
   369
fun rename_elem ren (Fixes fixes) = Fixes (fixes |> map (fn (x, T, mx) =>
wenzelm@12529
   370
      let val x' = rename ren x in
wenzelm@12529
   371
        if x = x' then (x, T, mx)
wenzelm@12529
   372
        else (x', T, if mx = None then mx else Some Syntax.NoSyn)    (*drop syntax*)
wenzelm@12529
   373
      end))
wenzelm@12263
   374
  | rename_elem ren (Assumes asms) = Assumes (map (apsnd (map (fn (t, (ps, qs)) =>
wenzelm@12263
   375
      (rename_term ren t, (map (rename_term ren) ps, map (rename_term ren) qs))))) asms)
wenzelm@12263
   376
  | rename_elem ren (Defines defs) = Defines (map (apsnd (fn (t, ps) =>
wenzelm@12263
   377
      (rename_term ren t, map (rename_term ren) ps))) defs)
wenzelm@12273
   378
  | rename_elem ren (Notes facts) = Notes (map (apsnd (map (apfst (map (rename_thm ren))))) facts);
wenzelm@12263
   379
wenzelm@12529
   380
fun rename_facts prfx elem =
wenzelm@12307
   381
  let
wenzelm@12323
   382
    fun qualify (arg as ((name, atts), x)) =
wenzelm@13394
   383
      if prfx = "" orelse name = "" then arg
wenzelm@13375
   384
      else ((NameSpace.pack [prfx, name], atts), x);
wenzelm@12307
   385
  in
wenzelm@12307
   386
    (case elem of
wenzelm@12307
   387
      Fixes fixes => Fixes fixes
wenzelm@12307
   388
    | Assumes asms => Assumes (map qualify asms)
wenzelm@12307
   389
    | Defines defs => Defines (map qualify defs)
wenzelm@12307
   390
    | Notes facts => Notes (map qualify facts))
wenzelm@12307
   391
  end;
wenzelm@12307
   392
wenzelm@12263
   393
wenzelm@12502
   394
(* type instantiation *)
wenzelm@12502
   395
wenzelm@12502
   396
fun inst_type [] T = T
wenzelm@12502
   397
  | inst_type env T = Term.map_type_tfree (fn v => if_none (assoc (env, v)) (TFree v)) T;
wenzelm@12502
   398
wenzelm@12502
   399
fun inst_term [] t = t
wenzelm@12502
   400
  | inst_term env t = Term.map_term_types (inst_type env) t;
wenzelm@12502
   401
wenzelm@13211
   402
fun inst_thm _ [] th = th
wenzelm@13211
   403
  | inst_thm ctxt env th =
wenzelm@12502
   404
      let
wenzelm@13211
   405
        val sign = ProofContext.sign_of ctxt;
wenzelm@12575
   406
        val cert = Thm.cterm_of sign;
wenzelm@12575
   407
        val certT = Thm.ctyp_of sign;
wenzelm@13211
   408
        val {hyps, prop, maxidx, ...} = Thm.rep_thm th;
wenzelm@12579
   409
        val tfrees = foldr Term.add_term_tfree_names (prop :: hyps, []);
wenzelm@12579
   410
        val env' = filter (fn ((a, _), _) => a mem_string tfrees) env;
wenzelm@12502
   411
      in
wenzelm@12502
   412
        if null env' then th
wenzelm@12502
   413
        else
wenzelm@12502
   414
          th
wenzelm@12502
   415
          |> Drule.implies_intr_list (map cert hyps)
wenzelm@12575
   416
          |> Drule.tvars_intr_list (map (#1 o #1) env')
wenzelm@12502
   417
          |> (fn (th', al) => th' |>
wenzelm@12502
   418
            Thm.instantiate ((map (fn ((a, _), T) => (the (assoc (al, a)), certT T)) env'), []))
wenzelm@12502
   419
          |> (fn th'' => Drule.implies_elim_list th''
wenzelm@12502
   420
              (map (Thm.assume o cert o inst_term env') hyps))
wenzelm@12502
   421
      end;
wenzelm@12502
   422
wenzelm@13211
   423
fun inst_elem _ env (Fixes fixes) =
wenzelm@12502
   424
      Fixes (map (fn (x, T, mx) => (x, apsome (inst_type env) T, mx)) fixes)
wenzelm@13211
   425
  | inst_elem _ env (Assumes asms) = Assumes (map (apsnd (map (fn (t, (ps, qs)) =>
wenzelm@12502
   426
      (inst_term env t, (map (inst_term env) ps, map (inst_term env) qs))))) asms)
wenzelm@13211
   427
  | inst_elem _ env (Defines defs) = Defines (map (apsnd (fn (t, ps) =>
wenzelm@12502
   428
      (inst_term env t, map (inst_term env) ps))) defs)
wenzelm@13211
   429
  | inst_elem ctxt env (Notes facts) =
wenzelm@13211
   430
      Notes (map (apsnd (map (apfst (map (inst_thm ctxt env))))) facts);
wenzelm@12502
   431
wenzelm@12502
   432
wenzelm@12529
   433
wenzelm@12529
   434
(** structured contexts: rename + merge + implicit type instantiation **)
wenzelm@12529
   435
wenzelm@12529
   436
(* parameter types *)
wenzelm@12529
   437
wenzelm@12529
   438
fun frozen_tvars ctxt Ts =
wenzelm@12529
   439
  let
wenzelm@12529
   440
    val tvars = rev (foldl Term.add_tvarsT ([], Ts));
wenzelm@12529
   441
    val tfrees = map TFree
wenzelm@12529
   442
      (Term.invent_type_names (ProofContext.used_types ctxt) (length tvars) ~~ map #2 tvars);
wenzelm@12529
   443
  in map #1 tvars ~~ tfrees end;
wenzelm@12529
   444
wenzelm@12529
   445
fun unify_frozen ctxt maxidx Ts Us =
wenzelm@12529
   446
  let
wenzelm@12529
   447
    fun paramify (i, None) = (i, None)
wenzelm@12529
   448
      | paramify (i, Some T) = apsnd Some (Type.paramify_dummies (i, T));
wenzelm@12529
   449
wenzelm@12529
   450
    val (maxidx', Ts') = foldl_map paramify (maxidx, Ts);
wenzelm@12727
   451
    val (maxidx'', Us') = foldl_map paramify (maxidx', Us);
ballarin@14215
   452
    val tsig = Sign.tsig_of (ProofContext.sign_of ctxt);
ballarin@14215
   453
ballarin@14215
   454
    fun unify (env, (Some T, Some U)) = (Type.unify tsig env (U, T)
ballarin@14215
   455
          handle Type.TUNIFY =>
ballarin@14215
   456
            raise TYPE ("unify_frozen: failed to unify types", [U, T], []))
ballarin@14215
   457
      | unify (env, _) = env;
wenzelm@12529
   458
    val (unifier, _) = foldl unify ((Vartab.empty, maxidx''), Ts' ~~ Us');
wenzelm@12529
   459
    val Vs = map (apsome (Envir.norm_type unifier)) Us';
wenzelm@12529
   460
    val unifier' = Vartab.extend (unifier, frozen_tvars ctxt (mapfilter I Vs));
wenzelm@12532
   461
  in map (apsome (Envir.norm_type unifier')) Vs end;
wenzelm@12529
   462
wenzelm@12730
   463
fun params_of elemss = gen_distinct eq_fst (flat (map (snd o fst) elemss));
wenzelm@12529
   464
fun param_types ps = mapfilter (fn (_, None) => None | (x, Some T) => Some (x, T)) ps;
wenzelm@12529
   465
wenzelm@12529
   466
wenzelm@12529
   467
(* flatten expressions *)
wenzelm@11896
   468
wenzelm@12510
   469
local
wenzelm@12502
   470
wenzelm@12529
   471
fun unique_parms ctxt elemss =
wenzelm@12529
   472
  let
wenzelm@12529
   473
    val param_decls =
wenzelm@12529
   474
      flat (map (fn ((name, (ps, qs)), _) => map (rpair (name, ps)) qs) elemss)
wenzelm@12529
   475
      |> Symtab.make_multi |> Symtab.dest;
wenzelm@12529
   476
  in
wenzelm@12529
   477
    (case find_first (fn (_, ids) => length ids > 1) param_decls of
wenzelm@12529
   478
      Some (q, ids) => err_in_locale ctxt ("Multiple declaration of parameter " ^ quote q)
wenzelm@12529
   479
          (map (apsnd (map fst)) ids)
wenzelm@12529
   480
    | None => map (apfst (apsnd #1)) elemss)
wenzelm@12529
   481
  end;
wenzelm@12529
   482
wenzelm@12529
   483
fun unify_parms ctxt fixed_parms raw_parmss =
wenzelm@12502
   484
  let
wenzelm@12502
   485
    val tsig = Sign.tsig_of (ProofContext.sign_of ctxt);
wenzelm@12502
   486
    val maxidx = length raw_parmss;
wenzelm@12502
   487
    val idx_parmss = (0 upto maxidx - 1) ~~ raw_parmss;
wenzelm@12502
   488
wenzelm@12502
   489
    fun varify i = Term.map_type_tfree (fn (a, S) => TVar ((a, i), S));
wenzelm@12529
   490
    fun varify_parms (i, ps) = map (apsnd (varify i)) (param_types ps);
wenzelm@12529
   491
    val parms = fixed_parms @ flat (map varify_parms idx_parmss);
wenzelm@12502
   492
wenzelm@12529
   493
    fun unify T ((env, maxidx), U) = Type.unify tsig (env, maxidx) (U, T)
wenzelm@12529
   494
      handle Type.TUNIFY => raise TYPE ("unify_parms: failed to unify types", [U, T], []);
wenzelm@12502
   495
    fun unify_list (envir, T :: Us) = foldl (unify T) (envir, Us)
wenzelm@12502
   496
      | unify_list (envir, []) = envir;
wenzelm@12502
   497
    val (unifier, _) = foldl unify_list
wenzelm@12502
   498
      ((Vartab.empty, maxidx), map #2 (Symtab.dest (Symtab.make_multi parms)));
wenzelm@12502
   499
wenzelm@12502
   500
    val parms' = map (apsnd (Envir.norm_type unifier)) (gen_distinct eq_fst parms);
wenzelm@12502
   501
    val unifier' = Vartab.extend (unifier, frozen_tvars ctxt (map #2 parms'));
wenzelm@12502
   502
wenzelm@12502
   503
    fun inst_parms (i, ps) =
wenzelm@12502
   504
      foldr Term.add_typ_tfrees (mapfilter snd ps, [])
wenzelm@12502
   505
      |> mapfilter (fn (a, S) =>
wenzelm@12502
   506
          let val T = Envir.norm_type unifier' (TVar ((a, i), S))
ballarin@14215
   507
          in if T = TFree (a, S) then None else Some ((a, S), T) end)
wenzelm@12502
   508
  in map inst_parms idx_parmss end;
wenzelm@12502
   509
wenzelm@12529
   510
in
wenzelm@12502
   511
wenzelm@12529
   512
fun unify_elemss _ _ [] = []
wenzelm@12529
   513
  | unify_elemss _ [] [elems] = [elems]
wenzelm@12529
   514
  | unify_elemss ctxt fixed_parms elemss =
wenzelm@12502
   515
      let
wenzelm@12529
   516
        val envs = unify_parms ctxt fixed_parms (map (#2 o #1) elemss);
wenzelm@13308
   517
        fun inst (((name, ps), elems), env) =
wenzelm@13308
   518
          ((name, map (apsnd (apsome (inst_type env))) ps), (map (inst_elem ctxt env) elems));
wenzelm@12839
   519
      in map inst (elemss ~~ envs) end;
wenzelm@12502
   520
wenzelm@12575
   521
fun flatten_expr ctxt (prev_idents, expr) =
wenzelm@12014
   522
  let
wenzelm@12014
   523
    val thy = ProofContext.theory_of ctxt;
wenzelm@12263
   524
wenzelm@12289
   525
    fun renaming (Some x :: xs) (y :: ys) = (y, x) :: renaming xs ys
wenzelm@12289
   526
      | renaming (None :: xs) (y :: ys) = renaming xs ys
wenzelm@12273
   527
      | renaming [] _ = []
wenzelm@12289
   528
      | renaming xs [] = raise ERROR_MESSAGE ("Too many arguments in renaming: " ^
wenzelm@12289
   529
          commas (map (fn None => "_" | Some x => quote x) xs));
wenzelm@12289
   530
wenzelm@12289
   531
    fun rename_parms ren (name, ps) =
wenzelm@12289
   532
      let val ps' = map (rename ren) ps in
wenzelm@12289
   533
        (case duplicates ps' of [] => (name, ps')
wenzelm@12289
   534
        | dups => err_in_locale ctxt ("Duplicate parameters: " ^ commas_quote dups) [(name, ps')])
wenzelm@12289
   535
      end;
wenzelm@12263
   536
wenzelm@12273
   537
    fun identify ((ids, parms), Locale name) =
ballarin@14215
   538
    (* CB: ids is list of pairs: locale name and list of parameter renamings,
ballarin@14215
   539
       parms is accumulated list of parameters *)
wenzelm@12289
   540
          let
wenzelm@12289
   541
            val {import, params, ...} = the_locale thy name;
wenzelm@12289
   542
            val ps = map #1 (#1 params);
wenzelm@12289
   543
          in
wenzelm@12273
   544
            if (name, ps) mem ids then (ids, parms)
wenzelm@12277
   545
            else
wenzelm@12289
   546
              let val (ids', parms') = identify ((ids, parms), import);  (*acyclic dependencies!*)
wenzelm@12289
   547
              in (ids' @ [(name, ps)], merge_lists parms' ps) end
wenzelm@12273
   548
          end
wenzelm@12273
   549
      | identify ((ids, parms), Rename (e, xs)) =
wenzelm@12273
   550
          let
wenzelm@12273
   551
            val (ids', parms') = identify (([], []), e);
wenzelm@12839
   552
            val ren = renaming xs parms'
wenzelm@12839
   553
              handle ERROR_MESSAGE msg => err_in_locale ctxt msg ids';
wenzelm@12289
   554
            val ids'' = distinct (map (rename_parms ren) ids');
wenzelm@12289
   555
            val parms'' = distinct (flat (map #2 ids''));
wenzelm@12289
   556
          in (merge_lists ids ids'', merge_lists parms parms'') end
wenzelm@12273
   557
      | identify (arg, Merge es) = foldl identify (arg, es);
wenzelm@12014
   558
wenzelm@12307
   559
    fun eval (name, xs) =
wenzelm@12273
   560
      let
wenzelm@13308
   561
        val {params = (ps, qs), elems, ...} = the_locale thy name;
wenzelm@12307
   562
        val ren = filter_out (op =) (map #1 ps ~~ xs);
wenzelm@13308
   563
        val (params', elems') =
wenzelm@13308
   564
          if null ren then ((ps, qs), map #1 elems)
wenzelm@12502
   565
          else ((map (apfst (rename ren)) ps, map (rename ren) qs),
wenzelm@13308
   566
            map (rename_elem ren o #1) elems);
wenzelm@13375
   567
        val elems'' = map (rename_facts (space_implode "_" xs)) elems';
wenzelm@13308
   568
      in ((name, params'), elems'') end;
wenzelm@12307
   569
wenzelm@12575
   570
    val idents = gen_rems (op =) (#1 (identify (([], []), expr)), prev_idents);
wenzelm@12575
   571
    val raw_elemss = unique_parms ctxt (map eval idents);
wenzelm@12529
   572
    val elemss = unify_elemss ctxt [] raw_elemss;
wenzelm@12575
   573
  in (prev_idents @ idents, elemss) end;
wenzelm@12046
   574
wenzelm@12510
   575
end;
wenzelm@12510
   576
wenzelm@12070
   577
wenzelm@12529
   578
(* activate elements *)
wenzelm@12273
   579
wenzelm@12510
   580
local
wenzelm@12510
   581
wenzelm@13399
   582
fun export_axioms axs _ hyps th =
wenzelm@13399
   583
  th |> Drule.satisfy_hyps axs
wenzelm@13399
   584
  |> Drule.implies_intr_list (Library.drop (length axs, hyps))
wenzelm@13399
   585
  |> Seq.single;
wenzelm@12263
   586
wenzelm@13399
   587
fun activate_elem _ ((ctxt, axs), Fixes fixes) = ((ctxt |> ProofContext.add_fixes fixes, axs), [])
wenzelm@13399
   588
  | activate_elem _ ((ctxt, axs), Assumes asms) =
wenzelm@13399
   589
      let
wenzelm@13399
   590
        val ts = flat (map (map #1 o #2) asms);
nipkow@13629
   591
        val (ps,qs) = splitAt (length ts, axs)
wenzelm@13420
   592
        val (ctxt', _) =
wenzelm@13399
   593
          ctxt |> ProofContext.fix_frees ts
nipkow@13629
   594
          |> ProofContext.assume_i (export_axioms ps) asms;
nipkow@13629
   595
      in ((ctxt', qs), []) end
wenzelm@13399
   596
  | activate_elem _ ((ctxt, axs), Defines defs) =
wenzelm@13420
   597
      let val (ctxt', _) =
wenzelm@13399
   598
        ctxt |> ProofContext.assume_i ProofContext.export_def
wenzelm@13399
   599
          (defs |> map (fn ((name, atts), (t, ps)) =>
wenzelm@13399
   600
            let val (c, t') = ProofContext.cert_def ctxt t
wenzelm@13399
   601
            in ((if name = "" then Thm.def_name c else name, atts), [(t', (ps, []))]) end))
wenzelm@13420
   602
      in ((ctxt', axs), []) end
wenzelm@13399
   603
  | activate_elem is_ext ((ctxt, axs), Notes facts) =
wenzelm@13399
   604
      let val (ctxt', res) = ctxt |> ProofContext.have_thmss_i facts
wenzelm@13420
   605
      in ((ctxt', axs), if is_ext then res else []) end;
wenzelm@12502
   606
wenzelm@13399
   607
fun activate_elems ((name, ps), elems) (ctxt, axs) =
wenzelm@13399
   608
  let val ((ctxt', axs'), res) =
wenzelm@13399
   609
    foldl_map (activate_elem (name = "")) ((ProofContext.qualified true ctxt, axs), elems)
wenzelm@13399
   610
      handle ProofContext.CONTEXT (msg, ctxt) => err_in_locale ctxt msg [(name, map fst ps)]
wenzelm@13399
   611
  in ((ProofContext.restore_qualified ctxt ctxt', axs'), res) end;
wenzelm@13399
   612
wenzelm@13399
   613
fun activate_elemss prep_facts = foldl_map (fn ((ctxt, axs), ((name, ps), raw_elems)) =>
wenzelm@12834
   614
  let
wenzelm@12834
   615
    val elems = map (prep_facts ctxt) raw_elems;
wenzelm@13399
   616
    val ((ctxt', axs'), res) = apsnd flat (activate_elems ((name, ps), elems) (ctxt, axs));
wenzelm@13399
   617
  in ((ctxt', axs'), (((name, ps), elems), res)) end);
wenzelm@12834
   618
wenzelm@12546
   619
in
wenzelm@12546
   620
wenzelm@13399
   621
fun activate_facts prep_facts arg =
wenzelm@13399
   622
  apsnd (apsnd flat o Library.split_list) (activate_elemss prep_facts arg);
wenzelm@12546
   623
wenzelm@12510
   624
end;
wenzelm@12510
   625
wenzelm@12307
   626
wenzelm@12529
   627
wenzelm@12529
   628
(** prepare context elements **)
wenzelm@12529
   629
wenzelm@12529
   630
(* expressions *)
wenzelm@12529
   631
wenzelm@12529
   632
fun intern_expr sg (Locale xname) = Locale (intern sg xname)
wenzelm@12529
   633
  | intern_expr sg (Merge exprs) = Merge (map (intern_expr sg) exprs)
wenzelm@12529
   634
  | intern_expr sg (Rename (expr, xs)) = Rename (intern_expr sg expr, xs);
wenzelm@12529
   635
wenzelm@12529
   636
wenzelm@12546
   637
(* attributes *)
wenzelm@12546
   638
wenzelm@12546
   639
local fun read_att attrib (x, srcs) = (x, map attrib srcs) in
wenzelm@12546
   640
wenzelm@12546
   641
fun attribute _ (Elem (Fixes fixes)) = Elem (Fixes fixes)
wenzelm@12546
   642
  | attribute attrib (Elem (Assumes asms)) = Elem (Assumes (map (apfst (read_att attrib)) asms))
wenzelm@12546
   643
  | attribute attrib (Elem (Defines defs)) = Elem (Defines (map (apfst (read_att attrib)) defs))
wenzelm@12546
   644
  | attribute attrib (Elem (Notes facts)) =
wenzelm@12546
   645
      Elem (Notes (map (apfst (read_att attrib) o apsnd (map (read_att attrib))) facts))
wenzelm@12546
   646
  | attribute _ (Expr expr) = Expr expr;
wenzelm@12546
   647
wenzelm@12546
   648
end;
wenzelm@12546
   649
wenzelm@12546
   650
wenzelm@12529
   651
(* parameters *)
wenzelm@12502
   652
wenzelm@12502
   653
local
wenzelm@12502
   654
wenzelm@12529
   655
fun prep_fixes prep_vars ctxt fixes =
wenzelm@12529
   656
  let val vars = snd (foldl_map prep_vars (ctxt, map (fn (x, T, _) => ([x], T)) fixes))
wenzelm@12529
   657
  in map (fn (([x'], T'), (_, _, mx)) => (x', T', mx)) (vars ~~ fixes) end;
wenzelm@12529
   658
wenzelm@12529
   659
in
wenzelm@12529
   660
wenzelm@12529
   661
fun read_fixes x = prep_fixes ProofContext.read_vars x;
wenzelm@12529
   662
fun cert_fixes x = prep_fixes ProofContext.cert_vars x;
wenzelm@12529
   663
wenzelm@12529
   664
end;
wenzelm@12529
   665
wenzelm@12529
   666
wenzelm@12529
   667
(* propositions and bindings *)
wenzelm@12529
   668
wenzelm@12529
   669
datatype ('a, 'b) int_ext = Int of 'a | Ext of 'b;
wenzelm@12529
   670
wenzelm@12529
   671
local
wenzelm@12529
   672
wenzelm@12839
   673
local
wenzelm@12839
   674
wenzelm@12727
   675
fun declare_int_elem (ctxt, Fixes fixes) =
wenzelm@12575
   676
      (ctxt |> ProofContext.add_fixes (map (fn (x, T, mx) =>
wenzelm@12727
   677
        (x, apsome (Term.map_type_tfree (Type.param 0)) T, mx)) fixes), [])
wenzelm@12727
   678
  | declare_int_elem (ctxt, _) = (ctxt, []);
wenzelm@12529
   679
wenzelm@12529
   680
fun declare_ext_elem prep_fixes (ctxt, Fixes fixes) =
wenzelm@12575
   681
      (ctxt |> ProofContext.add_fixes (prep_fixes ctxt fixes), [])
wenzelm@12529
   682
  | declare_ext_elem _ (ctxt, Assumes asms) = (ctxt, map #2 asms)
wenzelm@12529
   683
  | declare_ext_elem _ (ctxt, Defines defs) = (ctxt, map (fn (_, (t, ps)) => [(t, (ps, []))]) defs)
wenzelm@12529
   684
  | declare_ext_elem _ (ctxt, Notes facts) = (ctxt, []);
wenzelm@12529
   685
wenzelm@12727
   686
fun declare_elems prep_fixes (ctxt, ((name, ps), elems)) =
wenzelm@12529
   687
  let val (ctxt', propps) =
wenzelm@12529
   688
    (case elems of
wenzelm@13308
   689
      Int es => foldl_map declare_int_elem (ctxt, es)
wenzelm@12546
   690
    | Ext e => foldl_map (declare_ext_elem prep_fixes) (ctxt, [e]))
wenzelm@12529
   691
    handle ProofContext.CONTEXT (msg, ctxt) => err_in_locale ctxt msg [(name, map fst ps)]
wenzelm@12727
   692
  in (ctxt', propps) end;
wenzelm@12727
   693
wenzelm@12839
   694
in
wenzelm@12839
   695
ballarin@14215
   696
(* CB: only called by prep_elemss. *)
ballarin@14215
   697
wenzelm@12727
   698
fun declare_elemss prep_fixes fixed_params raw_elemss ctxt =
wenzelm@12727
   699
  let
ballarin@14215
   700
    (* CB: fix of type bug of goal in target with context elements.
ballarin@14215
   701
       Parameters new in context elements must receive types that are
ballarin@14215
   702
       distinct from types of parameters in target (fixed_params).  *)
ballarin@14215
   703
    val ctxt_with_fixed =
ballarin@14215
   704
      ProofContext.declare_terms (map Free fixed_params) ctxt;
wenzelm@12727
   705
    val int_elemss =
wenzelm@12727
   706
      raw_elemss
wenzelm@12727
   707
      |> mapfilter (fn (id, Int es) => Some (id, es) | _ => None)
ballarin@14215
   708
      |> unify_elemss ctxt_with_fixed fixed_params;
wenzelm@12727
   709
    val (_, raw_elemss') =
wenzelm@12727
   710
      foldl_map (fn ((_, es) :: elemss, (id, Int _)) => (elemss, (id, Int es)) | x => x)
wenzelm@12727
   711
        (int_elemss, raw_elemss);
wenzelm@12727
   712
  in foldl_map (declare_elems prep_fixes) (ctxt, raw_elemss') end;
wenzelm@12529
   713
wenzelm@12839
   714
end;
wenzelm@12529
   715
wenzelm@12839
   716
local
wenzelm@12839
   717
wenzelm@12839
   718
val norm_term = Envir.beta_norm oo Term.subst_atomic;
wenzelm@12839
   719
wenzelm@13336
   720
fun abstract_term eq =    (*assumes well-formedness according to ProofContext.cert_def*)
wenzelm@12839
   721
  let
wenzelm@12839
   722
    val body = Term.strip_all_body eq;
wenzelm@12839
   723
    val vars = map Free (Term.rename_wrt_term body (Term.strip_all_vars eq));
wenzelm@12839
   724
    val (lhs, rhs) = Logic.dest_equals (Term.subst_bounds (vars, body));
wenzelm@12839
   725
    val (f, xs) = Term.strip_comb lhs;
wenzelm@13336
   726
    val eq' = Term.list_abs_free (map Term.dest_Free xs, rhs);
wenzelm@13336
   727
  in (Term.dest_Free f, eq') end;
wenzelm@13336
   728
wenzelm@13336
   729
fun abstract_thm sign eq =
wenzelm@13336
   730
  Thm.assume (Thm.cterm_of sign eq) |> Drule.gen_all |> Drule.abs_def;
wenzelm@12502
   731
wenzelm@13336
   732
fun bind_def ctxt (name, ps) ((xs, env, ths), eq) =
wenzelm@12839
   733
  let
wenzelm@13336
   734
    val ((y, T), b) = abstract_term eq;
wenzelm@13308
   735
    val b' = norm_term env b;
wenzelm@13336
   736
    val th = abstract_thm (ProofContext.sign_of ctxt) eq;
wenzelm@13308
   737
    fun err msg = err_in_locale ctxt (msg ^ ": " ^ quote y) [(name, map fst ps)];
wenzelm@12839
   738
  in
wenzelm@13308
   739
    conditional (exists (equal y o #1) xs) (fn () =>
wenzelm@13308
   740
      err "Attempt to define previously specified variable");
wenzelm@13308
   741
    conditional (exists (fn (Free (y', _), _) => y = y' | _ => false) env) (fn () =>
wenzelm@13308
   742
      err "Attempt to redefine variable");
wenzelm@13336
   743
    (Term.add_frees (xs, b'), (Free (y, T), b') :: env, th :: ths)
wenzelm@12839
   744
  end;
wenzelm@12575
   745
wenzelm@13308
   746
fun eval_text _ _ _ (text, Fixes _) = text
wenzelm@13394
   747
  | eval_text _ _ is_ext ((((exts, exts'), (ints, ints')), (xs, env, defs)), Assumes asms) =
wenzelm@13394
   748
      let
wenzelm@13394
   749
        val ts = flat (map (map #1 o #2) asms);
wenzelm@13394
   750
        val ts' = map (norm_term env) ts;
wenzelm@13394
   751
        val spec' =
wenzelm@13394
   752
          if is_ext then ((exts @ ts, exts' @ ts'), (ints, ints'))
wenzelm@13394
   753
          else ((exts, exts'), (ints @ ts, ints' @ ts'));
wenzelm@13394
   754
      in (spec', (foldl Term.add_frees (xs, ts'), env, defs)) end
wenzelm@13308
   755
  | eval_text ctxt id _ ((spec, binds), Defines defs) =
wenzelm@13308
   756
      (spec, foldl (bind_def ctxt id) (binds, map (#1 o #2) defs))
wenzelm@13308
   757
  | eval_text _ _ _ (text, Notes _) = text;
wenzelm@13308
   758
wenzelm@13308
   759
fun closeup _ false elem = elem
wenzelm@13308
   760
  | closeup ctxt true elem =
wenzelm@12839
   761
      let
wenzelm@13308
   762
        fun close_frees t =
wenzelm@13308
   763
          let val frees = rev (filter_out (ProofContext.is_fixed ctxt o #1)
wenzelm@13308
   764
            (Term.add_frees ([], t)))
wenzelm@13308
   765
          in Term.list_all_free (frees, t) end;
wenzelm@13308
   766
wenzelm@13308
   767
        fun no_binds [] = []
wenzelm@13308
   768
          | no_binds _ =
wenzelm@13308
   769
              raise ProofContext.CONTEXT ("Illegal term bindings in locale element", ctxt);
wenzelm@13308
   770
      in
wenzelm@13308
   771
        (case elem of
wenzelm@13308
   772
          Assumes asms => Assumes (asms |> map (fn (a, propps) =>
wenzelm@13308
   773
            (a, map (fn (t, (ps, qs)) => (close_frees t, (no_binds ps, no_binds qs))) propps)))
wenzelm@13308
   774
        | Defines defs => Defines (defs |> map (fn (a, (t, ps)) =>
wenzelm@13308
   775
            (a, (close_frees (#2 (ProofContext.cert_def ctxt t)), no_binds ps))))
wenzelm@13308
   776
        | e => e)
wenzelm@13308
   777
      end;
wenzelm@12839
   778
wenzelm@12502
   779
wenzelm@12839
   780
fun finish_ext_elem parms _ (Fixes fixes, _) = Fixes (map (fn (x, _, mx) =>
wenzelm@12727
   781
      (x, assoc_string (parms, x), mx)) fixes)
wenzelm@12839
   782
  | finish_ext_elem _ close (Assumes asms, propp) =
wenzelm@12839
   783
      close (Assumes (map #1 asms ~~ propp))
wenzelm@12839
   784
  | finish_ext_elem _ close (Defines defs, propp) =
wenzelm@12727
   785
      close (Defines (map #1 defs ~~ map (fn [(t, (ps, []))] => (t, ps)) propp))
wenzelm@12839
   786
  | finish_ext_elem _ _ (Notes facts, _) = Notes facts;
wenzelm@12839
   787
wenzelm@12839
   788
fun finish_parms parms ((name, ps), elems) =
wenzelm@12839
   789
  ((name, map (fn (x, _) => (x, assoc (parms, x))) ps), elems);
wenzelm@12839
   790
wenzelm@13375
   791
fun finish_elems ctxt parms _ (text, ((id, Int e), _)) =
wenzelm@12839
   792
      let
wenzelm@13308
   793
        val [(_, es)] = unify_elemss ctxt parms [(id, e)];
wenzelm@13308
   794
        val text' = foldl (eval_text ctxt id false) (text, es);
wenzelm@13308
   795
      in (text', (id, map Int es)) end
wenzelm@13375
   796
  | finish_elems ctxt parms do_close (text, ((id, Ext e), [propp])) =
wenzelm@13308
   797
      let
wenzelm@13308
   798
        val e' = finish_ext_elem parms (closeup ctxt do_close) (e, propp);
wenzelm@13375
   799
        val text' = eval_text ctxt id true (text, e');
wenzelm@13308
   800
      in (text', (id, [Ext e'])) end;
wenzelm@12839
   801
wenzelm@12839
   802
in
wenzelm@12510
   803
wenzelm@13375
   804
fun finish_elemss ctxt parms do_close =
wenzelm@13375
   805
  foldl_map (apsnd (finish_parms parms) o finish_elems ctxt parms do_close);
wenzelm@12839
   806
wenzelm@12839
   807
end;
wenzelm@12839
   808
wenzelm@13375
   809
fun prep_elemss prep_fixes prepp do_close context fixed_params raw_elemss raw_concl =
wenzelm@12529
   810
  let
wenzelm@12727
   811
    val (raw_ctxt, raw_proppss) = declare_elemss prep_fixes fixed_params raw_elemss context;
wenzelm@12529
   812
    val raw_propps = map flat raw_proppss;
wenzelm@12529
   813
    val raw_propp = flat raw_propps;
wenzelm@12529
   814
    val (ctxt, all_propp) =
wenzelm@12529
   815
      prepp (ProofContext.declare_terms (map Free fixed_params) raw_ctxt, raw_concl @ raw_propp);
wenzelm@12529
   816
    val ctxt = ProofContext.declare_terms (flat (map (map fst) all_propp)) ctxt;
wenzelm@12502
   817
wenzelm@12529
   818
    val all_propp' = map2 (op ~~)
wenzelm@12529
   819
      (#1 (#2 (ProofContext.bind_propp_schematic_i (ctxt, all_propp))), map (map snd) all_propp);
nipkow@13629
   820
    val (concl, propp) = splitAt(length raw_concl, all_propp');
wenzelm@12529
   821
    val propps = unflat raw_propps propp;
wenzelm@12839
   822
    val proppss = map (uncurry unflat) (raw_proppss ~~ propps);
wenzelm@12502
   823
wenzelm@12529
   824
    val xs = map #1 (params_of raw_elemss);
wenzelm@12727
   825
    val typing = unify_frozen ctxt 0
wenzelm@12529
   826
      (map (ProofContext.default_type raw_ctxt) xs)
wenzelm@12529
   827
      (map (ProofContext.default_type ctxt) xs);
wenzelm@12529
   828
    val parms = param_types (xs ~~ typing);
wenzelm@12273
   829
wenzelm@13394
   830
    val (text, elemss) = finish_elemss ctxt parms do_close
wenzelm@13394
   831
      (((([], []), ([], [])), ([], [], [])), raw_elemss ~~ proppss);
wenzelm@13308
   832
  in ((parms, elemss, concl), text) end;
wenzelm@12502
   833
wenzelm@12502
   834
in
wenzelm@12502
   835
wenzelm@12529
   836
fun read_elemss x = prep_elemss read_fixes ProofContext.read_propp_schematic x;
wenzelm@12529
   837
fun cert_elemss x = prep_elemss cert_fixes ProofContext.cert_propp_schematic x;
wenzelm@12529
   838
wenzelm@12529
   839
end;
wenzelm@12529
   840
wenzelm@12529
   841
wenzelm@12529
   842
(* facts *)
wenzelm@12529
   843
wenzelm@12529
   844
local
wenzelm@12529
   845
wenzelm@12529
   846
fun prep_name ctxt (name, atts) =
wenzelm@12529
   847
  if NameSpace.is_qualified name then
wenzelm@12529
   848
    raise ProofContext.CONTEXT ("Illegal qualified name: " ^ quote name, ctxt)
wenzelm@12529
   849
  else (name, atts);
wenzelm@12529
   850
wenzelm@13375
   851
fun prep_facts _ _ (Int elem) = elem
wenzelm@13375
   852
  | prep_facts _ _ (Ext (Fixes fixes)) = Fixes fixes
wenzelm@13375
   853
  | prep_facts _ ctxt (Ext (Assumes asms)) = Assumes (map (apfst (prep_name ctxt)) asms)
wenzelm@13375
   854
  | prep_facts _ ctxt (Ext (Defines defs)) = Defines (map (apfst (prep_name ctxt)) defs)
wenzelm@13375
   855
  | prep_facts get ctxt (Ext (Notes facts)) = Notes (facts |> map (fn (a, bs) =>
wenzelm@13375
   856
      (prep_name ctxt a, map (apfst (get ctxt)) bs)));
wenzelm@12529
   857
wenzelm@12529
   858
in
wenzelm@12529
   859
wenzelm@12529
   860
fun get_facts x = prep_facts ProofContext.get_thms x;
wenzelm@12529
   861
fun get_facts_i x = prep_facts (K I) x;
wenzelm@12529
   862
wenzelm@12529
   863
end;
wenzelm@12529
   864
wenzelm@12529
   865
wenzelm@12546
   866
(* full context statements: import + elements + conclusion *)
wenzelm@12529
   867
wenzelm@12529
   868
local
wenzelm@12529
   869
wenzelm@12529
   870
fun prep_context_statement prep_expr prep_elemss prep_facts
wenzelm@13399
   871
    do_close axioms fixed_params import elements raw_concl context =
wenzelm@12529
   872
  let
wenzelm@12529
   873
    val sign = ProofContext.sign_of context;
wenzelm@13375
   874
wenzelm@12575
   875
    fun flatten (ids, Elem (Fixes fixes)) =
wenzelm@12575
   876
          (ids, [(("", map (rpair None o #1) fixes), Ext (Fixes fixes))])
wenzelm@12575
   877
      | flatten (ids, Elem elem) = (ids, [(("", []), Ext elem)])
wenzelm@12575
   878
      | flatten (ids, Expr expr) =
wenzelm@13308
   879
          apsnd (map (apsnd Int)) (flatten_expr context (ids, prep_expr sign expr));
wenzelm@12529
   880
wenzelm@12575
   881
    val (import_ids, raw_import_elemss) = flatten ([], Expr import);
ballarin@14215
   882
    (* CB: normalise "includes" among elements *)
wenzelm@12575
   883
    val raw_elemss = flat (#2 ((foldl_map flatten (import_ids, elements))));
wenzelm@13375
   884
    val ((parms, all_elemss, concl), (spec, (_, _, defs))) = prep_elemss do_close
wenzelm@13336
   885
      context fixed_params (raw_import_elemss @ raw_elemss) raw_concl;
nipkow@13629
   886
    val (ps,qs) = splitAt(length raw_import_elemss, all_elemss)
wenzelm@13420
   887
    val ((import_ctxt, axioms'), (import_elemss, _)) =
nipkow@13629
   888
      activate_facts prep_facts ((context, axioms), ps);
ballarin@14215
   889
ballarin@14215
   890
(* CB: testing *)
ballarin@14215
   891
ballarin@14215
   892
val axioms' = if true (* null axioms *) then axioms' else
ballarin@14215
   893
let val {view = (ax3_view, ax3_axioms), ...} =
ballarin@14215
   894
  the_locale (ProofContext.theory_of context) "Type.ax3";
ballarin@14215
   895
val ax_TrueFalse = Thm.assume (read_cterm (sign_of_thm (hd axioms))
ballarin@14215
   896
  ("True <-> False", propT));
ballarin@14215
   897
val {view = (ax4_view, ax4_axioms), ...} =
ballarin@14215
   898
  the_locale (ProofContext.theory_of context) "Type.ax4";
ballarin@14215
   899
in axioms' @ ax3_axioms @ [ax_TrueFalse] @ (tl ax4_axioms) end;
wenzelm@13420
   900
    val ((ctxt, _), (elemss, _)) =
nipkow@13629
   901
      activate_facts prep_facts ((import_ctxt, axioms'), qs);
wenzelm@12834
   902
  in
wenzelm@13420
   903
    ((((import_ctxt, import_elemss), (ctxt, elemss)), (parms, spec, defs)), concl)
wenzelm@12834
   904
  end;
wenzelm@12529
   905
wenzelm@12529
   906
val gen_context = prep_context_statement intern_expr read_elemss get_facts;
wenzelm@12529
   907
val gen_context_i = prep_context_statement (K I) cert_elemss get_facts_i;
wenzelm@12529
   908
wenzelm@12529
   909
fun gen_statement prep_locale prep_ctxt raw_locale elems concl ctxt =
wenzelm@12529
   910
  let
wenzelm@12529
   911
    val thy = ProofContext.theory_of ctxt;
wenzelm@12529
   912
    val locale = apsome (prep_locale (Theory.sign_of thy)) raw_locale;
wenzelm@13415
   913
    val ((view_statement, view_axioms), fixed_params, import) =
ballarin@14215
   914
(* view_axioms are xxx.axioms of locale xxx *)
wenzelm@13415
   915
      (case locale of None => (([], []), [], empty)
wenzelm@13399
   916
      | Some name =>
wenzelm@13420
   917
          let val {view, params = (ps, _), ...} = the_locale thy name
wenzelm@13420
   918
          in (view, param_types ps, Locale name) end);
wenzelm@12730
   919
    val ((((locale_ctxt, _), (elems_ctxt, _)), _), concl') =
wenzelm@13415
   920
      prep_ctxt false view_axioms fixed_params import elems concl ctxt;
wenzelm@13415
   921
  in (locale, view_statement, locale_ctxt, elems_ctxt, concl') end;
wenzelm@13399
   922
wenzelm@12529
   923
in
wenzelm@12529
   924
ballarin@14215
   925
(* CB
ballarin@14215
   926
arguments are (see below): x->import, y->body (elements?), z->context
wenzelm@13399
   927
fun read_context x y z = #1 (gen_context true [] [] x y [] z);
wenzelm@13399
   928
fun cert_context x y z = #1 (gen_context_i true [] [] x y [] z);
ballarin@14215
   929
*)
ballarin@14215
   930
fun read_context x y z = (warning "read_context\n"; #1 (gen_context true [] [] x y [] z));
ballarin@14215
   931
fun cert_context x y z = (warning "cert_context\n"; #1 (gen_context_i true [] [] x y [] z));
ballarin@14215
   932
ballarin@14215
   933
(* CB
wenzelm@12529
   934
val read_context_statement = gen_statement intern gen_context;
wenzelm@12529
   935
val cert_context_statement = gen_statement (K I) gen_context_i;
ballarin@14215
   936
*)
ballarin@14215
   937
ballarin@14215
   938
fun read_context_statement so cs xss ctxt =
ballarin@14215
   939
let val (locale, view_statement, locale_ctxt, elems_ctxt, concl') =
ballarin@14215
   940
  gen_statement intern gen_context so cs xss ctxt;
ballarin@14215
   941
in (locale, view_statement, locale_ctxt, elems_ctxt, concl')
ballarin@14215
   942
end;
ballarin@14215
   943
fun cert_context_statement so cs xss ctxt =
ballarin@14215
   944
let val (locale, view_statement, locale_ctxt, elems_ctxt, concl') =
ballarin@14215
   945
  gen_statement (K I) gen_context_i so cs xss ctxt;
ballarin@14215
   946
in (locale, view_statement, locale_ctxt, elems_ctxt, concl')  
ballarin@14215
   947
end;
wenzelm@12502
   948
wenzelm@12502
   949
end;
wenzelm@11896
   950
wenzelm@11896
   951
wenzelm@11896
   952
wenzelm@13336
   953
(** define locales **)
wenzelm@13336
   954
wenzelm@13336
   955
(* print locale *)
wenzelm@12070
   956
wenzelm@12758
   957
fun print_locale thy import body =
wenzelm@12070
   958
  let
wenzelm@12289
   959
    val thy_ctxt = ProofContext.init thy;
wenzelm@13420
   960
    val (((_, import_elemss), (ctxt, elemss)), _) = read_context import body thy_ctxt;
wenzelm@13375
   961
    val all_elems = flat (map #2 (import_elemss @ elemss));
wenzelm@12070
   962
wenzelm@12307
   963
    val prt_typ = Pretty.quote o ProofContext.pretty_typ ctxt;
wenzelm@12307
   964
    val prt_term = Pretty.quote o ProofContext.pretty_term ctxt;
wenzelm@12307
   965
    val prt_thm = Pretty.quote o ProofContext.pretty_thm ctxt;
wenzelm@12070
   966
wenzelm@12070
   967
    fun prt_syn syn =
wenzelm@12070
   968
      let val s = (case syn of None => "(structure)" | Some mx => Syntax.string_of_mixfix mx)
wenzelm@12575
   969
      in if s = "" then [] else [Pretty.brk 2, Pretty.str s] end;
wenzelm@12070
   970
    fun prt_fix (x, Some T, syn) = Pretty.block (Pretty.str (x ^ " ::") :: Pretty.brk 1 ::
wenzelm@12070
   971
          prt_typ T :: Pretty.brk 1 :: prt_syn syn)
wenzelm@12070
   972
      | prt_fix (x, None, syn) = Pretty.block (Pretty.str x :: Pretty.brk 1 :: prt_syn syn);
wenzelm@12070
   973
wenzelm@12307
   974
    fun prt_name "" = [Pretty.brk 1]
wenzelm@12307
   975
      | prt_name name = [Pretty.str (ProofContext.cond_extern ctxt name ^ ":"), Pretty.brk 1];
wenzelm@12307
   976
    fun prt_asm ((a, _), ts) = Pretty.block (prt_name a @ Pretty.breaks (map (prt_term o fst) ts));
wenzelm@12307
   977
    fun prt_def ((a, _), (t, _)) = Pretty.block (prt_name a @ [prt_term t]);
wenzelm@12307
   978
    fun prt_fact ((a, _), ths) = Pretty.block
wenzelm@12307
   979
      (prt_name a @ Pretty.breaks (map prt_thm (flat (map fst ths))));
wenzelm@12070
   980
wenzelm@12289
   981
    fun items _ [] = []
wenzelm@12289
   982
      | items prfx (x :: xs) = Pretty.block [Pretty.str prfx, Pretty.brk 1, x] :: items "  and" xs;
wenzelm@12289
   983
    fun prt_elem (Fixes fixes) = items "fixes" (map prt_fix fixes)
wenzelm@12289
   984
      | prt_elem (Assumes asms) = items "assumes" (map prt_asm asms)
wenzelm@12289
   985
      | prt_elem (Defines defs) = items "defines" (map prt_def defs)
wenzelm@12289
   986
      | prt_elem (Notes facts) = items "notes" (map prt_fact facts);
wenzelm@12277
   987
  in
wenzelm@13336
   988
    Pretty.big_list "context elements:" (map (Pretty.chunks o prt_elem) all_elems)
wenzelm@13336
   989
    |> Pretty.writeln
wenzelm@12277
   990
  end;
wenzelm@12070
   991
wenzelm@12070
   992
wenzelm@12730
   993
(* store results *)
wenzelm@11896
   994
wenzelm@12706
   995
local
wenzelm@12706
   996
wenzelm@12702
   997
fun hide_bound_names names thy =
wenzelm@12702
   998
  thy |> PureThy.hide_thms false
wenzelm@12702
   999
    (map (Sign.full_name (Theory.sign_of thy)) (filter_out (equal "") names));
wenzelm@12702
  1000
wenzelm@12958
  1001
in
wenzelm@12958
  1002
wenzelm@13375
  1003
fun have_thmss_qualified kind name args thy =
wenzelm@12706
  1004
  thy
wenzelm@13375
  1005
  |> Theory.add_path (Sign.base_name name)
wenzelm@12711
  1006
  |> PureThy.have_thmss_i (Drule.kind kind) args
wenzelm@12706
  1007
  |>> hide_bound_names (map (#1 o #1) args)
wenzelm@12706
  1008
  |>> Theory.parent_path;
wenzelm@12706
  1009
wenzelm@12958
  1010
fun smart_have_thmss kind None = PureThy.have_thmss_i (Drule.kind kind)
wenzelm@12958
  1011
  | smart_have_thmss kind (Some (loc, _)) = have_thmss_qualified kind loc;
wenzelm@12958
  1012
wenzelm@12958
  1013
end;
wenzelm@12958
  1014
wenzelm@12958
  1015
local
wenzelm@12958
  1016
wenzelm@12958
  1017
fun put_facts loc args thy =
wenzelm@12958
  1018
  let
wenzelm@13399
  1019
    val {view, import, elems, params} = the_locale thy loc;
wenzelm@12958
  1020
    val note = Notes (map (fn ((a, more_atts), th_atts) =>
wenzelm@12958
  1021
      ((a, more_atts), map (apfst (map (curry Thm.name_thm a))) th_atts)) args);
wenzelm@13399
  1022
  in thy |> put_locale loc (make_locale view import (elems @ [(note, stamp ())]) params) end;
wenzelm@12958
  1023
wenzelm@12706
  1024
fun gen_have_thmss prep_locale get_thms kind raw_loc raw_args thy =
wenzelm@12706
  1025
  let
wenzelm@12706
  1026
    val thy_ctxt = ProofContext.init thy;
wenzelm@12706
  1027
    val loc = prep_locale (Theory.sign_of thy) raw_loc;
wenzelm@13399
  1028
    val (_, view, loc_ctxt, _, _) = cert_context_statement (Some loc) [] [] thy_ctxt;
wenzelm@12706
  1029
    val args = map (apsnd (map (apfst (get_thms loc_ctxt)))) raw_args;
wenzelm@13399
  1030
    val export = ProofContext.export_standard view loc_ctxt thy_ctxt;
wenzelm@12711
  1031
    val results = map (map export o #2) (#2 (ProofContext.have_thmss_i args loc_ctxt));
wenzelm@12706
  1032
    val args' = map (rpair [] o #1 o #1) args ~~ map (single o Thm.no_attributes) results;
wenzelm@12706
  1033
  in
wenzelm@12706
  1034
    thy
wenzelm@12706
  1035
    |> put_facts loc args
wenzelm@12706
  1036
    |> have_thmss_qualified kind loc args'
wenzelm@12706
  1037
  end;
wenzelm@12706
  1038
wenzelm@12706
  1039
in
wenzelm@12706
  1040
wenzelm@12711
  1041
val have_thmss = gen_have_thmss intern ProofContext.get_thms;
wenzelm@12711
  1042
val have_thmss_i = gen_have_thmss (K I) (K I);
wenzelm@12711
  1043
wenzelm@13336
  1044
fun add_thmss loc args (thy, ctxt) =
wenzelm@12958
  1045
  let
wenzelm@12958
  1046
    val args' = map (fn ((a, ths), atts) => ((a, atts), [(ths, [])])) args;
wenzelm@13336
  1047
    val thy' = put_facts loc args' thy;
wenzelm@13415
  1048
    val {view = (_, view_axioms), ...} = the_locale thy loc;
wenzelm@13399
  1049
    val ((ctxt', _), (_, facts')) =
wenzelm@13420
  1050
      activate_facts (K I) ((ctxt, view_axioms), [(("", []), [Notes args'])]);
wenzelm@13420
  1051
  in ((thy', ctxt'), facts') end;
wenzelm@12702
  1052
wenzelm@12706
  1053
end;
wenzelm@12063
  1054
wenzelm@11896
  1055
wenzelm@13336
  1056
(* predicate text *)
wenzelm@13336
  1057
wenzelm@13375
  1058
local
wenzelm@13375
  1059
wenzelm@13375
  1060
val introN = "intro";
wenzelm@13375
  1061
wenzelm@13375
  1062
fun atomize_spec sign ts =
wenzelm@13375
  1063
  let
wenzelm@13375
  1064
    val t = Library.foldr1 Logic.mk_conjunction ts;
wenzelm@13375
  1065
    val body = ObjectLogic.atomize_term sign t;
wenzelm@13375
  1066
    val bodyT = Term.fastype_of body;
wenzelm@13375
  1067
  in
wenzelm@13375
  1068
    if bodyT = propT then (t, propT, Thm.reflexive (Thm.cterm_of sign t))
wenzelm@13375
  1069
    else (body, bodyT, ObjectLogic.atomize_rule sign (Thm.cterm_of sign t))
wenzelm@13375
  1070
  end;
wenzelm@13375
  1071
wenzelm@13394
  1072
fun aprop_tr' n c = (c, fn args =>
wenzelm@13394
  1073
  if length args = n then Syntax.const "_aprop" $ Term.list_comb (Syntax.free c, args)
wenzelm@13394
  1074
  else raise Match);
wenzelm@13336
  1075
wenzelm@13420
  1076
fun def_pred bname parms defs ts norm_ts thy =
wenzelm@13375
  1077
  let
wenzelm@13375
  1078
    val sign = Theory.sign_of thy;
wenzelm@13375
  1079
    val name = Sign.full_name sign bname;
wenzelm@13375
  1080
wenzelm@13420
  1081
    val (body, bodyT, body_eq) = atomize_spec sign norm_ts;
wenzelm@13394
  1082
    val env = Term.add_term_free_names (body, []);
wenzelm@13394
  1083
    val xs = filter (fn (x, _) => x mem_string env) parms;
wenzelm@13394
  1084
    val Ts = map #2 xs;
wenzelm@13394
  1085
    val extraTs = (Term.term_tfrees body \\ foldr Term.add_typ_tfrees (Ts, []))
wenzelm@13394
  1086
      |> Library.sort_wrt #1 |> map TFree;
wenzelm@13399
  1087
    val predT = map Term.itselfT extraTs ---> Ts ---> bodyT;
wenzelm@13336
  1088
wenzelm@13394
  1089
    val args = map Logic.mk_type extraTs @ map Free xs;
wenzelm@13394
  1090
    val head = Term.list_comb (Const (name, predT), args);
wenzelm@13375
  1091
    val statement = ObjectLogic.assert_propT sign head;
wenzelm@13375
  1092
wenzelm@13375
  1093
    val (defs_thy, [pred_def]) =
wenzelm@13375
  1094
      thy
wenzelm@13394
  1095
      |> (if bodyT <> propT then I else
wenzelm@13394
  1096
        Theory.add_trfuns ([], [], map (aprop_tr' (length args)) (NameSpace.accesses' name), []))
wenzelm@13375
  1097
      |> Theory.add_consts_i [(bname, predT, Syntax.NoSyn)]
wenzelm@13375
  1098
      |> PureThy.add_defs_i false [((Thm.def_name bname, Logic.mk_equals (head, body)), [])];
wenzelm@13394
  1099
wenzelm@13375
  1100
    val defs_sign = Theory.sign_of defs_thy;
wenzelm@13375
  1101
    val cert = Thm.cterm_of defs_sign;
wenzelm@13375
  1102
wenzelm@13420
  1103
    val intro = Tactic.prove_standard defs_sign [] norm_ts statement (fn _ =>
wenzelm@13375
  1104
      Tactic.rewrite_goals_tac [pred_def] THEN
wenzelm@13375
  1105
      Tactic.compose_tac (false, body_eq RS Drule.equal_elim_rule1, 1) 1 THEN
wenzelm@13420
  1106
      Tactic.compose_tac (false, Drule.conj_intr_list (map (Thm.assume o cert) norm_ts), 0) 1);
wenzelm@13375
  1107
wenzelm@13375
  1108
    val conjuncts =
wenzelm@13399
  1109
      Drule.equal_elim_rule1 OF [Thm.symmetric body_eq,
wenzelm@13399
  1110
        Tactic.rewrite_rule [pred_def] (Thm.assume (cert statement))]
wenzelm@13375
  1111
      |> Drule.conj_elim_precise (length ts);
wenzelm@13394
  1112
    val axioms = (ts ~~ conjuncts) |> map (fn (t, ax) =>
wenzelm@13375
  1113
      Tactic.prove defs_sign [] [] t (fn _ =>
wenzelm@13375
  1114
        Tactic.rewrite_goals_tac defs THEN
wenzelm@13375
  1115
        Tactic.compose_tac (false, ax, 0) 1));
wenzelm@13394
  1116
  in (defs_thy, (statement, intro, axioms)) end;
wenzelm@13375
  1117
wenzelm@13394
  1118
fun change_elem _ (axms, Assumes asms) =
wenzelm@13394
  1119
      apsnd Notes ((axms, asms) |> foldl_map (fn (axs, (a, spec)) =>
nipkow@13629
  1120
        let val (ps,qs) = splitAt(length spec, axs)
nipkow@13629
  1121
        in (qs, (a, [(ps, [])])) end))
wenzelm@13394
  1122
  | change_elem f (axms, Notes facts) = (axms, Notes (map (apsnd (map (apfst (map f)))) facts))
wenzelm@13394
  1123
  | change_elem _ e = e;
wenzelm@13394
  1124
wenzelm@13394
  1125
fun change_elemss axioms elemss = (axioms, elemss) |> foldl_map
wenzelm@13394
  1126
  (fn (axms, (id as ("", _), es)) =>
wenzelm@13394
  1127
    foldl_map (change_elem (Drule.satisfy_hyps axioms)) (axms, es) |> apsnd (pair id)
wenzelm@13394
  1128
  | x => x) |> #2;
wenzelm@13394
  1129
wenzelm@13394
  1130
in
wenzelm@13375
  1131
wenzelm@13394
  1132
fun define_preds bname (parms, ((exts, exts'), (ints, ints')), defs) elemss thy =
wenzelm@13394
  1133
  let
wenzelm@13394
  1134
    val (thy', (elemss', more_ts)) =
wenzelm@13394
  1135
      if Library.null exts then (thy, (elemss, []))
wenzelm@13394
  1136
      else
wenzelm@13394
  1137
        let
wenzelm@13420
  1138
          val aname = if Library.null ints then bname else bname ^ "_" ^ axiomsN;
wenzelm@13394
  1139
          val (def_thy, (statement, intro, axioms)) =
wenzelm@13394
  1140
            thy |> def_pred aname parms defs exts exts';
wenzelm@13394
  1141
          val elemss' = change_elemss axioms elemss @
wenzelm@13420
  1142
            [(("", []), [Assumes [((bname ^ "_" ^ axiomsN, []), [(statement, ([], []))])]])];
wenzelm@13394
  1143
        in
wenzelm@13394
  1144
          def_thy |> have_thmss_qualified "" aname
wenzelm@13394
  1145
            [((introN, [ContextRules.intro_query_global None]), [([intro], [])])]
wenzelm@13394
  1146
          |> #1 |> rpair (elemss', [statement])
wenzelm@13394
  1147
        end;
wenzelm@13394
  1148
    val (thy'', view) =
wenzelm@13420
  1149
      if Library.null ints then (thy', ([], []))
wenzelm@13394
  1150
      else
wenzelm@13394
  1151
        let
wenzelm@13394
  1152
          val (def_thy, (statement, intro, axioms)) =
wenzelm@13394
  1153
            thy' |> def_pred bname parms defs (ints @ more_ts) (ints' @ more_ts);
wenzelm@13399
  1154
          val cstatement = Thm.cterm_of (Theory.sign_of def_thy) statement;
wenzelm@13394
  1155
        in
wenzelm@13394
  1156
          def_thy |> have_thmss_qualified "" bname
wenzelm@13420
  1157
            [((introN, [ContextRules.intro_query_global None]), [([intro], [])]),
wenzelm@13442
  1158
             ((axiomsN, [ContextRules.elim_query_global None]), [(map Drule.standard axioms, [])])]
wenzelm@13415
  1159
          |> #1 |> rpair ([cstatement], axioms)
wenzelm@13394
  1160
        end;
wenzelm@13394
  1161
  in (thy'', (elemss', view)) end;
wenzelm@13375
  1162
wenzelm@13375
  1163
end;
wenzelm@13336
  1164
wenzelm@13336
  1165
wenzelm@13297
  1166
(* add_locale(_i) *)
wenzelm@13297
  1167
wenzelm@13297
  1168
local
wenzelm@13297
  1169
wenzelm@13394
  1170
fun gen_add_locale prep_ctxt prep_expr do_pred bname raw_import raw_body thy =
wenzelm@13297
  1171
  let
wenzelm@13297
  1172
    val sign = Theory.sign_of thy;
wenzelm@13297
  1173
    val name = Sign.full_name sign bname;
wenzelm@13297
  1174
    val _ = conditional (is_some (get_locale thy name)) (fn () =>
wenzelm@13297
  1175
      error ("Duplicate definition of locale " ^ quote name));
wenzelm@13297
  1176
wenzelm@13297
  1177
    val thy_ctxt = ProofContext.init thy;
wenzelm@13420
  1178
    val (((import_ctxt, import_elemss), (body_ctxt, body_elemss)), text) =
wenzelm@13375
  1179
      prep_ctxt raw_import raw_body thy_ctxt;
wenzelm@13375
  1180
    val elemss = import_elemss @ body_elemss;
wenzelm@13297
  1181
wenzelm@13415
  1182
    val (pred_thy, (elemss', view as (view_statement, view_axioms))) =
wenzelm@13394
  1183
      if do_pred then thy |> define_preds bname text elemss
wenzelm@13415
  1184
      else (thy, (elemss, ([], [])));
wenzelm@13375
  1185
    val pred_ctxt = ProofContext.init pred_thy;
wenzelm@13420
  1186
wenzelm@13420
  1187
    val ((ctxt, _), (_, facts)) = activate_facts (K I) ((pred_ctxt, view_axioms), elemss');
wenzelm@13415
  1188
    val export = ProofContext.export_standard view_statement ctxt pred_ctxt;
wenzelm@13420
  1189
    val facts' = facts |> map (fn (a, ths) => ((a, []), [(map export ths, [])]));
wenzelm@13297
  1190
  in
wenzelm@13375
  1191
    pred_thy
wenzelm@13420
  1192
    |> have_thmss_qualified "" name facts' |> #1
wenzelm@13297
  1193
    |> declare_locale name
wenzelm@13399
  1194
    |> put_locale name (make_locale view (prep_expr sign raw_import)
wenzelm@13394
  1195
        (map (fn e => (e, stamp ())) (flat (map #2 (filter (equal "" o #1 o #1) elemss'))))
wenzelm@13375
  1196
        (params_of elemss', map #1 (params_of body_elemss)))
wenzelm@13297
  1197
  end;
wenzelm@13297
  1198
wenzelm@13297
  1199
in
wenzelm@13297
  1200
wenzelm@13297
  1201
val add_locale = gen_add_locale read_context intern_expr;
ballarin@14215
  1202
wenzelm@13297
  1203
val add_locale_i = gen_add_locale cert_context (K I);
wenzelm@13297
  1204
wenzelm@13297
  1205
end;
wenzelm@13297
  1206
wenzelm@13297
  1207
wenzelm@12730
  1208
wenzelm@11896
  1209
(** locale theory setup **)
wenzelm@12063
  1210
wenzelm@11896
  1211
val setup =
wenzelm@13460
  1212
 [LocalesData.init,
wenzelm@13460
  1213
  add_locale_i true "var" empty [Elem (Fixes [(Syntax.internal "x", None, Some Syntax.NoSyn)])],
wenzelm@13460
  1214
  add_locale_i true "struct" empty [Elem (Fixes [(Syntax.internal "S", None, None)])]];
wenzelm@11896
  1215
wenzelm@11896
  1216
end;