author  wenzelm 
Mon, 26 Apr 2010 14:44:41 +0200  
changeset 36346  5518de23101d 
parent 36330  0584e203960e 
child 36417  54bc1a44967d 
permissions  rwrr 
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 
5 
parameters. 

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 
30344
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset

10 
val define_class: binding * class list > string list > 
30211  11 
(Thm.binding * term list) list > theory > class * theory 
24589  12 
val add_classrel: thm > theory > theory 
13 
val add_arity: thm > theory > theory 

14 
val prove_classrel: class * class > tactic > theory > theory 

15 
val prove_arity: string * sort list * sort > tactic > theory > theory 

36327  16 
type info = {def: thm, intro: thm, axioms: thm list, params: (string * typ) list} 
17 
val get_info: theory > class > info 

20107  18 
val class_of_param: theory > string > class option 
19405  19 
val cert_classrel: theory > class * class > class * class 
20 
val read_classrel: theory > xstring * xstring > class * class 

30344
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset

21 
val axiomatize_class: binding * class list > theory > theory 
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset

22 
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

23 
val axiomatize_classrel: (class * class) list > theory > theory 
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

24 
val axiomatize_classrel_cmd: (xstring * xstring) list > theory > theory 
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

25 
val axiomatize_arity: arity > theory > theory 
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

26 
val axiomatize_arity_cmd: xstring * string list * string > theory > theory 
25486  27 
val instance_name: string * class > string 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

28 
val declare_overloaded: string * typ > theory > term * theory 
30519
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30469
diff
changeset

29 
val define_overloaded: binding > string * term > theory > thm * theory 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

30 
val unoverload: theory > thm > thm 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

31 
val overload: theory > thm > thm 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

32 
val unoverload_conv: theory > conv 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

33 
val overload_conv: theory > conv 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

34 
val unoverload_const: theory > string * typ > string 
31249  35 
val lookup_inst_param: Consts.T > ((string * string) * 'a) list > string * typ > 'a option 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

36 
val param_of_inst: theory > string * string > string 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

37 
val inst_of_param: theory > string > (string * string) option 
33172  38 
val thynames_of_arity: theory > class * string > string list 
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, 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

75 
proven_classrels: (thm * proof) Symreltab.table, 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

76 
proven_arities: ((class * sort list) * ((thm * string) * proof)) list Symtab.table, 
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)*), 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

82 
diff_merge_classrels: (class * class) list}; 
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 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

85 
(axclasses, params, proven_classrels, proven_arities, inst_params, diff_merge_classrels) = 
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, 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

88 
diff_merge_classrels = diff_merge_classrels}; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

89 

36327  90 
structure Data = Theory_Data_PP 
22846  91 
( 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

92 
type T = data; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

93 
val empty = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

94 
make_data (Symtab.empty, [], Symreltab.empty, Symtab.empty, (Symtab.empty, Symtab.empty), []); 
19574  95 
val extend = I; 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

96 
fun merge pp 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

97 
(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

98 
proven_arities = proven_arities1, inst_params = inst_params1, 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

99 
diff_merge_classrels = diff_merge_classrels1}, 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

100 
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

101 
proven_arities = proven_arities2, inst_params = inst_params2, 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

102 
diff_merge_classrels = diff_merge_classrels2}) = 
36325  103 
let 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

104 
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

105 
val params' = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

106 
if null params1 then params2 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

107 
else fold_rev (fn q => if member (op =) params1 q then I else add_param pp q) params2 params1; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

108 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

109 
(*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

110 
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

111 
val proven_arities' = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

112 
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

113 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

114 
val classrels1 = Symreltab.keys proven_classrels1; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

115 
val classrels2 = Symreltab.keys proven_classrels2; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

116 
val diff_merge_classrels' = 
36327  117 
subtract (op =) classrels1 classrels2 @ 
118 
subtract (op =) classrels2 classrels1 @ 

119 
diff_merge_classrels1 @ diff_merge_classrels2; 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

120 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

121 
val inst_params' = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

122 
(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

123 
Symtab.merge (K true) (#2 inst_params1, #2 inst_params2)); 
36325  124 
in 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

125 
make_data (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

126 
diff_merge_classrels') 
36325  127 
end; 
22846  128 
); 
6379  129 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

130 
fun map_data f = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

131 
Data.map (fn Data {axclasses, params, proven_classrels, proven_arities, inst_params, diff_merge_classrels} => 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

132 
make_data (f (axclasses, params, proven_classrels, proven_arities, inst_params, diff_merge_classrels))); 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

133 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

134 
fun map_axclasses f = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

135 
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, diff_merge_classrels) => 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

136 
(f axclasses, params, proven_classrels, proven_arities, inst_params, diff_merge_classrels)); 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

137 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

138 
fun map_params f = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

139 
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, diff_merge_classrels) => 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

140 
(axclasses, f params, proven_classrels, proven_arities, inst_params, diff_merge_classrels)); 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

141 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

142 
fun map_proven_classrels f = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

143 
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, diff_merge_classrels) => 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

144 
(axclasses, params, f proven_classrels, proven_arities, inst_params, diff_merge_classrels)); 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

145 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

146 
fun map_proven_arities f = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

147 
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, diff_merge_classrels) => 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

148 
(axclasses, params, proven_classrels, f proven_arities, inst_params, diff_merge_classrels)); 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

149 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

150 
fun map_inst_params f = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

151 
map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params, diff_merge_classrels) => 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

152 
(axclasses, params, proven_classrels, proven_arities, f inst_params, diff_merge_classrels)); 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

153 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

154 
val clear_diff_merge_classrels = 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

155 
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

156 
(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 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

158 
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

159 

85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

160 
val axclasses_of = #axclasses o rep_data; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

161 
val params_of = #params o rep_data; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

162 
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

163 
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

164 
val inst_params_of = #inst_params o rep_data; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

165 
val diff_merge_classrels_of = #diff_merge_classrels o rep_data; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

166 

6379  167 

36346  168 
(* axclasses with parameters *) 
19392  169 

24929
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

170 
fun get_info thy c = 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

171 
(case Symtab.lookup (axclasses_of thy) c of 
36327  172 
SOME info => info 
21919  173 
 NONE => error ("No such axclass: " ^ quote c)); 
6379  174 

36327  175 
fun all_params_of thy S = 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

176 
let val params = params_of thy; 
36327  177 
in fold (fn (x, c) => if Sign.subsort thy (S, [c]) then cons x else I) params [] end; 
19460  178 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

179 
fun class_of_param thy = AList.lookup (op =) (params_of thy); 
19460  180 

21919  181 

19511  182 
(* maintain instances *) 
19503  183 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

184 
val classrel_prefix = "classrel_"; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

185 
val arity_prefix = "arity_"; 
25486  186 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

187 
fun instance_name (a, c) = Long_Name.base_name c ^ "_" ^ Long_Name.base_name a; 
19528  188 

189 

19574  190 
fun the_classrel thy (c1, c2) = 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

191 
(case Symreltab.lookup (proven_classrels_of thy) (c1, c2) of 
36325  192 
SOME classrel => classrel 
24920  193 
 NONE => error ("Unproven class relation " ^ 
194 
Syntax.string_of_classrel (ProofContext.init thy) [c1, c2])); 

19574  195 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

196 
fun the_classrel_thm thy = Thm.transfer thy o #1 o the_classrel thy; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

197 
fun the_classrel_prf thy = #2 o the_classrel thy; 
36325  198 

199 
fun put_trancl_classrel ((c1, c2), th) thy = 

200 
let 

36327  201 
val cert = Thm.cterm_of thy; 
202 
val certT = Thm.ctyp_of thy; 

203 

36328
4d9deabf6474
replaced Sorts.rep_algebra by slightly more abstract selectors classes_of/arities_of;
wenzelm
parents:
36327
diff
changeset

204 
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

205 
val classrels = proven_classrels_of thy; 
36325  206 

207 
fun reflcl_classrel (c1', c2') = 

36327  208 
if c1' = c2' 
209 
then Thm.trivial (cert (Logic.mk_of_class (TVar ((Name.aT, 0), []), c1'))) 

210 
else the_classrel_thm thy (c1', c2'); 

36325  211 
fun gen_classrel (c1_pred, c2_succ) = 
212 
let 

213 
val th' = ((reflcl_classrel (c1_pred, c1) RS th) RS reflcl_classrel (c2, c2_succ)) 

36327  214 
> Drule.instantiate' [SOME (certT (TVar ((Name.aT, 0), [])))] [] 
215 
> Thm.close_derivation; 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

216 
val prf' = Thm.proof_of th'; 
36327  217 
in ((c1_pred, c2_succ), (th', prf')) end; 
36325  218 

36327  219 
val new_classrels = 
220 
Library.map_product pair (c1 :: Graph.imm_preds classes c1) (c2 :: Graph.imm_succs classes c2) 

36325  221 
> filter_out (Symreltab.defined classrels) 
36327  222 
> map gen_classrel; 
223 
val needed = not (null new_classrels); 

36325  224 
in 
225 
(needed, 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

226 
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

227 
else thy) 
36325  228 
end; 
229 

230 
fun complete_classrels thy = 

231 
let 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

232 
val classrels = proven_classrels_of thy; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

233 
val diff_merge_classrels = diff_merge_classrels_of thy; 
36325  234 
val (needed, thy') = (false, thy) > 
235 
fold (fn c12 => fn (needed, thy) => 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

236 
put_trancl_classrel (c12, Symreltab.lookup classrels c12 > the > #1) thy 
36325  237 
>> (fn b => needed orelse b)) 
36327  238 
diff_merge_classrels; 
36325  239 
in 
240 
if null diff_merge_classrels then NONE 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

241 
else SOME (clear_diff_merge_classrels thy') 
36325  242 
end; 
19503  243 

244 

19574  245 
fun the_arity thy a (c, Ss) = 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

246 
(case AList.lookup (op =) (Symtab.lookup_list (proven_arities_of thy) a) (c, Ss) of 
36325  247 
SOME arity => arity 
24920  248 
 NONE => error ("Unproven type arity " ^ 
249 
Syntax.string_of_arity (ProofContext.init thy) (a, Ss, [c]))); 

19503  250 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

251 
fun the_arity_thm thy a c_Ss = the_arity thy a c_Ss > #1 > #1 > Thm.transfer thy; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

252 
fun the_arity_prf thy a c_Ss = the_arity thy a c_Ss > #2; 
36325  253 

33172  254 
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

255 
Symtab.lookup_list (proven_arities_of thy) a 
36325  256 
> map_filter (fn ((c', _), ((_, name),_)) => if c = c' then SOME name else NONE) 
27497  257 
> rev; 
27397  258 

36325  259 
fun insert_arity_completions thy (t, ((c, Ss), ((th, thy_name), _))) arities = 
27547  260 
let 
261 
val algebra = Sign.classes_of thy; 

33172  262 
val super_class_completions = 
263 
Sign.super_classes thy c 

27547  264 
> filter_out (fn c1 => exists (fn ((c2, Ss2), _) => c1 = c2 
33172  265 
andalso Sorts.sorts_le algebra (Ss2, Ss)) (Symtab.lookup_list arities t)); 
36325  266 
val names_and_Ss = Name.names Name.context Name.aT (map (K []) Ss); 
267 
val completions = super_class_completions > map (fn c1 => 

268 
let 

269 
val th1 = (th RS the_classrel_thm thy (c, c1)) 

270 
> Drule.instantiate' (map (SOME o ctyp_of thy o TVar o apfst (rpair 0)) names_and_Ss) [] 

36327  271 
> Thm.close_derivation; 
272 
val prf1 = Thm.proof_of th1; 

273 
in (((th1, thy_name), prf1), c1) end); 

36325  274 
val arities' = fold (fn (th_thy_prf1, c1) => Symtab.cons_list (t, ((c1, Ss), th_thy_prf1))) 
27547  275 
completions arities; 
33172  276 
in (null completions, arities') end; 
19503  277 

27547  278 
fun put_arity ((t, Ss, c), th) thy = 
279 
let 

36325  280 
val arity' = (t, ((c, Ss), ((th, Context.theory_name thy), Thm.proof_of th))); 
27547  281 
in 
282 
thy 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

283 
> map_proven_arities 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

284 
(Symtab.insert_list (eq_fst op =) arity' #> 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

285 
insert_arity_completions thy arity' #> snd) 
27547  286 
end; 
19503  287 

31944  288 
fun complete_arities thy = 
27547  289 
let 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

290 
val arities = proven_arities_of thy; 
33172  291 
val (finished, arities') = arities 
292 
> fold_map (insert_arity_completions thy) (Symtab.dest_list arities); 

293 
in 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

294 
if forall I finished 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

295 
then NONE 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

296 
else SOME (map_proven_arities (K arities') thy) 
27547  297 
end; 
298 

36325  299 
val _ = Context.>> (Context.map_theory 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

300 
(Theory.at_begin complete_classrels #> Theory.at_begin complete_arities)); 
27397  301 

302 

25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

303 
(* maintain instance parameters *) 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

304 

34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

305 
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

306 
(case Symtab.lookup (the_default Symtab.empty (Symtab.lookup (#1 (inst_params_of thy)) c)) tyco of 
36327  307 
SOME c' => c' 
308 
 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

309 

36327  310 
fun add_inst_param (c, tyco) inst = 
311 
(map_inst_params o apfst o Symtab.map_default (c, Symtab.empty)) (Symtab.update_new (tyco, inst)) 

25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

312 
#> (map_inst_params o apsnd) (Symtab.update_new (fst inst, (c, tyco))); 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

313 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

314 
val inst_of_param = Symtab.lookup o #2 o inst_params_of; 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

315 
val param_of_inst = fst oo get_inst_param; 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

316 

36327  317 
fun inst_thms thy = 
36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

318 
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

319 

31249  320 
fun get_inst_tyco consts = try (fst 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

321 

34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

322 
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

323 
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

324 

34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

325 
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

326 
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

327 

36327  328 
fun lookup_inst_param consts params (c, T) = 
329 
(case get_inst_tyco consts (c, T) of 

330 
SOME tyco => AList.lookup (op =) params (c, tyco) 

331 
 NONE => NONE); 

31249  332 

25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

333 
fun unoverload_const thy (c_ty as (c, _)) = 
36327  334 
if is_some (class_of_param thy c) then 
335 
(case get_inst_tyco (Sign.consts_of thy) c_ty of 

336 
SOME tyco => try (param_of_inst thy) (c, tyco) > the_default c 

337 
 NONE => c) 

33969  338 
else c; 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

339 

404
dd3d3d6467db
axiomatic type class 'package' for Pure (alpha version);
wenzelm
parents:
diff
changeset

340 

36327  341 

19511  342 
(** instances **) 
19418
03b01c9314fc
reworded add_axclass(_i): canonical specification format,
wenzelm
parents:
19405
diff
changeset

343 

03b01c9314fc
reworded add_axclass(_i): canonical specification format,
wenzelm
parents:
19405
diff
changeset

344 
(* class relations *) 
03b01c9314fc
reworded add_axclass(_i): canonical specification format,
wenzelm
parents:
19405
diff
changeset

345 

19405  346 
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

347 
let 
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26516
diff
changeset

348 
val string_of_sort = Syntax.string_of_sort_global thy; 
19405  349 
val (c1, c2) = pairself (Sign.certify_class thy) raw_rel; 
24271  350 
val _ = Sign.primitive_classrel (c1, c2) (Theory.copy thy); 
19405  351 
val _ = 
19460  352 
(case subtract (op =) (all_params_of thy [c1]) (all_params_of thy [c2]) of 
19405  353 
[] => () 
26939
1035c89b4c02
moved global pretty/string_of functions from Sign to Syntax;
wenzelm
parents:
26516
diff
changeset

354 
 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

355 
commas_quote xs ^ " of " ^ string_of_sort [c2], [], [])); 
19405  356 
in (c1, c2) end; 
357 

358 
fun read_classrel thy raw_rel = 

35669
a91c7ed801b8
added ProofContext.tsig_of  proforma version for local name space only, not logical content;
wenzelm
parents:
35238
diff
changeset

359 
cert_classrel thy (pairself (ProofContext.read_class (ProofContext.init thy)) raw_rel) 
19405  360 
handle TYPE (msg, _, _) => error msg; 
361 

362 

25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

363 
(* declaration and definition of instances of overloaded constants *) 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

364 

35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

365 
fun inst_tyco_of thy (c, T) = 
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

366 
(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

367 
SOME tyco => tyco 
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

368 
 NONE => error ("Illegal type for instantiation of class parameter: " ^ 
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

369 
quote (c ^ " :: " ^ Syntax.string_of_typ_global thy T))); 
31249  370 

25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

371 
fun declare_overloaded (c, T) thy = 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

372 
let 
35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

373 
val class = 
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

374 
(case class_of_param thy c of 
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

375 
SOME class => class 
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

376 
 NONE => error ("Not a class parameter: " ^ quote c)); 
31249  377 
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

378 
val name_inst = instance_name (tyco, class) ^ "_inst"; 
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30344
diff
changeset

379 
val c' = Long_Name.base_name c ^ "_" ^ Long_Name.base_name tyco; 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

380 
val T' = Type.strip_sorts T; 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

381 
in 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

382 
thy 
35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

383 
> 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

384 
> 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

385 
> (fn const' as Const (c'', _) => 
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset

386 
Thm.add_def false true 
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset

387 
(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

388 
#>> apsnd Thm.varifyT_global 
19deea200358
Thm.add_axiom/add_def: return internal name of foundational axiom;
wenzelm
parents:
35961
diff
changeset

389 
#> (fn (_, thm) => add_inst_param (c, tyco) (c'', thm) 
19deea200358
Thm.add_axiom/add_def: return internal name of foundational axiom;
wenzelm
parents:
35961
diff
changeset

390 
#> PureThy.add_thm ((Binding.conceal (Binding.name c'), thm), []) 
19deea200358
Thm.add_axiom/add_def: return internal name of foundational axiom;
wenzelm
parents:
35961
diff
changeset

391 
#> snd 
19deea200358
Thm.add_axiom/add_def: return internal name of foundational axiom;
wenzelm
parents:
35961
diff
changeset

392 
#> pair (Const (c, T)))) 
35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

393 
> Sign.restore_naming thy 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

394 
end; 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

395 

30519
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30469
diff
changeset

396 
fun define_overloaded b (c, t) thy = 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

397 
let 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

398 
val T = Term.fastype_of t; 
31249  399 
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

400 
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

401 
val prop = Logic.mk_equals (Const (c', T), t); 
30519
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30469
diff
changeset

402 
val b' = Thm.def_binding_optional 
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30469
diff
changeset

403 
(Binding.name (Long_Name.base_name c ^ "_" ^ Long_Name.base_name tyco)) b; 
25597
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

404 
in 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

405 
thy 
30519
c05c0199826f
coherent binding policy with primitive target operations
haftmann
parents:
30469
diff
changeset

406 
> Thm.add_def false false (b', prop) 
36106
19deea200358
Thm.add_axiom/add_def: return internal name of foundational axiom;
wenzelm
parents:
35961
diff
changeset

407 
>> (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

408 
end; 
34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

409 

34860182b250
moved instance parameter management from class.ML to axclass.ML
haftmann
parents:
25486
diff
changeset

410 

30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

411 
(* primitive rules *) 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

412 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

413 
val shyps_topped = forall null o #shyps o Thm.rep_thm; 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

414 

31948
ea8c8bf47ce3
add_classrel/arity: strip_shyps of stored result;
wenzelm
parents:
31944
diff
changeset

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 (); 
36325  422 
val th' = th 
423 
> Drule.instantiate' [SOME (ctyp_of thy (TVar ((Name.aT, 0), [c1])))] [] 

36330
0584e203960e
renamed Drule.unconstrainTs to Thm.unconstrain_allTs to accomdate the version by krauss/schropp;
wenzelm
parents:
36329
diff
changeset

424 
> Thm.unconstrain_allTs; 
36327  425 
val _ = shyps_topped th' orelse raise Fail "add_classrel: nontop shyps after unconstrain"; 
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

426 
in 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

427 
thy 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

428 
> Sign.primitive_classrel (c1, c2) 
36325  429 
> (snd oo put_trancl_classrel) ((c1, c2), th') 
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

430 
> perhaps complete_arities 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

431 
end; 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

432 

31948
ea8c8bf47ce3
add_classrel/arity: strip_shyps of stored result;
wenzelm
parents:
31944
diff
changeset

433 
fun add_arity raw_th thy = 
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

434 
let 
31948
ea8c8bf47ce3
add_classrel/arity: strip_shyps of stored result;
wenzelm
parents:
31944
diff
changeset

435 
val th = Thm.strip_shyps (Thm.transfer thy raw_th); 
ea8c8bf47ce3
add_classrel/arity: strip_shyps of stored result;
wenzelm
parents:
31944
diff
changeset

436 
val prop = Thm.plain_prop_of th; 
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

437 
fun err () = raise THM ("add_arity: malformed type arity", 0, [th]); 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

438 
val (t, Ss, c) = Logic.dest_arity prop handle TERM _ => err (); 
36325  439 
val names = Name.names Name.context Name.aT Ss; 
440 
val T = Type (t, map TFree names); 

30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

441 
val missing_params = Sign.complete_sort thy [c] 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

442 
> maps (these o Option.map #params o try (get_info thy)) 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

443 
> filter_out (fn (const, _) => can (get_inst_param thy) (const, t)) 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

444 
> (map o apsnd o map_atyps) (K T); 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

445 
val _ = map (Sign.certify_sort thy) Ss = Ss orelse err (); 
36325  446 
val th' = th 
447 
> Drule.instantiate' (map (SOME o ctyp_of thy o TVar o apfst (rpair 0)) names) [] 

36330
0584e203960e
renamed Drule.unconstrainTs to Thm.unconstrain_allTs to accomdate the version by krauss/schropp;
wenzelm
parents:
36329
diff
changeset

448 
> Thm.unconstrain_allTs; 
36327  449 
val _ = shyps_topped th' orelse raise Fail "add_arity: nontop shyps after unconstrain"; 
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

450 
in 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

451 
thy 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

452 
> fold (snd oo declare_overloaded) missing_params 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

453 
> Sign.primitive_arity (t, Ss, [c]) 
36325  454 
> put_arity ((t, Ss, c), th') 
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

455 
end; 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

456 

a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

457 

a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

458 
(* tactical proofs *) 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

459 

a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

460 
fun prove_classrel raw_rel tac thy = 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

461 
let 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

462 
val ctxt = ProofContext.init thy; 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

463 
val (c1, c2) = cert_classrel thy raw_rel; 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

464 
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

465 
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

466 
quote (Syntax.string_of_classrel ctxt [c1, c2])); 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

467 
in 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

468 
thy 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

469 
> PureThy.add_thms [((Binding.name 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

470 
(prefix classrel_prefix (Logic.name_classrel (c1, c2))), th), [])] 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

471 
> (fn [th'] => add_classrel th') 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

472 
end; 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

473 

a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

474 
fun prove_arity raw_arity tac thy = 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

475 
let 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

476 
val ctxt = ProofContext.init thy; 
35669
a91c7ed801b8
added ProofContext.tsig_of  proforma version for local name space only, not logical content;
wenzelm
parents:
35238
diff
changeset

477 
val arity = ProofContext.cert_arity ctxt raw_arity; 
30951
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

478 
val names = map (prefix arity_prefix) (Logic.name_arities arity); 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

479 
val props = Logic.mk_arities arity; 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

480 
val ths = Goal.prove_multi ctxt [] [] props 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

481 
(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

482 
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

483 
quote (Syntax.string_of_arity ctxt arity)); 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

484 
in 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

485 
thy 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

486 
> PureThy.add_thms (map (rpair []) (map Binding.name names ~~ ths)) 
a6e26a248f03
formal declaration of undefined parameters after class instantiation
haftmann
parents:
30519
diff
changeset

487 
> fold add_arity 
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 
510 
val ctxt = ProofContext.init thy; 

24964  511 
val pp = Syntax.pp ctxt; 
19511  512 

513 

24964  514 
(* class *) 
19511  515 

30344
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset

516 
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

517 
val class = Sign.full_name thy bclass; 
24731  518 
val super = Sign.minimize_sort thy (Sign.certify_sort thy raw_super); 
19511  519 

24964  520 
fun check_constraint (a, S) = 
521 
if Sign.subsort thy (super, S) then () 

522 
else error ("Sort constraint of type variable " ^ 

32966
5b21661fe618
indicate CRITICAL nature of various setmp combinators;
wenzelm
parents:
32791
diff
changeset

523 
setmp_CRITICAL show_sorts true (Pretty.string_of_typ pp) (TFree (a, S)) ^ 
24964  524 
" needs to be weaker than " ^ Pretty.string_of_sort pp super); 
525 

526 

527 
(* params *) 

528 

529 
val params = raw_params > map (fn p => 

530 
let 

531 
val T = Sign.the_const_type thy p; 

532 
val _ = 

533 
(case Term.add_tvarsT T [] of 

534 
[((a, _), S)] => check_constraint (a, S) 

535 
 _ => error ("Exactly one type variable expected in class parameter " ^ quote p)); 

536 
val T' = Term.map_type_tvar (fn _ => TFree (Name.aT, [class])) T; 

537 
in (p, T') end); 

538 

539 

540 
(* axioms *) 

541 

19511  542 
fun prep_axiom t = 
543 
(case Term.add_tfrees t [] of 

24964  544 
[(a, S)] => check_constraint (a, S) 
545 
 [] => () 

546 
 _ => error ("Multiple type variables in class axiom:\n" ^ Pretty.string_of_term pp t); 

547 
t 

548 
> Term.map_types (Term.map_atyps (fn TFree _ => Term.aT []  U => U)) 

549 
> Logic.close_form); 

19511  550 

24681  551 
val axiomss = map (map (prep_axiom o Sign.cert_prop thy) o snd) raw_specs; 
22745  552 
val name_atts = map fst raw_specs; 
19511  553 

554 

555 
(* definition *) 

556 

35854  557 
val conjs = Logic.mk_of_sort (Term.aT [], super) @ flat axiomss; 
19511  558 
val class_eq = 
31943
5e960a0780a2
renamed inclass/Inclass to of_class/OfClass, in accordance to of_sort;
wenzelm
parents:
31904
diff
changeset

559 
Logic.mk_equals (Logic.mk_of_class (Term.aT [], class), Logic.mk_conjunction_balanced conjs); 
19511  560 

561 
val ([def], def_thy) = 

562 
thy 

563 
> Sign.primitive_class (bclass, super) 

35238  564 
> PureThy.add_defs false [((Thm.def_binding bconst, class_eq), [])]; 
19511  565 
val (raw_intro, (raw_classrel, raw_axioms)) = 
23421  566 
split_defined (length conjs) def > chop (length super); 
19392  567 

19418
03b01c9314fc
reworded add_axclass(_i): canonical specification format,
wenzelm
parents:
19405
diff
changeset

568 

19511  569 
(* facts *) 
570 

571 
val class_triv = Thm.class_triv def_thy class; 

572 
val ([(_, [intro]), (_, classrel), (_, axioms)], facts_thy) = 

573 
def_thy 

35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

574 
> Sign.qualified_path true bconst 
27691
ce171cbd4b93
PureThy: dropped note_thmss_qualified, dropped _i suffix
haftmann
parents:
27683
diff
changeset

575 
> PureThy.note_thmss "" 
36326  576 
[((Binding.name "intro", []), [([Drule.export_without_context raw_intro], [])]), 
577 
((Binding.name "super", []), [(map Drule.export_without_context raw_classrel, [])]), 

578 
((Binding.name "axioms", []), 

35021
c839a4c670c6
renamed oldstyle Drule.standard to Drule.export_without_context, to emphasize that this is in no way a standard operation;
wenzelm
parents:
34259
diff
changeset

579 
[(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

580 
> Sign.restore_naming def_thy; 
19511  581 

24847  582 

19511  583 
(* result *) 
584 

36329
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

585 
val axclass = make_axclass (def, intro, axioms, params); 
19511  586 
val result_thy = 
587 
facts_thy 

36325  588 
> fold (snd oo put_trancl_classrel) (map (pair class) super ~~ classrel) 
35201
c2ddb9395436
axclass: more precise treatment of naming vs. binding;
wenzelm
parents:
35021
diff
changeset

589 
> Sign.qualified_path false bconst 
27691
ce171cbd4b93
PureThy: dropped note_thmss_qualified, dropped _i suffix
haftmann
parents:
27683
diff
changeset

590 
> PureThy.note_thmss "" (name_atts ~~ map Thm.simple_fact (unflat axiomss axioms)) > snd 
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)) 
85004134055c
more systematic treatment of data  avoid slightly odd nested tuples here;
wenzelm
parents:
36328
diff
changeset

593 
> map_params (fold (fn (x, _) => add_param pp (x, class)) params); 
19511  594 

595 
in (class, result_thy) end; 

596 

597 

19531  598 

19511  599 
(** axiomatizations **) 
600 

601 
local 

602 

35896
487b267433b1
inlined version of oldstyle Drule.add_axioms  Specification.axiom is not bootstrapped yet;
wenzelm
parents:
35856
diff
changeset

603 
(* oldstyle axioms *) 
487b267433b1
inlined version of oldstyle Drule.add_axioms  Specification.axiom is not bootstrapped yet;
wenzelm
parents:
35856
diff
changeset

604 

487b267433b1
inlined version of oldstyle Drule.add_axioms  Specification.axiom is not bootstrapped yet;
wenzelm
parents:
35856
diff
changeset

605 
fun add_axiom (b, prop) = 
487b267433b1
inlined version of oldstyle Drule.add_axioms  Specification.axiom is not bootstrapped yet;
wenzelm
parents:
35856
diff
changeset

606 
Thm.add_axiom (b, prop) #> 
36106
19deea200358
Thm.add_axiom/add_def: return internal name of foundational axiom;
wenzelm
parents:
35961
diff
changeset

607 
(fn (_, thm) => PureThy.add_thm ((b, Drule.export_without_context thm), [])); 
35896
487b267433b1
inlined version of oldstyle Drule.add_axioms  Specification.axiom is not bootstrapped yet;
wenzelm
parents:
35856
diff
changeset

608 

20628  609 
fun axiomatize prep mk name add raw_args thy = 
610 
let 

611 
val args = prep thy raw_args; 

612 
val specs = mk args; 

613 
val names = name args; 

29579  614 
in 
615 
thy 

35896
487b267433b1
inlined version of oldstyle Drule.add_axioms  Specification.axiom is not bootstrapped yet;
wenzelm
parents:
35856
diff
changeset

616 
> fold_map add_axiom (map Binding.name names ~~ specs) 
29579  617 
> fold add 
618 
end; 

19511  619 

620 
fun ax_classrel prep = 

20628  621 
axiomatize (map o prep) (map Logic.mk_classrel) 
622 
(map (prefix classrel_prefix o Logic.name_classrel)) add_classrel; 

19511  623 

624 
fun ax_arity prep = 

35669
a91c7ed801b8
added ProofContext.tsig_of  proforma version for local name space only, not logical content;
wenzelm
parents:
35238
diff
changeset

625 
axiomatize (prep o ProofContext.init) Logic.mk_arities 
20628  626 
(map (prefix arity_prefix) o Logic.name_arities) add_arity; 
19511  627 

19706  628 
fun class_const c = 
629 
(Logic.const_of_class c, Term.itselfT (Term.aT []) > propT); 

630 

19511  631 
fun ax_class prep_class prep_classrel (bclass, raw_super) thy = 
632 
let 

30344
10a67c5ddddb
more uniform handling of binding in targets and derived elements;
wenzelm
parents:
30280
diff
changeset

633 
val class = Sign.full_name thy bclass; 
24731  634 
val super = map (prep_class thy) raw_super > Sign.minimize_sort thy; 
19511  635 
in 
636 
thy 

637 
> Sign.primitive_class (bclass, super) 

638 
> ax_classrel prep_classrel (map (fn c => (class, c)) super) 

19706  639 
> Theory.add_deps "" (class_const class) (map class_const super) 
19511  640 
end; 
641 

642 
in 

643 

24929
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

644 
val axiomatize_class = ax_class Sign.certify_class cert_classrel; 
35669
a91c7ed801b8
added ProofContext.tsig_of  proforma version for local name space only, not logical content;
wenzelm
parents:
35238
diff
changeset

645 
val axiomatize_class_cmd = ax_class (ProofContext.read_class o ProofContext.init) read_classrel; 
24929
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

646 
val axiomatize_classrel = ax_classrel cert_classrel; 
408becab067e
renamed AxClass.get_definition to AxClass.get_info (again);
wenzelm
parents:
24920
diff
changeset

647 
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

648 
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

649 
val axiomatize_arity_cmd = ax_arity ProofContext.read_arity; 
19511  650 

651 
end; 

652 

653 
end; 