wenzelm@17707
|
1 |
(* Title: Pure/defs.ML
|
wenzelm@17707
|
2 |
Author: Makarius
|
obua@16108
|
3 |
|
wenzelm@19692
|
4 |
Global well-formedness checks for constant definitions. Covers plain
|
wenzelm@19701
|
5 |
definitions and simple sub-structural overloading.
|
obua@16108
|
6 |
*)
|
obua@16108
|
7 |
|
wenzelm@16877
|
8 |
signature DEFS =
|
wenzelm@16877
|
9 |
sig
|
wenzelm@19697
|
10 |
val pretty_const: Pretty.pp -> string * typ list -> Pretty.T
|
wenzelm@19701
|
11 |
val plain_args: typ list -> bool
|
wenzelm@17707
|
12 |
type T
|
haftmann@24199
|
13 |
val specifications_of: T -> string -> {is_def: bool, name: string,
|
haftmann@24199
|
14 |
lhs: typ list, rhs: (string * typ list) list} list
|
haftmann@24199
|
15 |
val all_specifications_of: T -> (string * {is_def: bool, name: string,
|
haftmann@24199
|
16 |
lhs: typ list, rhs: (string * typ list) list} list) list
|
wenzelm@19697
|
17 |
val dest: T ->
|
wenzelm@19697
|
18 |
{restricts: ((string * typ list) * string) list,
|
wenzelm@19697
|
19 |
reducts: ((string * typ list) * (string * typ list) list) list}
|
wenzelm@19590
|
20 |
val empty: T
|
wenzelm@19692
|
21 |
val merge: Pretty.pp -> T * T -> T
|
haftmann@24199
|
22 |
val define: Pretty.pp -> bool -> bool -> string ->
|
wenzelm@19727
|
23 |
string * typ list -> (string * typ list) list -> T -> T
|
obua@16108
|
24 |
end
|
obua@16108
|
25 |
|
wenzelm@17711
|
26 |
structure Defs: DEFS =
|
wenzelm@17707
|
27 |
struct
|
obua@16108
|
28 |
|
wenzelm@19697
|
29 |
(* type arguments *)
|
wenzelm@19697
|
30 |
|
wenzelm@19697
|
31 |
type args = typ list;
|
wenzelm@19697
|
32 |
|
wenzelm@19697
|
33 |
fun pretty_const pp (c, args) =
|
wenzelm@19692
|
34 |
let
|
wenzelm@19692
|
35 |
val prt_args =
|
wenzelm@19692
|
36 |
if null args then []
|
wenzelm@19806
|
37 |
else [Pretty.list "(" ")" (map (Pretty.typ pp o Logic.unvarifyT) args)];
|
wenzelm@19697
|
38 |
in Pretty.block (Pretty.str c :: prt_args) end;
|
wenzelm@19613
|
39 |
|
wenzelm@19707
|
40 |
fun plain_args args =
|
wenzelm@19707
|
41 |
forall Term.is_TVar args andalso not (has_duplicates (op =) args);
|
wenzelm@19707
|
42 |
|
wenzelm@19697
|
43 |
fun disjoint_args (Ts, Us) =
|
wenzelm@19697
|
44 |
not (Type.could_unifys (Ts, Us)) orelse
|
wenzelm@19697
|
45 |
((Type.raw_unifys (Ts, map (Logic.incr_tvar (maxidx_of_typs Ts + 1)) Us) Vartab.empty; false)
|
wenzelm@19697
|
46 |
handle Type.TUNIFY => true);
|
wenzelm@19613
|
47 |
|
wenzelm@19697
|
48 |
fun match_args (Ts, Us) =
|
wenzelm@19697
|
49 |
Option.map Envir.typ_subst_TVars
|
wenzelm@19697
|
50 |
(SOME (Type.raw_matches (Ts, Us) Vartab.empty) handle Type.TYPE_MATCH => NONE);
|
wenzelm@19692
|
51 |
|
wenzelm@19692
|
52 |
|
wenzelm@19692
|
53 |
(* datatype defs *)
|
wenzelm@19692
|
54 |
|
haftmann@24199
|
55 |
type spec = {is_def: bool, name: string, lhs: args, rhs: (string * args) list};
|
wenzelm@19697
|
56 |
|
wenzelm@19692
|
57 |
type def =
|
wenzelm@19712
|
58 |
{specs: spec Inttab.table, (*source specifications*)
|
wenzelm@19712
|
59 |
restricts: (args * string) list, (*global restrictions imposed by incomplete patterns*)
|
wenzelm@19712
|
60 |
reducts: (args * (string * args) list) list}; (*specifications as reduction system*)
|
wenzelm@19692
|
61 |
|
wenzelm@19697
|
62 |
fun make_def (specs, restricts, reducts) =
|
wenzelm@19697
|
63 |
{specs = specs, restricts = restricts, reducts = reducts}: def;
|
wenzelm@19692
|
64 |
|
wenzelm@19697
|
65 |
fun map_def c f =
|
wenzelm@19697
|
66 |
Symtab.default (c, make_def (Inttab.empty, [], [])) #>
|
wenzelm@19697
|
67 |
Symtab.map_entry c (fn {specs, restricts, reducts}: def =>
|
wenzelm@19697
|
68 |
make_def (f (specs, restricts, reducts)));
|
wenzelm@19692
|
69 |
|
wenzelm@19692
|
70 |
|
wenzelm@19692
|
71 |
datatype T = Defs of def Symtab.table;
|
wenzelm@19692
|
72 |
|
wenzelm@19712
|
73 |
fun lookup_list which defs c =
|
wenzelm@19692
|
74 |
(case Symtab.lookup defs c of
|
wenzelm@19713
|
75 |
SOME (def: def) => which def
|
wenzelm@19692
|
76 |
| NONE => []);
|
wenzelm@19692
|
77 |
|
haftmann@24199
|
78 |
fun specifications_of (Defs defs) = lookup_list (map snd o Inttab.dest o #specs) defs;
|
haftmann@24199
|
79 |
fun all_specifications_of (Defs defs) =
|
haftmann@24199
|
80 |
((map o apsnd) (map snd o Inttab.dest o #specs) o Symtab.dest) defs;
|
wenzelm@19692
|
81 |
val restricts_of = lookup_list #restricts;
|
wenzelm@19692
|
82 |
val reducts_of = lookup_list #reducts;
|
wenzelm@19692
|
83 |
|
wenzelm@19697
|
84 |
fun dest (Defs defs) =
|
wenzelm@19697
|
85 |
let
|
wenzelm@19697
|
86 |
val restricts = Symtab.fold (fn (c, {restricts, ...}) =>
|
wenzelm@19697
|
87 |
fold (fn (args, name) => cons ((c, args), name)) restricts) defs [];
|
wenzelm@19697
|
88 |
val reducts = Symtab.fold (fn (c, {reducts, ...}) =>
|
wenzelm@19697
|
89 |
fold (fn (args, deps) => cons ((c, args), deps)) reducts) defs [];
|
wenzelm@19697
|
90 |
in {restricts = restricts, reducts = reducts} end;
|
wenzelm@19692
|
91 |
|
wenzelm@19697
|
92 |
val empty = Defs Symtab.empty;
|
wenzelm@19692
|
93 |
|
wenzelm@19692
|
94 |
|
wenzelm@19697
|
95 |
(* specifications *)
|
wenzelm@19692
|
96 |
|
wenzelm@19697
|
97 |
fun disjoint_specs c (i, {lhs = Ts, name = a, ...}: spec) =
|
wenzelm@19697
|
98 |
Inttab.forall (fn (j, {lhs = Us, name = b, ...}: spec) =>
|
wenzelm@19697
|
99 |
i = j orelse disjoint_args (Ts, Us) orelse
|
wenzelm@24792
|
100 |
error ("Clash of specifications " ^ quote a ^ " and " ^ quote b ^
|
wenzelm@19697
|
101 |
" for constant " ^ quote c));
|
wenzelm@19697
|
102 |
|
wenzelm@19697
|
103 |
fun join_specs c ({specs = specs1, restricts, reducts}, {specs = specs2, ...}: def) =
|
wenzelm@19697
|
104 |
let
|
wenzelm@19697
|
105 |
val specs' =
|
wenzelm@19697
|
106 |
Inttab.fold (fn spec2 => (disjoint_specs c spec2 specs1; Inttab.update spec2)) specs2 specs1;
|
wenzelm@19697
|
107 |
in make_def (specs', restricts, reducts) end;
|
wenzelm@19697
|
108 |
|
wenzelm@19697
|
109 |
fun update_specs c spec = map_def c (fn (specs, restricts, reducts) =>
|
wenzelm@19697
|
110 |
(disjoint_specs c spec specs; (Inttab.update spec specs, restricts, reducts)));
|
wenzelm@19697
|
111 |
|
wenzelm@19697
|
112 |
|
wenzelm@19701
|
113 |
(* normalized dependencies: reduction with well-formedness check *)
|
wenzelm@19697
|
114 |
|
wenzelm@19697
|
115 |
local
|
wenzelm@19697
|
116 |
|
wenzelm@19729
|
117 |
val prt = Pretty.string_of oo pretty_const;
|
wenzelm@19729
|
118 |
fun err pp (c, args) (d, Us) s1 s2 =
|
wenzelm@19729
|
119 |
error (s1 ^ " dependency of constant " ^ prt pp (c, args) ^ " -> " ^ prt pp (d, Us) ^ s2);
|
wenzelm@19729
|
120 |
|
wenzelm@19712
|
121 |
fun contained (U as TVar _) (Type (_, Ts)) = exists (fn T => T = U orelse contained U T) Ts
|
wenzelm@19697
|
122 |
| contained _ _ = false;
|
wenzelm@19697
|
123 |
|
wenzelm@19729
|
124 |
fun acyclic pp defs (c, args) (d, Us) =
|
wenzelm@19729
|
125 |
c <> d orelse
|
wenzelm@19729
|
126 |
exists (fn U => exists (contained U) args) Us orelse
|
wenzelm@19729
|
127 |
is_none (match_args (args, Us)) orelse
|
wenzelm@19729
|
128 |
err pp (c, args) (d, Us) "Circular" "";
|
wenzelm@19729
|
129 |
|
wenzelm@19701
|
130 |
fun wellformed pp defs (c, args) (d, Us) =
|
wenzelm@19729
|
131 |
forall is_TVar Us orelse
|
wenzelm@19729
|
132 |
(case find_first (fn (Ts, _) => not (disjoint_args (Ts, Us))) (restricts_of defs d) of
|
wenzelm@19729
|
133 |
SOME (Ts, name) =>
|
wenzelm@19729
|
134 |
err pp (c, args) (d, Us) "Malformed"
|
wenzelm@19729
|
135 |
("\n(restriction " ^ prt pp (d, Ts) ^ " from " ^ quote name ^ ")")
|
wenzelm@19729
|
136 |
| NONE => true);
|
wenzelm@19692
|
137 |
|
wenzelm@19701
|
138 |
fun reduction pp defs const deps =
|
wenzelm@19697
|
139 |
let
|
wenzelm@19701
|
140 |
fun reduct Us (Ts, rhs) =
|
wenzelm@19701
|
141 |
(case match_args (Ts, Us) of
|
wenzelm@19701
|
142 |
NONE => NONE
|
wenzelm@19701
|
143 |
| SOME subst => SOME (map (apsnd (map subst)) rhs));
|
wenzelm@19701
|
144 |
fun reducts (d, Us) = get_first (reduct Us) (reducts_of defs d);
|
wenzelm@19701
|
145 |
|
wenzelm@19701
|
146 |
val reds = map (`reducts) deps;
|
wenzelm@19701
|
147 |
val deps' =
|
wenzelm@19701
|
148 |
if forall (is_none o #1) reds then NONE
|
wenzelm@20668
|
149 |
else SOME (fold_rev
|
wenzelm@20668
|
150 |
(fn (NONE, dp) => insert (op =) dp | (SOME dps, _) => fold (insert (op =)) dps) reds []);
|
wenzelm@19729
|
151 |
val _ = forall (acyclic pp defs const) (the_default deps deps');
|
wenzelm@19697
|
152 |
in deps' end;
|
wenzelm@19692
|
153 |
|
wenzelm@19760
|
154 |
in
|
wenzelm@19760
|
155 |
|
wenzelm@19712
|
156 |
fun normalize pp =
|
wenzelm@19697
|
157 |
let
|
wenzelm@19701
|
158 |
fun norm_update (c, {reducts, ...}: def) (changed, defs) =
|
wenzelm@19701
|
159 |
let
|
wenzelm@19701
|
160 |
val reducts' = reducts |> map (fn (args, deps) =>
|
wenzelm@19712
|
161 |
(args, perhaps (reduction pp defs (c, args)) deps));
|
wenzelm@19697
|
162 |
in
|
wenzelm@19701
|
163 |
if reducts = reducts' then (changed, defs)
|
wenzelm@19701
|
164 |
else (true, defs |> map_def c (fn (specs, restricts, reducts) =>
|
wenzelm@19701
|
165 |
(specs, restricts, reducts')))
|
wenzelm@19697
|
166 |
end;
|
wenzelm@19701
|
167 |
fun norm_all defs =
|
wenzelm@19701
|
168 |
(case Symtab.fold norm_update defs (false, defs) of
|
wenzelm@19701
|
169 |
(true, defs') => norm_all defs'
|
wenzelm@19701
|
170 |
| (false, _) => defs);
|
wenzelm@19729
|
171 |
fun check defs (c, {reducts, ...}: def) =
|
wenzelm@19729
|
172 |
reducts |> forall (fn (args, deps) => forall (wellformed pp defs (c, args)) deps);
|
wenzelm@19729
|
173 |
in norm_all #> (fn defs => tap (Symtab.forall (check defs)) defs) end;
|
wenzelm@19701
|
174 |
|
wenzelm@19712
|
175 |
fun dependencies pp (c, args) restr deps =
|
wenzelm@19712
|
176 |
map_def c (fn (specs, restricts, reducts) =>
|
wenzelm@19712
|
177 |
let
|
wenzelm@19712
|
178 |
val restricts' = Library.merge (op =) (restricts, restr);
|
wenzelm@19712
|
179 |
val reducts' = insert (op =) (args, deps) reducts;
|
wenzelm@19712
|
180 |
in (specs, restricts', reducts') end)
|
wenzelm@19712
|
181 |
#> normalize pp;
|
wenzelm@19692
|
182 |
|
wenzelm@19697
|
183 |
end;
|
wenzelm@19692
|
184 |
|
wenzelm@19692
|
185 |
|
wenzelm@19624
|
186 |
(* merge *)
|
wenzelm@19624
|
187 |
|
wenzelm@19692
|
188 |
fun merge pp (Defs defs1, Defs defs2) =
|
wenzelm@19613
|
189 |
let
|
wenzelm@19697
|
190 |
fun add_deps (c, args) restr deps defs =
|
wenzelm@19692
|
191 |
if AList.defined (op =) (reducts_of defs c) args then defs
|
wenzelm@19697
|
192 |
else dependencies pp (c, args) restr deps defs;
|
wenzelm@19697
|
193 |
fun add_def (c, {restricts, reducts, ...}: def) =
|
wenzelm@19697
|
194 |
fold (fn (args, deps) => add_deps (c, args) restricts deps) reducts;
|
wenzelm@19760
|
195 |
in
|
wenzelm@19760
|
196 |
Defs (Symtab.join join_specs (defs1, defs2)
|
wenzelm@19760
|
197 |
|> normalize pp |> Symtab.fold add_def defs2)
|
wenzelm@19760
|
198 |
end;
|
wenzelm@19613
|
199 |
|
wenzelm@19613
|
200 |
|
wenzelm@19613
|
201 |
(* define *)
|
wenzelm@19590
|
202 |
|
haftmann@24199
|
203 |
fun define pp unchecked is_def name (c, args) deps (Defs defs) =
|
wenzelm@19692
|
204 |
let
|
wenzelm@19697
|
205 |
val restr =
|
wenzelm@19697
|
206 |
if plain_args args orelse
|
wenzelm@19697
|
207 |
(case args of [Type (a, rec_args)] => plain_args rec_args | _ => false)
|
wenzelm@19697
|
208 |
then [] else [(args, name)];
|
wenzelm@19697
|
209 |
val spec =
|
haftmann@24199
|
210 |
(serial (), {is_def = is_def, name = name, lhs = args, rhs = deps});
|
wenzelm@19697
|
211 |
val defs' = defs |> update_specs c spec;
|
wenzelm@19712
|
212 |
in Defs (defs' |> (if unchecked then I else dependencies pp (c, args) restr deps)) end;
|
wenzelm@19624
|
213 |
|
wenzelm@19697
|
214 |
end;
|