author | haftmann |
Wed, 22 Oct 2008 14:15:47 +0200 | |
changeset 28665 | 98aba9fc90f6 |
parent 28623 | de573f2e5389 |
child 28922 | ac2c34cad840 |
permissions | -rw-r--r-- |
2956 | 1 |
(* Title: Pure/sorts.ML |
2 |
ID: $Id$ |
|
3 |
Author: Markus Wenzel and Stefan Berghofer, TU Muenchen |
|
4 |
||
19514 | 5 |
The order-sorted algebra of type classes. |
19529 | 6 |
|
7 |
Classes denote (possibly empty) collections of types that are |
|
8 |
partially ordered by class inclusion. They are represented |
|
9 |
symbolically by strings. |
|
10 |
||
11 |
Sorts are intersections of finitely many classes. They are represented |
|
12 |
by lists of classes. Normal forms of sorts are sorted lists of |
|
13 |
minimal classes (wrt. current class inclusion). |
|
2956 | 14 |
*) |
15 |
||
16 |
signature SORTS = |
|
17 |
sig |
|
28623 | 18 |
val make: sort list -> sort OrdList.T |
28374 | 19 |
val subset: sort OrdList.T * sort OrdList.T -> bool |
28354 | 20 |
val union: sort OrdList.T -> sort OrdList.T -> sort OrdList.T |
21 |
val subtract: sort OrdList.T -> sort OrdList.T -> sort OrdList.T |
|
22 |
val remove_sort: sort -> sort OrdList.T -> sort OrdList.T |
|
23 |
val insert_sort: sort -> sort OrdList.T -> sort OrdList.T |
|
24 |
val insert_typ: typ -> sort OrdList.T -> sort OrdList.T |
|
25 |
val insert_typs: typ list -> sort OrdList.T -> sort OrdList.T |
|
26 |
val insert_term: term -> sort OrdList.T -> sort OrdList.T |
|
27 |
val insert_terms: term list -> sort OrdList.T -> sort OrdList.T |
|
19645 | 28 |
type algebra |
29 |
val rep_algebra: algebra -> |
|
20573 | 30 |
{classes: serial Graph.T, |
19645 | 31 |
arities: (class * (class * sort list)) list Symtab.table} |
21933
819ef284720b
classes: more direct way to achieve topological sorting;
wenzelm
parents:
21926
diff
changeset
|
32 |
val all_classes: algebra -> class list |
19645 | 33 |
val super_classes: algebra -> class -> class list |
34 |
val class_less: algebra -> class * class -> bool |
|
35 |
val class_le: algebra -> class * class -> bool |
|
36 |
val sort_eq: algebra -> sort * sort -> bool |
|
37 |
val sort_le: algebra -> sort * sort -> bool |
|
38 |
val sorts_le: algebra -> sort list * sort list -> bool |
|
39 |
val inter_sort: algebra -> sort * sort -> sort |
|
24732 | 40 |
val minimize_sort: algebra -> sort -> sort |
41 |
val complete_sort: algebra -> sort -> sort |
|
28623 | 42 |
val minimal_sorts: algebra -> sort list -> sort OrdList.T |
19645 | 43 |
val certify_class: algebra -> class -> class (*exception TYPE*) |
44 |
val certify_sort: algebra -> sort -> sort (*exception TYPE*) |
|
45 |
val add_class: Pretty.pp -> class * class list -> algebra -> algebra |
|
46 |
val add_classrel: Pretty.pp -> class * class -> algebra -> algebra |
|
47 |
val add_arities: Pretty.pp -> string * (class * sort list) list -> algebra -> algebra |
|
48 |
val empty_algebra: algebra |
|
49 |
val merge_algebra: Pretty.pp -> algebra * algebra -> algebra |
|
22181
39104d1c43ca
added explicit query function for arities to subalgebra projection
haftmann
parents:
21933
diff
changeset
|
50 |
val subalgebra: Pretty.pp -> (class -> bool) -> (class * string -> sort list) |
39104d1c43ca
added explicit query function for arities to subalgebra projection
haftmann
parents:
21933
diff
changeset
|
51 |
-> algebra -> (sort -> sort) * algebra |
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
52 |
type class_error |
26639 | 53 |
val class_error: Pretty.pp -> class_error -> string |
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
54 |
exception CLASS_ERROR of class_error |
19645 | 55 |
val mg_domain: algebra -> string -> sort -> sort list (*exception CLASS_ERROR*) |
28665 | 56 |
val meet_sort: algebra -> typ * sort |
57 |
-> sort Vartab.table -> sort Vartab.table (*exception CLASS_ERROR*) |
|
58 |
val meet_sort_typ: algebra -> typ * sort -> typ -> typ (*exception CLASS_ERROR*) |
|
19645 | 59 |
val of_sort: algebra -> typ * sort -> bool |
27555 | 60 |
val weaken: algebra -> ('a * class -> class -> 'a) -> 'a * class -> class -> 'a |
19645 | 61 |
val of_sort_derivation: Pretty.pp -> algebra -> |
22570
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22364
diff
changeset
|
62 |
{class_relation: 'a * class -> class -> 'a, |
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22364
diff
changeset
|
63 |
type_constructor: string -> ('a * class) list list -> class -> 'a, |
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22364
diff
changeset
|
64 |
type_variable: typ -> ('a * class) list} -> |
19584 | 65 |
typ * sort -> 'a list (*exception CLASS_ERROR*) |
19645 | 66 |
val witness_sorts: algebra -> string list -> sort list -> sort list -> (typ * sort) list |
2956 | 67 |
end; |
68 |
||
20573 | 69 |
structure Sorts: SORTS = |
2956 | 70 |
struct |
71 |
||
19514 | 72 |
|
19529 | 73 |
(** ordered lists of sorts **) |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
74 |
|
28623 | 75 |
val make = OrdList.make Term.sort_ord; |
28374 | 76 |
val op subset = OrdList.subset Term.sort_ord; |
16598
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
77 |
val op union = OrdList.union Term.sort_ord; |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
78 |
val subtract = OrdList.subtract Term.sort_ord; |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
79 |
|
19463 | 80 |
val remove_sort = OrdList.remove Term.sort_ord; |
16598
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
81 |
val insert_sort = OrdList.insert Term.sort_ord; |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
82 |
|
16598
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
83 |
fun insert_typ (TFree (_, S)) Ss = insert_sort S Ss |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
84 |
| insert_typ (TVar (_, S)) Ss = insert_sort S Ss |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
85 |
| insert_typ (Type (_, Ts)) Ss = insert_typs Ts Ss |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
86 |
and insert_typs [] Ss = Ss |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
87 |
| insert_typs (T :: Ts) Ss = insert_typs Ts (insert_typ T Ss); |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
88 |
|
16598
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
89 |
fun insert_term (Const (_, T)) Ss = insert_typ T Ss |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
90 |
| insert_term (Free (_, T)) Ss = insert_typ T Ss |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
91 |
| insert_term (Var (_, T)) Ss = insert_typ T Ss |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
92 |
| insert_term (Bound _) Ss = Ss |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
93 |
| insert_term (Abs (_, T, t)) Ss = insert_term t (insert_typ T Ss) |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
94 |
| insert_term (t $ u) Ss = insert_term t (insert_term u Ss); |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
95 |
|
16598
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
96 |
fun insert_terms [] Ss = Ss |
59381032be14
removed obsolete eq_sort, mem_sort, subset_sort, eq_set_sort, ins_sort, union_sort, rems_sort;
wenzelm
parents:
16400
diff
changeset
|
97 |
| insert_terms (t :: ts) Ss = insert_terms ts (insert_term t Ss); |
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
98 |
|
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
99 |
|
19529 | 100 |
|
101 |
(** order-sorted algebra **) |
|
2956 | 102 |
|
103 |
(* |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
104 |
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
|
105 |
subclass relation, which needs to be transitive and acyclic. |
2956 | 106 |
|
14782
d6ce35a1c386
incorporate sort ops from term.ML; use Graph.T; misc cleanup;
wenzelm
parents:
9281
diff
changeset
|
107 |
arities: table of association lists of all type arities; (t, ars) |
19531 | 108 |
means that type constructor t has the arities ars; an element |
109 |
(c, (c0, Ss)) of ars represents the arity t::(Ss)c being derived |
|
110 |
via c0 <= c. "Coregularity" of the arities structure requires |
|
111 |
that for any two declarations t::(Ss1)c1 and t::(Ss2)c2 such that |
|
112 |
c1 <= c2 holds Ss1 <= Ss2. |
|
2956 | 113 |
*) |
114 |
||
19645 | 115 |
datatype algebra = Algebra of |
20573 | 116 |
{classes: serial Graph.T, |
19645 | 117 |
arities: (class * (class * sort list)) list Symtab.table}; |
118 |
||
119 |
fun rep_algebra (Algebra args) = args; |
|
120 |
||
121 |
val classes_of = #classes o rep_algebra; |
|
122 |
val arities_of = #arities o rep_algebra; |
|
123 |
||
124 |
fun make_algebra (classes, arities) = |
|
125 |
Algebra {classes = classes, arities = arities}; |
|
126 |
||
127 |
fun map_classes f (Algebra {classes, arities}) = make_algebra (f classes, arities); |
|
128 |
fun map_arities f (Algebra {classes, arities}) = make_algebra (classes, f arities); |
|
129 |
||
130 |
||
131 |
(* classes *) |
|
132 |
||
21933
819ef284720b
classes: more direct way to achieve topological sorting;
wenzelm
parents:
21926
diff
changeset
|
133 |
fun all_classes (Algebra {classes, ...}) = Graph.all_preds classes (Graph.maximals classes); |
819ef284720b
classes: more direct way to achieve topological sorting;
wenzelm
parents:
21926
diff
changeset
|
134 |
|
19645 | 135 |
val super_classes = Graph.imm_succs o classes_of; |
2956 | 136 |
|
137 |
||
19529 | 138 |
(* class relations *) |
2956 | 139 |
|
19645 | 140 |
val class_less = Graph.is_edge o classes_of; |
141 |
fun class_le algebra (c1, c2) = c1 = c2 orelse class_less algebra (c1, c2); |
|
2956 | 142 |
|
143 |
||
19529 | 144 |
(* sort relations *) |
2956 | 145 |
|
19645 | 146 |
fun sort_le algebra (S1, S2) = |
23585 | 147 |
S1 = S2 orelse forall (fn c2 => exists (fn c1 => class_le algebra (c1, c2)) S1) S2; |
2956 | 148 |
|
19645 | 149 |
fun sorts_le algebra (Ss1, Ss2) = |
150 |
ListPair.all (sort_le algebra) (Ss1, Ss2); |
|
2956 | 151 |
|
19645 | 152 |
fun sort_eq algebra (S1, S2) = |
153 |
sort_le algebra (S1, S2) andalso sort_le algebra (S2, S1); |
|
2956 | 154 |
|
155 |
||
19529 | 156 |
(* intersection *) |
2956 | 157 |
|
19645 | 158 |
fun inter_class algebra c S = |
2956 | 159 |
let |
160 |
fun intr [] = [c] |
|
161 |
| intr (S' as c' :: c's) = |
|
19645 | 162 |
if class_le algebra (c', c) then S' |
163 |
else if class_le algebra (c, c') then intr c's |
|
2956 | 164 |
else c' :: intr c's |
165 |
in intr S end; |
|
166 |
||
19645 | 167 |
fun inter_sort algebra (S1, S2) = |
168 |
sort_strings (fold (inter_class algebra) S1 S2); |
|
2956 | 169 |
|
170 |
||
24732 | 171 |
(* normal forms *) |
2956 | 172 |
|
24732 | 173 |
fun minimize_sort _ [] = [] |
174 |
| minimize_sort _ (S as [_]) = S |
|
175 |
| minimize_sort algebra S = |
|
19645 | 176 |
filter (fn c => not (exists (fn c' => class_less algebra (c', c)) S)) S |
19529 | 177 |
|> sort_distinct string_ord; |
2990 | 178 |
|
24732 | 179 |
fun complete_sort algebra = |
180 |
Graph.all_succs (classes_of algebra) o minimize_sort algebra; |
|
181 |
||
28623 | 182 |
fun minimal_sorts algebra raw_sorts = |
183 |
let |
|
184 |
fun le S1 S2 = sort_le algebra (S1, S2); |
|
185 |
val sorts = make (map (minimize_sort algebra) raw_sorts); |
|
186 |
in sorts |> filter_out (fn S => exists (fn S' => le S' S andalso not (le S S')) sorts) end; |
|
187 |
||
2990 | 188 |
|
19645 | 189 |
(* certify *) |
190 |
||
191 |
fun certify_class algebra c = |
|
192 |
if can (Graph.get_node (classes_of algebra)) c then c |
|
193 |
else raise TYPE ("Undeclared class: " ^ quote c, [], []); |
|
194 |
||
24732 | 195 |
fun certify_sort classes = minimize_sort classes o map (certify_class classes); |
19645 | 196 |
|
197 |
||
2956 | 198 |
|
19529 | 199 |
(** build algebras **) |
19514 | 200 |
|
201 |
(* classes *) |
|
202 |
||
23655
d2d1138e0ddc
replaced exception TableFun/GraphFun.DUPS by TableFun/GraphFun.DUP;
wenzelm
parents:
23585
diff
changeset
|
203 |
fun err_dup_class c = error ("Duplicate declaration of class: " ^ quote c); |
19514 | 204 |
|
205 |
fun err_cyclic_classes pp css = |
|
206 |
error (cat_lines (map (fn cs => |
|
207 |
"Cycle in class relation: " ^ Pretty.string_of_classrel pp cs) css)); |
|
208 |
||
19645 | 209 |
fun add_class pp (c, cs) = map_classes (fn classes => |
19514 | 210 |
let |
20573 | 211 |
val classes' = classes |> Graph.new_node (c, serial ()) |
23655
d2d1138e0ddc
replaced exception TableFun/GraphFun.DUPS by TableFun/GraphFun.DUP;
wenzelm
parents:
23585
diff
changeset
|
212 |
handle Graph.DUP dup => err_dup_class dup; |
19514 | 213 |
val classes'' = classes' |> fold Graph.add_edge_trans_acyclic (map (pair c) cs) |
214 |
handle Graph.CYCLES css => err_cyclic_classes pp css; |
|
19645 | 215 |
in classes'' end); |
19514 | 216 |
|
217 |
||
218 |
(* arities *) |
|
219 |
||
220 |
local |
|
221 |
||
222 |
fun for_classes _ NONE = "" |
|
223 |
| for_classes pp (SOME (c1, c2)) = |
|
224 |
" for classes " ^ Pretty.string_of_classrel pp [c1, c2]; |
|
225 |
||
226 |
fun err_conflict pp t cc (c, Ss) (c', Ss') = |
|
227 |
error ("Conflict of type arities" ^ for_classes pp cc ^ ":\n " ^ |
|
228 |
Pretty.string_of_arity pp (t, Ss, [c]) ^ " and\n " ^ |
|
229 |
Pretty.string_of_arity pp (t, Ss', [c'])); |
|
230 |
||
19645 | 231 |
fun coregular pp algebra t (c, (c0, Ss)) ars = |
19514 | 232 |
let |
19524 | 233 |
fun conflict (c', (_, Ss')) = |
19645 | 234 |
if class_le algebra (c, c') andalso not (sorts_le algebra (Ss, Ss')) then |
19514 | 235 |
SOME ((c, c'), (c', Ss')) |
19645 | 236 |
else if class_le algebra (c', c) andalso not (sorts_le algebra (Ss', Ss)) then |
19514 | 237 |
SOME ((c', c), (c', Ss')) |
238 |
else NONE; |
|
239 |
in |
|
240 |
(case get_first conflict ars of |
|
241 |
SOME ((c1, c2), (c', Ss')) => err_conflict pp t (SOME (c1, c2)) (c, Ss) (c', Ss') |
|
19524 | 242 |
| NONE => (c, (c0, Ss)) :: ars) |
19514 | 243 |
end; |
244 |
||
19645 | 245 |
fun complete algebra (c0, Ss) = map (rpair (c0, Ss)) (c0 :: super_classes algebra c0); |
246 |
||
247 |
fun insert pp algebra t (c, (c0, Ss)) ars = |
|
19514 | 248 |
(case AList.lookup (op =) ars c of |
19645 | 249 |
NONE => coregular pp algebra t (c, (c0, Ss)) ars |
19524 | 250 |
| SOME (_, Ss') => |
19645 | 251 |
if sorts_le algebra (Ss, Ss') then ars |
252 |
else if sorts_le algebra (Ss', Ss) then |
|
253 |
coregular pp algebra t (c, (c0, Ss)) |
|
19524 | 254 |
(filter_out (fn (c'', (_, Ss'')) => c = c'' andalso Ss'' = Ss') ars) |
19514 | 255 |
else err_conflict pp t NONE (c, Ss) (c, Ss')); |
256 |
||
19645 | 257 |
fun insert_ars pp algebra (t, ars) arities = |
258 |
let val ars' = |
|
259 |
Symtab.lookup_list arities t |
|
260 |
|> fold_rev (fold_rev (insert pp algebra t)) (map (complete algebra) ars) |
|
261 |
in Symtab.update (t, ars') arities end; |
|
19514 | 262 |
|
263 |
in |
|
264 |
||
19645 | 265 |
fun add_arities pp arg algebra = algebra |> map_arities (insert_ars pp algebra arg); |
19514 | 266 |
|
19645 | 267 |
fun add_arities_table pp algebra = |
268 |
Symtab.fold (fn (t, ars) => insert_ars pp algebra (t, map snd ars)); |
|
19514 | 269 |
|
270 |
end; |
|
271 |
||
19529 | 272 |
|
19645 | 273 |
(* classrel *) |
274 |
||
275 |
fun rebuild_arities pp algebra = algebra |> map_arities (fn arities => |
|
276 |
Symtab.empty |
|
277 |
|> add_arities_table pp algebra arities); |
|
278 |
||
279 |
fun add_classrel pp rel = rebuild_arities pp o map_classes (fn classes => |
|
280 |
classes |> Graph.add_edge_trans_acyclic rel |
|
281 |
handle Graph.CYCLES css => err_cyclic_classes pp css); |
|
282 |
||
283 |
||
284 |
(* empty and merge *) |
|
285 |
||
286 |
val empty_algebra = make_algebra (Graph.empty, Symtab.empty); |
|
287 |
||
288 |
fun merge_algebra pp |
|
289 |
(Algebra {classes = classes1, arities = arities1}, |
|
290 |
Algebra {classes = classes2, arities = arities2}) = |
|
291 |
let |
|
292 |
val classes' = Graph.merge_trans_acyclic (op =) (classes1, classes2) |
|
23655
d2d1138e0ddc
replaced exception TableFun/GraphFun.DUPS by TableFun/GraphFun.DUP;
wenzelm
parents:
23585
diff
changeset
|
293 |
handle Graph.DUP c => err_dup_class c |
19645 | 294 |
| Graph.CYCLES css => err_cyclic_classes pp css; |
295 |
val algebra0 = make_algebra (classes', Symtab.empty); |
|
296 |
val arities' = Symtab.empty |
|
297 |
|> add_arities_table pp algebra0 arities1 |
|
298 |
|> add_arities_table pp algebra0 arities2; |
|
299 |
in make_algebra (classes', arities') end; |
|
300 |
||
21933
819ef284720b
classes: more direct way to achieve topological sorting;
wenzelm
parents:
21926
diff
changeset
|
301 |
|
819ef284720b
classes: more direct way to achieve topological sorting;
wenzelm
parents:
21926
diff
changeset
|
302 |
(* subalgebra *) |
819ef284720b
classes: more direct way to achieve topological sorting;
wenzelm
parents:
21926
diff
changeset
|
303 |
|
22181
39104d1c43ca
added explicit query function for arities to subalgebra projection
haftmann
parents:
21933
diff
changeset
|
304 |
fun subalgebra pp P sargs (algebra as Algebra {classes, arities}) = |
19952 | 305 |
let |
24732 | 306 |
val restrict_sort = minimize_sort algebra o filter P o Graph.all_succs classes; |
22181
39104d1c43ca
added explicit query function for arities to subalgebra projection
haftmann
parents:
21933
diff
changeset
|
307 |
fun restrict_arity tyco (c, (_, Ss)) = |
39104d1c43ca
added explicit query function for arities to subalgebra projection
haftmann
parents:
21933
diff
changeset
|
308 |
if P c then |
39104d1c43ca
added explicit query function for arities to subalgebra projection
haftmann
parents:
21933
diff
changeset
|
309 |
SOME (c, (c, Ss |> map2 (curry (inter_sort algebra)) (sargs (c, tyco)) |
39104d1c43ca
added explicit query function for arities to subalgebra projection
haftmann
parents:
21933
diff
changeset
|
310 |
|> map restrict_sort)) |
39104d1c43ca
added explicit query function for arities to subalgebra projection
haftmann
parents:
21933
diff
changeset
|
311 |
else NONE; |
21933
819ef284720b
classes: more direct way to achieve topological sorting;
wenzelm
parents:
21926
diff
changeset
|
312 |
val classes' = classes |> Graph.subgraph P; |
22181
39104d1c43ca
added explicit query function for arities to subalgebra projection
haftmann
parents:
21933
diff
changeset
|
313 |
val arities' = arities |> Symtab.map' (map_filter o restrict_arity); |
21933
819ef284720b
classes: more direct way to achieve topological sorting;
wenzelm
parents:
21926
diff
changeset
|
314 |
in (restrict_sort, rebuild_arities pp (make_algebra (classes', arities'))) end; |
20465 | 315 |
|
19645 | 316 |
|
19529 | 317 |
|
318 |
(** sorts of types **) |
|
319 |
||
26639 | 320 |
(* errors -- delayed message composition *) |
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
321 |
|
26639 | 322 |
datatype class_error = |
323 |
NoClassrel of class * class | |
|
324 |
NoArity of string * class | |
|
325 |
NoSubsort of sort * sort; |
|
19529 | 326 |
|
26639 | 327 |
fun class_error pp (NoClassrel (c1, c2)) = |
22196 | 328 |
"No class relation " ^ Pretty.string_of_classrel pp [c1, c2] |
26639 | 329 |
| class_error pp (NoArity (a, c)) = |
26326 | 330 |
"No type arity " ^ Pretty.string_of_arity pp (a, [], [c]) |
26994 | 331 |
| class_error pp (NoSubsort (S1, S2)) = |
332 |
"Cannot derive subsort relation " ^ Pretty.string_of_sort pp S1 |
|
333 |
^ " < " ^ Pretty.string_of_sort pp S2; |
|
19529 | 334 |
|
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
335 |
exception CLASS_ERROR of class_error; |
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
336 |
|
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
337 |
|
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
338 |
(* mg_domain *) |
19529 | 339 |
|
19645 | 340 |
fun mg_domain algebra a S = |
19529 | 341 |
let |
19645 | 342 |
val arities = arities_of algebra; |
19529 | 343 |
fun dom c = |
344 |
(case AList.lookup (op =) (Symtab.lookup_list arities a) c of |
|
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
345 |
NONE => raise CLASS_ERROR (NoArity (a, c)) |
19529 | 346 |
| SOME (_, Ss) => Ss); |
19645 | 347 |
fun dom_inter c Ss = ListPair.map (inter_sort algebra) (dom c, Ss); |
19529 | 348 |
in |
349 |
(case S of |
|
350 |
[] => raise Fail "Unknown domain of empty intersection" |
|
351 |
| c :: cs => fold dom_inter cs (dom c)) |
|
352 |
end; |
|
353 |
||
354 |
||
26639 | 355 |
(* meet_sort *) |
356 |
||
357 |
fun meet_sort algebra = |
|
358 |
let |
|
359 |
fun inters S S' = inter_sort algebra (S, S'); |
|
360 |
fun meet _ [] = I |
|
361 |
| meet (TFree (_, S)) S' = |
|
362 |
if sort_le algebra (S, S') then I |
|
363 |
else raise CLASS_ERROR (NoSubsort (S, S')) |
|
364 |
| meet (TVar (v, S)) S' = |
|
365 |
if sort_le algebra (S, S') then I |
|
366 |
else Vartab.map_default (v, S) (inters S') |
|
367 |
| meet (Type (a, Ts)) S = fold2 meet Ts (mg_domain algebra a S); |
|
368 |
in uncurry meet end; |
|
369 |
||
28665 | 370 |
fun meet_sort_typ algebra (T, S) = |
371 |
let |
|
372 |
val tab = meet_sort algebra (T, S) Vartab.empty; |
|
373 |
in Term.map_type_tvar (fn (v, _) => |
|
374 |
TVar (v, (the o Vartab.lookup tab) v)) |
|
375 |
end; |
|
376 |
||
26639 | 377 |
|
19529 | 378 |
(* of_sort *) |
379 |
||
19645 | 380 |
fun of_sort algebra = |
19529 | 381 |
let |
382 |
fun ofS (_, []) = true |
|
19645 | 383 |
| ofS (TFree (_, S), S') = sort_le algebra (S, S') |
384 |
| ofS (TVar (_, S), S') = sort_le algebra (S, S') |
|
19529 | 385 |
| ofS (Type (a, Ts), S) = |
19645 | 386 |
let val Ss = mg_domain algebra a S in |
19529 | 387 |
ListPair.all ofS (Ts, Ss) |
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
388 |
end handle CLASS_ERROR _ => false; |
19529 | 389 |
in ofS end; |
390 |
||
391 |
||
27498 | 392 |
(* animating derivations *) |
393 |
||
27555 | 394 |
fun weaken algebra class_relation = |
395 |
let |
|
396 |
fun path (x, c1 :: c2 :: cs) = path (class_relation (x, c1) c2, c2 :: cs) |
|
397 |
| path (x, _) = x; |
|
398 |
in fn (x, c1) => fn c2 => |
|
399 |
(case Graph.irreducible_paths (classes_of algebra) (c1, c2) of |
|
400 |
[] => raise CLASS_ERROR (NoClassrel (c1, c2)) |
|
401 |
| cs :: _ => path (x, cs)) |
|
402 |
end; |
|
19529 | 403 |
|
22570
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22364
diff
changeset
|
404 |
fun of_sort_derivation pp algebra {class_relation, type_constructor, type_variable} = |
19529 | 405 |
let |
27555 | 406 |
val weaken = weaken algebra class_relation; |
407 |
val arities = arities_of algebra; |
|
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
408 |
|
19529 | 409 |
fun weakens S1 S2 = S2 |> map (fn c2 => |
19645 | 410 |
(case S1 |> find_first (fn (_, c1) => class_le algebra (c1, c2)) of |
19529 | 411 |
SOME d1 => weaken d1 c2 |
26994 | 412 |
| NONE => raise CLASS_ERROR (NoSubsort (map #2 S1, S2)))); |
19529 | 413 |
|
414 |
fun derive _ [] = [] |
|
415 |
| derive (Type (a, Ts)) S = |
|
416 |
let |
|
19645 | 417 |
val Ss = mg_domain algebra a S; |
19529 | 418 |
val dom = map2 (fn T => fn S => derive T S ~~ S) Ts Ss; |
419 |
in |
|
420 |
S |> map (fn c => |
|
421 |
let |
|
422 |
val (c0, Ss') = the (AList.lookup (op =) (Symtab.lookup_list arities a) c); |
|
423 |
val dom' = map2 (fn d => fn S' => weakens d S' ~~ S') dom Ss'; |
|
22570
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22364
diff
changeset
|
424 |
in weaken (type_constructor a dom' c0, c0) c end) |
19529 | 425 |
end |
22570
f166a5416b3f
renamed of_sort_derivation record fields (avoid clash with Alice keywords);
wenzelm
parents:
22364
diff
changeset
|
426 |
| derive T S = weakens (type_variable T) S; |
19529 | 427 |
in uncurry derive end; |
428 |
||
429 |
||
430 |
(* witness_sorts *) |
|
431 |
||
19645 | 432 |
fun witness_sorts algebra types hyps sorts = |
19529 | 433 |
let |
19645 | 434 |
fun le S1 S2 = sort_le algebra (S1, S2); |
19529 | 435 |
fun get_solved S2 (T, S1) = if le S1 S2 then SOME (T, S2) else NONE; |
436 |
fun get_hyp S2 S1 = if le S1 S2 then SOME (TFree ("'hyp", S1), S2) else NONE; |
|
19645 | 437 |
fun mg_dom t S = SOME (mg_domain algebra t S) handle CLASS_ERROR _ => NONE; |
19529 | 438 |
|
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
439 |
fun witn_sort _ [] solved_failed = (SOME (propT, []), solved_failed) |
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
440 |
| witn_sort path S (solved, failed) = |
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
441 |
if exists (le S) failed then (NONE, (solved, failed)) |
19529 | 442 |
else |
443 |
(case get_first (get_solved S) solved of |
|
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
444 |
SOME w => (SOME w, (solved, failed)) |
19529 | 445 |
| NONE => |
446 |
(case get_first (get_hyp S) hyps of |
|
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
447 |
SOME w => (SOME w, (w :: solved, failed)) |
19584 | 448 |
| NONE => witn_types path types S (solved, failed))) |
19529 | 449 |
|
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
450 |
and witn_sorts path x = fold_map (witn_sort path) x |
19529 | 451 |
|
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
452 |
and witn_types _ [] S (solved, failed) = (NONE, (solved, S :: failed)) |
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
453 |
| witn_types path (t :: ts) S solved_failed = |
19529 | 454 |
(case mg_dom t S of |
455 |
SOME SS => |
|
456 |
(*do not descend into stronger args (achieving termination)*) |
|
457 |
if exists (fn D => le D S orelse exists (le D) path) SS then |
|
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
458 |
witn_types path ts S solved_failed |
19529 | 459 |
else |
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
460 |
let val (ws, (solved', failed')) = witn_sorts (S :: path) SS solved_failed in |
19529 | 461 |
if forall is_some ws then |
462 |
let val w = (Type (t, map (#1 o the) ws), S) |
|
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
463 |
in (SOME w, (w :: solved', failed')) end |
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
464 |
else witn_types path ts S (solved', failed') |
19529 | 465 |
end |
19578
f93b7637a5e6
added class_error and exception CLASS_ERROR (supercedes DOMAIN);
wenzelm
parents:
19531
diff
changeset
|
466 |
| NONE => witn_types path ts S solved_failed); |
19529 | 467 |
|
19584 | 468 |
in map_filter I (#1 (witn_sorts [] sorts ([], []))) end; |
19529 | 469 |
|
19514 | 470 |
end; |