author | obua |
Tue, 07 Jun 2005 20:04:41 +0200 | |
changeset 16313 | 79b37d5e50b1 |
parent 16291 | ea4e64b2f25a |
child 16339 | b02b6da609c3 |
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 |
*) |
16291 | 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, |
16291 | 14 |
defs: Defs.graph, |
3996 | 15 |
axioms: term Symtab.table, |
4996 | 16 |
oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table, |
4019 | 17 |
parents: theory list, |
18 |
ancestors: theory list} |
|
3996 | 19 |
val sign_of: theory -> Sign.sg |
6188 | 20 |
val is_draft: theory -> bool |
3996 | 21 |
val syn_of: theory -> Syntax.syntax |
22 |
val parents_of: theory -> theory list |
|
4019 | 23 |
val ancestors_of: theory -> theory list |
3996 | 24 |
val subthy: theory * theory -> bool |
25 |
val eq_thy: theory * theory -> bool |
|
26 |
val cert_axm: Sign.sg -> string * term -> string * term |
|
6311 | 27 |
val read_def_axm: Sign.sg * (indexname -> typ option) * (indexname -> sort option) -> |
28 |
string list -> string * string -> string * term |
|
3996 | 29 |
val read_axm: Sign.sg -> string * string -> string * term |
30 |
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
|
31 |
end |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
32 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
33 |
signature THEORY = |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
34 |
sig |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
35 |
include BASIC_THEORY |
3996 | 36 |
val axiomK: string |
37 |
val oracleK: string |
|
4912 | 38 |
(*theory extension primitives*) |
3996 | 39 |
val add_classes: (bclass * xclass list) list -> theory -> theory |
40 |
val add_classes_i: (bclass * class list) list -> theory -> theory |
|
41 |
val add_classrel: (xclass * xclass) list -> theory -> theory |
|
42 |
val add_classrel_i: (class * class) list -> theory -> theory |
|
8897 | 43 |
val add_defsort: string -> theory -> theory |
3996 | 44 |
val add_defsort_i: sort -> theory -> theory |
45 |
val add_types: (bstring * int * mixfix) list -> theory -> theory |
|
4846 | 46 |
val add_nonterminals: bstring list -> theory -> theory |
3996 | 47 |
val add_tyabbrs: (bstring * string list * string * mixfix) list |
1526 | 48 |
-> theory -> theory |
3996 | 49 |
val add_tyabbrs_i: (bstring * string list * typ * mixfix) list |
1526 | 50 |
-> theory -> theory |
8897 | 51 |
val add_arities: (xstring * string list * string) list -> theory -> theory |
3996 | 52 |
val add_arities_i: (string * sort list * sort) list -> theory -> theory |
53 |
val add_consts: (bstring * string * mixfix) list -> theory -> theory |
|
54 |
val add_consts_i: (bstring * typ * mixfix) list -> theory -> theory |
|
55 |
val add_syntax: (bstring * string * mixfix) list -> theory -> theory |
|
56 |
val add_syntax_i: (bstring * typ * mixfix) list -> theory -> theory |
|
57 |
val add_modesyntax: string * bool -> (bstring * string * mixfix) list -> theory -> theory |
|
58 |
val add_modesyntax_i: string * bool -> (bstring * typ * mixfix) list -> theory -> theory |
|
15747 | 59 |
val del_modesyntax: string * bool -> (bstring * string * mixfix) list -> theory -> theory |
60 |
val del_modesyntax_i: string * bool -> (bstring * typ * mixfix) list -> theory -> theory |
|
3996 | 61 |
val add_trfuns: |
4344 | 62 |
(string * (Syntax.ast list -> Syntax.ast)) list * |
63 |
(string * (term list -> term)) list * |
|
64 |
(string * (term list -> term)) list * |
|
65 |
(string * (Syntax.ast list -> Syntax.ast)) list -> theory -> theory |
|
3996 | 66 |
val add_trfunsT: |
4344 | 67 |
(string * (bool -> typ -> term list -> term)) list -> theory -> theory |
14645 | 68 |
val add_advanced_trfuns: |
69 |
(string * (Sign.sg -> Syntax.ast list -> Syntax.ast)) list * |
|
70 |
(string * (Sign.sg -> term list -> term)) list * |
|
71 |
(string * (Sign.sg -> term list -> term)) list * |
|
72 |
(string * (Sign.sg -> Syntax.ast list -> Syntax.ast)) list -> theory -> theory |
|
73 |
val add_advanced_trfunsT: |
|
74 |
(string * (Sign.sg -> bool -> typ -> term list -> term)) list -> theory -> theory |
|
2693 | 75 |
val add_tokentrfuns: |
6311 | 76 |
(string * string * (string -> string * real)) list -> theory -> theory |
77 |
val add_mode_tokentrfuns: string -> (string * (string -> string * real)) list |
|
78 |
-> theory -> theory |
|
4617 | 79 |
val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory |
3996 | 80 |
val add_trrules_i: Syntax.ast Syntax.trrule list -> theory -> theory |
81 |
val add_axioms: (bstring * string) list -> theory -> theory |
|
82 |
val add_axioms_i: (bstring * term) list -> theory -> theory |
|
4996 | 83 |
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
|
84 |
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
|
85 |
val add_finals_i: bool -> term list -> theory -> theory |
9320 | 86 |
val add_defs: bool -> (bstring * string) list -> theory -> theory |
87 |
val add_defs_i: bool -> (bstring * term) list -> theory -> theory |
|
3996 | 88 |
val add_path: string -> theory -> theory |
4846 | 89 |
val parent_path: theory -> theory |
90 |
val root_path: theory -> theory |
|
11501 | 91 |
val absolute_path: theory -> theory |
16134
89ea482e1649
added qualified_names, no_base_names, custom_accesses, set_policy, restore_naming;
wenzelm
parents:
16113
diff
changeset
|
92 |
val qualified_names: theory -> theory |
89ea482e1649
added qualified_names, no_base_names, custom_accesses, set_policy, restore_naming;
wenzelm
parents:
16113
diff
changeset
|
93 |
val no_base_names: theory -> theory |
89ea482e1649
added qualified_names, no_base_names, custom_accesses, set_policy, restore_naming;
wenzelm
parents:
16113
diff
changeset
|
94 |
val custom_accesses: (string list -> string list list) -> theory -> theory |
89ea482e1649
added qualified_names, no_base_names, custom_accesses, set_policy, restore_naming;
wenzelm
parents:
16113
diff
changeset
|
95 |
val set_policy: (string -> bstring -> string) * (string list -> string list list) -> |
89ea482e1649
added qualified_names, no_base_names, custom_accesses, set_policy, restore_naming;
wenzelm
parents:
16113
diff
changeset
|
96 |
theory -> theory |
89ea482e1649
added qualified_names, no_base_names, custom_accesses, set_policy, restore_naming;
wenzelm
parents:
16113
diff
changeset
|
97 |
val restore_naming: theory -> theory -> theory |
12588 | 98 |
val hide_space: bool -> string * xstring list -> theory -> theory |
99 |
val hide_space_i: bool -> string * string list -> theory -> theory |
|
100 |
val hide_classes: bool -> string list -> theory -> theory |
|
101 |
val hide_types: bool -> string list -> theory -> theory |
|
102 |
val hide_consts: bool -> string list -> theory -> theory |
|
3996 | 103 |
val add_name: string -> theory -> theory |
5862 | 104 |
val copy: theory -> theory |
6661 | 105 |
val prep_ext: theory -> theory |
3996 | 106 |
val prep_ext_merge: theory list -> theory |
4970 | 107 |
val requires: theory -> string -> string -> unit |
6369 | 108 |
val assert_super: theory -> theory -> theory |
3996 | 109 |
val pre_pure: theory |
1526 | 110 |
end; |
111 |
||
6188 | 112 |
signature PRIVATE_THEORY = |
5642 | 113 |
sig |
114 |
include THEORY |
|
6546 | 115 |
val init_data: Object.kind -> (Object.T * (Object.T -> Object.T) * (Object.T -> Object.T) * |
12311 | 116 |
(Object.T * Object.T -> Object.T) * (Sign.sg -> Object.T -> unit)) -> theory -> theory |
5642 | 117 |
val print_data: Object.kind -> theory -> unit |
118 |
val get_data: Object.kind -> (Object.T -> 'a) -> theory -> 'a |
|
119 |
val put_data: Object.kind -> ('a -> Object.T) -> 'a -> theory -> theory |
|
120 |
end; |
|
1526 | 121 |
|
6188 | 122 |
structure Theory: PRIVATE_THEORY = |
1526 | 123 |
struct |
2206 | 124 |
|
3996 | 125 |
|
2206 | 126 |
(** datatype theory **) |
1526 | 127 |
|
128 |
datatype theory = |
|
129 |
Theory of { |
|
130 |
sign: Sign.sg, |
|
16291 | 131 |
defs: Defs.graph, |
3996 | 132 |
axioms: term Symtab.table, |
4996 | 133 |
oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table, |
4019 | 134 |
parents: theory list, |
135 |
ancestors: theory list}; |
|
1526 | 136 |
|
16291 | 137 |
fun make_theory sign defs axioms oracles parents ancestors = |
138 |
Theory {sign = sign, defs = defs, axioms = axioms, |
|
16190 | 139 |
oracles = oracles, parents = parents, ancestors = ancestors}; |
3996 | 140 |
|
1526 | 141 |
fun rep_theory (Theory args) = args; |
142 |
||
3996 | 143 |
val sign_of = #sign o rep_theory; |
6188 | 144 |
val is_draft = Sign.is_draft o sign_of; |
14645 | 145 |
val syn_of = Sign.syn_of o sign_of; |
3996 | 146 |
val parents_of = #parents o rep_theory; |
4019 | 147 |
val ancestors_of = #ancestors o rep_theory; |
3996 | 148 |
|
1526 | 149 |
(*errors involving theories*) |
150 |
exception THEORY of string * theory list; |
|
151 |
||
152 |
(*compare theories*) |
|
153 |
val subthy = Sign.subsig o pairself sign_of; |
|
154 |
val eq_thy = Sign.eq_sg o pairself sign_of; |
|
155 |
||
6369 | 156 |
(*check for some theory*) |
4970 | 157 |
fun requires thy name what = |
10930 | 158 |
if Sign.exists_stamp name (sign_of thy) then () |
4846 | 159 |
else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what); |
1526 | 160 |
|
6369 | 161 |
fun assert_super thy1 thy2 = |
162 |
if subthy (thy1, thy2) then thy2 |
|
163 |
else raise THEORY ("Not a super theory", [thy1, thy2]); |
|
164 |
||
4846 | 165 |
(*partial Pure theory*) |
9282
0181ac100520
Defs are now checked for circularity (if not overloaded).
nipkow
parents:
9280
diff
changeset
|
166 |
val pre_pure = |
16158
2c3565b74b7a
Removed final_consts from theory data. Now const_deps deals with final
obua
parents:
16134
diff
changeset
|
167 |
make_theory Sign.pre_pure Defs.empty Symtab.empty Symtab.empty [] []; |
1526 | 168 |
|
169 |
||
170 |
||
171 |
(** extend theory **) |
|
172 |
||
8725 | 173 |
(*name spaces*) |
3996 | 174 |
val axiomK = "axiom"; |
3814 | 175 |
val oracleK = "oracle"; |
176 |
||
177 |
||
178 |
(* extend logical part of a theory *) |
|
179 |
||
1526 | 180 |
fun err_dup_axms names = |
10494 | 181 |
error ("Duplicate axiom name(s): " ^ commas_quote names); |
1526 | 182 |
|
3814 | 183 |
fun err_dup_oras names = |
10494 | 184 |
error ("Duplicate oracles: " ^ commas_quote names); |
3814 | 185 |
|
16158
2c3565b74b7a
Removed final_consts from theory data. Now const_deps deals with final
obua
parents:
16134
diff
changeset
|
186 |
fun ext_theory thy ext_sg new_axms new_oras = |
1526 | 187 |
let |
16291 | 188 |
val Theory {sign, defs, axioms, oracles, parents, ancestors} = thy; |
189 |
val draft = Sign.is_draft sign; |
|
190 |
val axioms' = Symtab.extend (if draft then axioms else Symtab.empty, new_axms) |
|
191 |
handle Symtab.DUPS names => err_dup_axms names; |
|
192 |
val oracles' = Symtab.extend (oracles, new_oras) |
|
193 |
handle Symtab.DUPS names => err_dup_oras names; |
|
4019 | 194 |
val (parents', ancestors') = |
16291 | 195 |
if draft then (parents, ancestors) else ([thy], thy :: ancestors); |
196 |
in make_theory (ext_sg sign) defs axioms' oracles' parents' ancestors' end; |
|
1526 | 197 |
|
198 |
||
199 |
(* extend signature of a theory *) |
|
200 |
||
16158
2c3565b74b7a
Removed final_consts from theory data. Now const_deps deals with final
obua
parents:
16134
diff
changeset
|
201 |
fun ext_sign ext_sg args thy = ext_theory thy (ext_sg args) [] []; |
1526 | 202 |
|
14645 | 203 |
val add_classes = ext_sign Sign.add_classes; |
204 |
val add_classes_i = ext_sign Sign.add_classes_i; |
|
205 |
val add_classrel = ext_sign Sign.add_classrel; |
|
206 |
val add_classrel_i = ext_sign Sign.add_classrel_i; |
|
207 |
val add_defsort = ext_sign Sign.add_defsort; |
|
208 |
val add_defsort_i = ext_sign Sign.add_defsort_i; |
|
209 |
val add_types = ext_sign Sign.add_types; |
|
210 |
val add_nonterminals = ext_sign Sign.add_nonterminals; |
|
211 |
val add_tyabbrs = ext_sign Sign.add_tyabbrs; |
|
212 |
val add_tyabbrs_i = ext_sign Sign.add_tyabbrs_i; |
|
213 |
val add_arities = ext_sign Sign.add_arities; |
|
214 |
val add_arities_i = ext_sign Sign.add_arities_i; |
|
215 |
val add_consts = ext_sign Sign.add_consts; |
|
216 |
val add_consts_i = ext_sign Sign.add_consts_i; |
|
217 |
val add_syntax = ext_sign Sign.add_syntax; |
|
218 |
val add_syntax_i = ext_sign Sign.add_syntax_i; |
|
219 |
val add_modesyntax = curry (ext_sign Sign.add_modesyntax); |
|
220 |
val add_modesyntax_i = curry (ext_sign Sign.add_modesyntax_i); |
|
15747 | 221 |
val del_modesyntax = curry (ext_sign Sign.del_modesyntax); |
222 |
val del_modesyntax_i = curry (ext_sign Sign.del_modesyntax_i); |
|
14645 | 223 |
val add_trfuns = ext_sign Sign.add_trfuns; |
224 |
val add_trfunsT = ext_sign Sign.add_trfunsT; |
|
225 |
val add_advanced_trfuns = ext_sign Sign.add_advanced_trfuns; |
|
226 |
val add_advanced_trfunsT = ext_sign Sign.add_advanced_trfunsT; |
|
227 |
val add_tokentrfuns = ext_sign Sign.add_tokentrfuns; |
|
6311 | 228 |
fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f)); |
14645 | 229 |
val add_trrules = ext_sign Sign.add_trrules; |
230 |
val add_trrules_i = ext_sign Sign.add_trrules_i; |
|
231 |
val add_path = ext_sign Sign.add_path; |
|
232 |
val parent_path = add_path ".."; |
|
233 |
val root_path = add_path "/"; |
|
234 |
val absolute_path = add_path "//"; |
|
16134
89ea482e1649
added qualified_names, no_base_names, custom_accesses, set_policy, restore_naming;
wenzelm
parents:
16113
diff
changeset
|
235 |
val qualified_names = ext_sign (K Sign.qualified_names) (); |
89ea482e1649
added qualified_names, no_base_names, custom_accesses, set_policy, restore_naming;
wenzelm
parents:
16113
diff
changeset
|
236 |
val no_base_names = ext_sign (K Sign.no_base_names) (); |
89ea482e1649
added qualified_names, no_base_names, custom_accesses, set_policy, restore_naming;
wenzelm
parents:
16113
diff
changeset
|
237 |
val custom_accesses = ext_sign Sign.custom_accesses; |
89ea482e1649
added qualified_names, no_base_names, custom_accesses, set_policy, restore_naming;
wenzelm
parents:
16113
diff
changeset
|
238 |
val set_policy = ext_sign Sign.set_policy; |
16190 | 239 |
val restore_naming = ext_sign Sign.restore_naming o sign_of; |
14645 | 240 |
val add_space = ext_sign Sign.add_space; |
241 |
val hide_space = ext_sign o Sign.hide_space; |
|
242 |
val hide_space_i = ext_sign o Sign.hide_space_i; |
|
243 |
fun hide_classes b = curry (hide_space_i b) Sign.classK; |
|
244 |
fun hide_types b = curry (hide_space_i b) Sign.typeK; |
|
245 |
fun hide_consts b = curry (hide_space_i b) Sign.constK; |
|
246 |
val add_name = ext_sign Sign.add_name; |
|
247 |
val copy = ext_sign (K Sign.copy) (); |
|
248 |
val prep_ext = ext_sign (K Sign.prep_ext) (); |
|
3814 | 249 |
|
3996 | 250 |
|
6311 | 251 |
|
3814 | 252 |
(** add axioms **) |
253 |
||
1526 | 254 |
(* prepare axioms *) |
255 |
||
256 |
fun err_in_axm name = |
|
257 |
error ("The error(s) above occurred in axiom " ^ quote name); |
|
258 |
||
16291 | 259 |
fun no_vars pp tm = |
260 |
(case (Term.term_vars tm, Term.term_tvars tm) of |
|
14184
2e0e02d68cbb
Changed no_vars such that it outputs list of illegal schematic variables.
berghofe
parents:
13646
diff
changeset
|
261 |
([], []) => tm |
2e0e02d68cbb
Changed no_vars such that it outputs list of illegal schematic variables.
berghofe
parents:
13646
diff
changeset
|
262 |
| (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
|
263 |
(Pretty.str "Illegal schematic variable(s) in term:" :: |
16291 | 264 |
map (Pretty.term pp) ts @ map (Pretty.typ pp o TVar) ixns))))); |
1526 | 265 |
|
266 |
fun cert_axm sg (name, raw_tm) = |
|
267 |
let |
|
16291 | 268 |
val pp = Sign.pp sg; |
269 |
val (t, T, _) = Sign.certify_term pp sg raw_tm |
|
2979 | 270 |
handle TYPE (msg, _, _) => error msg |
16291 | 271 |
| TERM (msg, _) => error msg; |
1526 | 272 |
in |
9537 | 273 |
Term.no_dummy_patterns t handle TERM (msg, _) => error msg; |
1526 | 274 |
assert (T = propT) "Term not of type prop"; |
16291 | 275 |
(name, no_vars pp t) |
9629 | 276 |
end; |
1526 | 277 |
|
5057 | 278 |
(*some duplication of code with read_def_cterm*) |
6661 | 279 |
fun read_def_axm (sg, types, sorts) used (name, str) = |
3814 | 280 |
let |
14914 | 281 |
val ts = Syntax.read (Sign.is_logtype sg) (Sign.syn_of sg) propT str; |
14828 | 282 |
val (t, _) = Sign.infer_types (Sign.pp sg) sg types sorts used true (ts, propT); |
9320 | 283 |
in cert_axm sg (name, t) end |
1960
ae390b599213
Improved error handling: if there are syntax or type-checking
paulson
parents:
1539
diff
changeset
|
284 |
handle ERROR => err_in_axm name; |
1526 | 285 |
|
15531 | 286 |
fun read_axm sg name_str = read_def_axm (sg, K NONE, K NONE) [] name_str; |
5057 | 287 |
|
1526 | 288 |
fun inferT_axm sg (name, pre_tm) = |
16291 | 289 |
let |
290 |
val pp = Sign.pp sg; |
|
291 |
val (t, _) = Sign.infer_types pp sg (K NONE) (K NONE) [] true ([pre_tm], propT); |
|
292 |
in (name, no_vars pp t) end |
|
1526 | 293 |
handle ERROR => err_in_axm name; |
294 |
||
295 |
||
296 |
(* extend axioms of a theory *) |
|
297 |
||
16291 | 298 |
local |
299 |
||
300 |
fun gen_add_axioms prep_axm raw_axms thy = |
|
1526 | 301 |
let |
16291 | 302 |
val sg = sign_of thy; |
303 |
val raw_axms' = map (apfst (Sign.full_name sg)) raw_axms; |
|
3814 | 304 |
val axioms = |
16291 | 305 |
map (apsnd (Term.compress_term o Logic.varify) o prep_axm sg) raw_axms'; |
4996 | 306 |
val ext_sg = Sign.add_space (axiomK, map fst axioms); |
16158
2c3565b74b7a
Removed final_consts from theory data. Now const_deps deals with final
obua
parents:
16134
diff
changeset
|
307 |
in ext_theory thy ext_sg axioms [] end; |
1526 | 308 |
|
16291 | 309 |
in |
310 |
||
311 |
val add_axioms = gen_add_axioms read_axm; |
|
312 |
val add_axioms_i = gen_add_axioms cert_axm; |
|
313 |
||
314 |
end; |
|
1526 | 315 |
|
316 |
||
3814 | 317 |
(* add oracle **) |
318 |
||
319 |
fun add_oracle (raw_name, oracle) (thy as Theory {sign, ...}) = |
|
320 |
let |
|
321 |
val name = Sign.full_name sign raw_name; |
|
4996 | 322 |
val ext_sg = Sign.add_space (oracleK, [name]); |
16158
2c3565b74b7a
Removed final_consts from theory data. Now const_deps deals with final
obua
parents:
16134
diff
changeset
|
323 |
in ext_theory thy ext_sg [] [(name, (oracle, stamp ()))] end; |
3814 | 324 |
|
325 |
||
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
326 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
327 |
(** add constant definitions **) |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
328 |
|
9320 | 329 |
(* overloading *) |
9280 | 330 |
|
16291 | 331 |
datatype overloading = Clean | Implicit | Useless; |
9320 | 332 |
|
16291 | 333 |
fun overloading sg overloaded declT defT = |
334 |
let |
|
335 |
val defT' = Term.incr_tvar (maxidx_of_typ declT + 1) (Type.varifyT defT); |
|
336 |
in |
|
337 |
if Sign.typ_instance sg (declT, defT') then Clean |
|
338 |
else if Sign.typ_instance sg (Type.strip_sorts declT, Type.strip_sorts defT') then Useless |
|
339 |
else if overloaded then Clean |
|
340 |
else Implicit |
|
9280 | 341 |
end; |
342 |
||
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
343 |
|
16291 | 344 |
(* dest_def *) |
345 |
||
346 |
fun dest_def pp tm = |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
347 |
let |
3787
67571f49ebe3
new internal forms: add_classes_i, add_classrel_i, add_defsort_i, add_arities_i
wenzelm
parents:
3767
diff
changeset
|
348 |
fun err msg = raise TERM (msg, [tm]); |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
349 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
350 |
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
|
351 |
handle TERM _ => err "Not a meta-equality (==)"; |
16291 | 352 |
val (head, args) = Term.strip_comb lhs; |
353 |
val (c, T) = Term.dest_Const head |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
354 |
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
|
355 |
|
4141 | 356 |
fun dest_free (Free (x, _)) = x |
357 |
| dest_free (Const ("TYPE", Type ("itself", [TFree (x, _)]))) = x |
|
358 |
| dest_free _ = raise Match; |
|
359 |
||
16291 | 360 |
val show_terms = commas_quote o map (Pretty.string_of_term pp); |
4141 | 361 |
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
|
362 |
val show_tfrees = commas_quote o map fst; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
363 |
|
16291 | 364 |
val lhs_nofrees = filter (not o can dest_free) args; |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
365 |
val lhs_dups = duplicates args; |
16291 | 366 |
val rhs_extras = term_frees rhs |> fold (remove op =) args; |
367 |
val rhs_extrasT = term_tfrees rhs |> fold (remove op =) (typ_tfrees T); |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
368 |
in |
16291 | 369 |
if not (null lhs_nofrees) then |
370 |
err ("Non-variables as arguments on lhs: " ^ show_terms lhs_nofrees) |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
371 |
else if not (null lhs_dups) then |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
372 |
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
|
373 |
else if not (null rhs_extras) then |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
374 |
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
|
375 |
else if not (null rhs_extrasT) then |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
376 |
err ("Extra type variables on rhs: " ^ show_tfrees rhs_extrasT) |
16291 | 377 |
else if exists_Const (equal (c, T)) rhs then |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
378 |
err ("Constant to be defined occurs on rhs") |
16291 | 379 |
else ((c, T), rhs) |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
380 |
end; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
381 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
382 |
|
16291 | 383 |
(* check_def *) |
384 |
||
385 |
fun pretty_const pp (c, T) = |
|
386 |
[Pretty.str c, Pretty.str " ::", Pretty.brk 1, |
|
387 |
Pretty.quote (Pretty.typ pp (Type.freeze_type T))]; (* FIXME zero indexes!? *) |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
388 |
|
16291 | 389 |
(* FIXME move error messages to defs.ML !? *) |
9320 | 390 |
|
16291 | 391 |
fun pretty_path pp path = fold_rev (fn (T, c, def) => |
392 |
fn [] => [Pretty.block (pretty_const pp (c, T))] |
|
393 |
| prts => Pretty.block (pretty_const pp (c, T) @ |
|
394 |
[Pretty.brk 1, Pretty.str ("depends via " ^ quote def ^ " on")]) :: prts) path []; |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
395 |
|
16313
79b37d5e50b1
A flag DEFS_CHAIN_HISTORY can be used to improve the error message
obua
parents:
16291
diff
changeset
|
396 |
fun chain_history_msg s = |
79b37d5e50b1
A flag DEFS_CHAIN_HISTORY can be used to improve the error message
obua
parents:
16291
diff
changeset
|
397 |
if Defs.chain_history () then s^": " |
79b37d5e50b1
A flag DEFS_CHAIN_HISTORY can be used to improve the error message
obua
parents:
16291
diff
changeset
|
398 |
else s^" (set DEFS_CHAIN_HISTORY=ON for full history): " |
79b37d5e50b1
A flag DEFS_CHAIN_HISTORY can be used to improve the error message
obua
parents:
16291
diff
changeset
|
399 |
|
16291 | 400 |
fun defs_circular pp path = |
16313
79b37d5e50b1
A flag DEFS_CHAIN_HISTORY can be used to improve the error message
obua
parents:
16291
diff
changeset
|
401 |
Pretty.str (chain_history_msg "Cyclic dependency of definitions") :: pretty_path pp path |
16291 | 402 |
|> Pretty.chunks |> Pretty.string_of; |
403 |
||
404 |
fun defs_infinite_chain pp path = |
|
16313
79b37d5e50b1
A flag DEFS_CHAIN_HISTORY can be used to improve the error message
obua
parents:
16291
diff
changeset
|
405 |
Pretty.str (chain_history_msg "Infinite chain of definitions") :: pretty_path pp path |
16291 | 406 |
|> Pretty.chunks |> Pretty.string_of; |
407 |
||
408 |
fun defs_clash def1 def2 = "Type clash in definitions " ^ quote def1 ^ " and " ^ quote def2; |
|
9320 | 409 |
|
16291 | 410 |
fun defs_final pp const = |
411 |
(Pretty.str "Attempt to define final constant" :: Pretty.brk 1 :: pretty_const pp const) |
|
412 |
|> Pretty.block |> Pretty.string_of; |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
413 |
|
16291 | 414 |
(* FIXME move to defs.ML; avoid exceptions *) |
415 |
fun declare sg c defs = |
|
416 |
let val T = Sign.the_const_type sg c |
|
417 |
in if_none (try (Defs.declare defs) (c, T)) defs end; |
|
10494 | 418 |
|
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
|
419 |
|
16291 | 420 |
fun check_def sg overloaded (bname, tm) defs = |
421 |
let |
|
422 |
val pp = Sign.pp sg; |
|
423 |
val name = Sign.full_name sg bname; |
|
424 |
||
425 |
fun err msg = error (Pretty.string_of (Pretty.chunks |
|
426 |
[Pretty.str msg, |
|
427 |
Pretty.block [Pretty.str ("The error(s) above occurred in definition " ^ quote name ^ ":"), |
|
428 |
Pretty.fbrk, Pretty.quote (Pretty.term pp tm)]])); |
|
429 |
||
430 |
fun show_def const txt = |
|
431 |
[Pretty.block (Pretty.str "Definition of " :: pretty_const pp const), Pretty.str txt] |
|
432 |
|> Pretty.chunks |> Pretty.string_of; |
|
9320 | 433 |
|
16291 | 434 |
val ((c, defT), rhs) = dest_def pp tm handle TERM (msg, _) => err msg; |
435 |
val rhs_consts = Term.term_constsT rhs; |
|
436 |
val declT = Sign.the_const_type sg c; |
|
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 |
|
16291 | 438 |
val _ = |
439 |
(case overloading sg overloaded declT defT of |
|
440 |
Clean => () |
|
441 |
| Implicit => warning (show_def (c, defT) |
|
442 |
("is strictly less general than the declared type (see " ^ quote name ^ ")")) |
|
443 |
| Useless => err (Library.setmp show_sorts true (show_def (c, defT)) |
|
444 |
"imposes additional sort constraints on the declared type of the constant")); |
|
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
|
445 |
|
16291 | 446 |
val decl_defs = defs |> declare sg c |> fold (declare sg) (map #1 rhs_consts); |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
447 |
in |
16291 | 448 |
Defs.define decl_defs (c, defT) name rhs_consts |
449 |
handle Defs.DEFS msg => err ("DEFS: " ^ msg) (* FIXME sys_error!? *) |
|
450 |
| Defs.CIRCULAR path => err (defs_circular pp path) |
|
451 |
| Defs.INFINITE_CHAIN path => err (defs_infinite_chain pp path) |
|
452 |
| Defs.CLASH (_, def1, def2) => err (defs_clash def1 def2) |
|
453 |
| Defs.FINAL const => err (defs_final pp const) |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
454 |
end; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
455 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
456 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
457 |
(* add_defs *) |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
458 |
|
16291 | 459 |
local |
9320 | 460 |
|
16291 | 461 |
fun gen_add_defs prep_axm overloaded raw_axms thy = |
462 |
let |
|
463 |
val Theory {sign, defs, axioms, oracles, parents, ancestors} = thy; |
|
9320 | 464 |
val axms = map (prep_axm sign) raw_axms; |
16291 | 465 |
val defs' = fold (check_def sign overloaded) axms defs; |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
466 |
in |
16291 | 467 |
make_theory sign defs' axioms oracles parents ancestors |
9320 | 468 |
|> add_axioms_i axms |
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
469 |
end; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
470 |
|
16291 | 471 |
in |
472 |
||
473 |
val add_defs_i = gen_add_defs cert_axm; |
|
474 |
val add_defs = gen_add_defs read_axm; |
|
475 |
||
476 |
end; |
|
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
477 |
|
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
478 |
|
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
479 |
(* add_finals *) |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
480 |
|
16291 | 481 |
local |
482 |
||
483 |
fun gen_add_finals prep_term overloaded raw_terms thy = |
|
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
484 |
let |
16291 | 485 |
val Theory {sign, defs, axioms, oracles, parents, ancestors} = thy; |
486 |
fun finalize tm finals = |
|
487 |
let |
|
488 |
fun err msg = raise TERM (msg, [tm]); (* FIXME error!? *) |
|
489 |
val (c, defT) = |
|
490 |
(case tm of Const x => x |
|
491 |
| Free _ => err "Attempt to finalize variable (or undeclared constant)" |
|
492 |
| _ => err "Attempt to finalize non-constant term"); |
|
493 |
val declT = Sign.the_const_type sign c |
|
494 |
handle TYPE (msg, _, _) => err msg; |
|
495 |
val _ = |
|
496 |
(case overloading sign overloaded declT defT of |
|
497 |
Clean => () |
|
498 |
| Implcit => warning ("Finalizing " ^ quote c ^ |
|
499 |
" at a strictly less general type than declared") |
|
500 |
| Useless => err "Sort constraints stronger than declared"); |
|
501 |
in |
|
502 |
Defs.finalize (if_none (try (Defs.declare finals) (c, declT)) finals) (c, defT) |
|
503 |
end; |
|
504 |
val defs' = fold finalize (map (prep_term sign) raw_terms) defs; |
|
505 |
in make_theory sign defs' axioms oracles parents ancestors end; |
|
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
506 |
|
16291 | 507 |
fun read_term sg = Sign.simple_read_term sg TypeInfer.logicT; |
508 |
fun cert_term sg = #1 o Sign.certify_term (Sign.pp sg) sg; |
|
509 |
||
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
510 |
in |
16291 | 511 |
|
512 |
val add_finals = gen_add_finals read_term; |
|
513 |
val add_finals_i = gen_add_finals cert_term; |
|
514 |
||
14223
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
515 |
end; |
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
516 |
|
0ee05eef881b
Added support for making constants final, that is, ensuring that no
skalberg
parents:
14204
diff
changeset
|
517 |
|
3878 | 518 |
|
3865 | 519 |
(** additional theory data **) |
520 |
||
4996 | 521 |
val init_data = curry (ext_sign Sign.init_data); |
522 |
fun print_data kind = Sign.print_data kind o sign_of; |
|
523 |
fun get_data kind f = Sign.get_data kind f o sign_of; |
|
524 |
fun put_data kind f = ext_sign (Sign.put_data kind f); |
|
3865 | 525 |
|
526 |
||
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
527 |
|
6661 | 528 |
(** merge theories **) (*exception ERROR*) |
4019 | 529 |
|
3878 | 530 |
(*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
|
531 |
fun prep_ext_merge thys = |
15703 | 532 |
let |
16291 | 533 |
val sign' = Sign.prep_ext_merge (map sign_of thys); |
3814 | 534 |
|
16291 | 535 |
val defss = map (#defs o rep_theory) thys; |
536 |
val defs' = foldl (uncurry Defs.merge) (hd defss) (tl defss) |
|
537 |
handle Defs.CIRCULAR namess => error (defs_circular (Sign.pp sign') namess) |
|
538 |
| Defs.INFINITE_CHAIN namess => error (defs_infinite_chain (Sign.pp sign') namess); |
|
15703 | 539 |
|
540 |
val axioms' = Symtab.empty; |
|
9282
0181ac100520
Defs are now checked for circularity (if not overloaded).
nipkow
parents:
9280
diff
changeset
|
541 |
|
15703 | 542 |
fun eq_ora ((_, (_, s1: stamp)), (_, (_, s2))) = s1 = s2; |
543 |
val oracles' = |
|
544 |
Symtab.make (gen_distinct eq_ora |
|
545 |
(List.concat (map (Symtab.dest o #oracles o rep_theory) thys))) |
|
546 |
handle Symtab.DUPS names => err_dup_oras names; |
|
4019 | 547 |
|
15703 | 548 |
val parents' = gen_distinct eq_thy thys; |
549 |
val ancestors' = |
|
550 |
gen_distinct eq_thy (parents' @ List.concat (map ancestors_of thys)); |
|
16291 | 551 |
in make_theory sign' defs' axioms' oracles' parents' ancestors' end; |
1526 | 552 |
|
3885 | 553 |
|
1526 | 554 |
end; |
555 |
||
3767
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
556 |
structure BasicTheory: BASIC_THEORY = Theory; |
e2bb53d8dd26
moved theory stuff (add_defs etc.) here from drule.ML;
wenzelm
parents:
2979
diff
changeset
|
557 |
open BasicTheory; |