author | wenzelm |
Thu, 21 Apr 2005 22:02:06 +0200 | |
changeset 15801 | d2f5ca3c048d |
parent 15797 | a63605582573 |
child 15882 | a191d2bee3e1 |
permissions | -rw-r--r-- |
3987 | 1 |
(* Title: Pure/pure_thy.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel, TU Muenchen |
|
4 |
||
5091 | 5 |
Theorem database, derived theory operations, and the ProtoPure theory. |
3987 | 6 |
*) |
7 |
||
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
8 |
signature BASIC_PURE_THY = |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
9 |
sig |
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
10 |
type thmref |
5000 | 11 |
val print_theorems: theory -> unit |
12 |
val print_theory: theory -> unit |
|
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
13 |
val get_thm: theory -> thmref -> thm |
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
14 |
val get_thms: theory -> thmref -> thm list |
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
15 |
val get_thmss: theory -> thmref list -> thm list |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
16 |
val thms_of: theory -> (string * thm) list |
5091 | 17 |
structure ProtoPure: |
18 |
sig |
|
19 |
val thy: theory |
|
20 |
val Goal_def: thm |
|
21 |
end |
|
4853 | 22 |
end; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
23 |
|
3987 | 24 |
signature PURE_THY = |
25 |
sig |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
26 |
include BASIC_PURE_THY |
15703 | 27 |
datatype interval = FromTo of int * int | From of int | Single of int |
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
28 |
val get_thm_closure: theory -> thmref -> thm |
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
29 |
val get_thms_closure: theory -> thmref -> thm list |
9564 | 30 |
val single_thm: string -> thm list -> thm |
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
31 |
val select_thm: thmref -> thm list -> thm list |
6367 | 32 |
val cond_extern_thm_sg: Sign.sg -> string -> xstring |
13274 | 33 |
val thms_containing: theory -> string list * string list -> (string * thm list) list |
13646 | 34 |
val thms_containing_consts: theory -> string list -> (string * thm) list |
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
35 |
val find_matching_thms: (thm -> thm list) * (term -> term) |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
36 |
-> theory -> term -> (string * thm) list |
13646 | 37 |
val find_intros: theory -> term -> (string * thm) list |
13800
16136d2da0db
Moved find_intros_goal from goals.ML to pure_thy.ML
berghofe
parents:
13713
diff
changeset
|
38 |
val find_intros_goal : theory -> thm -> int -> (string * thm) list |
13646 | 39 |
val find_elims : theory -> term -> (string * thm) list |
12695 | 40 |
val hide_thms: bool -> string list -> theory -> theory |
6091 | 41 |
val store_thm: (bstring * thm) * theory attribute list -> theory -> theory * thm |
7405 | 42 |
val smart_store_thms: (bstring * thm list) -> thm list |
12138
7cad58fbc866
renamed open_smart_store_thms to smart_store_thms_open;
wenzelm
parents:
12123
diff
changeset
|
43 |
val smart_store_thms_open: (bstring * thm list) -> thm list |
7899 | 44 |
val forall_elim_var: int -> thm -> thm |
45 |
val forall_elim_vars: int -> thm -> thm |
|
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
46 |
val add_thms: ((bstring * thm) * theory attribute list) list -> theory -> theory * thm list |
12711 | 47 |
val add_thmss: ((bstring * thm list) * theory attribute list) list -> theory |
48 |
-> theory * thm list list |
|
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
49 |
val note_thmss: |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
50 |
theory attribute -> ((bstring * theory attribute list) * |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
51 |
(thmref * theory attribute list) list) list -> theory -> |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
52 |
theory * (bstring * thm list) list |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
53 |
val note_thmss_i: |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
54 |
theory attribute -> ((bstring * theory attribute list) * |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
55 |
(thm list * theory attribute list) list) list -> theory -> |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
56 |
theory * (bstring * thm list) list |
15696 | 57 |
val note_thmss_accesses: |
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
58 |
(string -> string list) -> |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
59 |
theory attribute -> ((bstring * theory attribute list) * |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
60 |
(thmref * theory attribute list) list) list -> theory -> |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
61 |
theory * (bstring * thm list) list |
15696 | 62 |
val note_thmss_accesses_i: |
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
63 |
(string -> string list) -> |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
64 |
theory attribute -> ((bstring * theory attribute list) * |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
65 |
(thm list * theory attribute list) list) list -> theory -> |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
66 |
theory * (bstring * thm list) list |
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
67 |
val add_axioms: ((bstring * string) * theory attribute list) list -> theory -> theory * thm list |
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
68 |
val add_axioms_i: ((bstring * term) * theory attribute list) list -> theory -> theory * thm list |
12711 | 69 |
val add_axiomss: ((bstring * string list) * theory attribute list) list -> theory |
70 |
-> theory * thm list list |
|
71 |
val add_axiomss_i: ((bstring * term list) * theory attribute list) list -> theory |
|
72 |
-> theory * thm list list |
|
9318 | 73 |
val add_defs: bool -> ((bstring * string) * theory attribute list) list |
74 |
-> theory -> theory * thm list |
|
75 |
val add_defs_i: bool -> ((bstring * term) * theory attribute list) list |
|
76 |
-> theory -> theory * thm list |
|
77 |
val add_defss: bool -> ((bstring * string list) * theory attribute list) list |
|
78 |
-> theory -> theory * thm list list |
|
79 |
val add_defss_i: bool -> ((bstring * term list) * theory attribute list) list |
|
80 |
-> theory -> theory * thm list list |
|
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
81 |
val get_name: theory -> string |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
82 |
val put_name: string -> theory -> theory |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
83 |
val global_path: theory -> theory |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
84 |
val local_path: theory -> theory |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
85 |
val begin_theory: string -> theory list -> theory |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
86 |
val end_theory: theory -> theory |
6682 | 87 |
val checkpoint: theory -> theory |
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
88 |
val add_typedecls: (bstring * string list * mixfix) list -> theory -> theory |
3987 | 89 |
end; |
90 |
||
91 |
structure PureThy: PURE_THY = |
|
92 |
struct |
|
93 |
||
94 |
||
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
95 |
(*** theorem database ***) |
3987 | 96 |
|
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
97 |
(** data kind 'Pure/theorems' **) |
3987 | 98 |
|
5005 | 99 |
structure TheoremsDataArgs = |
100 |
struct |
|
101 |
val name = "Pure/theorems"; |
|
3987 | 102 |
|
5005 | 103 |
type T = |
104 |
{space: NameSpace.T, |
|
6091 | 105 |
thms_tab: thm list Symtab.table, |
13274 | 106 |
index: FactIndex.T} ref; |
3987 | 107 |
|
4853 | 108 |
fun mk_empty _ = |
13274 | 109 |
ref {space = NameSpace.empty, thms_tab = Symtab.empty, index = FactIndex.empty}: T; |
3987 | 110 |
|
5005 | 111 |
val empty = mk_empty (); |
6547 | 112 |
fun copy (ref x) = ref x; |
5005 | 113 |
val prep_ext = mk_empty; |
114 |
val merge = mk_empty; |
|
115 |
||
13274 | 116 |
fun pretty sg (ref {space, thms_tab, index = _}) = |
4853 | 117 |
let |
10008 | 118 |
val prt_thm = Display.pretty_thm_sg sg; |
4853 | 119 |
fun prt_thms (name, [th]) = |
120 |
Pretty.block [Pretty.str (name ^ ":"), Pretty.brk 1, prt_thm th] |
|
121 |
| prt_thms (name, ths) = Pretty.big_list (name ^ ":") (map prt_thm ths); |
|
3987 | 122 |
|
6846 | 123 |
val thmss = NameSpace.cond_extern_table space thms_tab; |
9215 | 124 |
in Pretty.big_list "theorems:" (map prt_thms thmss) end; |
8720 | 125 |
|
9215 | 126 |
fun print sg data = Pretty.writeln (pretty sg data); |
3987 | 127 |
end; |
128 |
||
5005 | 129 |
structure TheoremsData = TheoryDataFun(TheoremsDataArgs); |
130 |
val get_theorems_sg = TheoremsData.get_sg; |
|
131 |
val get_theorems = TheoremsData.get; |
|
132 |
||
6367 | 133 |
val cond_extern_thm_sg = NameSpace.cond_extern o #space o ! o get_theorems_sg; |
134 |
||
3987 | 135 |
|
5000 | 136 |
(* print theory *) |
3987 | 137 |
|
5005 | 138 |
val print_theorems = TheoremsData.print; |
8720 | 139 |
|
5000 | 140 |
fun print_theory thy = |
9215 | 141 |
Display.pretty_full_theory thy @ |
142 |
[TheoremsDataArgs.pretty (Theory.sign_of thy) (get_theorems thy)] |
|
8720 | 143 |
|> Pretty.chunks |> Pretty.writeln; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
144 |
|
3987 | 145 |
|
146 |
||
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
147 |
(** retrieve theorems **) |
3987 | 148 |
|
15531 | 149 |
fun the_thms _ (SOME thms) = thms |
150 |
| the_thms name NONE = error ("Unknown theorem(s) " ^ quote name); |
|
4037 | 151 |
|
9564 | 152 |
fun single_thm _ [thm] = thm |
153 |
| single_thm name _ = error ("Single theorem expected " ^ quote name); |
|
154 |
||
15703 | 155 |
|
156 |
(* selections *) |
|
157 |
||
158 |
datatype interval = |
|
159 |
FromTo of int * int | |
|
160 |
From of int | |
|
161 |
Single of int; |
|
162 |
||
163 |
type thmref = xstring * interval list option; |
|
164 |
||
165 |
local |
|
166 |
||
167 |
fun interval _ (FromTo (i, j)) = i upto j |
|
168 |
| interval n (From i) = i upto n |
|
169 |
| interval _ (Single i) = [i]; |
|
170 |
||
171 |
fun select name thms n i = |
|
172 |
if i < 1 orelse i > n then |
|
173 |
error ("Bad subscript " ^ string_of_int i ^ " for " ^ |
|
174 |
quote name ^ " (length " ^ string_of_int n ^ ")") |
|
175 |
else List.nth (thms, i - 1); |
|
176 |
||
177 |
in |
|
178 |
||
179 |
fun select_thm (_, NONE) thms = thms |
|
180 |
| select_thm (name, SOME is) thms = |
|
181 |
let val n = length thms |
|
182 |
in map (select name thms n) (List.concat (map (interval n) is)) end; |
|
183 |
||
184 |
end; |
|
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
185 |
|
9564 | 186 |
|
9808 | 187 |
(* get_thm(s)_closure -- statically scoped versions *) |
9564 | 188 |
|
189 |
(*beware of proper order of evaluation!*) |
|
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
190 |
|
9564 | 191 |
fun lookup_thms thy = |
192 |
let |
|
193 |
val sg_ref = Sign.self_ref (Theory.sign_of thy); |
|
194 |
val ref {space, thms_tab, ...} = get_theorems thy; |
|
195 |
in |
|
196 |
fn name => |
|
15570 | 197 |
Option.map (map (Thm.transfer_sg (Sign.deref sg_ref))) (*semi-dynamic identity*) |
9564 | 198 |
(Symtab.lookup (thms_tab, NameSpace.intern space name)) (*static content*) |
199 |
end; |
|
3987 | 200 |
|
9564 | 201 |
fun get_thms_closure thy = |
202 |
let val closures = map lookup_thms (thy :: Theory.ancestors_of thy) |
|
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
203 |
in fn namei as (name, _) => select_thm namei |
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
204 |
(the_thms name (get_first (fn f => f name) closures)) |
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
205 |
end; |
9564 | 206 |
|
9808 | 207 |
fun get_thm_closure thy = |
208 |
let val get = get_thms_closure thy |
|
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
209 |
in fn namei as (name, _) => single_thm name (get namei) end; |
9808 | 210 |
|
9564 | 211 |
|
212 |
(* get_thm etc. *) |
|
213 |
||
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
214 |
fun get_thms theory (namei as (name, _)) = |
9564 | 215 |
get_first (fn thy => lookup_thms thy name) (theory :: Theory.ancestors_of theory) |
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
216 |
|> the_thms name |> select_thm namei |> map (Thm.transfer theory); |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
217 |
|
15570 | 218 |
fun get_thmss thy names = List.concat (map (get_thms thy) names); |
15456
956d6acacf89
Specific theorems in a named list of theorems can now be referred to
berghofe
parents:
15387
diff
changeset
|
219 |
fun get_thm thy (namei as (name, _)) = single_thm name (get_thms thy namei); |
4783 | 220 |
|
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
221 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
222 |
(* thms_of *) |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
223 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
224 |
fun thms_of thy = |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
225 |
let val ref {thms_tab, ...} = get_theorems thy in |
15570 | 226 |
map (fn th => (Thm.name_of_thm th, th)) (List.concat (map snd (Symtab.dest thms_tab))) |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
227 |
end; |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
228 |
|
3987 | 229 |
|
13274 | 230 |
(* thms_containing *) |
3987 | 231 |
|
13274 | 232 |
fun thms_containing thy idx = |
233 |
let |
|
234 |
fun valid (name, ths) = |
|
15531 | 235 |
(case try (transform_error (get_thms thy)) (name, NONE) of |
236 |
NONE => false |
|
237 |
| SOME ths' => Library.equal_lists Thm.eq_thm (ths, ths')); |
|
13274 | 238 |
in |
239 |
(thy :: Theory.ancestors_of thy) |
|
15570 | 240 |
|> map (gen_distinct eq_fst o List.filter valid o FactIndex.find idx o #index o ! o get_theorems) |
241 |
|> List.concat |
|
13274 | 242 |
end; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
243 |
|
13646 | 244 |
fun thms_containing_consts thy consts = |
15570 | 245 |
thms_containing thy (consts, []) |> map #2 |> List.concat |
13646 | 246 |
|> map (fn th => (Thm.name_of_thm th, th)) |
247 |
||
15703 | 248 |
|
13646 | 249 |
(* intro/elim theorems *) |
250 |
||
251 |
(* intro: given a goal state, find a suitable intro rule for some subgoal *) |
|
252 |
(* elim: given a theorem thm, |
|
253 |
find a theorem whose major premise eliminates the conclusion of thm *) |
|
254 |
||
15531 | 255 |
fun top_const t = (case head_of t of Const (c, _) => SOME c | _ => NONE); |
13646 | 256 |
|
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
257 |
(* This is a hack to remove the Trueprop constant that most logics use *) |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
258 |
fun rem_top (_ $ t) = t |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
259 |
| rem_top _ = Bound 0 (* does not match anything *) |
13646 | 260 |
|
261 |
(*returns all those named_thms whose subterm extracted by extract can be |
|
262 |
instantiated to obj; the list is sorted according to the number of premises |
|
263 |
and the size of the required substitution.*) |
|
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
264 |
fun select_match(c,obj, signobj, named_thms, (extract_thms,extract_term)) = |
13646 | 265 |
let val tsig = Sign.tsig_of signobj |
266 |
fun matches prop = |
|
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
267 |
let val pat = extract_term prop |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
268 |
in case head_of pat of |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
269 |
Const(d,_) => c=d andalso Pattern.matches tsig (pat,obj) |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
270 |
| _ => false |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
271 |
end |
13646 | 272 |
|
273 |
fun substsize prop = |
|
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
274 |
let val pat = extract_term prop |
13646 | 275 |
val (_,subst) = Pattern.match tsig (pat,obj) |
15797 | 276 |
in Vartab.foldl (op + o apsnd (size_of_term o snd o snd)) (0, subst) |
277 |
end |
|
13646 | 278 |
|
279 |
fun thm_ord ((p0,s0,_),(p1,s1,_)) = |
|
280 |
prod_ord (int_ord o pairself (fn 0 => 0 | x => 1)) int_ord ((p0,s0),(p1,s1)); |
|
281 |
||
282 |
fun select((p as (_,thm))::named_thms, sels) = |
|
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
283 |
let |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
284 |
fun sel(thm::thms,sels) = |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
285 |
let val {prop, ...} = rep_thm thm |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
286 |
in if matches prop |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
287 |
then (nprems_of thm,substsize prop,p)::sels |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
288 |
else sel(thms,sels) |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
289 |
end |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
290 |
| sel([],sels) = sels |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
291 |
val {sign, ...} = rep_thm thm |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
292 |
in select(named_thms,if Sign.subsig(sign, signobj) |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
293 |
then sel(extract_thms thm,sels) |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
294 |
else sels) |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
295 |
end |
13646 | 296 |
| select([],sels) = sels |
297 |
||
298 |
in map (fn (_,_,t) => t) (sort thm_ord (select(named_thms, []))) end; |
|
299 |
||
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
300 |
fun find_matching_thms extract thy prop = |
15531 | 301 |
(case top_const prop of NONE => [] |
302 |
| SOME c => let val thms = thms_containing_consts thy [c] |
|
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
303 |
in select_match(c,prop,Theory.sign_of thy,thms,extract) end) |
13646 | 304 |
|
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
305 |
val find_intros = |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
306 |
find_matching_thms (single, rem_top o Logic.strip_imp_concl) |
13646 | 307 |
|
13800
16136d2da0db
Moved find_intros_goal from goals.ML to pure_thy.ML
berghofe
parents:
13713
diff
changeset
|
308 |
fun find_intros_goal thy st i = |
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
309 |
find_intros thy (rem_top(Logic.concl_of_goal (prop_of st) i)); |
13800
16136d2da0db
Moved find_intros_goal from goals.ML to pure_thy.ML
berghofe
parents:
13713
diff
changeset
|
310 |
|
15387
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
311 |
val find_elims = find_matching_thms |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
312 |
(fn thm => if Thm.no_prems thm then [] else [thm], |
24aff9e3de3f
fixed bug in find functions that I introduced some time ago.
nipkow
parents:
14981
diff
changeset
|
313 |
rem_top o hd o Logic.strip_imp_prems) |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
314 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
315 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
316 |
(** store theorems **) (*DESTRUCTIVE*) |
3987 | 317 |
|
12695 | 318 |
(* hiding -- affects current theory node only! *) |
319 |
||
13424 | 320 |
fun hide_thms fully names thy = |
12695 | 321 |
let |
13274 | 322 |
val r as ref {space, thms_tab, index} = get_theorems thy; |
13424 | 323 |
val space' = NameSpace.hide fully (space, names); |
13274 | 324 |
in r := {space = space', thms_tab = thms_tab, index = index}; thy end; |
12695 | 325 |
|
326 |
||
4853 | 327 |
(* naming *) |
328 |
||
11998 | 329 |
fun gen_names j len name = |
330 |
map (fn i => name ^ "_" ^ string_of_int i) (j+1 upto j+len); |
|
4853 | 331 |
|
11998 | 332 |
fun name_multi name xs = gen_names 0 (length xs) name ~~ xs; |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
333 |
|
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
334 |
fun name_thm pre (p as (_, thm)) = |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
335 |
if Thm.name_of_thm thm <> "" andalso pre then thm else Thm.name_thm p; |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
336 |
|
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
337 |
fun name_thms pre name [x] = [name_thm pre (name, x)] |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
338 |
| name_thms pre name xs = map (name_thm pre) (name_multi name xs); |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
339 |
|
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
340 |
fun name_thmss name xs = (case filter_out (null o fst) xs of |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
341 |
[([x], z)] => [([name_thm true (name, x)], z)] |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
342 |
| _ => snd (foldl_map (fn (i, (ys, z)) => (i + length ys, |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
343 |
(map (name_thm true) (gen_names i (length ys) name ~~ ys), z))) (0, xs))); |
4853 | 344 |
|
345 |
||
11998 | 346 |
(* enter_thms *) |
4853 | 347 |
|
7470
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
348 |
fun warn_overwrite name = warning ("Replaced old copy of theorems " ^ quote name); |
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
349 |
fun warn_same name = warning ("Theorem database already contains a copy of " ^ quote name); |
3987 | 350 |
|
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
351 |
fun gen_enter_thms _ _ _ _ _ app_att thy ("", thms) = app_att (thy, thms) |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
352 |
| gen_enter_thms full acc sg pre_name post_name app_att thy (bname, thms) = |
7470
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
353 |
let |
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
354 |
val name = full sg bname; |
11998 | 355 |
val (thy', thms') = app_att (thy, pre_name name thms); |
356 |
val named_thms = post_name name thms'; |
|
3987 | 357 |
|
13274 | 358 |
val r as ref {space, thms_tab, index} = get_theorems_sg sg; |
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
359 |
val space' = NameSpace.extend' acc (space, [name]); |
7470
9f67ca1e03dc
eliminated default_name (thms no longer stored for name "");
wenzelm
parents:
7405
diff
changeset
|
360 |
val thms_tab' = Symtab.update ((name, named_thms), thms_tab); |
13274 | 361 |
val index' = FactIndex.add (K false) (index, (name, named_thms)); |
362 |
in |
|
363 |
(case Symtab.lookup (thms_tab, name) of |
|
15531 | 364 |
NONE => () |
365 |
| SOME thms' => |
|
13274 | 366 |
if Library.equal_lists Thm.eq_thm (thms', named_thms) then warn_same name |
367 |
else warn_overwrite name); |
|
368 |
r := {space = space', thms_tab = thms_tab', index = index'}; |
|
11998 | 369 |
(thy', named_thms) |
370 |
end; |
|
3987 | 371 |
|
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
372 |
fun enter_thms sg = gen_enter_thms Sign.full_name NameSpace.accesses sg; |
4853 | 373 |
|
6091 | 374 |
(* add_thms(s) *) |
4853 | 375 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
376 |
fun add_thms_atts pre_name ((bname, thms), atts) thy = |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
377 |
enter_thms (Theory.sign_of thy) pre_name (name_thms false) |
11998 | 378 |
(Thm.applys_attributes o rpair atts) thy (bname, thms); |
4853 | 379 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
380 |
fun gen_add_thmss pre_name args theory = |
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
381 |
foldl_map (fn (thy, arg) => add_thms_atts pre_name arg thy) (theory, args); |
5907 | 382 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
383 |
fun gen_add_thms pre_name args = |
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
384 |
apsnd (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args); |
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
385 |
|
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
386 |
val add_thmss = gen_add_thmss (name_thms true); |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
387 |
val add_thms = gen_add_thms (name_thms true); |
5907 | 388 |
|
389 |
||
14564 | 390 |
(* note_thmss(_i) *) |
5907 | 391 |
|
9192 | 392 |
local |
12711 | 393 |
|
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
394 |
fun gen_note_thss enter get kind_att (thy, ((bname, more_atts), ths_atts)) = |
12711 | 395 |
let |
396 |
fun app (x, (ths, atts)) = Thm.applys_attributes ((x, ths), atts); |
|
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
397 |
val (thy', thms) = enter (Theory.sign_of thy) |
15570 | 398 |
name_thmss (name_thms false) (apsnd List.concat o foldl_map app) thy |
12711 | 399 |
(bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind_att])) ths_atts); |
400 |
in (thy', (bname, thms)) end; |
|
401 |
||
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
402 |
fun gen_note_thmss enter get kind_att args thy = |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
403 |
foldl_map (gen_note_thss enter get kind_att) (thy, args); |
12711 | 404 |
|
9192 | 405 |
in |
12711 | 406 |
|
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
407 |
(* if path is set, only permit unqualified names *) |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
408 |
|
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
409 |
val note_thmss = gen_note_thmss enter_thms get_thms; |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
410 |
val note_thmss_i = gen_note_thmss enter_thms (K I); |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
411 |
|
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
412 |
(* always permit qualified names, |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
413 |
clients may specify non-standard access policy *) |
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
414 |
|
15696 | 415 |
fun note_thmss_accesses acc = |
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
416 |
gen_note_thmss (gen_enter_thms Sign.full_name' acc) get_thms; |
15696 | 417 |
fun note_thmss_accesses_i acc = |
15624
484178635bd8
Further work on interpretation commands. New command `interpret' for
ballarin
parents:
15570
diff
changeset
|
418 |
gen_note_thmss (gen_enter_thms Sign.full_name' acc) (K I); |
12711 | 419 |
|
9192 | 420 |
end; |
5280 | 421 |
|
422 |
||
6091 | 423 |
(* store_thm *) |
5280 | 424 |
|
11998 | 425 |
fun store_thm ((bname, thm), atts) thy = |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
426 |
let val (thy', [th']) = add_thms_atts (name_thms true) ((bname, [thm]), atts) thy |
5280 | 427 |
in (thy', th') end; |
3987 | 428 |
|
429 |
||
7405 | 430 |
(* smart_store_thms *) |
3987 | 431 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
432 |
fun gen_smart_store_thms _ (name, []) = |
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset
|
433 |
error ("Cannot store empty list of theorems: " ^ quote name) |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
434 |
| gen_smart_store_thms name_thm (name, [thm]) = |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
435 |
snd (enter_thms (Thm.sign_of_thm thm) (name_thm true) (name_thm false) |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
436 |
I () (name, [thm])) |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
437 |
| gen_smart_store_thms name_thm (name, thms) = |
7405 | 438 |
let |
439 |
val merge_sg = Sign.merge_refs o apsnd (Sign.self_ref o Thm.sign_of_thm); |
|
15570 | 440 |
val sg_ref = Library.foldl merge_sg (Sign.self_ref (Thm.sign_of_thm (hd thms)), tl thms); |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
441 |
in snd (enter_thms (Sign.deref sg_ref) (name_thm true) (name_thm false) |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
442 |
I () (name, thms)) |
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
443 |
end; |
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset
|
444 |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
445 |
val smart_store_thms = gen_smart_store_thms name_thms; |
12872
0855c3ab2047
Theorems are only "pre-named" if the do not already have names.
berghofe
parents:
12711
diff
changeset
|
446 |
val smart_store_thms_open = gen_smart_store_thms (K (K I)); |
3987 | 447 |
|
448 |
||
7899 | 449 |
(* forall_elim_vars (belongs to drule.ML) *) |
450 |
||
13713 | 451 |
(*Replace outermost quantified variable by Var of given index.*) |
7899 | 452 |
fun forall_elim_var i th = |
453 |
let val {prop,sign,...} = rep_thm th |
|
454 |
in case prop of |
|
13713 | 455 |
Const ("all", _) $ Abs (a, T, _) => |
456 |
let val used = map (fst o fst) |
|
15570 | 457 |
(List.filter (equal i o snd o fst) (Term.add_vars ([], prop))) |
13713 | 458 |
in forall_elim (cterm_of sign (Var ((variant used a, i), T))) th end |
459 |
| _ => raise THM ("forall_elim_var", i, [th]) |
|
7899 | 460 |
end; |
461 |
||
462 |
(*Repeat forall_elim_var until all outer quantifiers are removed*) |
|
463 |
fun forall_elim_vars i th = |
|
464 |
forall_elim_vars i (forall_elim_var i th) |
|
465 |
handle THM _ => th; |
|
466 |
||
467 |
||
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
468 |
(* store axioms as theorems *) |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
469 |
|
4853 | 470 |
local |
7899 | 471 |
fun get_axs thy named_axs = |
472 |
map (forall_elim_vars 0 o Thm.get_axiom thy o fst) named_axs; |
|
7753 | 473 |
|
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
474 |
fun add_single add (thy, ((name, ax), atts)) = |
4853 | 475 |
let |
11998 | 476 |
val named_ax = [(name, ax)]; |
7753 | 477 |
val thy' = add named_ax thy; |
478 |
val thm = hd (get_axs thy' named_ax); |
|
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
479 |
in apsnd hd (gen_add_thms (K I) [((name, thm), atts)] thy') end; |
7753 | 480 |
|
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
481 |
fun add_multi add (thy, ((name, axs), atts)) = |
7753 | 482 |
let |
483 |
val named_axs = name_multi name axs; |
|
4853 | 484 |
val thy' = add named_axs thy; |
7753 | 485 |
val thms = get_axs thy' named_axs; |
12235
5fa04fc9b254
Further restructuring of theorem naming functions.
berghofe
parents:
12138
diff
changeset
|
486 |
in apsnd hd (gen_add_thmss (K I) [((name, thms), atts)] thy') end; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
487 |
|
8419
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
488 |
fun add_singles add args thy = foldl_map (add_single add) (thy, args); |
4770b1a12a93
add_thms, add_axioms, add_defs: return theorems as well;
wenzelm
parents:
8039
diff
changeset
|
489 |
fun add_multis add args thy = foldl_map (add_multi add) (thy, args); |
4853 | 490 |
in |
7753 | 491 |
val add_axioms = add_singles Theory.add_axioms; |
492 |
val add_axioms_i = add_singles Theory.add_axioms_i; |
|
493 |
val add_axiomss = add_multis Theory.add_axioms; |
|
494 |
val add_axiomss_i = add_multis Theory.add_axioms_i; |
|
9318 | 495 |
val add_defs = add_singles o Theory.add_defs; |
496 |
val add_defs_i = add_singles o Theory.add_defs_i; |
|
497 |
val add_defss = add_multis o Theory.add_defs; |
|
498 |
val add_defss_i = add_multis o Theory.add_defs_i; |
|
4853 | 499 |
end; |
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
500 |
|
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
501 |
|
3987 | 502 |
|
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
503 |
(*** derived theory operations ***) |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
504 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
505 |
(** theory management **) |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
506 |
|
5005 | 507 |
(* data kind 'Pure/theory_management' *) |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
508 |
|
5005 | 509 |
structure TheoryManagementDataArgs = |
510 |
struct |
|
511 |
val name = "Pure/theory_management"; |
|
6660 | 512 |
type T = {name: string, version: int}; |
5000 | 513 |
|
6660 | 514 |
val empty = {name = "", version = 0}; |
6547 | 515 |
val copy = I; |
5005 | 516 |
val prep_ext = I; |
5000 | 517 |
fun merge _ = empty; |
5005 | 518 |
fun print _ _ = (); |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
519 |
end; |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
520 |
|
5005 | 521 |
structure TheoryManagementData = TheoryDataFun(TheoryManagementDataArgs); |
522 |
val get_info = TheoryManagementData.get; |
|
523 |
val put_info = TheoryManagementData.put; |
|
524 |
||
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
525 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
526 |
(* get / put name *) |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
527 |
|
5000 | 528 |
val get_name = #name o get_info; |
6660 | 529 |
fun put_name name = put_info {name = name, version = 0}; |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
530 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
531 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
532 |
(* control prefixing of theory name *) |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
533 |
|
5210 | 534 |
val global_path = Theory.root_path; |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
535 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
536 |
fun local_path thy = |
5210 | 537 |
thy |> Theory.root_path |> Theory.add_path (get_name thy); |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
538 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
539 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
540 |
(* begin / end theory *) |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
541 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
542 |
fun begin_theory name thys = |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
543 |
Theory.prep_ext_merge thys |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
544 |
|> put_name name |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
545 |
|> local_path; |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
546 |
|
12123 | 547 |
fun end_theory thy = |
548 |
thy |
|
549 |
|> Theory.add_name (get_name thy); |
|
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
550 |
|
6682 | 551 |
fun checkpoint thy = |
552 |
if is_draft thy then |
|
553 |
let val {name, version} = get_info thy in |
|
554 |
thy |
|
555 |
|> Theory.add_name (name ^ ":" ^ string_of_int version) |
|
556 |
|> put_info {name = name, version = version + 1} |
|
557 |
end |
|
558 |
else thy; |
|
5000 | 559 |
|
560 |
||
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
561 |
|
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
562 |
(** add logical types **) |
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
563 |
|
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
564 |
fun add_typedecls decls thy = |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
565 |
let |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
566 |
val full = Sign.full_name (Theory.sign_of thy); |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
567 |
|
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
568 |
fun type_of (raw_name, vs, mx) = |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
569 |
if null (duplicates vs) then (raw_name, length vs, mx) |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
570 |
else error ("Duplicate parameters in type declaration: " ^ quote raw_name); |
14854 | 571 |
in thy |> Theory.add_types (map type_of decls) end; |
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
572 |
|
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
573 |
|
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
574 |
|
5091 | 575 |
(*** the ProtoPure theory ***) |
3987 | 576 |
|
14669 | 577 |
|
578 |
(*It might make sense to restrict the polymorphism of the constant "==" to |
|
579 |
sort logic, instead of the universal sort, {}. Unfortunately, this change |
|
580 |
causes HOL/Import/shuffler.ML to fail.*) |
|
581 |
||
3987 | 582 |
val proto_pure = |
583 |
Theory.pre_pure |
|
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset
|
584 |
|> Library.apply [TheoremsData.init, TheoryManagementData.init, Proofterm.init] |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
585 |
|> put_name "ProtoPure" |
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
586 |
|> global_path |
3987 | 587 |
|> Theory.add_types |
4922
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
588 |
[("fun", 2, NoSyn), |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
589 |
("prop", 0, NoSyn), |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
590 |
("itself", 1, NoSyn), |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
591 |
("dummy", 0, NoSyn)] |
03b81b6e1baa
added thms_closure: theory -> xstring -> tthm list option;
wenzelm
parents:
4853
diff
changeset
|
592 |
|> Theory.add_nonterminals Syntax.pure_nonterms |
3987 | 593 |
|> Theory.add_syntax Syntax.pure_syntax |
15801 | 594 |
|> Theory.add_syntax Syntax.pure_appl_syntax |
6692 | 595 |
|> Theory.add_modesyntax (Symbol.xsymbolsN, true) Syntax.pure_xsym_syntax |
3987 | 596 |
|> Theory.add_syntax |
7949 | 597 |
[("==>", "[prop, prop] => prop", Delimfix "op ==>"), |
9534 | 598 |
(Term.dummy_patternN, "aprop", Delimfix "'_")] |
3987 | 599 |
|> Theory.add_consts |
14854 | 600 |
[("==", "['a, 'a] => prop", InfixrName ("==", 2)), |
3987 | 601 |
("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)), |
602 |
("all", "('a => prop) => prop", Binder ("!!", 0, 0)), |
|
10667 | 603 |
("Goal", "prop => prop", NoSyn), |
6547 | 604 |
("TYPE", "'a itself", NoSyn), |
9534 | 605 |
(Term.dummy_patternN, "'a", Delimfix "'_")] |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
13800
diff
changeset
|
606 |
|> Theory.add_finals_i false |
14854 | 607 |
[Const("==", [TFree ("'a", []), TFree ("'a", [])] ---> propT), |
608 |
Const("==>", [propT, propT] ---> propT), |
|
609 |
Const("all", (TFree("'a", []) --> propT) --> propT), |
|
610 |
Const("TYPE", a_itselfT)] |
|
5041
a1d0a6d555cd
Goals may now contain assumptions, which are not returned.
nipkow
parents:
5026
diff
changeset
|
611 |
|> Theory.add_modesyntax ("", false) |
12138
7cad58fbc866
renamed open_smart_store_thms to smart_store_thms_open;
wenzelm
parents:
12123
diff
changeset
|
612 |
(Syntax.pure_syntax_output @ Syntax.pure_appl_syntax) |
12250 | 613 |
|> Theory.add_trfuns Syntax.pure_trfuns |
614 |
|> Theory.add_trfunsT Syntax.pure_trfunsT |
|
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
615 |
|> local_path |
10667 | 616 |
|> (#1 oo (add_defs_i false o map Thm.no_attributes)) |
617 |
[("Goal_def", let val A = Free ("A", propT) in Logic.mk_equals (Logic.mk_goal A, A) end)] |
|
9238 | 618 |
|> (#1 o add_thmss [(("nothing", []), [])]) |
11516
a0633bdcd015
Added equality axioms and initialization of proof term package.
berghofe
parents:
10667
diff
changeset
|
619 |
|> Theory.add_axioms_i Proofterm.equality_axms |
4963
38aa2d56e28c
added get_name, put_name, global_path, local_path, begin_theory,
wenzelm
parents:
4933
diff
changeset
|
620 |
|> end_theory; |
3987 | 621 |
|
5091 | 622 |
structure ProtoPure = |
623 |
struct |
|
624 |
val thy = proto_pure; |
|
625 |
val Goal_def = get_axiom thy "Goal_def"; |
|
626 |
end; |
|
3987 | 627 |
|
628 |
||
629 |
end; |
|
630 |
||
631 |
||
4022
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
632 |
structure BasicPureThy: BASIC_PURE_THY = PureThy; |
0770a19c48d3
added ignored_consts, thms_containing, add_store_axioms(_i),
wenzelm
parents:
4013
diff
changeset
|
633 |
open BasicPureThy; |
15715 | 634 |