src/Pure/theory.ML
author haftmann
Tue Mar 20 15:52:42 2007 +0100 (2007-03-20)
changeset 22485 3a7d623485fa
parent 21772 7c7ade4f537b
child 22578 b0eb5652f210
permissions -rw-r--r--
added theory dependency graph
paulson@1526
     1
(*  Title:      Pure/theory.ML
paulson@1526
     2
    ID:         $Id$
paulson@1526
     3
    Author:     Lawrence C Paulson and Markus Wenzel
paulson@1526
     4
wenzelm@16443
     5
Logical theory content: axioms, definitions, oracles.
paulson@1526
     6
*)
wenzelm@16291
     7
wenzelm@3767
     8
signature BASIC_THEORY =
wenzelm@3767
     9
sig
wenzelm@16495
    10
  val sign_of: theory -> theory    (*obsolete*)
wenzelm@3996
    11
  val rep_theory: theory ->
wenzelm@16443
    12
   {axioms: term NameSpace.table,
wenzelm@17706
    13
    defs: Defs.T,
wenzelm@16443
    14
    oracles: ((theory * Object.T -> term) * stamp) NameSpace.table}
wenzelm@3996
    15
  val parents_of: theory -> theory list
wenzelm@4019
    16
  val ancestors_of: theory -> theory list
wenzelm@16443
    17
  val eq_thy: theory * theory -> bool
wenzelm@3996
    18
  val subthy: theory * theory -> bool
wenzelm@16443
    19
  val cert_axm: theory -> string * term -> string * term
wenzelm@16443
    20
  val read_def_axm: theory * (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@6311
    21
    string list -> string * string -> string * term
wenzelm@16443
    22
  val read_axm: theory -> string * string -> string * term
wenzelm@16443
    23
  val inferT_axm: theory -> string * term -> string * term
wenzelm@3767
    24
end
wenzelm@3767
    25
wenzelm@3767
    26
signature THEORY =
wenzelm@3767
    27
sig
wenzelm@3767
    28
  include BASIC_THEORY
wenzelm@16443
    29
  include SIGN_THEORY
wenzelm@16495
    30
  val begin_theory: string -> theory list -> theory
wenzelm@16495
    31
  val end_theory: theory -> theory
wenzelm@16495
    32
  val checkpoint: theory -> theory
wenzelm@16495
    33
  val copy: theory -> theory
wenzelm@16536
    34
  val init_data: theory -> theory
wenzelm@16443
    35
  val axiom_space: theory -> NameSpace.T
wenzelm@16443
    36
  val oracle_space: theory -> NameSpace.T
wenzelm@16339
    37
  val axioms_of: theory -> (string * term) list
wenzelm@16339
    38
  val all_axioms_of: theory -> (string * term) list
wenzelm@17706
    39
  val defs_of : theory -> Defs.T
wenzelm@16443
    40
  val self_ref: theory -> theory_ref
wenzelm@16443
    41
  val deref: theory_ref -> theory
wenzelm@16443
    42
  val merge: theory * theory -> theory                     (*exception TERM*)
wenzelm@16443
    43
  val merge_refs: theory_ref * theory_ref -> theory_ref    (*exception TERM*)
wenzelm@21608
    44
  val merge_list: theory list -> theory                    (*exception TERM*)
wenzelm@16443
    45
  val requires: theory -> string -> string -> unit
wenzelm@16443
    46
  val assert_super: theory -> theory -> theory
wenzelm@3996
    47
  val add_axioms: (bstring * string) list -> theory -> theory
wenzelm@3996
    48
  val add_axioms_i: (bstring * term) list -> theory -> theory
wenzelm@19708
    49
  val add_deps: string -> string * typ -> (string * typ) list -> theory -> theory
wenzelm@19630
    50
  val add_defs: bool -> bool -> (bstring * string) list -> theory -> theory
wenzelm@19630
    51
  val add_defs_i: bool -> bool -> (bstring * term) list -> theory -> theory
wenzelm@16443
    52
  val add_finals: bool -> string list -> theory -> theory
wenzelm@16443
    53
  val add_finals_i: bool -> term list -> theory -> theory
wenzelm@16443
    54
  val add_oracle: bstring * (theory * Object.T -> term) -> theory -> theory
haftmann@22485
    55
  val dep_graph: theory -> unit Graph.T;
wenzelm@16495
    56
end
paulson@1526
    57
wenzelm@16443
    58
structure Theory: THEORY =
wenzelm@16443
    59
struct
wenzelm@16443
    60
wenzelm@19708
    61
wenzelm@16443
    62
(** type theory **)
wenzelm@16443
    63
wenzelm@16443
    64
(* context operations *)
wenzelm@16443
    65
wenzelm@16443
    66
val eq_thy = Context.eq_thy;
wenzelm@16443
    67
val subthy = Context.subthy;
paulson@1526
    68
wenzelm@16443
    69
val parents_of = Context.parents_of;
wenzelm@16443
    70
val ancestors_of = Context.ancestors_of;
wenzelm@16443
    71
wenzelm@16443
    72
val self_ref = Context.self_ref;
wenzelm@16443
    73
val deref = Context.deref;
wenzelm@16443
    74
val merge = Context.merge;
wenzelm@16443
    75
val merge_refs = Context.merge_refs;
wenzelm@16443
    76
wenzelm@21608
    77
fun merge_list [] = raise TERM ("Empty merge of theories", [])
wenzelm@21608
    78
  | merge_list (thy :: thys) = Library.foldl merge (thy, thys);
wenzelm@21608
    79
wenzelm@16495
    80
val begin_theory = Sign.local_path oo Context.begin_thy Sign.pp;
wenzelm@16495
    81
val end_theory = Context.finish_thy;
wenzelm@16495
    82
val checkpoint = Context.checkpoint_thy;
wenzelm@16495
    83
val copy = Context.copy_thy;
wenzelm@16495
    84
wenzelm@16443
    85
wenzelm@16443
    86
(* signature operations *)
wenzelm@16443
    87
wenzelm@16443
    88
val sign_of = I;
wenzelm@16443
    89
wenzelm@16443
    90
structure SignTheory: SIGN_THEORY = Sign;
wenzelm@16443
    91
open SignTheory;
wenzelm@16443
    92
wenzelm@2206
    93
wenzelm@3996
    94
wenzelm@16443
    95
(** datatype thy **)
wenzelm@16443
    96
wenzelm@16443
    97
datatype thy = Thy of
wenzelm@16443
    98
 {axioms: term NameSpace.table,
wenzelm@17706
    99
  defs: Defs.T,
wenzelm@16443
   100
  oracles: ((theory * Object.T -> term) * stamp) NameSpace.table};
wenzelm@16443
   101
wenzelm@16443
   102
fun make_thy (axioms, defs, oracles) =
wenzelm@16443
   103
  Thy {axioms = axioms, defs = defs, oracles = oracles};
paulson@1526
   104
wenzelm@16443
   105
fun err_dup_axms dups = error ("Duplicate axiom(s): " ^ commas_quote dups);
wenzelm@16443
   106
fun err_dup_oras dups = error ("Duplicate oracle(s): " ^ commas_quote dups);
wenzelm@3996
   107
wenzelm@16443
   108
structure ThyData = TheoryDataFun
wenzelm@16443
   109
(struct
wenzelm@16536
   110
  val name = "Pure/theory";
wenzelm@16443
   111
  type T = thy;
wenzelm@16443
   112
  val empty = make_thy (NameSpace.empty_table, Defs.empty, NameSpace.empty_table);
wenzelm@16443
   113
  val copy = I;
wenzelm@16443
   114
wenzelm@16443
   115
  fun extend (Thy {axioms, defs, oracles}) = make_thy (NameSpace.empty_table, defs, oracles);
wenzelm@16443
   116
wenzelm@16443
   117
  fun merge pp (thy1, thy2) =
wenzelm@16443
   118
    let
wenzelm@16443
   119
      val Thy {axioms = _, defs = defs1, oracles = oracles1} = thy1;
wenzelm@16443
   120
      val Thy {axioms = _, defs = defs2, oracles = oracles2} = thy2;
paulson@1526
   121
wenzelm@16443
   122
      val axioms = NameSpace.empty_table;
wenzelm@19693
   123
      val defs = Defs.merge pp (defs1, defs2);
haftmann@17496
   124
      val oracles = NameSpace.merge_tables (eq_snd (op =)) (oracles1, oracles2)
wenzelm@16443
   125
        handle Symtab.DUPS dups => err_dup_oras dups;
wenzelm@16443
   126
    in make_thy (axioms, defs, oracles) end;
wenzelm@16443
   127
wenzelm@16443
   128
  fun print _ _ = ();
wenzelm@16443
   129
end);
wenzelm@16443
   130
wenzelm@16536
   131
val init_data = ThyData.init;
wenzelm@16443
   132
wenzelm@16443
   133
fun rep_theory thy = ThyData.get thy |> (fn Thy args => args);
wenzelm@16443
   134
wenzelm@16443
   135
fun map_thy f = ThyData.map (fn (Thy {axioms, defs, oracles}) =>
wenzelm@16443
   136
  make_thy (f (axioms, defs, oracles)));
wenzelm@16443
   137
wenzelm@16443
   138
fun map_axioms f = map_thy (fn (axioms, defs, oracles) => (f axioms, defs, oracles));
wenzelm@16443
   139
fun map_defs f = map_thy (fn (axioms, defs, oracles) => (axioms, f defs, oracles));
wenzelm@16443
   140
fun map_oracles f = map_thy (fn (axioms, defs, oracles) => (axioms, defs, f oracles));
wenzelm@16443
   141
wenzelm@16443
   142
wenzelm@16443
   143
(* basic operations *)
wenzelm@16443
   144
wenzelm@16443
   145
val axiom_space = #1 o #axioms o rep_theory;
wenzelm@16443
   146
val oracle_space = #1 o #oracles o rep_theory;
wenzelm@3996
   147
wenzelm@16339
   148
val axioms_of = Symtab.dest o #2 o #axioms o rep_theory;
wenzelm@19482
   149
fun all_axioms_of thy = maps axioms_of (thy :: ancestors_of thy);
wenzelm@16339
   150
wenzelm@16803
   151
val defs_of = #defs o rep_theory;
obua@16743
   152
paulson@4970
   153
fun requires thy name what =
wenzelm@16443
   154
  if Context.exists_name name thy then ()
wenzelm@4846
   155
  else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what);
paulson@1526
   156
wenzelm@6369
   157
fun assert_super thy1 thy2 =
wenzelm@6369
   158
  if subthy (thy1, thy2) then thy2
wenzelm@6369
   159
  else raise THEORY ("Not a super theory", [thy1, thy2]);
wenzelm@6369
   160
wenzelm@3996
   161
wenzelm@6311
   162
wenzelm@3814
   163
(** add axioms **)
wenzelm@3814
   164
paulson@1526
   165
(* prepare axioms *)
paulson@1526
   166
wenzelm@18678
   167
fun err_in_axm msg name =
wenzelm@18678
   168
  cat_error msg ("The error(s) above occurred in axiom " ^ quote name);
paulson@1526
   169
wenzelm@16443
   170
fun cert_axm thy (name, raw_tm) =
paulson@1526
   171
  let
wenzelm@18968
   172
    val (t, T, _) = Sign.certify_prop thy raw_tm
wenzelm@2979
   173
      handle TYPE (msg, _, _) => error msg
wenzelm@16291
   174
        | TERM (msg, _) => error msg;
paulson@1526
   175
  in
wenzelm@9537
   176
    Term.no_dummy_patterns t handle TERM (msg, _) => error msg;
wenzelm@18968
   177
    (name, Sign.no_vars (Sign.pp thy) t)
wenzelm@9629
   178
  end;
paulson@1526
   179
wenzelm@16443
   180
fun read_def_axm (thy, types, sorts) used (name, str) =
wenzelm@3814
   181
  let
wenzelm@21772
   182
    val ts = Syntax.read (ProofContext.init thy) (Sign.is_logtype thy) (Sign.syn_of thy) propT str;
wenzelm@18968
   183
    val (t, _) =
wenzelm@20155
   184
      Sign.infer_types (Sign.pp thy) thy (Sign.consts_of thy)
wenzelm@20155
   185
        types sorts (Name.make_context used) true (ts, propT);
wenzelm@16443
   186
  in cert_axm thy (name, t) end
wenzelm@18678
   187
  handle ERROR msg => err_in_axm msg name;
paulson@1526
   188
wenzelm@16443
   189
fun read_axm thy name_str = read_def_axm (thy, K NONE, K NONE) [] name_str;
wenzelm@5057
   190
wenzelm@16443
   191
fun inferT_axm thy (name, pre_tm) =
wenzelm@16291
   192
  let
wenzelm@16443
   193
    val pp = Sign.pp thy;
wenzelm@18968
   194
    val (t, _) =
wenzelm@20155
   195
      Sign.infer_types pp thy (Sign.consts_of thy)
wenzelm@20155
   196
        (K NONE) (K NONE) Name.context true ([pre_tm], propT);
wenzelm@18943
   197
  in (name, Sign.no_vars pp t) end
wenzelm@18678
   198
  handle ERROR msg => err_in_axm msg name;
paulson@1526
   199
paulson@1526
   200
wenzelm@16443
   201
(* add_axioms(_i) *)
paulson@1526
   202
wenzelm@16291
   203
local
wenzelm@16291
   204
wenzelm@16443
   205
fun gen_add_axioms prep_axm raw_axms thy = thy |> map_axioms (fn axioms =>
paulson@1526
   206
  let
wenzelm@16991
   207
    val axms = map (apsnd (Compress.term thy o Logic.varify) o prep_axm thy) raw_axms;
wenzelm@16443
   208
    val axioms' = NameSpace.extend_table (Sign.naming_of thy) (axioms, axms)
wenzelm@16443
   209
      handle Symtab.DUPS dups => err_dup_axms dups;
wenzelm@16443
   210
  in axioms' end);
paulson@1526
   211
wenzelm@16291
   212
in
wenzelm@16291
   213
wenzelm@16291
   214
val add_axioms = gen_add_axioms read_axm;
wenzelm@16291
   215
val add_axioms_i = gen_add_axioms cert_axm;
wenzelm@16291
   216
wenzelm@16291
   217
end;
paulson@1526
   218
paulson@1526
   219
wenzelm@3767
   220
wenzelm@3767
   221
(** add constant definitions **)
wenzelm@3767
   222
wenzelm@19708
   223
(* dependencies *)
wenzelm@19708
   224
wenzelm@19708
   225
fun dependencies thy unchecked is_def name lhs rhs =
wenzelm@19708
   226
  let
wenzelm@19708
   227
    val pp = Sign.pp thy;
wenzelm@19708
   228
    val consts = Sign.consts_of thy;
wenzelm@19727
   229
    fun prep const =
wenzelm@19727
   230
      let val Const (c, T) = Sign.no_vars pp (Const const)
wenzelm@19806
   231
      in (c, Consts.typargs consts (c, Compress.typ thy (Logic.varifyT T))) end;
wenzelm@19708
   232
wenzelm@19708
   233
    val lhs_vars = Term.add_tfreesT (#2 lhs) [];
wenzelm@19708
   234
    val rhs_extras = fold (#2 #> Term.fold_atyps (fn TFree v =>
wenzelm@19708
   235
      if member (op =) lhs_vars v then I else insert (op =) v | _ => I)) rhs [];
wenzelm@19708
   236
    val _ =
wenzelm@19708
   237
      if null rhs_extras then ()
wenzelm@19708
   238
      else error ("Specification depends on extra type variables: " ^
wenzelm@19708
   239
        commas_quote (map (Pretty.string_of_typ pp o TFree) rhs_extras) ^
wenzelm@19708
   240
        "\nThe error(s) above occurred in " ^ quote name);
wenzelm@19727
   241
  in Defs.define pp unchecked is_def (Context.theory_name thy) name (prep lhs) (map prep rhs) end;
wenzelm@19708
   242
wenzelm@19708
   243
fun add_deps a raw_lhs raw_rhs thy =
wenzelm@19708
   244
  let
wenzelm@19708
   245
    val lhs :: rhs = map (dest_Const o Sign.cert_term thy o Const) (raw_lhs :: raw_rhs);
wenzelm@19708
   246
    val name = if a = "" then (#1 lhs ^ " axiom") else a;
wenzelm@19708
   247
  in thy |> map_defs (dependencies thy false false name lhs rhs) end;
wenzelm@17706
   248
wenzelm@17706
   249
wenzelm@16944
   250
(* check_overloading *)
nipkow@9280
   251
wenzelm@16944
   252
fun check_overloading thy overloaded (c, T) =
wenzelm@16291
   253
  let
wenzelm@16944
   254
    val declT =
wenzelm@16944
   255
      (case Sign.const_constraint thy c of
wenzelm@16944
   256
        NONE => error ("Undeclared constant " ^ quote c)
wenzelm@16944
   257
      | SOME declT => declT);
wenzelm@19806
   258
    val T' = Logic.varifyT T;
wenzelm@16944
   259
wenzelm@16944
   260
    fun message txt =
wenzelm@16944
   261
      [Pretty.block [Pretty.str "Specification of constant ",
wenzelm@16944
   262
        Pretty.str c, Pretty.str " ::", Pretty.brk 1, Pretty.quote (Sign.pretty_typ thy T)],
wenzelm@16944
   263
        Pretty.str txt] |> Pretty.chunks |> Pretty.string_of;
wenzelm@16291
   264
  in
wenzelm@16944
   265
    if Sign.typ_instance thy (declT, T') then ()
wenzelm@16944
   266
    else if Type.raw_instance (declT, T') then
wenzelm@16944
   267
      error (Library.setmp show_sorts true
wenzelm@16944
   268
        message "imposes additional sort constraints on the constant declaration")
wenzelm@16944
   269
    else if overloaded then ()
wenzelm@16944
   270
    else warning (message "is strictly less general than the declared type");
wenzelm@16944
   271
    (c, T)
nipkow@9280
   272
  end;
nipkow@9280
   273
wenzelm@3767
   274
wenzelm@16291
   275
(* check_def *)
wenzelm@16291
   276
wenzelm@19630
   277
fun check_def thy unchecked overloaded (bname, tm) defs =
wenzelm@16291
   278
  let
wenzelm@17706
   279
    val name = Sign.full_name thy bname;
wenzelm@19693
   280
    val (lhs_const, rhs) = Sign.cert_def (Sign.pp thy) tm;
wenzelm@16944
   281
    val rhs_consts = fold_aterms (fn Const const => insert (op =) const | _ => I) rhs [];
wenzelm@18943
   282
    val _ = check_overloading thy overloaded lhs_const;
wenzelm@19708
   283
  in defs |> dependencies thy unchecked true name lhs_const rhs_consts end
wenzelm@18678
   284
  handle ERROR msg => cat_error msg (Pretty.string_of (Pretty.block
wenzelm@16883
   285
   [Pretty.str ("The error(s) above occurred in definition " ^ quote bname ^ ":"),
wenzelm@19693
   286
    Pretty.fbrk, Pretty.quote (Sign.pretty_term thy tm)]));
wenzelm@3767
   287
wenzelm@3767
   288
wenzelm@16443
   289
(* add_defs(_i) *)
wenzelm@3767
   290
wenzelm@16291
   291
local
wenzelm@9320
   292
wenzelm@19630
   293
fun gen_add_defs prep_axm unchecked overloaded raw_axms thy =
wenzelm@16443
   294
  let val axms = map (prep_axm thy) raw_axms in
wenzelm@16443
   295
    thy
wenzelm@19630
   296
    |> map_defs (fold (check_def thy unchecked overloaded) axms)
wenzelm@9320
   297
    |> add_axioms_i axms
wenzelm@3767
   298
  end;
wenzelm@3767
   299
wenzelm@16291
   300
in
wenzelm@16291
   301
wenzelm@16291
   302
val add_defs_i = gen_add_defs cert_axm;
wenzelm@16291
   303
val add_defs = gen_add_defs read_axm;
wenzelm@16291
   304
wenzelm@16291
   305
end;
wenzelm@3767
   306
wenzelm@3767
   307
wenzelm@16443
   308
(* add_finals(_i) *)
skalberg@14223
   309
wenzelm@16291
   310
local
wenzelm@16291
   311
wenzelm@17706
   312
fun gen_add_finals prep_term overloaded args thy =
skalberg@14223
   313
  let
wenzelm@17706
   314
    fun const_of (Const const) = const
wenzelm@17706
   315
      | const_of (Free _) = error "Attempt to finalize variable (or undeclared constant)"
wenzelm@17706
   316
      | const_of _ = error "Attempt to finalize non-constant term";
wenzelm@19708
   317
    fun specify (c, T) = dependencies thy false false (c ^ " axiom") (c, T) [];
wenzelm@19708
   318
    val finalize = specify o check_overloading thy overloaded o const_of o prep_term thy;
wenzelm@17706
   319
  in thy |> map_defs (fold finalize args) end;
wenzelm@16291
   320
skalberg@14223
   321
in
wenzelm@16291
   322
wenzelm@17706
   323
val add_finals = gen_add_finals Sign.read_term;
wenzelm@17706
   324
val add_finals_i = gen_add_finals Sign.cert_term;
wenzelm@16291
   325
skalberg@14223
   326
end;
skalberg@14223
   327
skalberg@14223
   328
wenzelm@3878
   329
wenzelm@16443
   330
(** add oracle **)
wenzelm@3814
   331
wenzelm@16443
   332
fun add_oracle (bname, oracle) thy = thy |> map_oracles (fn oracles =>
wenzelm@16443
   333
  NameSpace.extend_table (Sign.naming_of thy) (oracles, [(bname, (oracle, stamp ()))])
wenzelm@16443
   334
    handle Symtab.DUPS dups => err_dup_oras dups);
wenzelm@3885
   335
haftmann@22485
   336
haftmann@22485
   337
haftmann@22485
   338
(** graph of theory parents **)
haftmann@22485
   339
haftmann@22485
   340
fun dep_graph thy =
haftmann@22485
   341
  let
haftmann@22485
   342
    fun add_thy thy gr =
haftmann@22485
   343
      let
haftmann@22485
   344
        val name = Context.theory_name thy;
haftmann@22485
   345
      in if can (Graph.get_node gr) name then (name, gr)
haftmann@22485
   346
      else
haftmann@22485
   347
        gr
haftmann@22485
   348
        |> Graph.new_node (name, ())
haftmann@22485
   349
        |> fold_map add_thy (parents_of thy)
haftmann@22485
   350
        |-> (fn names => fold (fn name' => Graph.add_edge (name, name')) names)
haftmann@22485
   351
        |> pair name
haftmann@22485
   352
      end;
haftmann@22485
   353
  in snd (add_thy thy Graph.empty) end;
haftmann@22485
   354
paulson@1526
   355
end;
paulson@1526
   356
wenzelm@3767
   357
structure BasicTheory: BASIC_THEORY = Theory;
wenzelm@3767
   358
open BasicTheory;