src/Pure/facts.ML
author wenzelm
Wed Dec 31 15:30:10 2008 +0100 (2008-12-31)
changeset 29269 5c25a2012975
parent 28965 1de908189869
child 29581 b3b33e0298eb
permissions -rw-r--r--
moved term order operations to structure TermOrd (cf. Pure/term_ord.ML);
tuned signature of structure Term;
wenzelm@26281
     1
(*  Title:      Pure/facts.ML
wenzelm@26281
     2
    Author:     Makarius
wenzelm@26281
     3
wenzelm@26307
     4
Environment of named facts, optionally indexed by proposition.
wenzelm@26281
     5
*)
wenzelm@26281
     6
wenzelm@26281
     7
signature FACTS =
wenzelm@26281
     8
sig
wenzelm@26336
     9
  val the_single: string -> thm list -> thm
wenzelm@26336
    10
  datatype interval = FromTo of int * int | From of int | Single of int
wenzelm@26336
    11
  datatype ref =
wenzelm@26361
    12
    Named of (string * Position.T) * interval list option |
wenzelm@26336
    13
    Fact of string
wenzelm@26361
    14
  val named: string -> ref
wenzelm@26336
    15
  val string_of_ref: ref -> string
wenzelm@26336
    16
  val name_of_ref: ref -> string
wenzelm@26366
    17
  val pos_of_ref: ref -> Position.T
wenzelm@26336
    18
  val map_name_of_ref: (string -> string) -> ref -> ref
wenzelm@26336
    19
  val select: ref -> thm list -> thm list
wenzelm@26336
    20
  val selections: string * thm list -> (ref * thm) list
wenzelm@26281
    21
  type T
wenzelm@26393
    22
  val empty: T
wenzelm@26664
    23
  val intern: T -> xstring -> string
wenzelm@26664
    24
  val extern: T -> string -> xstring
wenzelm@27738
    25
  val lookup: Context.generic -> T -> string -> (bool * thm list) option
wenzelm@26692
    26
  val defined: T -> string -> bool
wenzelm@26692
    27
  val fold_static: (string * thm list -> 'a -> 'a) -> T -> 'a -> 'a
wenzelm@27175
    28
  val dest_static: T list -> T -> (string * thm list) list
wenzelm@27175
    29
  val extern_static: T list -> T -> (xstring * thm list) list
wenzelm@26281
    30
  val props: T -> thm list
wenzelm@26281
    31
  val could_unify: T -> term -> thm list
wenzelm@26281
    32
  val merge: T * T -> T
haftmann@28965
    33
  val add_global: NameSpace.naming -> Binding.T * thm list -> T -> string * T
haftmann@28965
    34
  val add_local: bool -> NameSpace.naming -> Binding.T * thm list -> T -> string * T
haftmann@28965
    35
  val add_dynamic: NameSpace.naming -> Binding.T * (Context.generic -> thm list) -> T -> string * T
wenzelm@26654
    36
  val del: string -> T -> T
wenzelm@26654
    37
  val hide: bool -> string -> T -> T
wenzelm@26281
    38
end;
wenzelm@26281
    39
wenzelm@26281
    40
structure Facts: FACTS =
wenzelm@26281
    41
struct
wenzelm@26281
    42
wenzelm@26336
    43
(** fact references **)
wenzelm@26336
    44
wenzelm@26336
    45
fun the_single _ [th] : thm = th
wenzelm@26336
    46
  | the_single name _ = error ("Single theorem expected " ^ quote name);
wenzelm@26336
    47
wenzelm@26336
    48
wenzelm@26336
    49
(* datatype interval *)
wenzelm@26336
    50
wenzelm@26336
    51
datatype interval =
wenzelm@26336
    52
  FromTo of int * int |
wenzelm@26336
    53
  From of int |
wenzelm@26336
    54
  Single of int;
wenzelm@26336
    55
wenzelm@26336
    56
fun string_of_interval (FromTo (i, j)) = string_of_int i ^ "-" ^ string_of_int j
wenzelm@26336
    57
  | string_of_interval (From i) = string_of_int i ^ "-"
wenzelm@26336
    58
  | string_of_interval (Single i) = string_of_int i;
wenzelm@26336
    59
wenzelm@26336
    60
fun interval n iv =
wenzelm@26336
    61
  let fun err () = raise Fail ("Bad interval specification " ^ string_of_interval iv) in
wenzelm@26336
    62
    (case iv of
wenzelm@26336
    63
      FromTo (i, j) => if i <= j then i upto j else err ()
wenzelm@26336
    64
    | From i => if i <= n then i upto n else err ()
wenzelm@26336
    65
    | Single i => [i])
wenzelm@26336
    66
  end;
wenzelm@26336
    67
wenzelm@26336
    68
wenzelm@26336
    69
(* datatype ref *)
wenzelm@26336
    70
wenzelm@26336
    71
datatype ref =
wenzelm@26361
    72
  Named of (string * Position.T) * interval list option |
wenzelm@26336
    73
  Fact of string;
wenzelm@26336
    74
wenzelm@26361
    75
fun named name = Named ((name, Position.none), NONE);
wenzelm@26361
    76
wenzelm@26366
    77
fun name_pos_of_ref (Named (name_pos, _)) = name_pos
wenzelm@26366
    78
  | name_pos_of_ref (Fact _) = error "Illegal literal fact";
wenzelm@26366
    79
wenzelm@26366
    80
val name_of_ref = #1 o name_pos_of_ref;
wenzelm@26366
    81
val pos_of_ref = #2 o name_pos_of_ref;
wenzelm@26336
    82
wenzelm@26361
    83
fun map_name_of_ref f (Named ((name, pos), is)) = Named ((f name, pos), is)
wenzelm@26336
    84
  | map_name_of_ref _ r = r;
wenzelm@26336
    85
wenzelm@26361
    86
fun string_of_ref (Named ((name, _), NONE)) = name
wenzelm@26361
    87
  | string_of_ref (Named ((name, _), SOME is)) =
wenzelm@26336
    88
      name ^ enclose "(" ")" (commas (map string_of_interval is))
wenzelm@26336
    89
  | string_of_ref (Fact _) = error "Illegal literal fact";
wenzelm@26336
    90
wenzelm@26336
    91
wenzelm@26336
    92
(* select *)
wenzelm@26336
    93
wenzelm@26336
    94
fun select (Fact _) ths = ths
wenzelm@26336
    95
  | select (Named (_, NONE)) ths = ths
wenzelm@26361
    96
  | select (Named ((name, pos), SOME ivs)) ths =
wenzelm@26336
    97
      let
wenzelm@26336
    98
        val n = length ths;
wenzelm@26361
    99
        fun err msg =
wenzelm@26361
   100
          error (msg ^ " for " ^ quote name ^ " (length " ^ string_of_int n ^ ")" ^
wenzelm@26361
   101
            Position.str_of pos);
wenzelm@26336
   102
        fun sel i =
wenzelm@26336
   103
          if i < 1 orelse i > n then err ("Bad subscript " ^ string_of_int i)
wenzelm@26336
   104
          else nth ths (i - 1);
wenzelm@26336
   105
        val is = maps (interval n) ivs handle Fail msg => err msg;
wenzelm@26336
   106
      in map sel is end;
wenzelm@26336
   107
wenzelm@26336
   108
wenzelm@26336
   109
(* selections *)
wenzelm@26336
   110
wenzelm@26361
   111
fun selections (name, [th]) = [(Named ((name, Position.none), NONE), th)]
wenzelm@26361
   112
  | selections (name, ths) = map2 (fn i => fn th =>
wenzelm@26361
   113
      (Named ((name, Position.none), SOME [Single i]), th)) (1 upto length ths) ths;
wenzelm@26336
   114
wenzelm@26336
   115
wenzelm@26336
   116
wenzelm@26336
   117
(** fact environment **)
wenzelm@26336
   118
wenzelm@26393
   119
(* datatypes *)
wenzelm@26393
   120
wenzelm@26393
   121
datatype fact = Static of thm list | Dynamic of Context.generic -> thm list;
wenzelm@26281
   122
wenzelm@26281
   123
datatype T = Facts of
wenzelm@26393
   124
 {facts: (fact * serial) NameSpace.table,
wenzelm@26281
   125
  props: thm Net.net};
wenzelm@26281
   126
wenzelm@26281
   127
fun make_facts facts props = Facts {facts = facts, props = props};
wenzelm@26393
   128
val empty = make_facts NameSpace.empty_table Net.empty;
wenzelm@26281
   129
wenzelm@26281
   130
wenzelm@26281
   131
(* named facts *)
wenzelm@26281
   132
wenzelm@26281
   133
fun facts_of (Facts {facts, ...}) = facts;
wenzelm@26281
   134
wenzelm@26281
   135
val space_of = #1 o facts_of;
wenzelm@26393
   136
val table_of = #2 o facts_of;
wenzelm@26393
   137
wenzelm@26664
   138
val intern = NameSpace.intern o space_of;
wenzelm@26664
   139
val extern = NameSpace.extern o space_of;
wenzelm@26664
   140
wenzelm@26692
   141
val defined = Symtab.defined o table_of;
wenzelm@26692
   142
wenzelm@26393
   143
fun lookup context facts name =
wenzelm@26393
   144
  (case Symtab.lookup (table_of facts) name of
wenzelm@26393
   145
    NONE => NONE
wenzelm@27738
   146
  | SOME (Static ths, _) => SOME (true, ths)
wenzelm@27738
   147
  | SOME (Dynamic f, _) => SOME (false, f context));
wenzelm@26393
   148
wenzelm@26692
   149
fun fold_static f = Symtab.fold (fn (name, (Static ths, _)) => f (name, ths) | _ => I) o table_of;
wenzelm@26393
   150
wenzelm@27175
   151
wenzelm@27175
   152
(* content difference *)
wenzelm@27175
   153
wenzelm@27175
   154
fun diff_table prev_facts facts =
wenzelm@27175
   155
  fold_static (fn (name, ths) =>
wenzelm@27175
   156
    if exists (fn prev => defined prev name) prev_facts then I
wenzelm@27175
   157
    else cons (name, ths)) facts [];
wenzelm@27175
   158
wenzelm@27175
   159
fun dest_static prev_facts facts =
wenzelm@27175
   160
  sort_wrt #1 (diff_table prev_facts facts);
wenzelm@27175
   161
wenzelm@27175
   162
fun extern_static prev_facts facts =
wenzelm@27175
   163
  sort_wrt #1 (diff_table prev_facts facts |> map (apfst (extern facts)));
wenzelm@26281
   164
wenzelm@26281
   165
wenzelm@26281
   166
(* indexed props *)
wenzelm@26281
   167
wenzelm@29269
   168
val prop_ord = TermOrd.term_ord o pairself Thm.full_prop_of;
wenzelm@26281
   169
wenzelm@26281
   170
fun props (Facts {props, ...}) = sort_distinct prop_ord (Net.content props);
wenzelm@26281
   171
fun could_unify (Facts {props, ...}) = Net.unify_term props;
wenzelm@26281
   172
wenzelm@26281
   173
wenzelm@26393
   174
(* merge facts *)
wenzelm@26281
   175
wenzelm@26393
   176
fun err_dup_fact name = error ("Duplicate fact " ^ quote name);
wenzelm@26281
   177
wenzelm@27175
   178
(* FIXME stamp identity! *)
wenzelm@26654
   179
fun eq_entry ((Static ths1, _), (Static ths2, _)) = is_equal (list_ord Thm.thm_ord (ths1, ths2))
wenzelm@26654
   180
  | eq_entry ((_, id1: serial), (_, id2)) = id1 = id2;
wenzelm@26654
   181
wenzelm@26281
   182
fun merge (Facts {facts = facts1, props = props1}, Facts {facts = facts2, props = props2}) =
wenzelm@26281
   183
  let
wenzelm@26654
   184
    val facts' = NameSpace.merge_tables eq_entry (facts1, facts2)
wenzelm@26654
   185
      handle Symtab.DUP dup => err_dup_fact dup;
wenzelm@26281
   186
    val props' = Net.merge (is_equal o prop_ord) (props1, props2);
wenzelm@26281
   187
  in make_facts facts' props' end;
wenzelm@26281
   188
wenzelm@26393
   189
wenzelm@26654
   190
(* add static entries *)
wenzelm@26393
   191
haftmann@28864
   192
fun add permissive do_props naming (b, ths) (Facts {facts, props}) =
wenzelm@26281
   193
  let
haftmann@28965
   194
    val (name, facts') = if Binding.is_empty b then ("", facts)
haftmann@28864
   195
      else let
haftmann@28864
   196
        val (space, tab) = facts;
haftmann@28965
   197
        val (name, space') = NameSpace.declare naming b space;
haftmann@28864
   198
        val entry = (name, (Static ths, serial ()));
haftmann@28864
   199
        val tab' = (if permissive then Symtab.update else Symtab.update_new) entry tab
haftmann@28864
   200
          handle Symtab.DUP dup => err_dup_fact dup;
haftmann@28864
   201
      in (name, (space', tab')) end;
wenzelm@26281
   202
    val props' =
wenzelm@26281
   203
      if do_props then fold (fn th => Net.insert_term (K false) (Thm.full_prop_of th, th)) ths props
wenzelm@26281
   204
      else props;
haftmann@28864
   205
  in (name, make_facts facts' props') end;
wenzelm@26281
   206
wenzelm@26307
   207
val add_global = add false false;
wenzelm@26307
   208
val add_local = add true;
wenzelm@26307
   209
wenzelm@26393
   210
wenzelm@26654
   211
(* add dynamic entries *)
wenzelm@26393
   212
haftmann@28864
   213
fun add_dynamic naming (b, f) (Facts {facts = (space, tab), props}) =
wenzelm@26290
   214
  let
haftmann@28965
   215
    val (name, space') = NameSpace.declare naming b space;
wenzelm@26393
   216
    val entry = (name, (Dynamic f, serial ()));
wenzelm@26393
   217
    val tab' = Symtab.update_new entry tab
wenzelm@26393
   218
      handle Symtab.DUP dup => err_dup_fact dup;
haftmann@28864
   219
  in (name, make_facts (space', tab') props) end;
wenzelm@26281
   220
wenzelm@26654
   221
wenzelm@26654
   222
(* remove entries *)
wenzelm@26654
   223
wenzelm@26654
   224
fun del name (Facts {facts = (space, tab), props}) =
wenzelm@26654
   225
  let
wenzelm@26654
   226
    val space' = NameSpace.hide true name space handle ERROR _ => space;
wenzelm@26654
   227
    val tab' = Symtab.delete_safe name tab;
wenzelm@26654
   228
  in make_facts (space', tab') props end;
wenzelm@26654
   229
wenzelm@26654
   230
fun hide fully name (Facts {facts = (space, tab), props}) =
wenzelm@26654
   231
  make_facts (NameSpace.hide fully name space, tab) props;
wenzelm@26654
   232
wenzelm@26281
   233
end;