author | huffman |
Thu, 26 May 2005 02:23:27 +0200 | |
changeset 16081 | 81a4b4a245b0 |
parent 15570 | 8d8c70b41bab |
child 16399 | 0c9265f1ce31 |
permissions | -rw-r--r-- |
2956 | 1 |
(* Title: Pure/sorts.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel and Stefan Berghofer, TU Muenchen |
|
4 |
||
5 |
Type classes and sorts. |
|
6 |
*) |
|
7 |
||
8 |
signature SORTS = |
|
9 |
sig |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
10 |
val eq_sort: sort * sort -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
11 |
val mem_sort: sort * sort list -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
12 |
val subset_sort: sort list * sort list -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
13 |
val eq_set_sort: sort list * sort list -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
14 |
val ins_sort: sort * sort list -> sort list |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
15 |
val union_sort: sort list * sort list -> sort list |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
16 |
val rems_sort: sort list * sort list -> sort list |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
17 |
type classes |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
18 |
type arities |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
19 |
val class_eq: classes -> class * class -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
20 |
val class_less: classes -> class * class -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
21 |
val class_le: classes -> class * class -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
22 |
val sort_eq: classes -> sort * sort -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
23 |
val sort_less: classes -> sort * sort -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
24 |
val sort_le: classes -> sort * sort -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
25 |
val sorts_le: classes -> sort list * sort list -> bool |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
26 |
val inter_class: classes -> class * sort -> sort |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
27 |
val inter_sort: classes -> sort * sort -> sort |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
28 |
val norm_sort: classes -> sort -> sort |
14986 | 29 |
val certify_class: classes -> class -> class |
30 |
val certify_sort: classes -> sort -> sort |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
31 |
val of_sort: classes * arities -> typ * sort -> bool |
7643 | 32 |
exception DOMAIN of string * class |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
33 |
val mg_domain: classes * arities -> string -> sort -> sort list (*exception DOMAIN*) |
14828 | 34 |
val witness_sorts: classes * arities -> string list -> |
35 |
sort list -> sort list -> (typ * sort) list |
|
2956 | 36 |
end; |
37 |
||
38 |
structure Sorts: SORTS = |
|
39 |
struct |
|
40 |
||
41 |
(** type classes and sorts **) |
|
42 |
||
43 |
(* |
|
44 |
Classes denote (possibly empty) collections of types that are |
|
45 |
partially ordered by class inclusion. They are represented |
|
46 |
symbolically by strings. |
|
47 |
||
48 |
Sorts are intersections of finitely many classes. They are |
|
49 |
represented by lists of classes. Normal forms of sorts are sorted |
|
50 |
lists of minimal classes (wrt. current class inclusion). |
|
51 |
||
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
52 |
(types already defined in Pure/term.ML) |
2956 | 53 |
*) |
54 |
||
55 |
||
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
56 |
(* equality, membership and insertion of sorts *) |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
57 |
|
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
58 |
fun eq_sort ([]: sort, []) = true |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
59 |
| eq_sort ((S1 :: Ss1), (S2 :: Ss2)) = S1 = S2 andalso eq_sort (Ss1, Ss2) |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
60 |
| eq_sort (_, _) = false; |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
61 |
|
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
62 |
fun mem_sort (_: sort, []) = false |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
63 |
| mem_sort (S, S' :: Ss) = eq_sort (S, S') orelse mem_sort (S, Ss); |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
64 |
|
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
65 |
fun ins_sort (S, Ss) = if mem_sort (S, Ss) then Ss else S :: Ss; |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
66 |
|
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
67 |
fun union_sort (Ss, []) = Ss |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
68 |
| union_sort ([], Ss) = Ss |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
69 |
| union_sort ((S :: Ss), Ss') = union_sort (Ss, ins_sort (S, Ss')); |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
70 |
|
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
71 |
fun subset_sort ([], Ss) = true |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
72 |
| subset_sort (S :: Ss, Ss') = mem_sort (S, Ss') andalso subset_sort (Ss, Ss'); |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
73 |
|
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
74 |
fun eq_set_sort (Ss, Ss') = |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
75 |
Ss = Ss' orelse (subset_sort (Ss, Ss') andalso subset_sort (Ss', Ss)); |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
76 |
|
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
77 |
val rems_sort = gen_rems eq_sort; |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
78 |
|
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
79 |
|
2956 | 80 |
(* sort signature information *) |
81 |
||
82 |
(* |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
83 |
classes: graph representing class declarations together with proper |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
84 |
subclass relation, which needs to be transitive and acyclic. |
2956 | 85 |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
86 |
arities: table of association lists of all type arities; (t, ars) |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
87 |
means that type constructor t has the arities ars; an element (c, |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
88 |
Ss) of ars represents the arity t::(Ss)c. "Coregularity" of the |
14870 | 89 |
arities structure requires that for any two declarations |
90 |
t::(Ss1)c1 and t::(Ss2)c2 such that c1 <= c2 holds Ss1 <= Ss2. |
|
2956 | 91 |
*) |
92 |
||
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
93 |
type classes = stamp Graph.T; |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
94 |
type arities = (class * sort list) list Symtab.table; |
2956 | 95 |
|
96 |
||
97 |
||
98 |
(** equality and inclusion **) |
|
99 |
||
100 |
(* classes *) |
|
101 |
||
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
102 |
fun class_eq (_: classes) (c1, c2:class) = c1 = c2; |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
103 |
val class_less: classes -> class * class -> bool = Graph.is_edge; |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
104 |
fun class_le classes (c1, c2) = c1 = c2 orelse class_less classes (c1, c2); |
2956 | 105 |
|
106 |
||
107 |
(* sorts *) |
|
108 |
||
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
109 |
fun sort_le classes (S1, S2) = |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
110 |
forall (fn c2 => exists (fn c1 => class_le classes (c1, c2)) S1) S2; |
2956 | 111 |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
112 |
fun sorts_le classes (Ss1, Ss2) = |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
113 |
ListPair.all (sort_le classes) (Ss1, Ss2); |
2956 | 114 |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
115 |
fun sort_eq classes (S1, S2) = |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
116 |
sort_le classes (S1, S2) andalso sort_le classes (S2, S1); |
2956 | 117 |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
118 |
fun sort_less classes (S1, S2) = |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
119 |
sort_le classes (S1, S2) andalso not (sort_le classes (S2, S1)); |
2956 | 120 |
|
121 |
||
122 |
(* normal forms of sorts *) |
|
123 |
||
14986 | 124 |
local |
125 |
||
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
126 |
fun minimal_class classes S c = |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
127 |
not (exists (fn c' => class_less classes (c', c)) S); |
2956 | 128 |
|
14986 | 129 |
val distinct_class = gen_distinct (op = : class * class -> bool); |
130 |
||
131 |
in |
|
132 |
||
133 |
fun norm_sort _ [] = [] |
|
134 |
| norm_sort _ (S as [_]) = S |
|
135 |
| norm_sort classes S = |
|
15570 | 136 |
sort_strings (distinct_class (List.filter (minimal_class classes S) S)); |
14986 | 137 |
|
138 |
end; |
|
139 |
||
140 |
||
141 |
(* certify *) |
|
142 |
||
143 |
fun certify_class classes c = |
|
144 |
if can (Graph.get_node classes) c then c |
|
145 |
else raise TYPE ("Undeclared class: " ^ quote c, [], []); |
|
146 |
||
147 |
fun certify_sort classes = norm_sort classes o map (certify_class classes); |
|
2956 | 148 |
|
149 |
||
150 |
||
151 |
(** intersection **) |
|
152 |
||
7643 | 153 |
(*intersect class with sort (preserves minimality)*) |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
154 |
fun inter_class classes (c, S) = |
2956 | 155 |
let |
156 |
fun intr [] = [c] |
|
157 |
| intr (S' as c' :: c's) = |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
158 |
if class_le classes (c', c) then S' |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
159 |
else if class_le classes (c, c') then intr c's |
2956 | 160 |
else c' :: intr c's |
161 |
in intr S end; |
|
162 |
||
163 |
(*instersect sorts (preserves minimality)*) |
|
15570 | 164 |
fun inter_sort classes = sort_strings o Library.foldr (inter_class classes); |
2956 | 165 |
|
166 |
||
167 |
||
168 |
(** sorts of types **) |
|
169 |
||
7643 | 170 |
(* mg_domain *) |
171 |
||
172 |
exception DOMAIN of string * class; |
|
2956 | 173 |
|
7643 | 174 |
fun mg_domain _ _ [] = sys_error "mg_domain" (*don't know number of args!*) |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
175 |
| mg_domain (classes, arities) a S = |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
176 |
let |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
177 |
fun mg_dom c = |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
178 |
(case Library.assoc_string (Symtab.lookup_multi (arities, a), c) of |
15531 | 179 |
NONE => raise DOMAIN (a, c) |
180 |
| SOME Ss => Ss); |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
181 |
val doms = map mg_dom S; |
15570 | 182 |
in Library.foldl (ListPair.map (inter_sort classes)) (hd doms, tl doms) end; |
2956 | 183 |
|
184 |
||
2990 | 185 |
(* of_sort *) |
186 |
||
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
187 |
fun of_sort (classes, arities) = |
2990 | 188 |
let |
189 |
fun ofS (_, []) = true |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
190 |
| ofS (TFree (_, S), S') = sort_le classes (S, S') |
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
191 |
| ofS (TVar (_, S), S') = sort_le classes (S, S') |
2990 | 192 |
| ofS (Type (a, Ts), S) = |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
193 |
let val Ss = mg_domain (classes, arities) a S in |
2990 | 194 |
ListPair.all ofS (Ts, Ss) |
7643 | 195 |
end handle DOMAIN _ => false; |
2990 | 196 |
in ofS end; |
197 |
||
198 |
||
2956 | 199 |
|
7643 | 200 |
(** witness_sorts **) |
201 |
||
14828 | 202 |
local |
203 |
||
204 |
fun witness_aux (classes, arities) log_types hyps sorts = |
|
7643 | 205 |
let |
206 |
val top_witn = (propT, []); |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
207 |
fun le S1 S2 = sort_le classes (S1, S2); |
15531 | 208 |
fun get_solved S2 (T, S1) = if le S1 S2 then SOME (T, S2) else NONE; |
209 |
fun get_hyp S2 S1 = if le S1 S2 then SOME (TFree ("'hyp", S1), S2) else NONE; |
|
210 |
fun mg_dom t S = SOME (mg_domain (classes, arities) t S) handle DOMAIN _ => NONE; |
|
7643 | 211 |
|
15531 | 212 |
fun witn_sort _ (solved_failed, []) = (solved_failed, SOME top_witn) |
7643 | 213 |
| witn_sort path ((solved, failed), S) = |
15531 | 214 |
if exists (le S) failed then ((solved, failed), NONE) |
7643 | 215 |
else |
216 |
(case get_first (get_solved S) solved of |
|
15531 | 217 |
SOME w => ((solved, failed), SOME w) |
218 |
| NONE => |
|
7643 | 219 |
(case get_first (get_hyp S) hyps of |
15531 | 220 |
SOME w => ((w :: solved, failed), SOME w) |
221 |
| NONE => witn_types path log_types ((solved, failed), S))) |
|
7643 | 222 |
|
223 |
and witn_sorts path x = foldl_map (witn_sort path) x |
|
2956 | 224 |
|
15531 | 225 |
and witn_types _ [] ((solved, failed), S) = ((solved, S :: failed), NONE) |
7643 | 226 |
| witn_types path (t :: ts) (solved_failed, S) = |
227 |
(case mg_dom t S of |
|
15531 | 228 |
SOME SS => |
7643 | 229 |
(*do not descend into stronger args (achieving termination)*) |
230 |
if exists (fn D => le D S orelse exists (le D) path) SS then |
|
231 |
witn_types path ts (solved_failed, S) |
|
232 |
else |
|
233 |
let val ((solved', failed'), ws) = witn_sorts (S :: path) (solved_failed, SS) in |
|
15570 | 234 |
if forall isSome ws then |
235 |
let val w = (Type (t, map (#1 o valOf) ws), S) |
|
15531 | 236 |
in ((w :: solved', failed'), SOME w) end |
7643 | 237 |
else witn_types path ts ((solved', failed'), S) |
238 |
end |
|
15531 | 239 |
| NONE => witn_types path ts (solved_failed, S)); |
7643 | 240 |
|
241 |
in witn_sorts [] (([], []), sorts) end; |
|
242 |
||
14828 | 243 |
fun str_of_sort [c] = c |
244 |
| str_of_sort cs = enclose "{" "}" (commas cs); |
|
245 |
||
246 |
in |
|
7643 | 247 |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
248 |
fun witness_sorts (classes, arities) log_types hyps sorts = |
7643 | 249 |
let |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
250 |
(*double check result of witness search*) |
15531 | 251 |
fun check_result NONE = NONE |
252 |
| check_result (SOME (T, S)) = |
|
253 |
if of_sort (classes, arities) (T, S) then SOME (T, S) |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
254 |
else sys_error ("Sorts.witness_sorts: bad witness for sort " ^ str_of_sort S); |
15570 | 255 |
in List.mapPartial check_result (#2 (witness_aux (classes, arities) log_types hyps sorts)) end; |
2956 | 256 |
|
257 |
end; |
|
14828 | 258 |
|
259 |
end; |