author | blanchet |
Wed, 03 Nov 2010 22:33:23 +0100 | |
changeset 40342 | 3154f63e2bda |
parent 39557 | fe5722fce758 |
child 41228 | e1fce873b814 |
permissions | -rw-r--r-- |
404
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset
|
1 |
(* Title: Pure/axclass.ML |
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset
|
2 |
Author: Markus Wenzel, TU Muenchen |
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset
|
3 |
|
24964 | 4 |
Type classes defined as predicates, associated with a record of |
36417 | 5 |
parameters. Proven class relations and type arities. |
404
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset
|
6 |
*) |
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset
|
7 |
|
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset
|
8 |
signature AX_CLASS = |
3938 | 9 |
sig |
36427 | 10 |
type info = {def: thm, intro: thm, axioms: thm list, params: (string * typ) list} |
11 |
val get_info: theory -> class -> info |
|
12 |
val class_of_param: theory -> string -> class option |
|
13 |
val instance_name: string * class -> string |
|
14 |
val thynames_of_arity: theory -> class * string -> string list |
|
15 |
val param_of_inst: theory -> string * string -> string |
|
16 |
val inst_of_param: theory -> string -> (string * string) option |
|
17 |
val unoverload: theory -> thm -> thm |
|
18 |
val overload: theory -> thm -> thm |
|
19 |
val unoverload_conv: theory -> conv |
|
20 |
val overload_conv: theory -> conv |
|
21 |
val lookup_inst_param: Consts.T -> ((string * string) * 'a) list -> string * typ -> 'a option |
|
22 |
val unoverload_const: theory -> string * typ -> string |
|
23 |
val cert_classrel: theory -> class * class -> class * class |
|
24 |
val read_classrel: theory -> xstring * xstring -> class * class |
|
25 |
val declare_overloaded: string * typ -> theory -> term * theory |
|
26 |
val define_overloaded: binding -> string * term -> theory -> thm * theory |
|
37246 | 27 |
val add_classrel: thm -> theory -> theory |
28 |
val add_arity: thm -> theory -> theory |
|
24589 | 29 |
val prove_classrel: class * class -> tactic -> theory -> theory |
30 |
val prove_arity: string * sort list * sort -> tactic -> theory -> theory |
|
36427 | 31 |
val define_class: binding * class list -> string list -> |
32 |
(Thm.binding * term list) list -> theory -> class * theory |
|
30344
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset
|
33 |
val axiomatize_class: binding * class list -> theory -> theory |
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset
|
34 |
val axiomatize_class_cmd: binding * xstring list -> theory -> theory |
24929
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
35 |
val axiomatize_classrel: (class * class) list -> theory -> theory |
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
36 |
val axiomatize_classrel_cmd: (xstring * xstring) list -> theory -> theory |
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
37 |
val axiomatize_arity: arity -> theory -> theory |
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
38 |
val axiomatize_arity_cmd: xstring * string list * string -> theory -> theory |
3938 | 39 |
end; |
404
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset
|
40 |
|
15801 | 41 |
structure AxClass: AX_CLASS = |
404
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset
|
42 |
struct |
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset
|
43 |
|
19405 | 44 |
(** theory data **) |
423 | 45 |
|
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
46 |
(* axclass info *) |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
47 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
48 |
type info = |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
49 |
{def: thm, |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
50 |
intro: thm, |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
51 |
axioms: thm list, |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
52 |
params: (string * typ) list}; |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
53 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
54 |
fun make_axclass (def, intro, axioms, params): info = |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
55 |
{def = def, intro = intro, axioms = axioms, params = params}; |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
56 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
57 |
|
19405 | 58 |
(* class parameters (canonical order) *) |
423 | 59 |
|
19405 | 60 |
type param = string * class; |
423 | 61 |
|
19405 | 62 |
fun add_param pp ((x, c): param) params = |
63 |
(case AList.lookup (op =) params x of |
|
64 |
NONE => (x, c) :: params |
|
65 |
| SOME c' => error ("Duplicate class parameter " ^ quote x ^ |
|
66 |
" for " ^ Pretty.string_of_sort pp [c] ^ |
|
67 |
(if c = c' then "" else " and " ^ Pretty.string_of_sort pp [c']))); |
|
423 | 68 |
|
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
69 |
|
19511 | 70 |
(* setup data *) |
19392 | 71 |
|
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
72 |
datatype data = Data of |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
73 |
{axclasses: info Symtab.table, |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
74 |
params: param list, |
36418
752ee03427c2
clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
wenzelm
parents:
36417
diff
changeset
|
75 |
proven_classrels: thm Symreltab.table, |
752ee03427c2
clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
wenzelm
parents:
36417
diff
changeset
|
76 |
proven_arities: ((class * sort list) * (thm * string)) list Symtab.table, |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
77 |
(*arity theorems with theory name*) |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
78 |
inst_params: |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
79 |
(string * thm) Symtab.table Symtab.table * |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
80 |
(*constant name ~> type constructor ~> (constant name, equation)*) |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
81 |
(string * string) Symtab.table (*constant name ~> (constant name, type constructor)*), |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
82 |
diff_classrels: (class * class) list}; |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
83 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
84 |
fun make_data |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
85 |
(axclasses, params, proven_classrels, proven_arities, inst_params, diff_classrels) = |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
86 |
Data {axclasses = axclasses, params = params, proven_classrels = proven_classrels, |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
87 |
proven_arities = proven_arities, inst_params = inst_params, |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
88 |
diff_classrels = diff_classrels}; |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
89 |
|
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
90 |
fun diff_table tab1 tab2 = |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
91 |
Symreltab.fold (fn (x, _) => if Symreltab.defined tab2 x then I else cons x) tab1 []; |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
92 |
|
36327 | 93 |
structure Data = Theory_Data_PP |
22846 | 94 |
( |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
95 |
type T = data; |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
96 |
val empty = |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
97 |
make_data (Symtab.empty, [], Symreltab.empty, Symtab.empty, (Symtab.empty, Symtab.empty), []); |
19574 | 98 |
val extend = I; |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
99 |
fun merge pp |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
100 |
(Data {axclasses = axclasses1, params = params1, proven_classrels = proven_classrels1, |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
101 |
proven_arities = proven_arities1, inst_params = inst_params1, |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
102 |
diff_classrels = diff_classrels1}, |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
103 |
Data {axclasses = axclasses2, params = params2, proven_classrels = proven_classrels2, |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
104 |
proven_arities = proven_arities2, inst_params = inst_params2, |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
105 |
diff_classrels = diff_classrels2}) = |
36325 | 106 |
let |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
107 |
val axclasses' = Symtab.merge (K true) (axclasses1, axclasses2); |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
108 |
val params' = |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
109 |
if null params1 then params2 |
36417 | 110 |
else fold_rev (fn p => if member (op =) params1 p then I else add_param pp p) params2 params1; |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
111 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
112 |
(*transitive closure of classrels and arity completion is done in Theory.at_begin hook*) |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
113 |
val proven_classrels' = Symreltab.join (K #1) (proven_classrels1, proven_classrels2); |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
114 |
val proven_arities' = |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
115 |
Symtab.join (K (Library.merge (eq_fst op =))) (proven_arities1, proven_arities2); |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
116 |
|
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
117 |
val diff_classrels' = |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
118 |
diff_table proven_classrels1 proven_classrels2 @ |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
119 |
diff_table proven_classrels2 proven_classrels1 @ |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
120 |
diff_classrels1 @ diff_classrels2; |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
121 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
122 |
val inst_params' = |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
123 |
(Symtab.join (K (Symtab.merge (K true))) (#1 inst_params1, #1 inst_params2), |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
124 |
Symtab.merge (K true) (#2 inst_params1, #2 inst_params2)); |
36325 | 125 |
in |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
126 |
make_data |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
127 |
(axclasses', params', proven_classrels', proven_arities', inst_params', diff_classrels') |
36325 | 128 |
end; |
22846 | 129 |
); |
6379 | 130 |
|
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
131 |
fun map_data f = |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
132 |
Data.map (fn Data {axclasses, params, proven_classrels, proven_arities, inst_params, diff_classrels} => |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
133 |
make_data (f (axclasses, params, proven_classrels, proven_arities, inst_params, diff_classrels))); |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
134 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
135 |
fun map_axclasses f = |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
136 |
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, diff_classrels) => |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
137 |
(f axclasses, params, proven_classrels, proven_arities, inst_params, diff_classrels)); |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
138 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
139 |
fun map_params f = |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
140 |
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, diff_classrels) => |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
141 |
(axclasses, f params, proven_classrels, proven_arities, inst_params, diff_classrels)); |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
142 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
143 |
fun map_proven_classrels f = |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
144 |
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, diff_classrels) => |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
145 |
(axclasses, params, f proven_classrels, proven_arities, inst_params, diff_classrels)); |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
146 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
147 |
fun map_proven_arities f = |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
148 |
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, diff_classrels) => |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
149 |
(axclasses, params, proven_classrels, f proven_arities, inst_params, diff_classrels)); |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
150 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
151 |
fun map_inst_params f = |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
152 |
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, diff_classrels) => |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
153 |
(axclasses, params, proven_classrels, proven_arities, f inst_params, diff_classrels)); |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
154 |
|
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
155 |
val clear_diff_classrels = |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
156 |
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, _) => |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
157 |
(axclasses, params, proven_classrels, proven_arities, inst_params, [])); |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
158 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
159 |
val rep_data = Data.get #> (fn Data args => args); |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
160 |
|
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
161 |
val axclasses_of = #axclasses o rep_data; |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
162 |
val params_of = #params o rep_data; |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
163 |
val proven_classrels_of = #proven_classrels o rep_data; |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
164 |
val proven_arities_of = #proven_arities o rep_data; |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
165 |
val inst_params_of = #inst_params o rep_data; |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
166 |
val diff_classrels_of = #diff_classrels o rep_data; |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
167 |
|
6379 | 168 |
|
36346 | 169 |
(* axclasses with parameters *) |
19392 | 170 |
|
24929
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
171 |
fun get_info thy c = |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
172 |
(case Symtab.lookup (axclasses_of thy) c of |
36327 | 173 |
SOME info => info |
21919 | 174 |
| NONE => error ("No such axclass: " ^ quote c)); |
6379 | 175 |
|
36327 | 176 |
fun all_params_of thy S = |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
177 |
let val params = params_of thy; |
36327 | 178 |
in fold (fn (x, c) => if Sign.subsort thy (S, [c]) then cons x else I) params [] end; |
19460 | 179 |
|
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
180 |
fun class_of_param thy = AList.lookup (op =) (params_of thy); |
19460 | 181 |
|
21919 | 182 |
|
19511 | 183 |
(* maintain instances *) |
19503 | 184 |
|
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
185 |
val classrel_prefix = "classrel_"; |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
186 |
val arity_prefix = "arity_"; |
25486 | 187 |
|
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
188 |
fun instance_name (a, c) = Long_Name.base_name c ^ "_" ^ Long_Name.base_name a; |
19528 | 189 |
|
190 |
||
36421
066e35d1c0d7
tuned classrel completion -- bypass composition with reflexive edges;
wenzelm
parents:
36420
diff
changeset
|
191 |
infix 0 RSO; |
066e35d1c0d7
tuned classrel completion -- bypass composition with reflexive edges;
wenzelm
parents:
36420
diff
changeset
|
192 |
|
36456 | 193 |
fun (SOME a) RSO (SOME b) = SOME (a RS b) |
194 |
| x RSO NONE = x |
|
195 |
| NONE RSO y = y; |
|
36421
066e35d1c0d7
tuned classrel completion -- bypass composition with reflexive edges;
wenzelm
parents:
36420
diff
changeset
|
196 |
|
19574 | 197 |
fun the_classrel thy (c1, c2) = |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
198 |
(case Symreltab.lookup (proven_classrels_of thy) (c1, c2) of |
36881
4de023c28a84
the_classrel/the_arity: avoid Thm.transfer for proofterm version -- theory might already have become stale within the proof_body future;
wenzelm
parents:
36768
diff
changeset
|
199 |
SOME thm => thm |
24920 | 200 |
| NONE => error ("Unproven class relation " ^ |
36881
4de023c28a84
the_classrel/the_arity: avoid Thm.transfer for proofterm version -- theory might already have become stale within the proof_body future;
wenzelm
parents:
36768
diff
changeset
|
201 |
Syntax.string_of_classrel (ProofContext.init_global thy) [c1, c2])); (* FIXME stale thy (!?) *) |
19574 | 202 |
|
36325 | 203 |
fun put_trancl_classrel ((c1, c2), th) thy = |
204 |
let |
|
36328
4d9deabf6474
replaced Sorts.rep_algebra by slightly more abstract selectors classes_of/arities_of;
wenzelm
parents:
36327
diff
changeset
|
205 |
val classes = Sorts.classes_of (Sign.classes_of thy); |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
206 |
val classrels = proven_classrels_of thy; |
36325 | 207 |
|
208 |
fun reflcl_classrel (c1', c2') = |
|
36881
4de023c28a84
the_classrel/the_arity: avoid Thm.transfer for proofterm version -- theory might already have become stale within the proof_body future;
wenzelm
parents:
36768
diff
changeset
|
209 |
if c1' = c2' then NONE else SOME (Thm.transfer thy (the_classrel thy (c1', c2'))); |
36325 | 210 |
fun gen_classrel (c1_pred, c2_succ) = |
211 |
let |
|
36421
066e35d1c0d7
tuned classrel completion -- bypass composition with reflexive edges;
wenzelm
parents:
36420
diff
changeset
|
212 |
val th' = |
066e35d1c0d7
tuned classrel completion -- bypass composition with reflexive edges;
wenzelm
parents:
36420
diff
changeset
|
213 |
the ((reflcl_classrel (c1_pred, c1) RSO SOME th) RSO reflcl_classrel (c2, c2_succ)) |
066e35d1c0d7
tuned classrel completion -- bypass composition with reflexive edges;
wenzelm
parents:
36420
diff
changeset
|
214 |
|> Drule.instantiate' [SOME (ctyp_of thy (TVar ((Name.aT, 0), [])))] [] |
36327 | 215 |
|> Thm.close_derivation; |
36418
752ee03427c2
clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
wenzelm
parents:
36417
diff
changeset
|
216 |
in ((c1_pred, c2_succ), th') end; |
36325 | 217 |
|
36327 | 218 |
val new_classrels = |
219 |
Library.map_product pair (c1 :: Graph.imm_preds classes c1) (c2 :: Graph.imm_succs classes c2) |
|
36421
066e35d1c0d7
tuned classrel completion -- bypass composition with reflexive edges;
wenzelm
parents:
36420
diff
changeset
|
220 |
|> filter_out ((op =) orf Symreltab.defined classrels) |
36327 | 221 |
|> map gen_classrel; |
222 |
val needed = not (null new_classrels); |
|
36325 | 223 |
in |
224 |
(needed, |
|
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
225 |
if needed then map_proven_classrels (fold Symreltab.update new_classrels) thy |
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
226 |
else thy) |
36325 | 227 |
end; |
228 |
||
229 |
fun complete_classrels thy = |
|
230 |
let |
|
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
231 |
val classrels = proven_classrels_of thy; |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
232 |
val diff_classrels = diff_classrels_of thy; |
36325 | 233 |
val (needed, thy') = (false, thy) |> |
36417 | 234 |
fold (fn rel => fn (needed, thy) => |
36418
752ee03427c2
clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
wenzelm
parents:
36417
diff
changeset
|
235 |
put_trancl_classrel (rel, Symreltab.lookup classrels rel |> the) thy |
36325 | 236 |
|>> (fn b => needed orelse b)) |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
237 |
diff_classrels; |
36325 | 238 |
in |
36420
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
239 |
if null diff_classrels then NONE |
66fd989c8e15
tuned diff_classrels -- avoid slightly inefficient Symreltab.keys;
wenzelm
parents:
36419
diff
changeset
|
240 |
else SOME (clear_diff_classrels thy') |
36325 | 241 |
end; |
19503 | 242 |
|
243 |
||
36740 | 244 |
fun the_arity thy (a, Ss, c) = |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
245 |
(case AList.lookup (op =) (Symtab.lookup_list (proven_arities_of thy) a) (c, Ss) of |
36881
4de023c28a84
the_classrel/the_arity: avoid Thm.transfer for proofterm version -- theory might already have become stale within the proof_body future;
wenzelm
parents:
36768
diff
changeset
|
246 |
SOME (thm, _) => thm |
24920 | 247 |
| NONE => error ("Unproven type arity " ^ |
36881
4de023c28a84
the_classrel/the_arity: avoid Thm.transfer for proofterm version -- theory might already have become stale within the proof_body future;
wenzelm
parents:
36768
diff
changeset
|
248 |
Syntax.string_of_arity (ProofContext.init_global thy) (a, Ss, [c]))); (* FIXME stale thy (!?) *) |
19503 | 249 |
|
33172 | 250 |
fun thynames_of_arity thy (c, a) = |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
251 |
Symtab.lookup_list (proven_arities_of thy) a |
36418
752ee03427c2
clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
wenzelm
parents:
36417
diff
changeset
|
252 |
|> map_filter (fn ((c', _), (_, name)) => if c = c' then SOME name else NONE) |
27497 | 253 |
|> rev; |
27397 | 254 |
|
36419
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
255 |
fun insert_arity_completions thy t ((c, Ss), ((th, thy_name))) (finished, arities) = |
27547 | 256 |
let |
257 |
val algebra = Sign.classes_of thy; |
|
36417 | 258 |
val ars = Symtab.lookup_list arities t; |
33172 | 259 |
val super_class_completions = |
260 |
Sign.super_classes thy c |
|
36417 | 261 |
|> filter_out (fn c1 => exists (fn ((c2, Ss2), _) => |
262 |
c1 = c2 andalso Sorts.sorts_le algebra (Ss2, Ss)) ars); |
|
263 |
||
264 |
val names = Name.invents Name.context Name.aT (length Ss); |
|
265 |
val std_vars = map (fn a => SOME (ctyp_of thy (TVar ((a, 0), [])))) names; |
|
266 |
||
36325 | 267 |
val completions = super_class_completions |> map (fn c1 => |
268 |
let |
|
36419
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
269 |
val th1 = |
36881
4de023c28a84
the_classrel/the_arity: avoid Thm.transfer for proofterm version -- theory might already have become stale within the proof_body future;
wenzelm
parents:
36768
diff
changeset
|
270 |
(th RS Thm.transfer thy (the_classrel thy (c, c1))) |
36417 | 271 |
|> Drule.instantiate' std_vars [] |
36327 | 272 |
|> Thm.close_derivation; |
36418
752ee03427c2
clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
wenzelm
parents:
36417
diff
changeset
|
273 |
in ((th1, thy_name), c1) end); |
36419
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
274 |
|
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
275 |
val finished' = finished andalso null completions; |
36418
752ee03427c2
clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
wenzelm
parents:
36417
diff
changeset
|
276 |
val arities' = fold (fn (th, c1) => Symtab.cons_list (t, ((c1, Ss), th))) completions arities; |
36419
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
277 |
in (finished', arities') end; |
19503 | 278 |
|
27547 | 279 |
fun put_arity ((t, Ss, c), th) thy = |
36419
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
280 |
let val ar = ((c, Ss), (th, Context.theory_name thy)) in |
27547 | 281 |
thy |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
282 |
|> map_proven_arities |
36419
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
283 |
(Symtab.insert_list (eq_fst op =) (t, ar) #> |
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
284 |
curry (insert_arity_completions thy t ar) true #> #2) |
27547 | 285 |
end; |
19503 | 286 |
|
31944 | 287 |
fun complete_arities thy = |
27547 | 288 |
let |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
289 |
val arities = proven_arities_of thy; |
36419
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
290 |
val (finished, arities') = |
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
291 |
Symtab.fold (fn (t, ars) => fold (insert_arity_completions thy t) ars) arities (true, arities); |
33172 | 292 |
in |
36419
7aea10d10113
tuned aritiy completion -- slightly less intermediate data structures;
wenzelm
parents:
36418
diff
changeset
|
293 |
if finished then NONE |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
294 |
else SOME (map_proven_arities (K arities') thy) |
27547 | 295 |
end; |
296 |
||
36325 | 297 |
val _ = Context.>> (Context.map_theory |
36740 | 298 |
(Theory.at_begin complete_classrels #> |
299 |
Theory.at_begin complete_arities)); |
|
27397 | 300 |
|
36740 | 301 |
val _ = Proofterm.install_axclass_proofs |
302 |
{classrel_proof = Thm.proof_of oo the_classrel, |
|
303 |
arity_proof = Thm.proof_of oo the_arity}; |
|
36418
752ee03427c2
clarified proven results: store thm only and retrieve proof later via Thm.proof_of (this may also impact parallelism, because internal join_proofs is deferred);
wenzelm
parents:
36417
diff
changeset
|
304 |
|
27397 | 305 |
|
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
306 |
(* maintain instance parameters *) |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
307 |
|
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
308 |
fun get_inst_param thy (c, tyco) = |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
309 |
(case Symtab.lookup (the_default Symtab.empty (Symtab.lookup (#1 (inst_params_of thy)) c)) tyco of |
36327 | 310 |
SOME c' => c' |
311 |
| NONE => error ("No instance parameter for constant " ^ quote c ^ " on type " ^ quote tyco)); |
|
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
312 |
|
36327 | 313 |
fun add_inst_param (c, tyco) inst = |
314 |
(map_inst_params o apfst o Symtab.map_default (c, Symtab.empty)) (Symtab.update_new (tyco, inst)) |
|
36417 | 315 |
#> (map_inst_params o apsnd) (Symtab.update_new (#1 inst, (c, tyco))); |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
316 |
|
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
317 |
val inst_of_param = Symtab.lookup o #2 o inst_params_of; |
36417 | 318 |
val param_of_inst = #1 oo get_inst_param; |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
319 |
|
36327 | 320 |
fun inst_thms thy = |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
321 |
Symtab.fold (Symtab.fold (cons o #2 o #2) o #2) (#1 (inst_params_of thy)) []; |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
322 |
|
36417 | 323 |
fun get_inst_tyco consts = try (#1 o dest_Type o the_single o Consts.typargs consts); |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
324 |
|
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
325 |
fun unoverload thy = MetaSimplifier.simplify true (inst_thms thy); |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
326 |
fun overload thy = MetaSimplifier.simplify true (map Thm.symmetric (inst_thms thy)); |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
327 |
|
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
328 |
fun unoverload_conv thy = MetaSimplifier.rewrite true (inst_thms thy); |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
329 |
fun overload_conv thy = MetaSimplifier.rewrite true (map Thm.symmetric (inst_thms thy)); |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
330 |
|
36327 | 331 |
fun lookup_inst_param consts params (c, T) = |
332 |
(case get_inst_tyco consts (c, T) of |
|
333 |
SOME tyco => AList.lookup (op =) params (c, tyco) |
|
334 |
| NONE => NONE); |
|
31249 | 335 |
|
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
336 |
fun unoverload_const thy (c_ty as (c, _)) = |
36327 | 337 |
if is_some (class_of_param thy c) then |
338 |
(case get_inst_tyco (Sign.consts_of thy) c_ty of |
|
339 |
SOME tyco => try (param_of_inst thy) (c, tyco) |> the_default c |
|
340 |
| NONE => c) |
|
33969 | 341 |
else c; |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
342 |
|
404
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset
|
343 |
|
36327 | 344 |
|
19511 | 345 |
(** instances **) |
19418
03b01c9314fc
reworded add_axclass(_i): canonical specification format,
wenzelm
parents:
19405
diff
changeset
|
346 |
|
03b01c9314fc
reworded add_axclass(_i): canonical specification format,
wenzelm
parents:
19405
diff
changeset
|
347 |
(* class relations *) |
03b01c9314fc
reworded add_axclass(_i): canonical specification format,
wenzelm
parents:
19405
diff
changeset
|
348 |
|
19405 | 349 |
fun cert_classrel thy raw_rel = |
15876
a67343c6ab2a
sane interfaces for tactical instance proofs (do not expand defs of theory, proper handling of sort instances);
wenzelm
parents:
15853
diff
changeset
|
350 |
let |
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26516
diff
changeset
|
351 |
val string_of_sort = Syntax.string_of_sort_global thy; |
19405 | 352 |
val (c1, c2) = pairself (Sign.certify_class thy) raw_rel; |
24271 | 353 |
val _ = Sign.primitive_classrel (c1, c2) (Theory.copy thy); |
19405 | 354 |
val _ = |
19460 | 355 |
(case subtract (op =) (all_params_of thy [c1]) (all_params_of thy [c2]) of |
19405 | 356 |
[] => () |
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26516
diff
changeset
|
357 |
| xs => raise TYPE ("Class " ^ string_of_sort [c1] ^ " lacks parameter(s) " ^ |
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26516
diff
changeset
|
358 |
commas_quote xs ^ " of " ^ string_of_sort [c2], [], [])); |
19405 | 359 |
in (c1, c2) end; |
360 |
||
361 |
fun read_classrel thy raw_rel = |
|
36610
bafd82950e24
renamed ProofContext.init to ProofContext.init_global to emphasize that this is not the real thing;
wenzelm
parents:
36456
diff
changeset
|
362 |
cert_classrel thy (pairself (ProofContext.read_class (ProofContext.init_global thy)) raw_rel) |
19405 | 363 |
handle TYPE (msg, _, _) => error msg; |
364 |
||
365 |
||
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
366 |
(* declaration and definition of instances of overloaded constants *) |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
367 |
|
35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
368 |
fun inst_tyco_of thy (c, T) = |
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
369 |
(case get_inst_tyco (Sign.consts_of thy) (c, T) of |
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
370 |
SOME tyco => tyco |
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
371 |
| NONE => error ("Illegal type for instantiation of class parameter: " ^ |
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
372 |
quote (c ^ " :: " ^ Syntax.string_of_typ_global thy T))); |
31249 | 373 |
|
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
374 |
fun declare_overloaded (c, T) thy = |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
375 |
let |
35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
376 |
val class = |
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
377 |
(case class_of_param thy c of |
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
378 |
SOME class => class |
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
379 |
| NONE => error ("Not a class parameter: " ^ quote c)); |
31249 | 380 |
val tyco = inst_tyco_of thy (c, T); |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
381 |
val name_inst = instance_name (tyco, class) ^ "_inst"; |
36417 | 382 |
val c' = instance_name (tyco, c); |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
383 |
val T' = Type.strip_sorts T; |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
384 |
in |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
385 |
thy |
35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
386 |
|> Sign.qualified_path true (Binding.name name_inst) |
33173
b8ca12f6681a
eliminated obsolete tags for types/consts -- now handled via name space, in strongly typed fashion;
wenzelm
parents:
33172
diff
changeset
|
387 |
|> Sign.declare_const ((Binding.name c', T'), NoSyn) |
30344
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset
|
388 |
|-> (fn const' as Const (c'', _) => |
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset
|
389 |
Thm.add_def false true |
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset
|
390 |
(Binding.name (Thm.def_name c'), Logic.mk_equals (Const (c, T'), const')) |
36106
19deea200358
Thm.add_axiom/add_def: return internal name of foundational axiom;
wenzelm
parents:
35961
diff
changeset
|
391 |
#>> apsnd Thm.varifyT_global |
19deea200358
Thm.add_axiom/add_def: return internal name of foundational axiom;
wenzelm
parents:
35961
diff
changeset
|
392 |
#-> (fn (_, thm) => add_inst_param (c, tyco) (c'', thm) |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39134
diff
changeset
|
393 |
#> Global_Theory.add_thm ((Binding.conceal (Binding.name c'), thm), []) |
36417 | 394 |
#> #2 |
36106
19deea200358
Thm.add_axiom/add_def: return internal name of foundational axiom;
wenzelm
parents:
35961
diff
changeset
|
395 |
#> pair (Const (c, T)))) |
35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
396 |
||> Sign.restore_naming thy |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
397 |
end; |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
398 |
|
30519
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30469
diff
changeset
|
399 |
fun define_overloaded b (c, t) thy = |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
400 |
let |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
401 |
val T = Term.fastype_of t; |
31249 | 402 |
val tyco = inst_tyco_of thy (c, T); |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
403 |
val (c', eq) = get_inst_param thy (c, tyco); |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
404 |
val prop = Logic.mk_equals (Const (c', T), t); |
36417 | 405 |
val b' = Thm.def_binding_optional (Binding.name (instance_name (tyco, c))) b; |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
406 |
in |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
407 |
thy |
30519
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30469
diff
changeset
|
408 |
|> Thm.add_def false false (b', prop) |
38383 | 409 |
|>> (fn (_, thm) => Drule.transitive_thm OF [eq, thm]) |
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
410 |
end; |
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
411 |
|
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset
|
412 |
|
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
413 |
(* primitive rules *) |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
414 |
|
37249 | 415 |
fun add_classrel raw_th thy = |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
416 |
let |
31948
ea8c8bf47ce3
add_classrel/arity: strip_shyps of stored result;
wenzelm
parents:
31944
diff
changeset
|
417 |
val th = Thm.strip_shyps (Thm.transfer thy raw_th); |
ea8c8bf47ce3
add_classrel/arity: strip_shyps of stored result;
wenzelm
parents:
31944
diff
changeset
|
418 |
val prop = Thm.plain_prop_of th; |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
419 |
fun err () = raise THM ("add_classrel: malformed class relation", 0, [th]); |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
420 |
val rel = Logic.dest_classrel prop handle TERM _ => err (); |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
421 |
val (c1, c2) = cert_classrel thy rel handle TYPE _ => err (); |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39134
diff
changeset
|
422 |
val (th', thy') = Global_Theory.store_thm |
37249 | 423 |
(Binding.name (prefix classrel_prefix (Logic.name_classrel (c1, c2))), th) thy; |
37232
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
424 |
val th'' = th' |
36934
ae0809cff6f0
normalize atyp names after unconstrainT, which may rename atyps arbitrarily;
krauss
parents:
36881
diff
changeset
|
425 |
|> Thm.unconstrainT |
37232
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
426 |
|> Drule.instantiate' [SOME (ctyp_of thy' (TVar ((Name.aT, 0), [])))] []; |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
427 |
in |
37232
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
428 |
thy' |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
429 |
|> Sign.primitive_classrel (c1, c2) |
37232
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
430 |
|> (#2 oo put_trancl_classrel) ((c1, c2), th'') |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
431 |
|> perhaps complete_arities |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
432 |
end; |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
433 |
|
37249 | 434 |
fun add_arity raw_th thy = |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
435 |
let |
31948
ea8c8bf47ce3
add_classrel/arity: strip_shyps of stored result;
wenzelm
parents:
31944
diff
changeset
|
436 |
val th = Thm.strip_shyps (Thm.transfer thy raw_th); |
ea8c8bf47ce3
add_classrel/arity: strip_shyps of stored result;
wenzelm
parents:
31944
diff
changeset
|
437 |
val prop = Thm.plain_prop_of th; |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
438 |
fun err () = raise THM ("add_arity: malformed type arity", 0, [th]); |
37232
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
439 |
val arity as (t, Ss, c) = Logic.dest_arity prop handle TERM _ => err (); |
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
440 |
|
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39134
diff
changeset
|
441 |
val (th', thy') = Global_Theory.store_thm |
37249 | 442 |
(Binding.name (prefix arity_prefix (Logic.name_arity arity)), th) thy; |
36417 | 443 |
|
444 |
val args = Name.names Name.context Name.aT Ss; |
|
445 |
val T = Type (t, map TFree args); |
|
37232
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
446 |
val std_vars = map (fn (a, S) => SOME (ctyp_of thy' (TVar ((a, 0), [])))) args; |
36417 | 447 |
|
37232
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
448 |
val missing_params = Sign.complete_sort thy' [c] |
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
449 |
|> maps (these o Option.map #params o try (get_info thy')) |
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
450 |
|> filter_out (fn (const, _) => can (get_inst_param thy') (const, t)) |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
451 |
|> (map o apsnd o map_atyps) (K T); |
37232
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
452 |
val th'' = th' |
36934
ae0809cff6f0
normalize atyp names after unconstrainT, which may rename atyps arbitrarily;
krauss
parents:
36881
diff
changeset
|
453 |
|> Thm.unconstrainT |
ae0809cff6f0
normalize atyp names after unconstrainT, which may rename atyps arbitrarily;
krauss
parents:
36881
diff
changeset
|
454 |
|> Drule.instantiate' std_vars []; |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
455 |
in |
37232
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
456 |
thy' |
36417 | 457 |
|> fold (#2 oo declare_overloaded) missing_params |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
458 |
|> Sign.primitive_arity (t, Ss, [c]) |
37232
c10fb22a5e0c
classrel and arity theorems are now stored under proper name in theory. add_arity and
berghofe
parents:
36935
diff
changeset
|
459 |
|> put_arity ((t, Ss, c), th'') |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
460 |
end; |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
461 |
|
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
462 |
|
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
463 |
(* tactical proofs *) |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
464 |
|
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
465 |
fun prove_classrel raw_rel tac thy = |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
466 |
let |
36610
bafd82950e24
renamed ProofContext.init to ProofContext.init_global to emphasize that this is not the real thing;
wenzelm
parents:
36456
diff
changeset
|
467 |
val ctxt = ProofContext.init_global thy; |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
468 |
val (c1, c2) = cert_classrel thy raw_rel; |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
469 |
val th = Goal.prove ctxt [] [] (Logic.mk_classrel (c1, c2)) (K tac) handle ERROR msg => |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
470 |
cat_error msg ("The error(s) above occurred while trying to prove class relation " ^ |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
471 |
quote (Syntax.string_of_classrel ctxt [c1, c2])); |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
472 |
in |
37249 | 473 |
thy |> add_classrel th |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
474 |
end; |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
475 |
|
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
476 |
fun prove_arity raw_arity tac thy = |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
477 |
let |
36610
bafd82950e24
renamed ProofContext.init to ProofContext.init_global to emphasize that this is not the real thing;
wenzelm
parents:
36456
diff
changeset
|
478 |
val ctxt = ProofContext.init_global thy; |
35669
a91c7ed801b8
added ProofContext.tsig_of -- proforma version for local name space only, not logical content;
wenzelm
parents:
35238
diff
changeset
|
479 |
val arity = ProofContext.cert_arity ctxt raw_arity; |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
480 |
val names = map (prefix arity_prefix) (Logic.name_arities arity); |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
481 |
val props = Logic.mk_arities arity; |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
482 |
val ths = Goal.prove_multi ctxt [] [] props |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
483 |
(fn _ => Goal.precise_conjunction_tac (length props) 1 THEN tac) handle ERROR msg => |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
484 |
cat_error msg ("The error(s) above occurred while trying to prove type arity " ^ |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
485 |
quote (Syntax.string_of_arity ctxt arity)); |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
486 |
in |
37249 | 487 |
thy |> fold add_arity ths |
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
488 |
end; |
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
489 |
|
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset
|
490 |
|
19511 | 491 |
|
492 |
(** class definitions **) |
|
493 |
||
23421 | 494 |
fun split_defined n eq = |
495 |
let |
|
496 |
val intro = |
|
497 |
(eq RS Drule.equal_elim_rule2) |
|
498 |
|> Conjunction.curry_balanced n |
|
499 |
|> n = 0 ? Thm.eq_assumption 1; |
|
500 |
val dests = |
|
501 |
if n = 0 then [] |
|
502 |
else |
|
503 |
(eq RS Drule.equal_elim_rule1) |
|
32765 | 504 |
|> Balanced_Tree.dest (fn th => |
23421 | 505 |
(th RS Conjunction.conjunctionD1, th RS Conjunction.conjunctionD2)) n; |
506 |
in (intro, dests) end; |
|
507 |
||
24964 | 508 |
fun define_class (bclass, raw_super) raw_params raw_specs thy = |
19511 | 509 |
let |
39133
70d3915c92f0
pretty printing: prefer regular Proof.context over Pretty.pp, which is mostly for special bootstrap purposes involving theory merge, for example;
wenzelm
parents:
38383
diff
changeset
|
510 |
val ctxt = Syntax.init_pretty_global thy; |
19511 | 511 |
|
512 |
||
24964 | 513 |
(* class *) |
19511 | 514 |
|
30344
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset
|
515 |
val bconst = Binding.map_name Logic.const_of_class bclass; |
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset
|
516 |
val class = Sign.full_name thy bclass; |
24731 | 517 |
val super = Sign.minimize_sort thy (Sign.certify_sort thy raw_super); |
19511 | 518 |
|
24964 | 519 |
fun check_constraint (a, S) = |
520 |
if Sign.subsort thy (super, S) then () |
|
521 |
else error ("Sort constraint of type variable " ^ |
|
39134
917b4b6ba3d2
turned show_sorts/show_types into proper configuration options;
wenzelm
parents:
39133
diff
changeset
|
522 |
Syntax.string_of_typ (Config.put show_sorts true ctxt) (TFree (a, S)) ^ |
39133
70d3915c92f0
pretty printing: prefer regular Proof.context over Pretty.pp, which is mostly for special bootstrap purposes involving theory merge, for example;
wenzelm
parents:
38383
diff
changeset
|
523 |
" needs to be weaker than " ^ Syntax.string_of_sort ctxt super); |
24964 | 524 |
|
525 |
||
526 |
(* params *) |
|
527 |
||
528 |
val params = raw_params |> map (fn p => |
|
529 |
let |
|
530 |
val T = Sign.the_const_type thy p; |
|
531 |
val _ = |
|
532 |
(case Term.add_tvarsT T [] of |
|
533 |
[((a, _), S)] => check_constraint (a, S) |
|
534 |
| _ => error ("Exactly one type variable expected in class parameter " ^ quote p)); |
|
535 |
val T' = Term.map_type_tvar (fn _ => TFree (Name.aT, [class])) T; |
|
536 |
in (p, T') end); |
|
537 |
||
538 |
||
539 |
(* axioms *) |
|
540 |
||
19511 | 541 |
fun prep_axiom t = |
542 |
(case Term.add_tfrees t [] of |
|
24964 | 543 |
[(a, S)] => check_constraint (a, S) |
544 |
| [] => () |
|
39133
70d3915c92f0
pretty printing: prefer regular Proof.context over Pretty.pp, which is mostly for special bootstrap purposes involving theory merge, for example;
wenzelm
parents:
38383
diff
changeset
|
545 |
| _ => error ("Multiple type variables in class axiom:\n" ^ Syntax.string_of_term ctxt t); |
24964 | 546 |
t |
547 |
|> Term.map_types (Term.map_atyps (fn TFree _ => Term.aT [] | U => U)) |
|
548 |
|> Logic.close_form); |
|
19511 | 549 |
|
24681 | 550 |
val axiomss = map (map (prep_axiom o Sign.cert_prop thy) o snd) raw_specs; |
22745 | 551 |
val name_atts = map fst raw_specs; |
19511 | 552 |
|
553 |
||
554 |
(* definition *) |
|
555 |
||
35854 | 556 |
val conjs = Logic.mk_of_sort (Term.aT [], super) @ flat axiomss; |
19511 | 557 |
val class_eq = |
31943
5e960a0780a2
renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents:
31904
diff
changeset
|
558 |
Logic.mk_equals (Logic.mk_of_class (Term.aT [], class), Logic.mk_conjunction_balanced conjs); |
19511 | 559 |
|
560 |
val ([def], def_thy) = |
|
561 |
thy |
|
562 |
|> Sign.primitive_class (bclass, super) |
|
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39134
diff
changeset
|
563 |
|> Global_Theory.add_defs false [((Thm.def_binding bconst, class_eq), [])]; |
19511 | 564 |
val (raw_intro, (raw_classrel, raw_axioms)) = |
23421 | 565 |
split_defined (length conjs) def ||> chop (length super); |
19392 | 566 |
|
19418
03b01c9314fc
reworded add_axclass(_i): canonical specification format,
wenzelm
parents:
19405
diff
changeset
|
567 |
|
19511 | 568 |
(* facts *) |
569 |
||
570 |
val class_triv = Thm.class_triv def_thy class; |
|
571 |
val ([(_, [intro]), (_, classrel), (_, axioms)], facts_thy) = |
|
572 |
def_thy |
|
35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
573 |
|> Sign.qualified_path true bconst |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39134
diff
changeset
|
574 |
|> Global_Theory.note_thmss "" |
36326 | 575 |
[((Binding.name "intro", []), [([Drule.export_without_context raw_intro], [])]), |
576 |
((Binding.name "super", []), [(map Drule.export_without_context raw_classrel, [])]), |
|
577 |
((Binding.name "axioms", []), |
|
35021
c839a4c670c6
renamed old-style Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
34259
diff
changeset
|
578 |
[(map (fn th => Drule.export_without_context (class_triv RS th)) raw_axioms, [])])] |
27691
ce171cbd4b93
PureThy: dropped note_thmss_qualified, dropped _i suffix
haftmann
parents:
27683
diff
changeset
|
579 |
||> Sign.restore_naming def_thy; |
19511 | 580 |
|
24847 | 581 |
|
19511 | 582 |
(* result *) |
583 |
||
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
584 |
val axclass = make_axclass (def, intro, axioms, params); |
19511 | 585 |
val result_thy = |
586 |
facts_thy |
|
36417 | 587 |
|> fold (#2 oo put_trancl_classrel) (map (pair class) super ~~ classrel) |
35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset
|
588 |
|> Sign.qualified_path false bconst |
39557
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39134
diff
changeset
|
589 |
|> Global_Theory.note_thmss "" (name_atts ~~ map Thm.simple_fact (unflat axiomss axioms)) |
fe5722fce758
renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents:
39134
diff
changeset
|
590 |
|> #2 |
19511 | 591 |
|> Sign.restore_naming facts_thy |
36329
85004134055c
more systematic treatment of data -- avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset
|
592 |
|> map_axclasses (Symtab.update (class, axclass)) |
39133
70d3915c92f0
pretty printing: prefer regular Proof.context over Pretty.pp, which is mostly for special bootstrap purposes involving theory merge, for example;
wenzelm
parents:
38383
diff
changeset
|
593 |
|> map_params (fold (fn (x, _) => add_param (Syntax.pp ctxt) (x, class)) params); |
19511 | 594 |
|
595 |
in (class, result_thy) end; |
|
596 |
||
597 |
||
19531 | 598 |
|
19511 | 599 |
(** axiomatizations **) |
600 |
||
601 |
local |
|
602 |
||
36417 | 603 |
(*old-style axioms*) |
20628 | 604 |
fun axiomatize prep mk name add raw_args thy = |
605 |
let |
|
606 |
val args = prep thy raw_args; |
|
607 |
val specs = mk args; |
|
608 |
val names = name args; |
|
29579 | 609 |
in |
610 |
thy |
|
37249 | 611 |
|> fold_map Thm.add_axiom (map Binding.name names ~~ specs) |
612 |
|-> fold (add o Drule.export_without_context o snd) |
|
29579 | 613 |
end; |
19511 | 614 |
|
615 |
fun ax_classrel prep = |
|
20628 | 616 |
axiomatize (map o prep) (map Logic.mk_classrel) |
37249 | 617 |
(map (prefix classrel_prefix o Logic.name_classrel)) add_classrel; |
19511 | 618 |
|
619 |
fun ax_arity prep = |
|
36610
bafd82950e24
renamed ProofContext.init to ProofContext.init_global to emphasize that this is not the real thing;
wenzelm
parents:
36456
diff
changeset
|
620 |
axiomatize (prep o ProofContext.init_global) Logic.mk_arities |
37249 | 621 |
(map (prefix arity_prefix) o Logic.name_arities) add_arity; |
19511 | 622 |
|
19706 | 623 |
fun class_const c = |
624 |
(Logic.const_of_class c, Term.itselfT (Term.aT []) --> propT); |
|
625 |
||
19511 | 626 |
fun ax_class prep_class prep_classrel (bclass, raw_super) thy = |
627 |
let |
|
30344
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset
|
628 |
val class = Sign.full_name thy bclass; |
24731 | 629 |
val super = map (prep_class thy) raw_super |> Sign.minimize_sort thy; |
19511 | 630 |
in |
631 |
thy |
|
632 |
|> Sign.primitive_class (bclass, super) |
|
633 |
|> ax_classrel prep_classrel (map (fn c => (class, c)) super) |
|
19706 | 634 |
|> Theory.add_deps "" (class_const class) (map class_const super) |
19511 | 635 |
end; |
636 |
||
637 |
in |
|
638 |
||
24929
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
639 |
val axiomatize_class = ax_class Sign.certify_class cert_classrel; |
36610
bafd82950e24
renamed ProofContext.init to ProofContext.init_global to emphasize that this is not the real thing;
wenzelm
parents:
36456
diff
changeset
|
640 |
val axiomatize_class_cmd = ax_class (ProofContext.read_class o ProofContext.init_global) read_classrel; |
24929
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
641 |
val axiomatize_classrel = ax_classrel cert_classrel; |
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset
|
642 |
val axiomatize_classrel_cmd = ax_classrel read_classrel; |
35669
a91c7ed801b8
added ProofContext.tsig_of -- proforma version for local name space only, not logical content;
wenzelm
parents:
35238
diff
changeset
|
643 |
val axiomatize_arity = ax_arity ProofContext.cert_arity; |
a91c7ed801b8
added ProofContext.tsig_of -- proforma version for local name space only, not logical content;
wenzelm
parents:
35238
diff
changeset
|
644 |
val axiomatize_arity_cmd = ax_arity ProofContext.read_arity; |
19511 | 645 |
|
646 |
end; |
|
647 |
||
648 |
end; |