author | obua |
Sun, 29 May 2005 12:39:12 +0200 | |
changeset 16108 | cf468b93a02e |
parent 15747 | 00d637286a69 |
child 16113 | 692fe6595755 |
permissions | -rw-r--r-- |
1526 | 1 |
(* Title: Pure/theory.ML |
2 |
ID: $Id$ |
|
3 |
Author: Lawrence C Paulson and Markus Wenzel |
|
4 |
||
5025 | 5 |
The abstract type "theory" of theories. |
1526 | 6 |
*) |
7 |
||
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
8 |
signature BASIC_THEORY = |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
9 |
sig |
1526 | 10 |
type theory |
11 |
exception THEORY of string * theory list |
|
3996 | 12 |
val rep_theory: theory -> |
3814 | 13 |
{sign: Sign.sg, |
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
14 |
const_deps: Defs.graph, |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
15 |
final_consts: typ list Symtab.table, |
3996 | 16 |
axioms: term Symtab.table, |
4996 | 17 |
oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table, |
4019 | 18 |
parents: theory list, |
19 |
ancestors: theory list} |
|
3996 | 20 |
val sign_of: theory -> Sign.sg |
6188 | 21 |
val is_draft: theory -> bool |
3996 | 22 |
val syn_of: theory -> Syntax.syntax |
23 |
val parents_of: theory -> theory list |
|
4019 | 24 |
val ancestors_of: theory -> theory list |
3996 | 25 |
val subthy: theory * theory -> bool |
26 |
val eq_thy: theory * theory -> bool |
|
27 |
val cert_axm: Sign.sg -> string * term -> string * term |
|
6311 | 28 |
val read_def_axm: Sign.sg * (indexname -> typ option) * (indexname -> sort option) -> |
29 |
string list -> string * string -> string * term |
|
3996 | 30 |
val read_axm: Sign.sg -> string * string -> string * term |
31 |
val inferT_axm: Sign.sg -> string * term -> string * term |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
32 |
end |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
33 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
34 |
signature THEORY = |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
35 |
sig |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
36 |
include BASIC_THEORY |
3996 | 37 |
val axiomK: string |
38 |
val oracleK: string |
|
4912 | 39 |
(*theory extension primitives*) |
3996 | 40 |
val add_classes: (bclass * xclass list) list -> theory -> theory |
41 |
val add_classes_i: (bclass * class list) list -> theory -> theory |
|
42 |
val add_classrel: (xclass * xclass) list -> theory -> theory |
|
43 |
val add_classrel_i: (class * class) list -> theory -> theory |
|
8897 | 44 |
val add_defsort: string -> theory -> theory |
3996 | 45 |
val add_defsort_i: sort -> theory -> theory |
46 |
val add_types: (bstring * int * mixfix) list -> theory -> theory |
|
4846 | 47 |
val add_nonterminals: bstring list -> theory -> theory |
3996 | 48 |
val add_tyabbrs: (bstring * string list * string * mixfix) list |
1526 | 49 |
-> theory -> theory |
3996 | 50 |
val add_tyabbrs_i: (bstring * string list * typ * mixfix) list |
1526 | 51 |
-> theory -> theory |
8897 | 52 |
val add_arities: (xstring * string list * string) list -> theory -> theory |
3996 | 53 |
val add_arities_i: (string * sort list * sort) list -> theory -> theory |
54 |
val add_consts: (bstring * string * mixfix) list -> theory -> theory |
|
55 |
val add_consts_i: (bstring * typ * mixfix) list -> theory -> theory |
|
56 |
val add_syntax: (bstring * string * mixfix) list -> theory -> theory |
|
57 |
val add_syntax_i: (bstring * typ * mixfix) list -> theory -> theory |
|
58 |
val add_modesyntax: string * bool -> (bstring * string * mixfix) list -> theory -> theory |
|
59 |
val add_modesyntax_i: string * bool -> (bstring * typ * mixfix) list -> theory -> theory |
|
15747 | 60 |
val del_modesyntax: string * bool -> (bstring * string * mixfix) list -> theory -> theory |
61 |
val del_modesyntax_i: string * bool -> (bstring * typ * mixfix) list -> theory -> theory |
|
3996 | 62 |
val add_trfuns: |
4344 | 63 |
(string * (Syntax.ast list -> Syntax.ast)) list * |
64 |
(string * (term list -> term)) list * |
|
65 |
(string * (term list -> term)) list * |
|
66 |
(string * (Syntax.ast list -> Syntax.ast)) list -> theory -> theory |
|
3996 | 67 |
val add_trfunsT: |
4344 | 68 |
(string * (bool -> typ -> term list -> term)) list -> theory -> theory |
14645 | 69 |
val add_advanced_trfuns: |
70 |
(string * (Sign.sg -> Syntax.ast list -> Syntax.ast)) list * |
|
71 |
(string * (Sign.sg -> term list -> term)) list * |
|
72 |
(string * (Sign.sg -> term list -> term)) list * |
|
73 |
(string * (Sign.sg -> Syntax.ast list -> Syntax.ast)) list -> theory -> theory |
|
74 |
val add_advanced_trfunsT: |
|
75 |
(string * (Sign.sg -> bool -> typ -> term list -> term)) list -> theory -> theory |
|
2693 | 76 |
val add_tokentrfuns: |
6311 | 77 |
(string * string * (string -> string * real)) list -> theory -> theory |
78 |
val add_mode_tokentrfuns: string -> (string * (string -> string * real)) list |
|
79 |
-> theory -> theory |
|
4617 | 80 |
val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory |
3996 | 81 |
val add_trrules_i: Syntax.ast Syntax.trrule list -> theory -> theory |
82 |
val add_axioms: (bstring * string) list -> theory -> theory |
|
83 |
val add_axioms_i: (bstring * term) list -> theory -> theory |
|
4996 | 84 |
val add_oracle: bstring * (Sign.sg * Object.T -> term) -> theory -> theory |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
85 |
val add_finals: bool -> string list -> theory -> theory |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
86 |
val add_finals_i: bool -> term list -> theory -> theory |
9320 | 87 |
val add_defs: bool -> (bstring * string) list -> theory -> theory |
88 |
val add_defs_i: bool -> (bstring * term) list -> theory -> theory |
|
3996 | 89 |
val add_path: string -> theory -> theory |
4846 | 90 |
val parent_path: theory -> theory |
91 |
val root_path: theory -> theory |
|
11501 | 92 |
val absolute_path: theory -> theory |
12588 | 93 |
val hide_space: bool -> string * xstring list -> theory -> theory |
94 |
val hide_space_i: bool -> string * string list -> theory -> theory |
|
95 |
val hide_classes: bool -> string list -> theory -> theory |
|
96 |
val hide_types: bool -> string list -> theory -> theory |
|
97 |
val hide_consts: bool -> string list -> theory -> theory |
|
3996 | 98 |
val add_name: string -> theory -> theory |
5862 | 99 |
val copy: theory -> theory |
6661 | 100 |
val prep_ext: theory -> theory |
3996 | 101 |
val prep_ext_merge: theory list -> theory |
4970 | 102 |
val requires: theory -> string -> string -> unit |
6369 | 103 |
val assert_super: theory -> theory -> theory |
3996 | 104 |
val pre_pure: theory |
1526 | 105 |
end; |
106 |
||
6188 | 107 |
signature PRIVATE_THEORY = |
5642 | 108 |
sig |
109 |
include THEORY |
|
6546 | 110 |
val init_data: Object.kind -> (Object.T * (Object.T -> Object.T) * (Object.T -> Object.T) * |
12311 | 111 |
(Object.T * Object.T -> Object.T) * (Sign.sg -> Object.T -> unit)) -> theory -> theory |
5642 | 112 |
val print_data: Object.kind -> theory -> unit |
113 |
val get_data: Object.kind -> (Object.T -> 'a) -> theory -> 'a |
|
114 |
val put_data: Object.kind -> ('a -> Object.T) -> 'a -> theory -> theory |
|
115 |
end; |
|
1526 | 116 |
|
5642 | 117 |
|
6188 | 118 |
structure Theory: PRIVATE_THEORY = |
1526 | 119 |
struct |
2206 | 120 |
|
3996 | 121 |
|
2206 | 122 |
(** datatype theory **) |
1526 | 123 |
|
124 |
datatype theory = |
|
125 |
Theory of { |
|
126 |
sign: Sign.sg, |
|
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
127 |
const_deps: Defs.graph, |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
128 |
final_consts: typ list Symtab.table, |
3996 | 129 |
axioms: term Symtab.table, |
4996 | 130 |
oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table, |
4019 | 131 |
parents: theory list, |
132 |
ancestors: theory list}; |
|
1526 | 133 |
|
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
134 |
fun make_theory sign const_deps final_consts axioms oracles parents ancestors = |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
135 |
Theory {sign = sign, const_deps = const_deps, final_consts = final_consts, axioms = axioms, |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
136 |
oracles = oracles, parents = parents, ancestors = ancestors}; |
3996 | 137 |
|
1526 | 138 |
fun rep_theory (Theory args) = args; |
139 |
||
3996 | 140 |
val sign_of = #sign o rep_theory; |
6188 | 141 |
val is_draft = Sign.is_draft o sign_of; |
14645 | 142 |
val syn_of = Sign.syn_of o sign_of; |
3996 | 143 |
val parents_of = #parents o rep_theory; |
4019 | 144 |
val ancestors_of = #ancestors o rep_theory; |
3996 | 145 |
|
1526 | 146 |
(*errors involving theories*) |
147 |
exception THEORY of string * theory list; |
|
148 |
||
149 |
(*compare theories*) |
|
150 |
val subthy = Sign.subsig o pairself sign_of; |
|
151 |
val eq_thy = Sign.eq_sg o pairself sign_of; |
|
152 |
||
6369 | 153 |
(*check for some theory*) |
4970 | 154 |
fun requires thy name what = |
10930 | 155 |
if Sign.exists_stamp name (sign_of thy) then () |
4846 | 156 |
else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what); |
1526 | 157 |
|
6369 | 158 |
fun assert_super thy1 thy2 = |
159 |
if subthy (thy1, thy2) then thy2 |
|
160 |
else raise THEORY ("Not a super theory", [thy1, thy2]); |
|
161 |
||
4846 | 162 |
(*partial Pure theory*) |
9282
0181ac100520
Defs are now checked for circularity (if not overloaded).
nipkow
parents:
9280
diff
changeset
|
163 |
val pre_pure = |
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
164 |
make_theory Sign.pre_pure Defs.empty Symtab.empty Symtab.empty Symtab.empty [] []; |
1526 | 165 |
|
166 |
||
167 |
||
168 |
(** extend theory **) |
|
169 |
||
8725 | 170 |
(*name spaces*) |
3996 | 171 |
val axiomK = "axiom"; |
3814 | 172 |
val oracleK = "oracle"; |
173 |
||
174 |
||
175 |
(* extend logical part of a theory *) |
|
176 |
||
1526 | 177 |
fun err_dup_axms names = |
10494 | 178 |
error ("Duplicate axiom name(s): " ^ commas_quote names); |
1526 | 179 |
|
3814 | 180 |
fun err_dup_oras names = |
10494 | 181 |
error ("Duplicate oracles: " ^ commas_quote names); |
3814 | 182 |
|
9320 | 183 |
fun ext_theory thy ext_sg ext_deps new_axms new_oras = |
1526 | 184 |
let |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
185 |
val Theory {sign, const_deps, final_consts, axioms, oracles, parents, ancestors} = thy; |
1526 | 186 |
val draft = Sign.is_draft sign; |
3996 | 187 |
val axioms' = |
4488 | 188 |
Symtab.extend (if draft then axioms else Symtab.empty, new_axms) |
1526 | 189 |
handle Symtab.DUPS names => err_dup_axms names; |
3814 | 190 |
val oracles' = |
4488 | 191 |
Symtab.extend (oracles, new_oras) |
3814 | 192 |
handle Symtab.DUPS names => err_dup_oras names; |
4019 | 193 |
val (parents', ancestors') = |
194 |
if draft then (parents, ancestors) else ([thy], thy :: ancestors); |
|
1526 | 195 |
in |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
196 |
make_theory (ext_sg sign) (ext_deps const_deps) final_consts axioms' oracles' parents' ancestors' |
1526 | 197 |
end; |
198 |
||
199 |
||
200 |
(* extend signature of a theory *) |
|
201 |
||
9320 | 202 |
fun ext_sign extfun decls thy = ext_theory thy (extfun decls) I [] []; |
1526 | 203 |
|
14645 | 204 |
val add_classes = ext_sign Sign.add_classes; |
205 |
val add_classes_i = ext_sign Sign.add_classes_i; |
|
206 |
val add_classrel = ext_sign Sign.add_classrel; |
|
207 |
val add_classrel_i = ext_sign Sign.add_classrel_i; |
|
208 |
val add_defsort = ext_sign Sign.add_defsort; |
|
209 |
val add_defsort_i = ext_sign Sign.add_defsort_i; |
|
210 |
val add_types = ext_sign Sign.add_types; |
|
211 |
val add_nonterminals = ext_sign Sign.add_nonterminals; |
|
212 |
val add_tyabbrs = ext_sign Sign.add_tyabbrs; |
|
213 |
val add_tyabbrs_i = ext_sign Sign.add_tyabbrs_i; |
|
214 |
val add_arities = ext_sign Sign.add_arities; |
|
215 |
val add_arities_i = ext_sign Sign.add_arities_i; |
|
216 |
val add_consts = ext_sign Sign.add_consts; |
|
217 |
val add_consts_i = ext_sign Sign.add_consts_i; |
|
218 |
val add_syntax = ext_sign Sign.add_syntax; |
|
219 |
val add_syntax_i = ext_sign Sign.add_syntax_i; |
|
220 |
val add_modesyntax = curry (ext_sign Sign.add_modesyntax); |
|
221 |
val add_modesyntax_i = curry (ext_sign Sign.add_modesyntax_i); |
|
15747 | 222 |
val del_modesyntax = curry (ext_sign Sign.del_modesyntax); |
223 |
val del_modesyntax_i = curry (ext_sign Sign.del_modesyntax_i); |
|
14645 | 224 |
val add_trfuns = ext_sign Sign.add_trfuns; |
225 |
val add_trfunsT = ext_sign Sign.add_trfunsT; |
|
226 |
val add_advanced_trfuns = ext_sign Sign.add_advanced_trfuns; |
|
227 |
val add_advanced_trfunsT = ext_sign Sign.add_advanced_trfunsT; |
|
228 |
val add_tokentrfuns = ext_sign Sign.add_tokentrfuns; |
|
6311 | 229 |
fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f)); |
14645 | 230 |
val add_trrules = ext_sign Sign.add_trrules; |
231 |
val add_trrules_i = ext_sign Sign.add_trrules_i; |
|
232 |
val add_path = ext_sign Sign.add_path; |
|
233 |
val parent_path = add_path ".."; |
|
234 |
val root_path = add_path "/"; |
|
235 |
val absolute_path = add_path "//"; |
|
236 |
val add_space = ext_sign Sign.add_space; |
|
237 |
val hide_space = ext_sign o Sign.hide_space; |
|
238 |
val hide_space_i = ext_sign o Sign.hide_space_i; |
|
239 |
fun hide_classes b = curry (hide_space_i b) Sign.classK; |
|
240 |
fun hide_types b = curry (hide_space_i b) Sign.typeK; |
|
241 |
fun hide_consts b = curry (hide_space_i b) Sign.constK; |
|
242 |
val add_name = ext_sign Sign.add_name; |
|
243 |
val copy = ext_sign (K Sign.copy) (); |
|
244 |
val prep_ext = ext_sign (K Sign.prep_ext) (); |
|
3814 | 245 |
|
3996 | 246 |
|
6311 | 247 |
|
3814 | 248 |
(** add axioms **) |
249 |
||
1526 | 250 |
(* prepare axioms *) |
251 |
||
252 |
fun err_in_axm name = |
|
253 |
error ("The error(s) above occurred in axiom " ^ quote name); |
|
254 |
||
14184
2e0e02d68cbb
Changed no_vars such that it outputs list of illegal schematic variables.
berghofe
parents:
13646
diff
changeset
|
255 |
fun no_vars sg tm = (case (term_vars tm, term_tvars tm) of |
2e0e02d68cbb
Changed no_vars such that it outputs list of illegal schematic variables.
berghofe
parents:
13646
diff
changeset
|
256 |
([], []) => tm |
2e0e02d68cbb
Changed no_vars such that it outputs list of illegal schematic variables.
berghofe
parents:
13646
diff
changeset
|
257 |
| (ts, ixns) => error (Pretty.string_of (Pretty.block (Pretty.breaks |
2e0e02d68cbb
Changed no_vars such that it outputs list of illegal schematic variables.
berghofe
parents:
13646
diff
changeset
|
258 |
(Pretty.str "Illegal schematic variable(s) in term:" :: |
2e0e02d68cbb
Changed no_vars such that it outputs list of illegal schematic variables.
berghofe
parents:
13646
diff
changeset
|
259 |
map (Sign.pretty_term sg) ts @ |
2e0e02d68cbb
Changed no_vars such that it outputs list of illegal schematic variables.
berghofe
parents:
13646
diff
changeset
|
260 |
map (Sign.pretty_typ sg o TVar) ixns))))); |
1526 | 261 |
|
262 |
fun cert_axm sg (name, raw_tm) = |
|
263 |
let |
|
14828 | 264 |
val (t, T, _) = Sign.certify_term (Sign.pp sg) sg raw_tm |
2979 | 265 |
handle TYPE (msg, _, _) => error msg |
3996 | 266 |
| TERM (msg, _) => error msg; |
1526 | 267 |
in |
9537 | 268 |
Term.no_dummy_patterns t handle TERM (msg, _) => error msg; |
1526 | 269 |
assert (T = propT) "Term not of type prop"; |
14184
2e0e02d68cbb
Changed no_vars such that it outputs list of illegal schematic variables.
berghofe
parents:
13646
diff
changeset
|
270 |
(name, no_vars sg t) |
9629 | 271 |
end; |
1526 | 272 |
|
5057 | 273 |
(*some duplication of code with read_def_cterm*) |
6661 | 274 |
fun read_def_axm (sg, types, sorts) used (name, str) = |
3814 | 275 |
let |
14914 | 276 |
val ts = Syntax.read (Sign.is_logtype sg) (Sign.syn_of sg) propT str; |
14828 | 277 |
val (t, _) = Sign.infer_types (Sign.pp sg) sg types sorts used true (ts, propT); |
9320 | 278 |
in cert_axm sg (name, t) end |
1960
ae390b599213
Improved error handling: if there are syntax or type-checking
paulson
parents:
1539
diff
changeset
|
279 |
handle ERROR => err_in_axm name; |
1526 | 280 |
|
15531 | 281 |
fun read_axm sg name_str = read_def_axm (sg, K NONE, K NONE) [] name_str; |
5057 | 282 |
|
1526 | 283 |
fun inferT_axm sg (name, pre_tm) = |
14828 | 284 |
let val (t, _) = Sign.infer_types (Sign.pp sg) sg |
15531 | 285 |
(K NONE) (K NONE) [] true ([pre_tm], propT); |
14184
2e0e02d68cbb
Changed no_vars such that it outputs list of illegal schematic variables.
berghofe
parents:
13646
diff
changeset
|
286 |
in (name, no_vars sg t) end |
1526 | 287 |
handle ERROR => err_in_axm name; |
288 |
||
289 |
||
290 |
(* extend axioms of a theory *) |
|
291 |
||
3814 | 292 |
fun ext_axms prep_axm raw_axms (thy as Theory {sign, ...}) = |
1526 | 293 |
let |
3814 | 294 |
val raw_axms' = map (apfst (Sign.full_name sign)) raw_axms; |
295 |
val axioms = |
|
296 |
map (apsnd (Term.compress_term o Logic.varify) o prep_axm sign) raw_axms'; |
|
4996 | 297 |
val ext_sg = Sign.add_space (axiomK, map fst axioms); |
9320 | 298 |
in ext_theory thy ext_sg I axioms [] end; |
1526 | 299 |
|
300 |
val add_axioms = ext_axms read_axm; |
|
301 |
val add_axioms_i = ext_axms cert_axm; |
|
302 |
||
303 |
||
3814 | 304 |
(* add oracle **) |
305 |
||
306 |
fun add_oracle (raw_name, oracle) (thy as Theory {sign, ...}) = |
|
307 |
let |
|
308 |
val name = Sign.full_name sign raw_name; |
|
4996 | 309 |
val ext_sg = Sign.add_space (oracleK, [name]); |
9320 | 310 |
in ext_theory thy ext_sg I [] [(name, (oracle, stamp ()))] end; |
3814 | 311 |
|
312 |
||
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
313 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
314 |
(** add constant definitions **) |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
315 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
316 |
(* clash_types, clash_consts *) |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
317 |
|
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
318 |
(*check if types have common instance (ignoring sorts) |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
319 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
320 |
fun clash_types ty1 ty2 = |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
321 |
let |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
322 |
val ty1' = Type.varifyT ty1; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
323 |
val ty2' = incr_tvar (maxidx_of_typ ty1' + 1) (Type.varifyT ty2); |
9320 | 324 |
in Type.raw_unify (ty1', ty2') end; |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
325 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
326 |
fun clash_consts (c1, ty1) (c2, ty2) = |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
327 |
c1 = c2 andalso clash_types ty1 ty2; |
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
328 |
*) |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
329 |
|
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
330 |
(* clash_defns |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
331 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
332 |
fun clash_defn c_ty (name, tm) = |
14204 | 333 |
let val (c, ty') = dest_Const (head_of (fst (Logic.dest_equals (Logic.strip_imp_concl tm)))) in |
15531 | 334 |
if clash_consts c_ty (c, ty') then SOME (name, ty') else NONE |
335 |
end handle TERM _ => NONE; |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
336 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
337 |
fun clash_defns c_ty axms = |
15570 | 338 |
distinct (List.mapPartial (clash_defn c_ty) axms); |
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
339 |
*) |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
340 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
341 |
|
9320 | 342 |
(* overloading *) |
9280 | 343 |
|
9320 | 344 |
datatype overloading = NoOverloading | Useless | Plain; |
345 |
||
346 |
fun overloading sg declT defT = |
|
10403 | 347 |
let val T = Term.incr_tvar (maxidx_of_typ declT + 1) (Type.varifyT defT) in |
348 |
if Sign.typ_instance sg (declT, T) then NoOverloading |
|
14789 | 349 |
else if Sign.typ_instance sg (Type.strip_sorts declT, Type.strip_sorts T) then Useless |
9320 | 350 |
else Plain |
9280 | 351 |
end; |
352 |
||
353 |
||
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
354 |
(* dest_defn *) |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
355 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
356 |
fun dest_defn tm = |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
357 |
let |
3787
67571f49ebe3
new internal forms: add_classes_i, add_classrel_i, add_defsort_i, add_arities_i
wenzelm
parents:
3767
diff
changeset
|
358 |
fun err msg = raise TERM (msg, [tm]); |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
359 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
360 |
val (lhs, rhs) = Logic.dest_equals (Logic.strip_imp_concl tm) |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
361 |
handle TERM _ => err "Not a meta-equality (==)"; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
362 |
val (head, args) = strip_comb lhs; |
9320 | 363 |
val c_ty as (c, ty) = dest_Const head |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
364 |
handle TERM _ => err "Head of lhs not a constant"; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
365 |
|
4141 | 366 |
fun dest_free (Free (x, _)) = x |
367 |
| dest_free (Const ("TYPE", Type ("itself", [TFree (x, _)]))) = x |
|
368 |
| dest_free _ = raise Match; |
|
369 |
||
370 |
val show_frees = commas_quote o map dest_free; |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
371 |
val show_tfrees = commas_quote o map fst; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
372 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
373 |
val lhs_dups = duplicates args; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
374 |
val rhs_extras = gen_rems (op =) (term_frees rhs, args); |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
375 |
val rhs_extrasT = gen_rems (op =) (term_tfrees rhs, typ_tfrees ty); |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
376 |
in |
4141 | 377 |
if not (forall (can dest_free) args) then |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
378 |
err "Arguments (on lhs) must be variables" |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
379 |
else if not (null lhs_dups) then |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
380 |
err ("Duplicate variables on lhs: " ^ show_frees lhs_dups) |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
381 |
else if not (null rhs_extras) then |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
382 |
err ("Extra variables on rhs: " ^ show_frees rhs_extras) |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
383 |
else if not (null rhs_extrasT) then |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
384 |
err ("Extra type variables on rhs: " ^ show_tfrees rhs_extrasT) |
9282
0181ac100520
Defs are now checked for circularity (if not overloaded).
nipkow
parents:
9280
diff
changeset
|
385 |
else if exists_Const (fn c_ty' => c_ty' = c_ty) rhs then |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
386 |
err ("Constant to be defined occurs on rhs") |
9320 | 387 |
else (c_ty, rhs) |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
388 |
end; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
389 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
390 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
391 |
(* check_defn *) |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
392 |
|
3814 | 393 |
fun err_in_defn sg name msg = |
9320 | 394 |
(error_msg msg; |
395 |
error ("The error(s) above occurred in definition " ^ quote (Sign.full_name sg name))); |
|
396 |
||
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
397 |
fun pretty_const sg (c, ty) = [Pretty.str c, Pretty.str " ::", Pretty.quote (Sign.pretty_typ sg (#1 (Type.freeze_thaw_type ty)))]; |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
398 |
|
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
399 |
fun cycle_msg sg namess = Pretty.string_of (Pretty.block (((Pretty.str "cyclic dependency found: ") :: Pretty.fbrk :: ( |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
400 |
let |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
401 |
fun f last (ty, constname, defname) = |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
402 |
(pretty_const sg (constname, ty)) @ (if last then [] else [Pretty.str (" depends via "^ quote defname^ " on ")]) |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
403 |
|
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
404 |
in |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
405 |
foldr (fn (x,r) => (f (r=[]) x)@[Pretty.fbrk]@r) [] namess |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
406 |
end)))) |
9320 | 407 |
|
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
408 |
fun check_defn sg overloaded final_consts ((deps, axms), def as (name, tm)) = |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
409 |
let |
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
410 |
|
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
411 |
val name = Sign.full_name sg name |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
412 |
|
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
413 |
fun is_final (c, ty) = |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
414 |
case Symtab.lookup(final_consts,c) of |
15531 | 415 |
SOME [] => true |
416 |
| SOME tys => exists (curry (Sign.typ_instance sg) ty) tys |
|
417 |
| NONE => false; |
|
9320 | 418 |
|
10494 | 419 |
fun pretty_const (c, ty) = [Pretty.str c, Pretty.str " ::", Pretty.brk 1, |
420 |
Pretty.quote (Sign.pretty_typ sg (#1 (Type.freeze_thaw_type ty)))]; |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
421 |
|
10494 | 422 |
fun def_txt (c_ty, txt) = Pretty.block |
423 |
(Pretty.str "Definition of " :: pretty_const c_ty @ |
|
424 |
(if txt = "" then [] else [Pretty.str txt])); |
|
425 |
||
426 |
fun show_defn c (dfn, ty') = Pretty.block |
|
427 |
(Pretty.str " " :: pretty_const (c, ty') @ [Pretty.str " in ", Pretty.str dfn]); |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
428 |
|
9320 | 429 |
val (c_ty as (c, ty), rhs) = dest_defn tm |
9280 | 430 |
handle TERM (msg, _) => err_in_defn sg name msg; |
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
431 |
|
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
432 |
fun decl deps c = |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
433 |
(case Sign.const_type sg c of |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
434 |
SOME T => (Defs.declare deps c T handle _ => deps, T) |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
435 |
| NONE => err_in_defn sg name ("Undeclared constant " ^ quote c)); |
9320 | 436 |
|
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
437 |
val (deps, c_decl) = decl deps c |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
438 |
|
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
439 |
val body = Term.term_constsT rhs |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
440 |
val deps = foldl (fn ((c, _), deps) => fst (decl deps c)) deps body |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
441 |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
442 |
in |
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
443 |
if is_final c_ty then |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
444 |
err_in_defn sg name (Pretty.string_of (Pretty.block |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
445 |
([Pretty.str "The constant",Pretty.brk 1] @ |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
446 |
pretty_const c_ty @ |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
447 |
[Pretty.brk 1,Pretty.str "has been declared final"]))) |
9320 | 448 |
else |
449 |
(case overloading sg c_decl ty of |
|
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
450 |
Useless => |
10494 | 451 |
err_in_defn sg name (Pretty.string_of (Pretty.chunks |
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
452 |
[Library.setmp show_sorts true def_txt (c_ty, ""), Pretty.str |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
453 |
"imposes additional sort constraints on the declared type of the constant"])) |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
454 |
| ov => |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
455 |
let |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
456 |
val deps' = Defs.define deps c ty name body |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
457 |
handle Defs.DEFS s => err_in_defn sg name ("DEFS: "^s) |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
458 |
| Defs.CIRCULAR s => err_in_defn sg name (cycle_msg sg s) |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
459 |
| Defs.CLASH (_, def1, def2) => err_in_defn sg name ( |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
460 |
"clashing definitions "^ quote def1 ^" and "^ quote def2) |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
461 |
in |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
462 |
((if ov = Plain andalso not overloaded then |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
463 |
warning (Pretty.string_of (Pretty.chunks |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
464 |
[def_txt (c_ty, ""), Pretty.str ("is strictly less general than the declared type (see " ^ quote name ^ ")")])) |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
465 |
else |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
466 |
()); (deps', def::axms)) |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
467 |
end) |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
468 |
end; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
469 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
470 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
471 |
(* add_defs *) |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
472 |
|
9320 | 473 |
fun ext_defns prep_axm overloaded raw_axms thy = |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
474 |
let |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
475 |
val Theory {sign, const_deps, final_consts, axioms, oracles, parents, ancestors} = thy; |
15570 | 476 |
val all_axioms = List.concat (map (Symtab.dest o #axioms o rep_theory) (thy :: ancestors)); |
9320 | 477 |
|
478 |
val axms = map (prep_axm sign) raw_axms; |
|
15570 | 479 |
val (const_deps', _) = Library.foldl (check_defn sign overloaded final_consts) ((const_deps, all_axioms), axms); |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
480 |
in |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
481 |
make_theory sign const_deps' final_consts axioms oracles parents ancestors |
9320 | 482 |
|> add_axioms_i axms |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
483 |
end; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
484 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
485 |
val add_defs_i = ext_defns cert_axm; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
486 |
val add_defs = ext_defns read_axm; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
487 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
488 |
|
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
489 |
(* add_finals *) |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
490 |
|
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
491 |
fun ext_finals prep_term overloaded raw_terms thy = |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
492 |
let |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
493 |
val Theory {sign, const_deps, final_consts, axioms, oracles, parents, ancestors} = thy; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
494 |
fun mk_final (finals,tm) = |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
495 |
let |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
496 |
fun err msg = raise TERM(msg,[tm]); |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
497 |
val (c,ty) = dest_Const tm |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
498 |
handle TERM _ => err "Can only make constants final"; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
499 |
val c_decl = |
15531 | 500 |
(case Sign.const_type sign c of SOME T => T |
501 |
| NONE => err ("Undeclared constant " ^ quote c)); |
|
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
502 |
val simple = |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
503 |
case overloading sign c_decl ty of |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
504 |
NoOverloading => true |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
505 |
| Useless => err "Sort restrictions too strong" |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
506 |
| Plain => if overloaded then false |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
507 |
else err "Type is more general than declared"; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
508 |
val typ_instance = Sign.typ_instance sign; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
509 |
in |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
510 |
if simple then |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
511 |
(case Symtab.lookup(finals,c) of |
15531 | 512 |
SOME [] => err "Constant already final" |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
513 |
| _ => Symtab.update((c,[]),finals)) |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
514 |
else |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
515 |
(case Symtab.lookup(finals,c) of |
15531 | 516 |
SOME [] => err "Constant already completely final" |
517 |
| SOME tys => if exists (curry typ_instance ty) tys |
|
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
518 |
then err "Instance of constant is already final" |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
519 |
else Symtab.update((c,ty::gen_rem typ_instance (tys,ty)),finals) |
15531 | 520 |
| NONE => Symtab.update((c,[ty]),finals)) |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
521 |
end; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
522 |
val consts = map (prep_term sign) raw_terms; |
15570 | 523 |
val final_consts' = Library.foldl mk_final (final_consts,consts); |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
524 |
in |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
525 |
make_theory sign const_deps final_consts' axioms oracles parents ancestors |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
526 |
end; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
527 |
|
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
528 |
local |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
529 |
fun read_term sg = Sign.simple_read_term sg TypeInfer.logicT; |
14828 | 530 |
fun cert_term sg = #1 o Sign.certify_term (Sign.pp sg) sg; |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
531 |
in |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
532 |
val add_finals = ext_finals read_term; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
533 |
val add_finals_i = ext_finals cert_term; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
534 |
end; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
535 |
|
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
536 |
fun merge_final sg = |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
537 |
let |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
538 |
fun merge_single (tys,ty) = |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
539 |
if exists (curry (Sign.typ_instance sg) ty) tys |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
540 |
then tys |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
541 |
else (ty::gen_rem (Sign.typ_instance sg) (tys,ty)); |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
542 |
fun merge ([],_) = [] |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
543 |
| merge (_,[]) = [] |
15570 | 544 |
| merge input = Library.foldl merge_single input; |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
545 |
in |
15531 | 546 |
SOME o merge |
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
547 |
end; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
548 |
|
3878 | 549 |
|
3865 | 550 |
(** additional theory data **) |
551 |
||
4996 | 552 |
val init_data = curry (ext_sign Sign.init_data); |
553 |
fun print_data kind = Sign.print_data kind o sign_of; |
|
554 |
fun get_data kind f = Sign.get_data kind f o sign_of; |
|
555 |
fun put_data kind f = ext_sign (Sign.put_data kind f); |
|
3865 | 556 |
|
557 |
||
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
558 |
|
6661 | 559 |
(** merge theories **) (*exception ERROR*) |
4019 | 560 |
|
3878 | 561 |
(*merge list of theories from left to right, preparing extend*) |
3967
edd5ff9371f8
sg_ref: automatic adjustment of thms of draft theories;
wenzelm
parents:
3956
diff
changeset
|
562 |
fun prep_ext_merge thys = |
15703 | 563 |
let |
564 |
val sign' = Sign.prep_ext_merge (map sign_of thys) |
|
3814 | 565 |
|
15703 | 566 |
val depss = map (#const_deps o rep_theory) thys; |
16108
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
567 |
val deps' = foldl (uncurry Defs.merge) (hd depss) (tl depss) |
cf468b93a02e
Implement cycle-free overloading, so that definitions cannot harm consistency any more (except of course via interaction with axioms).
obua
parents:
15747
diff
changeset
|
568 |
handle Defs.CIRCULAR namess => error (cycle_msg sign' namess); |
15703 | 569 |
|
570 |
val final_constss = map (#final_consts o rep_theory) thys; |
|
571 |
val final_consts' = |
|
572 |
Library.foldl (Symtab.join (merge_final sign')) (hd final_constss, tl final_constss); |
|
573 |
val axioms' = Symtab.empty; |
|
9282
0181ac100520
Defs are now checked for circularity (if not overloaded).
nipkow
parents:
9280
diff
changeset
|
574 |
|
15703 | 575 |
fun eq_ora ((_, (_, s1: stamp)), (_, (_, s2))) = s1 = s2; |
576 |
val oracles' = |
|
577 |
Symtab.make (gen_distinct eq_ora |
|
578 |
(List.concat (map (Symtab.dest o #oracles o rep_theory) thys))) |
|
579 |
handle Symtab.DUPS names => err_dup_oras names; |
|
4019 | 580 |
|
15703 | 581 |
val parents' = gen_distinct eq_thy thys; |
582 |
val ancestors' = |
|
583 |
gen_distinct eq_thy (parents' @ List.concat (map ancestors_of thys)); |
|
584 |
in |
|
585 |
make_theory sign' deps' final_consts' axioms' oracles' parents' ancestors' |
|
586 |
end; |
|
1526 | 587 |
|
3885 | 588 |
|
1526 | 589 |
end; |
590 |
||
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
591 |
structure BasicTheory: BASIC_THEORY = Theory; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
592 |
open BasicTheory; |
15716 | 593 |