adamc@2
|
1 (* Copyright (c) 2008, Adam Chlipala
|
adamc@2
|
2 * All rights reserved.
|
adamc@2
|
3 *
|
adamc@2
|
4 * Redistribution and use in source and binary forms, with or without
|
adamc@2
|
5 * modification, are permitted provided that the following conditions are met:
|
adamc@2
|
6 *
|
adamc@2
|
7 * - Redistributions of source code must retain the above copyright notice,
|
adamc@2
|
8 * this list of conditions and the following disclaimer.
|
adamc@2
|
9 * - Redistributions in binary form must reproduce the above copyright notice,
|
adamc@2
|
10 * this list of conditions and the following disclaimer in the documentation
|
adamc@2
|
11 * and/or other materials provided with the distribution.
|
adamc@2
|
12 * - The names of contributors may not be used to endorse or promote products
|
adamc@2
|
13 * derived from this software without specific prior written permission.
|
adamc@2
|
14 *
|
adamc@2
|
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
adamc@2
|
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
adamc@2
|
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
adamc@2
|
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
adamc@2
|
19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
adamc@2
|
20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
adamc@2
|
21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
adamc@2
|
22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
adamc@2
|
23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
adamc@2
|
24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
adamc@2
|
25 * POSSIBILITY OF SUCH DAMAGE.
|
adamc@2
|
26 *)
|
adamc@2
|
27
|
adamc@2
|
28 structure Elaborate :> ELABORATE = struct
|
adamc@2
|
29
|
adamc@14
|
30 structure P = Prim
|
adamc@4
|
31 structure L = Source
|
adamc@2
|
32 structure L' = Elab
|
adamc@2
|
33 structure E = ElabEnv
|
adamc@2
|
34 structure U = ElabUtil
|
adamc@82
|
35 structure D = Disjoint
|
adamc@2
|
36
|
adamc@3
|
37 open Print
|
adamc@3
|
38 open ElabPrint
|
adamc@329
|
39 open ElabErr
|
adamc@3
|
40
|
adamc@172
|
41 structure IM = IntBinaryMap
|
adamc@175
|
42
|
adamc@175
|
43 structure SK = struct
|
adamc@175
|
44 type ord_key = string
|
adamc@175
|
45 val compare = String.compare
|
adamc@175
|
46 end
|
adamc@175
|
47
|
adamc@175
|
48 structure SS = BinarySetFn(SK)
|
adamc@175
|
49 structure SM = BinaryMapFn(SK)
|
adamc@62
|
50
|
adamc@210
|
51 val basis_r = ref 0
|
adamc@210
|
52
|
adamc@2
|
53 fun elabExplicitness e =
|
adamc@2
|
54 case e of
|
adamc@2
|
55 L.Explicit => L'.Explicit
|
adamc@2
|
56 | L.Implicit => L'.Implicit
|
adamc@2
|
57
|
adamc@2
|
58 fun occursKind r =
|
adamc@76
|
59 U.Kind.exists (fn L'.KUnif (_, _, r') => r = r'
|
adamc@2
|
60 | _ => false)
|
adamc@2
|
61
|
adamc@3
|
62 exception KUnify' of kunify_error
|
adamc@3
|
63
|
adamc@3
|
64 fun unifyKinds' (k1All as (k1, _)) (k2All as (k2, _)) =
|
adamc@2
|
65 let
|
adamc@3
|
66 fun err f = raise KUnify' (f (k1All, k2All))
|
adamc@2
|
67 in
|
adamc@2
|
68 case (k1, k2) of
|
adamc@2
|
69 (L'.KType, L'.KType) => ()
|
adamc@82
|
70 | (L'.KUnit, L'.KUnit) => ()
|
adamc@82
|
71
|
adamc@2
|
72 | (L'.KArrow (d1, r1), L'.KArrow (d2, r2)) =>
|
adamc@3
|
73 (unifyKinds' d1 d2;
|
adamc@3
|
74 unifyKinds' r1 r2)
|
adamc@2
|
75 | (L'.KName, L'.KName) => ()
|
adamc@3
|
76 | (L'.KRecord k1, L'.KRecord k2) => unifyKinds' k1 k2
|
adamc@207
|
77 | (L'.KTuple ks1, L'.KTuple ks2) =>
|
adamc@207
|
78 ((ListPair.appEq (fn (k1, k2) => unifyKinds' k1 k2) (ks1, ks2))
|
adamc@207
|
79 handle ListPair.UnequalLengths => err KIncompatible)
|
adamc@2
|
80
|
adamc@2
|
81 | (L'.KError, _) => ()
|
adamc@2
|
82 | (_, L'.KError) => ()
|
adamc@2
|
83
|
adamc@76
|
84 | (L'.KUnif (_, _, ref (SOME k1All)), _) => unifyKinds' k1All k2All
|
adamc@76
|
85 | (_, L'.KUnif (_, _, ref (SOME k2All))) => unifyKinds' k1All k2All
|
adamc@2
|
86
|
adamc@76
|
87 | (L'.KUnif (_, _, r1), L'.KUnif (_, _, r2)) =>
|
adamc@2
|
88 if r1 = r2 then
|
adamc@2
|
89 ()
|
adamc@2
|
90 else
|
adamc@2
|
91 r1 := SOME k2All
|
adamc@2
|
92
|
adamc@76
|
93 | (L'.KUnif (_, _, r), _) =>
|
adamc@2
|
94 if occursKind r k2All then
|
adamc@2
|
95 err KOccursCheckFailed
|
adamc@2
|
96 else
|
adamc@2
|
97 r := SOME k2All
|
adamc@76
|
98 | (_, L'.KUnif (_, _, r)) =>
|
adamc@2
|
99 if occursKind r k1All then
|
adamc@2
|
100 err KOccursCheckFailed
|
adamc@2
|
101 else
|
adamc@2
|
102 r := SOME k1All
|
adamc@2
|
103
|
adamc@2
|
104 | _ => err KIncompatible
|
adamc@2
|
105 end
|
adamc@2
|
106
|
adamc@3
|
107 exception KUnify of L'.kind * L'.kind * kunify_error
|
adamc@3
|
108
|
adamc@3
|
109 fun unifyKinds k1 k2 =
|
adamc@3
|
110 unifyKinds' k1 k2
|
adamc@3
|
111 handle KUnify' err => raise KUnify (k1, k2, err)
|
adamc@3
|
112
|
adamc@5
|
113 fun checkKind env c k1 k2 =
|
adamc@3
|
114 unifyKinds k1 k2
|
adamc@3
|
115 handle KUnify (k1, k2, err) =>
|
adamc@5
|
116 conError env (WrongKind (c, k1, k2, err))
|
adamc@3
|
117
|
adamc@3
|
118 val dummy = ErrorMsg.dummySpan
|
adamc@3
|
119
|
adamc@3
|
120 val ktype = (L'.KType, dummy)
|
adamc@3
|
121 val kname = (L'.KName, dummy)
|
adamc@12
|
122 val ktype_record = (L'.KRecord ktype, dummy)
|
adamc@3
|
123
|
adamc@3
|
124 val cerror = (L'.CError, dummy)
|
adamc@3
|
125 val kerror = (L'.KError, dummy)
|
adamc@10
|
126 val eerror = (L'.EError, dummy)
|
adamc@31
|
127 val sgnerror = (L'.SgnError, dummy)
|
adamc@31
|
128 val strerror = (L'.StrError, dummy)
|
adamc@3
|
129
|
adamc@56
|
130 val int = ref cerror
|
adamc@56
|
131 val float = ref cerror
|
adamc@56
|
132 val string = ref cerror
|
adamc@203
|
133 val table = ref cerror
|
adamc@56
|
134
|
adamc@3
|
135 local
|
adamc@3
|
136 val count = ref 0
|
adamc@3
|
137 in
|
adamc@3
|
138
|
adamc@3
|
139 fun resetKunif () = count := 0
|
adamc@3
|
140
|
adamc@76
|
141 fun kunif loc =
|
adamc@3
|
142 let
|
adamc@3
|
143 val n = !count
|
adamc@3
|
144 val s = if n <= 26 then
|
adamc@3
|
145 str (chr (ord #"A" + n))
|
adamc@3
|
146 else
|
adamc@3
|
147 "U" ^ Int.toString (n - 26)
|
adamc@3
|
148 in
|
adamc@3
|
149 count := n + 1;
|
adamc@76
|
150 (L'.KUnif (loc, s, ref NONE), dummy)
|
adamc@3
|
151 end
|
adamc@3
|
152
|
adamc@3
|
153 end
|
adamc@3
|
154
|
adamc@10
|
155 local
|
adamc@10
|
156 val count = ref 0
|
adamc@10
|
157 in
|
adamc@10
|
158
|
adamc@10
|
159 fun resetCunif () = count := 0
|
adamc@10
|
160
|
adamc@76
|
161 fun cunif (loc, k) =
|
adamc@10
|
162 let
|
adamc@10
|
163 val n = !count
|
adamc@10
|
164 val s = if n <= 26 then
|
adamc@10
|
165 str (chr (ord #"A" + n))
|
adamc@10
|
166 else
|
adamc@10
|
167 "U" ^ Int.toString (n - 26)
|
adamc@10
|
168 in
|
adamc@10
|
169 count := n + 1;
|
adamc@76
|
170 (L'.CUnif (loc, k, s, ref NONE), dummy)
|
adamc@10
|
171 end
|
adamc@10
|
172
|
adamc@10
|
173 end
|
adamc@10
|
174
|
adamc@18
|
175 fun elabKind (k, loc) =
|
adamc@18
|
176 case k of
|
adamc@18
|
177 L.KType => (L'.KType, loc)
|
adamc@18
|
178 | L.KArrow (k1, k2) => (L'.KArrow (elabKind k1, elabKind k2), loc)
|
adamc@18
|
179 | L.KName => (L'.KName, loc)
|
adamc@18
|
180 | L.KRecord k => (L'.KRecord (elabKind k), loc)
|
adamc@82
|
181 | L.KUnit => (L'.KUnit, loc)
|
adamc@207
|
182 | L.KTuple ks => (L'.KTuple (map elabKind ks), loc)
|
adamc@76
|
183 | L.KWild => kunif loc
|
adamc@18
|
184
|
adamc@67
|
185 fun foldKind (dom, ran, loc)=
|
adamc@67
|
186 (L'.KArrow ((L'.KArrow ((L'.KName, loc),
|
adamc@67
|
187 (L'.KArrow (dom,
|
adamc@67
|
188 (L'.KArrow (ran, ran), loc)), loc)), loc),
|
adamc@67
|
189 (L'.KArrow (ran,
|
adamc@67
|
190 (L'.KArrow ((L'.KRecord dom, loc),
|
adamc@67
|
191 ran), loc)), loc)), loc)
|
adamc@67
|
192
|
adamc@207
|
193 fun hnormKind (kAll as (k, _)) =
|
adamc@207
|
194 case k of
|
adamc@207
|
195 L'.KUnif (_, _, ref (SOME k)) => hnormKind k
|
adamc@207
|
196 | _ => kAll
|
adamc@207
|
197
|
adamc@83
|
198 fun elabCon (env, denv) (c, loc) =
|
adamc@3
|
199 case c of
|
adamc@3
|
200 L.CAnnot (c, k) =>
|
adamc@3
|
201 let
|
adamc@3
|
202 val k' = elabKind k
|
adamc@83
|
203 val (c', ck, gs) = elabCon (env, denv) c
|
adamc@3
|
204 in
|
adamc@5
|
205 checkKind env c' ck k';
|
adamc@83
|
206 (c', k', gs)
|
adamc@3
|
207 end
|
adamc@3
|
208
|
adamc@3
|
209 | L.TFun (t1, t2) =>
|
adamc@3
|
210 let
|
adamc@83
|
211 val (t1', k1, gs1) = elabCon (env, denv) t1
|
adamc@83
|
212 val (t2', k2, gs2) = elabCon (env, denv) t2
|
adamc@3
|
213 in
|
adamc@5
|
214 checkKind env t1' k1 ktype;
|
adamc@5
|
215 checkKind env t2' k2 ktype;
|
adamc@83
|
216 ((L'.TFun (t1', t2'), loc), ktype, gs1 @ gs2)
|
adamc@3
|
217 end
|
adamc@3
|
218 | L.TCFun (e, x, k, t) =>
|
adamc@3
|
219 let
|
adamc@3
|
220 val e' = elabExplicitness e
|
adamc@3
|
221 val k' = elabKind k
|
adamc@3
|
222 val env' = E.pushCRel env x k'
|
adamc@83
|
223 val (t', tk, gs) = elabCon (env', D.enter denv) t
|
adamc@3
|
224 in
|
adamc@5
|
225 checkKind env t' tk ktype;
|
adamc@83
|
226 ((L'.TCFun (e', x, k', t'), loc), ktype, gs)
|
adamc@3
|
227 end
|
adamc@345
|
228 | L.CDisjoint (c1, c2, c) =>
|
adamc@85
|
229 let
|
adamc@85
|
230 val (c1', k1, gs1) = elabCon (env, denv) c1
|
adamc@85
|
231 val (c2', k2, gs2) = elabCon (env, denv) c2
|
adamc@85
|
232
|
adamc@85
|
233 val ku1 = kunif loc
|
adamc@85
|
234 val ku2 = kunif loc
|
adamc@85
|
235
|
adamc@90
|
236 val (denv', gs3) = D.assert env denv (c1', c2')
|
adamc@90
|
237 val (c', k, gs4) = elabCon (env, denv') c
|
adamc@85
|
238 in
|
adamc@85
|
239 checkKind env c1' k1 (L'.KRecord ku1, loc);
|
adamc@85
|
240 checkKind env c2' k2 (L'.KRecord ku2, loc);
|
adamc@85
|
241
|
adamc@345
|
242 ((L'.CDisjoint (L'.Instantiate, c1', c2', c'), loc), k, gs1 @ gs2 @ gs3 @ gs4)
|
adamc@85
|
243 end
|
adamc@3
|
244 | L.TRecord c =>
|
adamc@3
|
245 let
|
adamc@83
|
246 val (c', ck, gs) = elabCon (env, denv) c
|
adamc@3
|
247 val k = (L'.KRecord ktype, loc)
|
adamc@3
|
248 in
|
adamc@5
|
249 checkKind env c' ck k;
|
adamc@83
|
250 ((L'.TRecord c', loc), ktype, gs)
|
adamc@3
|
251 end
|
adamc@3
|
252
|
adamc@34
|
253 | L.CVar ([], s) =>
|
adamc@3
|
254 (case E.lookupC env s of
|
adamc@9
|
255 E.NotBound =>
|
adamc@5
|
256 (conError env (UnboundCon (loc, s));
|
adamc@83
|
257 (cerror, kerror, []))
|
adamc@9
|
258 | E.Rel (n, k) =>
|
adamc@83
|
259 ((L'.CRel n, loc), k, [])
|
adamc@9
|
260 | E.Named (n, k) =>
|
adamc@83
|
261 ((L'.CNamed n, loc), k, []))
|
adamc@34
|
262 | L.CVar (m1 :: ms, s) =>
|
adamc@34
|
263 (case E.lookupStr env m1 of
|
adamc@42
|
264 NONE => (conError env (UnboundStrInCon (loc, m1));
|
adamc@83
|
265 (cerror, kerror, []))
|
adamc@34
|
266 | SOME (n, sgn) =>
|
adamc@34
|
267 let
|
adamc@34
|
268 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
|
adamc@34
|
269 case E.projectStr env {sgn = sgn, str = str, field = m} of
|
adamc@34
|
270 NONE => (conError env (UnboundStrInCon (loc, m));
|
adamc@34
|
271 (strerror, sgnerror))
|
adamc@34
|
272 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
|
adamc@34
|
273 ((L'.StrVar n, loc), sgn) ms
|
adamc@34
|
274
|
adamc@34
|
275 val k = case E.projectCon env {sgn = sgn, str = str, field = s} of
|
adamc@34
|
276 NONE => (conError env (UnboundCon (loc, s));
|
adamc@34
|
277 kerror)
|
adamc@34
|
278 | SOME (k, _) => k
|
adamc@34
|
279 in
|
adamc@83
|
280 ((L'.CModProj (n, ms, s), loc), k, [])
|
adamc@34
|
281 end)
|
adamc@34
|
282
|
adamc@3
|
283 | L.CApp (c1, c2) =>
|
adamc@3
|
284 let
|
adamc@83
|
285 val (c1', k1, gs1) = elabCon (env, denv) c1
|
adamc@83
|
286 val (c2', k2, gs2) = elabCon (env, denv) c2
|
adamc@76
|
287 val dom = kunif loc
|
adamc@76
|
288 val ran = kunif loc
|
adamc@3
|
289 in
|
adamc@5
|
290 checkKind env c1' k1 (L'.KArrow (dom, ran), loc);
|
adamc@5
|
291 checkKind env c2' k2 dom;
|
adamc@83
|
292 ((L'.CApp (c1', c2'), loc), ran, gs1 @ gs2)
|
adamc@3
|
293 end
|
adamc@67
|
294 | L.CAbs (x, ko, t) =>
|
adamc@3
|
295 let
|
adamc@67
|
296 val k' = case ko of
|
adamc@76
|
297 NONE => kunif loc
|
adamc@67
|
298 | SOME k => elabKind k
|
adamc@3
|
299 val env' = E.pushCRel env x k'
|
adamc@83
|
300 val (t', tk, gs) = elabCon (env', D.enter denv) t
|
adamc@3
|
301 in
|
adamc@8
|
302 ((L'.CAbs (x, k', t'), loc),
|
adamc@83
|
303 (L'.KArrow (k', tk), loc),
|
adamc@83
|
304 gs)
|
adamc@3
|
305 end
|
adamc@3
|
306
|
adamc@3
|
307 | L.CName s =>
|
adamc@83
|
308 ((L'.CName s, loc), kname, [])
|
adamc@3
|
309
|
adamc@3
|
310 | L.CRecord xcs =>
|
adamc@3
|
311 let
|
adamc@76
|
312 val k = kunif loc
|
adamc@3
|
313
|
adamc@83
|
314 val (xcs', gs) = ListUtil.foldlMap (fn ((x, c), gs) =>
|
adamc@83
|
315 let
|
adamc@83
|
316 val (x', xk, gs1) = elabCon (env, denv) x
|
adamc@83
|
317 val (c', ck, gs2) = elabCon (env, denv) c
|
adamc@83
|
318 in
|
adamc@83
|
319 checkKind env x' xk kname;
|
adamc@83
|
320 checkKind env c' ck k;
|
adamc@83
|
321 ((x', c'), gs1 @ gs2 @ gs)
|
adamc@83
|
322 end) [] xcs
|
adamc@67
|
323
|
adamc@67
|
324 val rc = (L'.CRecord (k, xcs'), loc)
|
adamc@67
|
325 (* Add duplicate field checking later. *)
|
adamc@83
|
326
|
adamc@83
|
327 fun prove (xcs, ds) =
|
adamc@83
|
328 case xcs of
|
adamc@83
|
329 [] => ds
|
adamc@83
|
330 | xc :: rest =>
|
adamc@83
|
331 let
|
adamc@83
|
332 val r1 = (L'.CRecord (k, [xc]), loc)
|
adamc@83
|
333 val ds = foldl (fn (xc', ds) =>
|
adamc@83
|
334 let
|
adamc@83
|
335 val r2 = (L'.CRecord (k, [xc']), loc)
|
adamc@83
|
336 in
|
adamc@90
|
337 D.prove env denv (r1, r2, loc) @ ds
|
adamc@83
|
338 end)
|
adamc@83
|
339 ds rest
|
adamc@83
|
340 in
|
adamc@83
|
341 prove (rest, ds)
|
adamc@83
|
342 end
|
adamc@3
|
343 in
|
adamc@83
|
344 (rc, (L'.KRecord k, loc), prove (xcs', gs))
|
adamc@3
|
345 end
|
adamc@3
|
346 | L.CConcat (c1, c2) =>
|
adamc@3
|
347 let
|
adamc@83
|
348 val (c1', k1, gs1) = elabCon (env, denv) c1
|
adamc@83
|
349 val (c2', k2, gs2) = elabCon (env, denv) c2
|
adamc@76
|
350 val ku = kunif loc
|
adamc@3
|
351 val k = (L'.KRecord ku, loc)
|
adamc@3
|
352 in
|
adamc@5
|
353 checkKind env c1' k1 k;
|
adamc@5
|
354 checkKind env c2' k2 k;
|
adamc@83
|
355 ((L'.CConcat (c1', c2'), loc), k,
|
adamc@90
|
356 D.prove env denv (c1', c2', loc) @ gs1 @ gs2)
|
adamc@3
|
357 end
|
adamc@67
|
358 | L.CFold =>
|
adamc@67
|
359 let
|
adamc@76
|
360 val dom = kunif loc
|
adamc@76
|
361 val ran = kunif loc
|
adamc@67
|
362 in
|
adamc@67
|
363 ((L'.CFold (dom, ran), loc),
|
adamc@83
|
364 foldKind (dom, ran, loc),
|
adamc@83
|
365 [])
|
adamc@67
|
366 end
|
adamc@3
|
367
|
adamc@83
|
368 | L.CUnit => ((L'.CUnit, loc), (L'.KUnit, loc), [])
|
adamc@82
|
369
|
adamc@207
|
370 | L.CTuple cs =>
|
adamc@207
|
371 let
|
adamc@207
|
372 val (cs', ks, gs) = foldl (fn (c, (cs', ks, gs)) =>
|
adamc@207
|
373 let
|
adamc@207
|
374 val (c', k, gs') = elabCon (env, denv) c
|
adamc@207
|
375 in
|
adamc@207
|
376 (c' :: cs', k :: ks, gs' @ gs)
|
adamc@207
|
377 end) ([], [], []) cs
|
adamc@207
|
378 in
|
adamc@207
|
379 ((L'.CTuple (rev cs'), loc), (L'.KTuple (rev ks), loc), gs)
|
adamc@207
|
380 end
|
adamc@207
|
381 | L.CProj (c, n) =>
|
adamc@207
|
382 let
|
adamc@207
|
383 val (c', k, gs) = elabCon (env, denv) c
|
adamc@207
|
384 in
|
adamc@207
|
385 case hnormKind k of
|
adamc@207
|
386 (L'.KTuple ks, _) =>
|
adamc@207
|
387 if n <= 0 orelse n > length ks then
|
adamc@207
|
388 (conError env (ProjBounds (c', n));
|
adamc@207
|
389 (cerror, kerror, []))
|
adamc@207
|
390 else
|
adamc@207
|
391 ((L'.CProj (c', n), loc), List.nth (ks, n - 1), gs)
|
adamc@207
|
392 | k => (conError env (ProjMismatch (c', k));
|
adamc@207
|
393 (cerror, kerror, []))
|
adamc@207
|
394 end
|
adamc@207
|
395
|
adamc@18
|
396 | L.CWild k =>
|
adamc@18
|
397 let
|
adamc@18
|
398 val k' = elabKind k
|
adamc@18
|
399 in
|
adamc@83
|
400 (cunif (loc, k'), k', [])
|
adamc@18
|
401 end
|
adamc@18
|
402
|
adamc@6
|
403 fun kunifsRemain k =
|
adamc@6
|
404 case k of
|
adamc@76
|
405 L'.KUnif (_, _, ref NONE) => true
|
adamc@6
|
406 | _ => false
|
adamc@10
|
407 fun cunifsRemain c =
|
adamc@10
|
408 case c of
|
adamc@76
|
409 L'.CUnif (loc, _, _, ref NONE) => SOME loc
|
adamc@76
|
410 | _ => NONE
|
adamc@6
|
411
|
adamc@76
|
412 val kunifsInDecl = U.Decl.exists {kind = kunifsRemain,
|
adamc@76
|
413 con = fn _ => false,
|
adamc@76
|
414 exp = fn _ => false,
|
adamc@76
|
415 sgn_item = fn _ => false,
|
adamc@76
|
416 sgn = fn _ => false,
|
adamc@76
|
417 str = fn _ => false,
|
adamc@76
|
418 decl = fn _ => false}
|
adamc@10
|
419
|
adamc@76
|
420 val cunifsInDecl = U.Decl.search {kind = fn _ => NONE,
|
adamc@76
|
421 con = cunifsRemain,
|
adamc@76
|
422 exp = fn _ => NONE,
|
adamc@76
|
423 sgn_item = fn _ => NONE,
|
adamc@76
|
424 sgn = fn _ => NONE,
|
adamc@76
|
425 str = fn _ => NONE,
|
adamc@76
|
426 decl = fn _ => NONE}
|
adamc@10
|
427
|
adamc@10
|
428 fun occursCon r =
|
adamc@10
|
429 U.Con.exists {kind = fn _ => false,
|
adamc@76
|
430 con = fn L'.CUnif (_, _, _, r') => r = r'
|
adamc@10
|
431 | _ => false}
|
adamc@10
|
432
|
adamc@10
|
433 exception CUnify' of cunify_error
|
adamc@10
|
434
|
adamc@13
|
435 exception SynUnif = E.SynUnif
|
adamc@12
|
436
|
adamc@81
|
437 open ElabOps
|
adamc@43
|
438
|
adamc@12
|
439 type record_summary = {
|
adamc@12
|
440 fields : (L'.con * L'.con) list,
|
adamc@12
|
441 unifs : (L'.con * L'.con option ref) list,
|
adamc@12
|
442 others : L'.con list
|
adamc@12
|
443 }
|
adamc@12
|
444
|
adamc@12
|
445 fun summaryToCon {fields, unifs, others} =
|
adamc@12
|
446 let
|
adamc@12
|
447 val c = (L'.CRecord (ktype, []), dummy)
|
adamc@12
|
448 val c = List.foldr (fn (c', c) => (L'.CConcat (c', c), dummy)) c others
|
adamc@12
|
449 val c = List.foldr (fn ((c', _), c) => (L'.CConcat (c', c), dummy)) c unifs
|
adamc@12
|
450 in
|
adamc@12
|
451 (L'.CConcat ((L'.CRecord (ktype, fields), dummy), c), dummy)
|
adamc@12
|
452 end
|
adamc@12
|
453
|
adamc@12
|
454 fun p_summary env s = p_con env (summaryToCon s)
|
adamc@12
|
455
|
adamc@12
|
456 exception CUnify of L'.con * L'.con * cunify_error
|
adamc@12
|
457
|
adamc@12
|
458 fun kindof env (c, loc) =
|
adamc@12
|
459 case c of
|
adamc@12
|
460 L'.TFun _ => ktype
|
adamc@12
|
461 | L'.TCFun _ => ktype
|
adamc@12
|
462 | L'.TRecord _ => ktype
|
adamc@12
|
463
|
adamc@12
|
464 | L'.CRel xn => #2 (E.lookupCRel env xn)
|
adamc@12
|
465 | L'.CNamed xn => #2 (E.lookupCNamed env xn)
|
adamc@34
|
466 | L'.CModProj (n, ms, x) =>
|
adamc@34
|
467 let
|
adamc@34
|
468 val (_, sgn) = E.lookupStrNamed env n
|
adamc@34
|
469 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
|
adamc@34
|
470 case E.projectStr env {sgn = sgn, str = str, field = m} of
|
adamc@34
|
471 NONE => raise Fail "kindof: Unknown substructure"
|
adamc@34
|
472 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
|
adamc@34
|
473 ((L'.StrVar n, loc), sgn) ms
|
adamc@34
|
474 in
|
adamc@34
|
475 case E.projectCon env {sgn = sgn, str = str, field = x} of
|
adamc@34
|
476 NONE => raise Fail "kindof: Unknown con in structure"
|
adamc@34
|
477 | SOME (k, _) => k
|
adamc@34
|
478 end
|
adamc@34
|
479
|
adamc@12
|
480 | L'.CApp (c, _) =>
|
adamc@141
|
481 (case hnormKind (kindof env c) of
|
adamc@141
|
482 (L'.KArrow (_, k), _) => k
|
adamc@141
|
483 | (L'.KError, _) => kerror
|
adamc@141
|
484 | k => raise CUnify' (CKindof (k, c)))
|
adamc@12
|
485 | L'.CAbs (x, k, c) => (L'.KArrow (k, kindof (E.pushCRel env x k) c), loc)
|
adamc@345
|
486 | L'.CDisjoint (_, _, _, c) => kindof env c
|
adamc@12
|
487
|
adamc@12
|
488 | L'.CName _ => kname
|
adamc@12
|
489
|
adamc@12
|
490 | L'.CRecord (k, _) => (L'.KRecord k, loc)
|
adamc@12
|
491 | L'.CConcat (c, _) => kindof env c
|
adamc@67
|
492 | L'.CFold (dom, ran) => foldKind (dom, ran, loc)
|
adamc@12
|
493
|
adamc@82
|
494 | L'.CUnit => (L'.KUnit, loc)
|
adamc@82
|
495
|
adamc@207
|
496 | L'.CTuple cs => (L'.KTuple (map (kindof env) cs), loc)
|
adamc@207
|
497 | L'.CProj (c, n) =>
|
adamc@207
|
498 (case hnormKind (kindof env c) of
|
adamc@207
|
499 (L'.KTuple ks, _) => List.nth (ks, n - 1)
|
adamc@207
|
500 | k => raise CUnify' (CKindof (k, c)))
|
adamc@207
|
501
|
adamc@12
|
502 | L'.CError => kerror
|
adamc@76
|
503 | L'.CUnif (_, k, _, _) => k
|
adamc@12
|
504
|
adamc@90
|
505 val hnormCon = D.hnormCon
|
adamc@86
|
506
|
adamc@205
|
507 datatype con_summary =
|
adamc@205
|
508 Nil
|
adamc@205
|
509 | Cons
|
adamc@205
|
510 | Unknown
|
adamc@205
|
511
|
adamc@205
|
512 fun compatible cs =
|
adamc@205
|
513 case cs of
|
adamc@205
|
514 (Unknown, _) => false
|
adamc@205
|
515 | (_, Unknown) => false
|
adamc@205
|
516 | (s1, s2) => s1 = s2
|
adamc@205
|
517
|
adamc@205
|
518 fun summarizeCon (env, denv) c =
|
adamc@205
|
519 let
|
adamc@205
|
520 val (c, gs) = hnormCon (env, denv) c
|
adamc@205
|
521 in
|
adamc@205
|
522 case #1 c of
|
adamc@205
|
523 L'.CRecord (_, []) => (Nil, gs)
|
adamc@205
|
524 | L'.CRecord (_, _ :: _) => (Cons, gs)
|
adamc@205
|
525 | L'.CConcat ((L'.CRecord (_, _ :: _), _), _) => (Cons, gs)
|
adamc@345
|
526 | L'.CDisjoint (_, _, _, c) =>
|
adamc@205
|
527 let
|
adamc@205
|
528 val (s, gs') = summarizeCon (env, denv) c
|
adamc@205
|
529 in
|
adamc@205
|
530 (s, gs @ gs')
|
adamc@205
|
531 end
|
adamc@205
|
532 | _ => (Unknown, gs)
|
adamc@205
|
533 end
|
adamc@205
|
534
|
adamc@205
|
535 fun p_con_summary s =
|
adamc@205
|
536 Print.PD.string (case s of
|
adamc@205
|
537 Nil => "Nil"
|
adamc@205
|
538 | Cons => "Cons"
|
adamc@205
|
539 | Unknown => "Unknown")
|
adamc@205
|
540
|
adamc@223
|
541 exception SummaryFailure
|
adamc@223
|
542
|
adamc@86
|
543 fun unifyRecordCons (env, denv) (c1, c2) =
|
adamc@12
|
544 let
|
adamc@92
|
545 fun rkindof c =
|
adamc@147
|
546 case hnormKind (kindof env c) of
|
adamc@92
|
547 (L'.KRecord k, _) => k
|
adamc@141
|
548 | (L'.KError, _) => kerror
|
adamc@141
|
549 | k => raise CUnify' (CKindof (k, c))
|
adamc@92
|
550
|
adamc@92
|
551 val k1 = rkindof c1
|
adamc@92
|
552 val k2 = rkindof c2
|
adamc@86
|
553
|
adamc@86
|
554 val (r1, gs1) = recordSummary (env, denv) c1
|
adamc@86
|
555 val (r2, gs2) = recordSummary (env, denv) c2
|
adamc@12
|
556 in
|
adamc@12
|
557 unifyKinds k1 k2;
|
adamc@86
|
558 unifySummaries (env, denv) (k1, r1, r2);
|
adamc@86
|
559 gs1 @ gs2
|
adamc@12
|
560 end
|
adamc@12
|
561
|
adamc@86
|
562 and recordSummary (env, denv) c =
|
adamc@86
|
563 let
|
adamc@86
|
564 val (c, gs) = hnormCon (env, denv) c
|
adamc@12
|
565
|
adamc@86
|
566 val (sum, gs') =
|
adamc@86
|
567 case c of
|
adamc@86
|
568 (L'.CRecord (_, xcs), _) => ({fields = xcs, unifs = [], others = []}, [])
|
adamc@86
|
569 | (L'.CConcat (c1, c2), _) =>
|
adamc@86
|
570 let
|
adamc@86
|
571 val (s1, gs1) = recordSummary (env, denv) c1
|
adamc@86
|
572 val (s2, gs2) = recordSummary (env, denv) c2
|
adamc@86
|
573 in
|
adamc@86
|
574 ({fields = #fields s1 @ #fields s2,
|
adamc@86
|
575 unifs = #unifs s1 @ #unifs s2,
|
adamc@86
|
576 others = #others s1 @ #others s2},
|
adamc@86
|
577 gs1 @ gs2)
|
adamc@86
|
578 end
|
adamc@86
|
579 | (L'.CUnif (_, _, _, ref (SOME c)), _) => recordSummary (env, denv) c
|
adamc@86
|
580 | c' as (L'.CUnif (_, _, _, r), _) => ({fields = [], unifs = [(c', r)], others = []}, [])
|
adamc@86
|
581 | c' => ({fields = [], unifs = [], others = [c']}, [])
|
adamc@86
|
582 in
|
adamc@86
|
583 (sum, gs @ gs')
|
adamc@86
|
584 end
|
adamc@86
|
585
|
adamc@86
|
586 and consEq (env, denv) (c1, c2) =
|
adamc@209
|
587 let
|
adamc@209
|
588 val gs = unifyCons (env, denv) c1 c2
|
adamc@209
|
589 in
|
adamc@209
|
590 List.all (fn (loc, env, denv, c1, c2) =>
|
adamc@209
|
591 case D.prove env denv (c1, c2, loc) of
|
adamc@209
|
592 [] => true
|
adamc@209
|
593 | _ => false) gs
|
adamc@209
|
594 end
|
adamc@12
|
595 handle CUnify _ => false
|
adamc@12
|
596
|
adamc@80
|
597 and consNeq env (c1, c2) =
|
adamc@86
|
598 case (#1 (ElabOps.hnormCon env c1), #1 (ElabOps.hnormCon env c2)) of
|
adamc@80
|
599 (L'.CName x1, L'.CName x2) => x1 <> x2
|
adamc@80
|
600 | _ => false
|
adamc@80
|
601
|
adamc@86
|
602 and unifySummaries (env, denv) (k, s1 : record_summary, s2 : record_summary) =
|
adamc@12
|
603 let
|
adamc@223
|
604 val loc = #2 k
|
adamc@14
|
605 (*val () = eprefaces "Summaries" [("#1", p_summary env s1),
|
adamc@223
|
606 ("#2", p_summary env s2)]*)
|
adamc@12
|
607
|
adamc@12
|
608 fun eatMatching p (ls1, ls2) =
|
adamc@12
|
609 let
|
adamc@12
|
610 fun em (ls1, ls2, passed1) =
|
adamc@12
|
611 case ls1 of
|
adamc@12
|
612 [] => (rev passed1, ls2)
|
adamc@12
|
613 | h1 :: t1 =>
|
adamc@12
|
614 let
|
adamc@12
|
615 fun search (ls2', passed2) =
|
adamc@12
|
616 case ls2' of
|
adamc@12
|
617 [] => em (t1, ls2, h1 :: passed1)
|
adamc@12
|
618 | h2 :: t2 =>
|
adamc@12
|
619 if p (h1, h2) then
|
adamc@12
|
620 em (t1, List.revAppend (passed2, t2), passed1)
|
adamc@12
|
621 else
|
adamc@12
|
622 search (t2, h2 :: passed2)
|
adamc@12
|
623 in
|
adamc@12
|
624 search (ls2, [])
|
adamc@12
|
625 end
|
adamc@12
|
626 in
|
adamc@12
|
627 em (ls1, ls2, [])
|
adamc@12
|
628 end
|
adamc@12
|
629
|
adamc@12
|
630 val (fs1, fs2) = eatMatching (fn ((x1, c1), (x2, c2)) =>
|
adamc@80
|
631 not (consNeq env (x1, x2))
|
adamc@86
|
632 andalso consEq (env, denv) (c1, c2)
|
adamc@86
|
633 andalso consEq (env, denv) (x1, x2))
|
adamc@79
|
634 (#fields s1, #fields s2)
|
adamc@14
|
635 (*val () = eprefaces "Summaries2" [("#1", p_summary env {fields = fs1, unifs = #unifs s1, others = #others s1}),
|
adamc@223
|
636 ("#2", p_summary env {fields = fs2, unifs = #unifs s2, others = #others s2})]*)
|
adamc@12
|
637 val (unifs1, unifs2) = eatMatching (fn ((_, r1), (_, r2)) => r1 = r2) (#unifs s1, #unifs s2)
|
adamc@86
|
638 val (others1, others2) = eatMatching (consEq (env, denv)) (#others s1, #others s2)
|
adamc@223
|
639 (*val () = eprefaces "Summaries3" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
|
adamc@223
|
640 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
|
adamc@12
|
641
|
adamc@12
|
642 fun unifFields (fs, others, unifs) =
|
adamc@12
|
643 case (fs, others, unifs) of
|
adamc@12
|
644 ([], [], _) => ([], [], unifs)
|
adamc@12
|
645 | (_, _, []) => (fs, others, [])
|
adamc@12
|
646 | (_, _, (_, r) :: rest) =>
|
adamc@12
|
647 let
|
adamc@12
|
648 val r' = ref NONE
|
adamc@141
|
649 val kr = (L'.KRecord k, dummy)
|
adamc@141
|
650 val cr' = (L'.CUnif (dummy, kr, "recd", r'), dummy)
|
adamc@12
|
651
|
adamc@12
|
652 val prefix = case (fs, others) of
|
adamc@12
|
653 ([], other :: others) =>
|
adamc@12
|
654 List.foldl (fn (other, c) =>
|
adamc@12
|
655 (L'.CConcat (c, other), dummy))
|
adamc@12
|
656 other others
|
adamc@12
|
657 | (fs, []) =>
|
adamc@12
|
658 (L'.CRecord (k, fs), dummy)
|
adamc@12
|
659 | (fs, others) =>
|
adamc@12
|
660 List.foldl (fn (other, c) =>
|
adamc@12
|
661 (L'.CConcat (c, other), dummy))
|
adamc@12
|
662 (L'.CRecord (k, fs), dummy) others
|
adamc@12
|
663 in
|
adamc@12
|
664 r := SOME (L'.CConcat (prefix, cr'), dummy);
|
adamc@12
|
665 ([], [], (cr', r') :: rest)
|
adamc@12
|
666 end
|
adamc@12
|
667
|
adamc@12
|
668 val (fs1, others1, unifs2) = unifFields (fs1, others1, unifs2)
|
adamc@12
|
669 val (fs2, others2, unifs1) = unifFields (fs2, others2, unifs1)
|
adamc@12
|
670
|
adamc@223
|
671 (*val () = eprefaces "Summaries4" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
|
adamc@223
|
672 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
|
adamc@223
|
673
|
adamc@223
|
674 fun isGuessable (other, fs) =
|
adamc@223
|
675 let
|
adamc@223
|
676 val gs = guessFold (env, denv) (other, (L'.CRecord (k, fs), loc), [], SummaryFailure)
|
adamc@223
|
677 in
|
adamc@223
|
678 List.all (fn (loc, env, denv, c1, c2) =>
|
adamc@223
|
679 case D.prove env denv (c1, c2, loc) of
|
adamc@223
|
680 [] => true
|
adamc@223
|
681 | _ => false) gs
|
adamc@223
|
682 end
|
adamc@223
|
683 handle SummaryFailure => false
|
adamc@223
|
684
|
adamc@223
|
685 val (fs1, fs2, others1, others2) =
|
adamc@223
|
686 case (fs1, fs2, others1, others2) of
|
adamc@223
|
687 ([], _, [other1], []) =>
|
adamc@223
|
688 if isGuessable (other1, fs2) then
|
adamc@223
|
689 ([], [], [], [])
|
adamc@223
|
690 else
|
adamc@223
|
691 (fs1, fs2, others1, others2)
|
adamc@223
|
692 | _ => (fs1, fs2, others1, others2)
|
adamc@223
|
693
|
adamc@223
|
694 (*val () = eprefaces "Summaries5" [("#1", p_summary env {fields = fs1, unifs = unifs1, others = others1}),
|
adamc@223
|
695 ("#2", p_summary env {fields = fs2, unifs = unifs2, others = others2})]*)
|
adamc@223
|
696
|
adamc@86
|
697 val clear = case (fs1, others1, fs2, others2) of
|
adamc@86
|
698 ([], [], [], []) => true
|
adamc@12
|
699 | _ => false
|
adamc@12
|
700 val empty = (L'.CRecord (k, []), dummy)
|
adamc@223
|
701
|
adamc@329
|
702 fun unsummarize {fields, unifs, others} =
|
adamc@329
|
703 let
|
adamc@329
|
704 val c = (L'.CRecord (k, fields), loc)
|
adamc@329
|
705
|
adamc@329
|
706 val c = foldl (fn ((c1, _), c2) => (L'.CConcat (c1, c2), loc))
|
adamc@329
|
707 c unifs
|
adamc@329
|
708 in
|
adamc@329
|
709 foldl (fn (c1, c2) => (L'.CConcat (c1, c2), loc))
|
adamc@329
|
710 c others
|
adamc@329
|
711 end
|
adamc@329
|
712
|
adamc@12
|
713 fun pairOffUnifs (unifs1, unifs2) =
|
adamc@12
|
714 case (unifs1, unifs2) of
|
adamc@12
|
715 ([], _) =>
|
adamc@86
|
716 if clear then
|
adamc@12
|
717 List.app (fn (_, r) => r := SOME empty) unifs2
|
adamc@12
|
718 else
|
adamc@329
|
719 raise CUnify' (CRecordFailure (unsummarize s1, unsummarize s2))
|
adamc@12
|
720 | (_, []) =>
|
adamc@86
|
721 if clear then
|
adamc@12
|
722 List.app (fn (_, r) => r := SOME empty) unifs1
|
adamc@12
|
723 else
|
adamc@329
|
724 raise CUnify' (CRecordFailure (unsummarize s1, unsummarize s2))
|
adamc@12
|
725 | ((c1, _) :: rest1, (_, r2) :: rest2) =>
|
adamc@12
|
726 (r2 := SOME c1;
|
adamc@12
|
727 pairOffUnifs (rest1, rest2))
|
adamc@12
|
728 in
|
adamc@12
|
729 pairOffUnifs (unifs1, unifs2)
|
adamc@223
|
730 (*before eprefaces "Summaries'" [("#1", p_summary env s1),
|
adamc@223
|
731 ("#2", p_summary env s2)]*)
|
adamc@223
|
732 end
|
adamc@223
|
733
|
adamc@223
|
734 and guessFold (env, denv) (c1, c2, gs, ex) =
|
adamc@223
|
735 let
|
adamc@223
|
736 val loc = #2 c1
|
adamc@223
|
737
|
adamc@223
|
738 fun unfold (dom, ran, f, i, r, c) =
|
adamc@223
|
739 let
|
adamc@223
|
740 val nm = cunif (loc, (L'.KName, loc))
|
adamc@223
|
741 val v = cunif (loc, dom)
|
adamc@223
|
742 val rest = cunif (loc, (L'.KRecord dom, loc))
|
adamc@223
|
743 val acc = (L'.CFold (dom, ran), loc)
|
adamc@223
|
744 val acc = (L'.CApp (acc, f), loc)
|
adamc@223
|
745 val acc = (L'.CApp (acc, i), loc)
|
adamc@223
|
746 val acc = (L'.CApp (acc, rest), loc)
|
adamc@223
|
747
|
adamc@223
|
748 val (iS, gs3) = summarizeCon (env, denv) i
|
adamc@223
|
749
|
adamc@223
|
750 val app = (L'.CApp (f, nm), loc)
|
adamc@223
|
751 val app = (L'.CApp (app, v), loc)
|
adamc@223
|
752 val app = (L'.CApp (app, acc), loc)
|
adamc@223
|
753 val (appS, gs4) = summarizeCon (env, denv) app
|
adamc@223
|
754
|
adamc@223
|
755 val (cS, gs5) = summarizeCon (env, denv) c
|
adamc@223
|
756 in
|
adamc@223
|
757 (*prefaces "Summaries" [("iS", p_con_summary iS),
|
adamc@223
|
758 ("appS", p_con_summary appS),
|
adamc@223
|
759 ("cS", p_con_summary cS)];*)
|
adamc@223
|
760
|
adamc@223
|
761 if compatible (iS, appS) then
|
adamc@223
|
762 raise ex
|
adamc@223
|
763 else if compatible (cS, iS) then
|
adamc@223
|
764 let
|
adamc@223
|
765 (*val () = prefaces "Same?" [("i", p_con env i),
|
adamc@223
|
766 ("c", p_con env c)]*)
|
adamc@223
|
767 val gs6 = unifyCons (env, denv) i c
|
adamc@223
|
768 (*val () = TextIO.print "Yes!\n"*)
|
adamc@223
|
769
|
adamc@223
|
770 val gs7 = unifyCons (env, denv) r (L'.CRecord (dom, []), loc)
|
adamc@223
|
771 in
|
adamc@223
|
772 gs @ gs3 @ gs5 @ gs6 @ gs7
|
adamc@223
|
773 end
|
adamc@223
|
774 else if compatible (cS, appS) then
|
adamc@223
|
775 let
|
adamc@223
|
776 (*val () = prefaces "Same?" [("app", p_con env app),
|
adamc@223
|
777 ("c", p_con env c),
|
adamc@223
|
778 ("app'", p_con env (#1 (hnormCon (env, denv) app)))]*)
|
adamc@223
|
779 val gs6 = unifyCons (env, denv) app c
|
adamc@223
|
780 (*val () = TextIO.print "Yes!\n"*)
|
adamc@223
|
781
|
adamc@223
|
782 val singleton = (L'.CRecord (dom, [(nm, v)]), loc)
|
adamc@223
|
783 val concat = (L'.CConcat (singleton, rest), loc)
|
adamc@223
|
784 (*val () = prefaces "Pre-crew" [("r", p_con env r),
|
adamc@223
|
785 ("concat", p_con env concat)]*)
|
adamc@223
|
786 val gs7 = unifyCons (env, denv) r concat
|
adamc@223
|
787 in
|
adamc@223
|
788 (*prefaces "The crew" [("nm", p_con env nm),
|
adamc@223
|
789 ("v", p_con env v),
|
adamc@223
|
790 ("rest", p_con env rest)];*)
|
adamc@223
|
791
|
adamc@223
|
792 gs @ gs3 @ gs4 @ gs5 @ gs6 @ gs7
|
adamc@223
|
793 end
|
adamc@223
|
794 else
|
adamc@223
|
795 raise ex
|
adamc@223
|
796 end
|
adamc@223
|
797 handle _ => raise ex
|
adamc@223
|
798 in
|
adamc@223
|
799 case (#1 c1, #1 c2) of
|
adamc@223
|
800 (L'.CApp ((L'.CApp ((L'.CApp ((L'.CFold (dom, ran), _), f), _), i), _), r), _) =>
|
adamc@223
|
801 unfold (dom, ran, f, i, r, c2)
|
adamc@223
|
802 | (_, L'.CApp ((L'.CApp ((L'.CApp ((L'.CFold (dom, ran), _), f), _), i), _), r)) =>
|
adamc@223
|
803 unfold (dom, ran, f, i, r, c1)
|
adamc@223
|
804 | _ => raise ex
|
adamc@12
|
805 end
|
adamc@12
|
806
|
adamc@86
|
807 and unifyCons' (env, denv) c1 c2 =
|
adamc@326
|
808 case (#1 c1, #1 c2) of
|
adamc@345
|
809 (L'.CDisjoint (_, x1, y1, t1), L'.CDisjoint (_, x2, y2, t2)) =>
|
adamc@205
|
810 let
|
adamc@326
|
811 val gs1 = unifyCons' (env, denv) x1 x2
|
adamc@326
|
812 val gs2 = unifyCons' (env, denv) y1 y2
|
adamc@326
|
813 val (denv', gs3) = D.assert env denv (x1, y1)
|
adamc@326
|
814 val gs4 = unifyCons' (env, denv') t1 t2
|
adamc@205
|
815 in
|
adamc@326
|
816 gs1 @ gs2 @ gs3 @ gs4
|
adamc@205
|
817 end
|
adamc@326
|
818 | _ =>
|
adamc@326
|
819 let
|
adamc@326
|
820 val (c1, gs1) = hnormCon (env, denv) c1
|
adamc@326
|
821 val (c2, gs2) = hnormCon (env, denv) c2
|
adamc@326
|
822 in
|
adamc@326
|
823 let
|
adamc@326
|
824 val gs3 = unifyCons'' (env, denv) c1 c2
|
adamc@326
|
825 in
|
adamc@326
|
826 gs1 @ gs2 @ gs3
|
adamc@326
|
827 end
|
adamc@326
|
828 handle ex => guessFold (env, denv) (c1, c2, gs1 @ gs2, ex)
|
adamc@326
|
829 end
|
adamc@11
|
830
|
adamc@205
|
831 and unifyCons'' (env, denv) (c1All as (c1, loc)) (c2All as (c2, _)) =
|
adamc@10
|
832 let
|
adamc@210
|
833 fun err f = raise CUnify' (f (c1All, c2All))
|
adamc@12
|
834
|
adamc@86
|
835 fun isRecord () = unifyRecordCons (env, denv) (c1All, c2All)
|
adamc@10
|
836 in
|
adamc@92
|
837 (*eprefaces "unifyCons''" [("c1All", p_con env c1All),
|
adamc@92
|
838 ("c2All", p_con env c2All)];*)
|
adamc@92
|
839
|
adamc@10
|
840 case (c1, c2) of
|
adamc@88
|
841 (L'.CUnit, L'.CUnit) => []
|
adamc@88
|
842
|
adamc@88
|
843 | (L'.TFun (d1, r1), L'.TFun (d2, r2)) =>
|
adamc@86
|
844 unifyCons' (env, denv) d1 d2
|
adamc@86
|
845 @ unifyCons' (env, denv) r1 r2
|
adamc@10
|
846 | (L'.TCFun (expl1, x1, d1, r1), L'.TCFun (expl2, _, d2, r2)) =>
|
adamc@10
|
847 if expl1 <> expl2 then
|
adamc@10
|
848 err CExplicitness
|
adamc@10
|
849 else
|
adamc@10
|
850 (unifyKinds d1 d2;
|
adamc@86
|
851 unifyCons' (E.pushCRel env x1 d1, D.enter denv) r1 r2)
|
adamc@86
|
852 | (L'.TRecord r1, L'.TRecord r2) => unifyCons' (env, denv) r1 r2
|
adamc@10
|
853
|
adamc@10
|
854 | (L'.CRel n1, L'.CRel n2) =>
|
adamc@10
|
855 if n1 = n2 then
|
adamc@86
|
856 []
|
adamc@10
|
857 else
|
adamc@10
|
858 err CIncompatible
|
adamc@10
|
859 | (L'.CNamed n1, L'.CNamed n2) =>
|
adamc@10
|
860 if n1 = n2 then
|
adamc@86
|
861 []
|
adamc@10
|
862 else
|
adamc@10
|
863 err CIncompatible
|
adamc@10
|
864
|
adamc@10
|
865 | (L'.CApp (d1, r1), L'.CApp (d2, r2)) =>
|
adamc@86
|
866 (unifyCons' (env, denv) d1 d2;
|
adamc@86
|
867 unifyCons' (env, denv) r1 r2)
|
adamc@10
|
868 | (L'.CAbs (x1, k1, c1), L'.CAbs (_, k2, c2)) =>
|
adamc@10
|
869 (unifyKinds k1 k2;
|
adamc@86
|
870 unifyCons' (E.pushCRel env x1 k1, D.enter denv) c1 c2)
|
adamc@10
|
871
|
adamc@10
|
872 | (L'.CName n1, L'.CName n2) =>
|
adamc@10
|
873 if n1 = n2 then
|
adamc@86
|
874 []
|
adamc@10
|
875 else
|
adamc@10
|
876 err CIncompatible
|
adamc@10
|
877
|
adamc@34
|
878 | (L'.CModProj (n1, ms1, x1), L'.CModProj (n2, ms2, x2)) =>
|
adamc@34
|
879 if n1 = n2 andalso ms1 = ms2 andalso x1 = x2 then
|
adamc@86
|
880 []
|
adamc@34
|
881 else
|
adamc@34
|
882 err CIncompatible
|
adamc@34
|
883
|
adamc@207
|
884 | (L'.CTuple cs1, L'.CTuple cs2) =>
|
adamc@207
|
885 ((ListPair.foldlEq (fn (c1, c2, gs) =>
|
adamc@207
|
886 let
|
adamc@207
|
887 val gs' = unifyCons' (env, denv) c1 c2
|
adamc@207
|
888 in
|
adamc@207
|
889 gs' @ gs
|
adamc@207
|
890 end) [] (cs1, cs2))
|
adamc@207
|
891 handle ListPair.UnequalLengths => err CIncompatible)
|
adamc@207
|
892 | (L'.CProj (c1, n1), L'.CProj (c2, n2)) =>
|
adamc@207
|
893 if n1 = n2 then
|
adamc@207
|
894 unifyCons' (env, denv) c1 c2
|
adamc@207
|
895 else
|
adamc@207
|
896 err CIncompatible
|
adamc@207
|
897
|
adamc@86
|
898 | (L'.CError, _) => []
|
adamc@86
|
899 | (_, L'.CError) => []
|
adamc@10
|
900
|
adamc@92
|
901 | (L'.CRecord _, _) => isRecord ()
|
adamc@92
|
902 | (_, L'.CRecord _) => isRecord ()
|
adamc@92
|
903 | (L'.CConcat _, _) => isRecord ()
|
adamc@92
|
904 | (_, L'.CConcat _) => isRecord ()
|
adamc@10
|
905
|
adamc@76
|
906 | (L'.CUnif (_, k1, _, r1), L'.CUnif (_, k2, _, r2)) =>
|
adamc@10
|
907 if r1 = r2 then
|
adamc@86
|
908 []
|
adamc@10
|
909 else
|
adamc@10
|
910 (unifyKinds k1 k2;
|
adamc@86
|
911 r1 := SOME c2All;
|
adamc@86
|
912 [])
|
adamc@10
|
913
|
adamc@76
|
914 | (L'.CUnif (_, _, _, r), _) =>
|
adamc@10
|
915 if occursCon r c2All then
|
adamc@10
|
916 err COccursCheckFailed
|
adamc@10
|
917 else
|
adamc@86
|
918 (r := SOME c2All;
|
adamc@86
|
919 [])
|
adamc@76
|
920 | (_, L'.CUnif (_, _, _, r)) =>
|
adamc@10
|
921 if occursCon r c1All then
|
adamc@10
|
922 err COccursCheckFailed
|
adamc@10
|
923 else
|
adamc@86
|
924 (r := SOME c1All;
|
adamc@86
|
925 [])
|
adamc@10
|
926
|
adamc@71
|
927 | (L'.CFold (dom1, ran1), L'.CFold (dom2, ran2)) =>
|
adamc@71
|
928 (unifyKinds dom1 dom2;
|
adamc@86
|
929 unifyKinds ran1 ran2;
|
adamc@86
|
930 [])
|
adamc@71
|
931
|
adamc@10
|
932 | _ => err CIncompatible
|
adamc@10
|
933 end
|
adamc@10
|
934
|
adamc@86
|
935 and unifyCons (env, denv) c1 c2 =
|
adamc@86
|
936 unifyCons' (env, denv) c1 c2
|
adamc@10
|
937 handle CUnify' err => raise CUnify (c1, c2, err)
|
adamc@10
|
938 | KUnify args => raise CUnify (c1, c2, CKind args)
|
adamc@210
|
939
|
adamc@86
|
940 fun checkCon (env, denv) e c1 c2 =
|
adamc@86
|
941 unifyCons (env, denv) c1 c2
|
adamc@10
|
942 handle CUnify (c1, c2, err) =>
|
adamc@86
|
943 (expError env (Unify (e, c1, c2, err));
|
adamc@86
|
944 [])
|
adamc@10
|
945
|
adamc@171
|
946 fun checkPatCon (env, denv) p c1 c2 =
|
adamc@171
|
947 unifyCons (env, denv) c1 c2
|
adamc@171
|
948 handle CUnify (c1, c2, err) =>
|
adamc@171
|
949 (expError env (PatUnify (p, c1, c2, err));
|
adamc@171
|
950 [])
|
adamc@171
|
951
|
adamc@14
|
952 fun primType env p =
|
adamc@56
|
953 case p of
|
adamc@56
|
954 P.Int _ => !int
|
adamc@56
|
955 | P.Float _ => !float
|
adamc@56
|
956 | P.String _ => !string
|
adamc@14
|
957
|
adamc@71
|
958 fun recCons (k, nm, v, rest, loc) =
|
adamc@71
|
959 (L'.CConcat ((L'.CRecord (k, [(nm, v)]), loc),
|
adamc@71
|
960 rest), loc)
|
adamc@71
|
961
|
adamc@71
|
962 fun foldType (dom, loc) =
|
adamc@71
|
963 (L'.TCFun (L'.Explicit, "ran", (L'.KArrow ((L'.KRecord dom, loc), (L'.KType, loc)), loc),
|
adamc@71
|
964 (L'.TFun ((L'.TCFun (L'.Explicit, "nm", (L'.KName, loc),
|
adamc@71
|
965 (L'.TCFun (L'.Explicit, "v", dom,
|
adamc@71
|
966 (L'.TCFun (L'.Explicit, "rest", (L'.KRecord dom, loc),
|
adamc@71
|
967 (L'.TFun ((L'.CApp ((L'.CRel 3, loc), (L'.CRel 0, loc)), loc),
|
adamc@345
|
968 (L'.CDisjoint (L'.Instantiate,
|
adamc@334
|
969 (L'.CRecord
|
adamc@326
|
970 ((L'.KUnit, loc),
|
adamc@326
|
971 [((L'.CRel 2, loc),
|
adamc@326
|
972 (L'.CUnit, loc))]), loc),
|
adamc@326
|
973 (L'.CRel 0, loc),
|
adamc@326
|
974 (L'.CApp ((L'.CRel 3, loc),
|
adamc@326
|
975 recCons (dom,
|
adamc@326
|
976 (L'.CRel 2, loc),
|
adamc@326
|
977 (L'.CRel 1, loc),
|
adamc@326
|
978 (L'.CRel 0, loc),
|
adamc@326
|
979 loc)), loc)),
|
adamc@326
|
980 loc)), loc)),
|
adamc@71
|
981 loc)), loc)), loc),
|
adamc@71
|
982 (L'.TFun ((L'.CApp ((L'.CRel 0, loc), (L'.CRecord (dom, []), loc)), loc),
|
adamc@71
|
983 (L'.TCFun (L'.Explicit, "r", (L'.KRecord dom, loc),
|
adamc@71
|
984 (L'.CApp ((L'.CRel 1, loc), (L'.CRel 0, loc)), loc)), loc)),
|
adamc@71
|
985 loc)), loc)), loc)
|
adamc@71
|
986
|
adamc@228
|
987 datatype constraint =
|
adamc@228
|
988 Disjoint of D.goal
|
adamc@228
|
989 | TypeClass of E.env * L'.con * L'.exp option ref * ErrorMsg.span
|
adamc@228
|
990
|
adamc@228
|
991 val enD = map Disjoint
|
adamc@228
|
992
|
adamc@86
|
993 fun elabHead (env, denv) (e as (_, loc)) t =
|
adamc@15
|
994 let
|
adamc@15
|
995 fun unravel (t, e) =
|
adamc@86
|
996 let
|
adamc@86
|
997 val (t, gs) = hnormCon (env, denv) t
|
adamc@86
|
998 in
|
adamc@86
|
999 case t of
|
adamc@86
|
1000 (L'.TCFun (L'.Implicit, x, k, t'), _) =>
|
adamc@86
|
1001 let
|
adamc@86
|
1002 val u = cunif (loc, k)
|
adamc@86
|
1003
|
adamc@339
|
1004 val t'' = subConInCon (0, u) t'
|
adamc@339
|
1005 val (e, t, gs') = unravel (t'', (L'.ECApp (e, u), loc))
|
adamc@86
|
1006 in
|
adamc@339
|
1007 (*prefaces "Unravel" [("t'", p_con env t'),
|
adamc@339
|
1008 ("t''", p_con env t'')];*)
|
adamc@228
|
1009 (e, t, enD gs @ gs')
|
adamc@86
|
1010 end
|
adamc@228
|
1011 | _ => (e, t, enD gs)
|
adamc@86
|
1012 end
|
adamc@15
|
1013 in
|
adamc@15
|
1014 unravel (t, e)
|
adamc@15
|
1015 end
|
adamc@15
|
1016
|
adamc@174
|
1017 fun elabPat (pAll as (p, loc), (env, denv, bound)) =
|
adamc@171
|
1018 let
|
adamc@171
|
1019 val perror = (L'.PWild, loc)
|
adamc@171
|
1020 val terror = (L'.CError, loc)
|
adamc@171
|
1021 val pterror = (perror, terror)
|
adamc@171
|
1022 val rerror = (pterror, (env, bound))
|
adamc@171
|
1023
|
adamc@191
|
1024 fun pcon (pc, po, xs, to, dn, dk) =
|
adamc@188
|
1025 case (po, to) of
|
adamc@188
|
1026 (NONE, SOME _) => (expError env (PatHasNoArg loc);
|
adamc@188
|
1027 rerror)
|
adamc@188
|
1028 | (SOME _, NONE) => (expError env (PatHasArg loc);
|
adamc@188
|
1029 rerror)
|
adamc@191
|
1030 | (NONE, NONE) =>
|
adamc@191
|
1031 let
|
adamc@191
|
1032 val k = (L'.KType, loc)
|
adamc@191
|
1033 val unifs = map (fn _ => cunif (loc, k)) xs
|
adamc@191
|
1034 val dn = foldl (fn (u, dn) => (L'.CApp (dn, u), loc)) dn unifs
|
adamc@191
|
1035 in
|
adamc@191
|
1036 (((L'.PCon (dk, pc, unifs, NONE), loc), dn),
|
adamc@191
|
1037 (env, bound))
|
adamc@191
|
1038 end
|
adamc@188
|
1039 | (SOME p, SOME t) =>
|
adamc@188
|
1040 let
|
adamc@188
|
1041 val ((p', pt), (env, bound)) = elabPat (p, (env, denv, bound))
|
adamc@191
|
1042
|
adamc@191
|
1043 val k = (L'.KType, loc)
|
adamc@191
|
1044 val unifs = map (fn _ => cunif (loc, k)) xs
|
adamc@194
|
1045 val nxs = length unifs - 1
|
adamc@194
|
1046 val t = ListUtil.foldli (fn (i, u, t) => subConInCon (nxs - i, u) t) t unifs
|
adamc@191
|
1047 val dn = foldl (fn (u, dn) => (L'.CApp (dn, u), loc)) dn unifs
|
adamc@188
|
1048 in
|
adamc@191
|
1049 ignore (checkPatCon (env, denv) p' pt t);
|
adamc@191
|
1050 (((L'.PCon (dk, pc, unifs, SOME p'), loc), dn),
|
adamc@188
|
1051 (env, bound))
|
adamc@188
|
1052 end
|
adamc@171
|
1053 in
|
adamc@171
|
1054 case p of
|
adamc@171
|
1055 L.PWild => (((L'.PWild, loc), cunif (loc, (L'.KType, loc))),
|
adamc@171
|
1056 (env, bound))
|
adamc@171
|
1057 | L.PVar x =>
|
adamc@171
|
1058 let
|
adamc@171
|
1059 val t = if SS.member (bound, x) then
|
adamc@171
|
1060 (expError env (DuplicatePatternVariable (loc, x));
|
adamc@171
|
1061 terror)
|
adamc@171
|
1062 else
|
adamc@171
|
1063 cunif (loc, (L'.KType, loc))
|
adamc@171
|
1064 in
|
adamc@182
|
1065 (((L'.PVar (x, t), loc), t),
|
adamc@171
|
1066 (E.pushERel env x t, SS.add (bound, x)))
|
adamc@171
|
1067 end
|
adamc@173
|
1068 | L.PPrim p => (((L'.PPrim p, loc), primType env p),
|
adamc@173
|
1069 (env, bound))
|
adamc@171
|
1070 | L.PCon ([], x, po) =>
|
adamc@171
|
1071 (case E.lookupConstructor env x of
|
adamc@174
|
1072 NONE => (expError env (UnboundConstructor (loc, [], x));
|
adamc@171
|
1073 rerror)
|
adamc@191
|
1074 | SOME (dk, n, xs, to, dn) => pcon (L'.PConVar n, po, xs, to, (L'.CNamed dn, loc), dk))
|
adamc@174
|
1075 | L.PCon (m1 :: ms, x, po) =>
|
adamc@174
|
1076 (case E.lookupStr env m1 of
|
adamc@174
|
1077 NONE => (expError env (UnboundStrInExp (loc, m1));
|
adamc@174
|
1078 rerror)
|
adamc@174
|
1079 | SOME (n, sgn) =>
|
adamc@174
|
1080 let
|
adamc@174
|
1081 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
|
adamc@174
|
1082 case E.projectStr env {sgn = sgn, str = str, field = m} of
|
adamc@182
|
1083 NONE => raise Fail "elabPat: Unknown substructure"
|
adamc@174
|
1084 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
|
adamc@174
|
1085 ((L'.StrVar n, loc), sgn) ms
|
adamc@174
|
1086 in
|
adamc@174
|
1087 case E.projectConstructor env {str = str, sgn = sgn, field = x} of
|
adamc@174
|
1088 NONE => (expError env (UnboundConstructor (loc, m1 :: ms, x));
|
adamc@174
|
1089 rerror)
|
adamc@191
|
1090 | SOME (dk, _, xs, to, dn) => pcon (L'.PConProj (n, ms, x), po, xs, to, dn, dk)
|
adamc@174
|
1091 end)
|
adamc@174
|
1092
|
adamc@175
|
1093 | L.PRecord (xps, flex) =>
|
adamc@175
|
1094 let
|
adamc@175
|
1095 val (xpts, (env, bound, _)) =
|
adamc@175
|
1096 ListUtil.foldlMap (fn ((x, p), (env, bound, fbound)) =>
|
adamc@175
|
1097 let
|
adamc@175
|
1098 val ((p', t), (env, bound)) = elabPat (p, (env, denv, bound))
|
adamc@175
|
1099 in
|
adamc@175
|
1100 if SS.member (fbound, x) then
|
adamc@175
|
1101 expError env (DuplicatePatField (loc, x))
|
adamc@175
|
1102 else
|
adamc@175
|
1103 ();
|
adamc@175
|
1104 ((x, p', t), (env, bound, SS.add (fbound, x)))
|
adamc@175
|
1105 end)
|
adamc@175
|
1106 (env, bound, SS.empty) xps
|
adamc@175
|
1107
|
adamc@175
|
1108 val k = (L'.KType, loc)
|
adamc@175
|
1109 val c = (L'.CRecord (k, map (fn (x, _, t) => ((L'.CName x, loc), t)) xpts), loc)
|
adamc@176
|
1110 val c =
|
adamc@175
|
1111 if flex then
|
adamc@176
|
1112 (L'.CConcat (c, cunif (loc, (L'.KRecord k, loc))), loc)
|
adamc@175
|
1113 else
|
adamc@176
|
1114 c
|
adamc@175
|
1115 in
|
adamc@182
|
1116 (((L'.PRecord xpts, loc),
|
adamc@175
|
1117 (L'.TRecord c, loc)),
|
adamc@175
|
1118 (env, bound))
|
adamc@175
|
1119 end
|
adamc@175
|
1120
|
adamc@171
|
1121 end
|
adamc@171
|
1122
|
adamc@172
|
1123 datatype coverage =
|
adamc@172
|
1124 Wild
|
adamc@173
|
1125 | None
|
adamc@172
|
1126 | Datatype of coverage IM.map
|
adamc@175
|
1127 | Record of coverage SM.map list
|
adamc@172
|
1128
|
adamc@243
|
1129 fun c2s c =
|
adamc@243
|
1130 case c of
|
adamc@243
|
1131 Wild => "Wild"
|
adamc@243
|
1132 | None => "None"
|
adamc@243
|
1133 | Datatype _ => "Datatype"
|
adamc@243
|
1134 | Record _ => "Record"
|
adamc@243
|
1135
|
adamc@172
|
1136 fun exhaustive (env, denv, t, ps) =
|
adamc@172
|
1137 let
|
adamc@172
|
1138 fun pcCoverage pc =
|
adamc@172
|
1139 case pc of
|
adamc@172
|
1140 L'.PConVar n => n
|
adamc@174
|
1141 | L'.PConProj (m1, ms, x) =>
|
adamc@174
|
1142 let
|
adamc@174
|
1143 val (str, sgn) = E.chaseMpath env (m1, ms)
|
adamc@174
|
1144 in
|
adamc@174
|
1145 case E.projectConstructor env {str = str, sgn = sgn, field = x} of
|
adamc@174
|
1146 NONE => raise Fail "exhaustive: Can't project constructor"
|
adamc@191
|
1147 | SOME (_, n, _, _, _) => n
|
adamc@174
|
1148 end
|
adamc@172
|
1149
|
adamc@172
|
1150 fun coverage (p, _) =
|
adamc@172
|
1151 case p of
|
adamc@172
|
1152 L'.PWild => Wild
|
adamc@172
|
1153 | L'.PVar _ => Wild
|
adamc@173
|
1154 | L'.PPrim _ => None
|
adamc@191
|
1155 | L'.PCon (_, pc, _, NONE) => Datatype (IM.insert (IM.empty, pcCoverage pc, Wild))
|
adamc@191
|
1156 | L'.PCon (_, pc, _, SOME p) => Datatype (IM.insert (IM.empty, pcCoverage pc, coverage p))
|
adamc@182
|
1157 | L'.PRecord xps => Record [foldl (fn ((x, p, _), fmap) =>
|
adamc@182
|
1158 SM.insert (fmap, x, coverage p)) SM.empty xps]
|
adamc@176
|
1159
|
adamc@172
|
1160 fun merge (c1, c2) =
|
adamc@172
|
1161 case (c1, c2) of
|
adamc@173
|
1162 (None, _) => c2
|
adamc@173
|
1163 | (_, None) => c1
|
adamc@173
|
1164
|
adamc@173
|
1165 | (Wild, _) => Wild
|
adamc@172
|
1166 | (_, Wild) => Wild
|
adamc@172
|
1167
|
adamc@172
|
1168 | (Datatype cm1, Datatype cm2) => Datatype (IM.unionWith merge (cm1, cm2))
|
adamc@172
|
1169
|
adamc@175
|
1170 | (Record fm1, Record fm2) => Record (fm1 @ fm2)
|
adamc@175
|
1171
|
adamc@175
|
1172 | _ => None
|
adamc@175
|
1173
|
adamc@172
|
1174 fun combinedCoverage ps =
|
adamc@172
|
1175 case ps of
|
adamc@172
|
1176 [] => raise Fail "Empty pattern list for coverage checking"
|
adamc@172
|
1177 | [p] => coverage p
|
adamc@172
|
1178 | p :: ps => merge (coverage p, combinedCoverage ps)
|
adamc@172
|
1179
|
adamc@175
|
1180 fun enumerateCases t =
|
adamc@175
|
1181 let
|
adamc@175
|
1182 fun dtype cons =
|
adamc@175
|
1183 ListUtil.mapConcat (fn (_, n, to) =>
|
adamc@175
|
1184 case to of
|
adamc@175
|
1185 NONE => [Datatype (IM.insert (IM.empty, n, Wild))]
|
adamc@175
|
1186 | SOME t => map (fn c => Datatype (IM.insert (IM.empty, n, c)))
|
adamc@175
|
1187 (enumerateCases t)) cons
|
adamc@175
|
1188 in
|
adamc@175
|
1189 case #1 (#1 (hnormCon (env, denv) t)) of
|
adamc@175
|
1190 L'.CNamed n =>
|
adamc@175
|
1191 (let
|
adamc@175
|
1192 val dt = E.lookupDatatype env n
|
adamc@175
|
1193 val cons = E.constructors dt
|
adamc@175
|
1194 in
|
adamc@175
|
1195 dtype cons
|
adamc@175
|
1196 end handle E.UnboundNamed _ => [Wild])
|
adamc@175
|
1197 | L'.TRecord c =>
|
adamc@175
|
1198 (case #1 (#1 (hnormCon (env, denv) c)) of
|
adamc@175
|
1199 L'.CRecord (_, xts) =>
|
adamc@175
|
1200 let
|
adamc@175
|
1201 val xts = map (fn (x, t) => (#1 (hnormCon (env, denv) x), t)) xts
|
adamc@175
|
1202
|
adamc@175
|
1203 fun exponentiate fs =
|
adamc@175
|
1204 case fs of
|
adamc@175
|
1205 [] => [SM.empty]
|
adamc@175
|
1206 | ((L'.CName x, _), t) :: rest =>
|
adamc@175
|
1207 let
|
adamc@175
|
1208 val this = enumerateCases t
|
adamc@175
|
1209 val rest = exponentiate rest
|
adamc@175
|
1210 in
|
adamc@175
|
1211 ListUtil.mapConcat (fn fmap =>
|
adamc@175
|
1212 map (fn c => SM.insert (fmap, x, c)) this) rest
|
adamc@175
|
1213 end
|
adamc@175
|
1214 | _ => raise Fail "exponentiate: Not CName"
|
adamc@175
|
1215 in
|
adamc@175
|
1216 if List.exists (fn ((L'.CName _, _), _) => false
|
adamc@175
|
1217 | (c, _) => true) xts then
|
adamc@175
|
1218 [Wild]
|
adamc@175
|
1219 else
|
adamc@175
|
1220 map (fn ls => Record [ls]) (exponentiate xts)
|
adamc@175
|
1221 end
|
adamc@175
|
1222 | _ => [Wild])
|
adamc@175
|
1223 | _ => [Wild]
|
adamc@175
|
1224 end
|
adamc@175
|
1225
|
adamc@175
|
1226 fun coverageImp (c1, c2) =
|
adamc@243
|
1227 let
|
adamc@243
|
1228 val r =
|
adamc@243
|
1229 case (c1, c2) of
|
adamc@243
|
1230 (Wild, _) => true
|
adamc@243
|
1231
|
adamc@243
|
1232 | (Datatype cmap1, Datatype cmap2) =>
|
adamc@243
|
1233 List.all (fn (n, c2) =>
|
adamc@243
|
1234 case IM.find (cmap1, n) of
|
adamc@243
|
1235 NONE => false
|
adamc@243
|
1236 | SOME c1 => coverageImp (c1, c2)) (IM.listItemsi cmap2)
|
adamc@243
|
1237 | (Datatype cmap1, Wild) =>
|
adamc@243
|
1238 List.all (fn (n, c1) => coverageImp (c1, Wild)) (IM.listItemsi cmap1)
|
adamc@243
|
1239
|
adamc@243
|
1240 | (Record fmaps1, Record fmaps2) =>
|
adamc@243
|
1241 List.all (fn fmap2 =>
|
adamc@243
|
1242 List.exists (fn fmap1 =>
|
adamc@243
|
1243 List.all (fn (x, c2) =>
|
adamc@243
|
1244 case SM.find (fmap1, x) of
|
adamc@243
|
1245 NONE => true
|
adamc@243
|
1246 | SOME c1 => coverageImp (c1, c2))
|
adamc@243
|
1247 (SM.listItemsi fmap2))
|
adamc@243
|
1248 fmaps1) fmaps2
|
adamc@243
|
1249
|
adamc@243
|
1250 | (Record fmaps1, Wild) =>
|
adamc@243
|
1251 List.exists (fn fmap1 =>
|
adamc@243
|
1252 List.all (fn (x, c1) => coverageImp (c1, Wild))
|
adamc@243
|
1253 (SM.listItemsi fmap1)) fmaps1
|
adamc@243
|
1254
|
adamc@243
|
1255 | _ => false
|
adamc@243
|
1256 in
|
adamc@243
|
1257 (*TextIO.print ("coverageImp(" ^ c2s c1 ^ ", " ^ c2s c2 ^ ") = " ^ Bool.toString r ^ "\n");*)
|
adamc@243
|
1258 r
|
adamc@243
|
1259 end
|
adamc@175
|
1260
|
adamc@172
|
1261 fun isTotal (c, t) =
|
adamc@172
|
1262 case c of
|
adamc@173
|
1263 None => (false, [])
|
adamc@173
|
1264 | Wild => (true, [])
|
adamc@172
|
1265 | Datatype cm =>
|
adamc@172
|
1266 let
|
adamc@172
|
1267 val ((t, _), gs) = hnormCon (env, denv) t
|
adamc@174
|
1268
|
adamc@174
|
1269 fun dtype cons =
|
adamc@174
|
1270 foldl (fn ((_, n, to), (total, gs)) =>
|
adamc@174
|
1271 case IM.find (cm, n) of
|
adamc@174
|
1272 NONE => (false, gs)
|
adamc@174
|
1273 | SOME c' =>
|
adamc@174
|
1274 case to of
|
adamc@174
|
1275 NONE => (total, gs)
|
adamc@174
|
1276 | SOME t' =>
|
adamc@174
|
1277 let
|
adamc@174
|
1278 val (total, gs') = isTotal (c', t')
|
adamc@174
|
1279 in
|
adamc@174
|
1280 (total, gs' @ gs)
|
adamc@174
|
1281 end)
|
adamc@174
|
1282 (true, gs) cons
|
adamc@191
|
1283
|
adamc@191
|
1284 fun unapp t =
|
adamc@191
|
1285 case t of
|
adamc@191
|
1286 L'.CApp ((t, _), _) => unapp t
|
adamc@191
|
1287 | _ => t
|
adamc@172
|
1288 in
|
adamc@191
|
1289 case unapp t of
|
adamc@172
|
1290 L'.CNamed n =>
|
adamc@172
|
1291 let
|
adamc@172
|
1292 val dt = E.lookupDatatype env n
|
adamc@172
|
1293 val cons = E.constructors dt
|
adamc@172
|
1294 in
|
adamc@174
|
1295 dtype cons
|
adamc@174
|
1296 end
|
adamc@174
|
1297 | L'.CModProj (m1, ms, x) =>
|
adamc@174
|
1298 let
|
adamc@174
|
1299 val (str, sgn) = E.chaseMpath env (m1, ms)
|
adamc@174
|
1300 in
|
adamc@174
|
1301 case E.projectDatatype env {str = str, sgn = sgn, field = x} of
|
adamc@174
|
1302 NONE => raise Fail "isTotal: Can't project datatype"
|
adamc@191
|
1303 | SOME (_, cons) => dtype cons
|
adamc@172
|
1304 end
|
adamc@172
|
1305 | L'.CError => (true, gs)
|
adamc@341
|
1306 | c =>
|
adamc@341
|
1307 (prefaces "Not a datatype" [("c", p_con env (c, ErrorMsg.dummySpan))];
|
adamc@341
|
1308 raise Fail "isTotal: Not a datatype")
|
adamc@172
|
1309 end
|
adamc@175
|
1310 | Record _ => (List.all (fn c2 => coverageImp (c, c2)) (enumerateCases t), [])
|
adamc@172
|
1311 in
|
adamc@172
|
1312 isTotal (combinedCoverage ps, t)
|
adamc@172
|
1313 end
|
adamc@172
|
1314
|
adamc@217
|
1315 fun unmodCon env (c, loc) =
|
adamc@217
|
1316 case c of
|
adamc@217
|
1317 L'.CNamed n =>
|
adamc@217
|
1318 (case E.lookupCNamed env n of
|
adamc@217
|
1319 (_, _, SOME (c as (L'.CModProj _, _))) => unmodCon env c
|
adamc@217
|
1320 | _ => (c, loc))
|
adamc@217
|
1321 | L'.CModProj (m1, ms, x) =>
|
adamc@217
|
1322 let
|
adamc@217
|
1323 val (str, sgn) = E.chaseMpath env (m1, ms)
|
adamc@217
|
1324 in
|
adamc@217
|
1325 case E.projectCon env {str = str, sgn = sgn, field = x} of
|
adamc@217
|
1326 NONE => raise Fail "unmodCon: Can't projectCon"
|
adamc@217
|
1327 | SOME (_, SOME (c as (L'.CModProj _, _))) => unmodCon env c
|
adamc@217
|
1328 | _ => (c, loc)
|
adamc@217
|
1329 end
|
adamc@217
|
1330 | _ => (c, loc)
|
adamc@217
|
1331
|
adamc@217
|
1332 fun normClassConstraint envs (c, loc) =
|
adamc@217
|
1333 case c of
|
adamc@217
|
1334 L'.CApp (f, x) =>
|
adamc@217
|
1335 let
|
adamc@217
|
1336 val f = unmodCon (#1 envs) f
|
adamc@217
|
1337 val (x, gs) = hnormCon envs x
|
adamc@217
|
1338 in
|
adamc@217
|
1339 ((L'.CApp (f, x), loc), gs)
|
adamc@217
|
1340 end
|
adamc@217
|
1341 | _ => ((c, loc), [])
|
adamc@216
|
1342
|
adamc@92
|
1343 fun elabExp (env, denv) (eAll as (e, loc)) =
|
adamc@91
|
1344 let
|
adamc@280
|
1345 (*val () = eprefaces "elabExp" [("eAll", SourcePrint.p_exp eAll)];*)
|
adamc@280
|
1346
|
adamc@280
|
1347 val r = case e of
|
adamc@91
|
1348 L.EAnnot (e, t) =>
|
adamc@91
|
1349 let
|
adamc@91
|
1350 val (e', et, gs1) = elabExp (env, denv) e
|
adamc@91
|
1351 val (t', _, gs2) = elabCon (env, denv) t
|
adamc@91
|
1352 val gs3 = checkCon (env, denv) e' et t'
|
adamc@91
|
1353 in
|
adamc@228
|
1354 (e', t', gs1 @ enD gs2 @ enD gs3)
|
adamc@91
|
1355 end
|
adamc@34
|
1356
|
adamc@91
|
1357 | L.EPrim p => ((L'.EPrim p, loc), primType env p, [])
|
adamc@91
|
1358 | L.EVar ([], s) =>
|
adamc@91
|
1359 (case E.lookupE env s of
|
adamc@91
|
1360 E.NotBound =>
|
adamc@91
|
1361 (expError env (UnboundExp (loc, s));
|
adamc@91
|
1362 (eerror, cerror, []))
|
adamc@91
|
1363 | E.Rel (n, t) => ((L'.ERel n, loc), t, [])
|
adamc@191
|
1364 | E.Named (n, t) =>
|
adamc@191
|
1365 if Char.isUpper (String.sub (s, 0)) then
|
adamc@191
|
1366 elabHead (env, denv) (L'.ENamed n, loc) t
|
adamc@191
|
1367 else
|
adamc@191
|
1368 ((L'.ENamed n, loc), t, []))
|
adamc@91
|
1369 | L.EVar (m1 :: ms, s) =>
|
adamc@91
|
1370 (case E.lookupStr env m1 of
|
adamc@91
|
1371 NONE => (expError env (UnboundStrInExp (loc, m1));
|
adamc@91
|
1372 (eerror, cerror, []))
|
adamc@91
|
1373 | SOME (n, sgn) =>
|
adamc@91
|
1374 let
|
adamc@91
|
1375 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
|
adamc@91
|
1376 case E.projectStr env {sgn = sgn, str = str, field = m} of
|
adamc@91
|
1377 NONE => (conError env (UnboundStrInCon (loc, m));
|
adamc@91
|
1378 (strerror, sgnerror))
|
adamc@91
|
1379 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
|
adamc@91
|
1380 ((L'.StrVar n, loc), sgn) ms
|
adamc@10
|
1381
|
adamc@91
|
1382 val t = case E.projectVal env {sgn = sgn, str = str, field = s} of
|
adamc@91
|
1383 NONE => (expError env (UnboundExp (loc, s));
|
adamc@91
|
1384 cerror)
|
adamc@91
|
1385 | SOME t => t
|
adamc@91
|
1386 in
|
adamc@91
|
1387 ((L'.EModProj (n, ms, s), loc), t, [])
|
adamc@91
|
1388 end)
|
adamc@86
|
1389
|
adamc@211
|
1390 | L.EApp (e1, (L.EWild, _)) =>
|
adamc@210
|
1391 let
|
adamc@210
|
1392 val (e1', t1, gs1) = elabExp (env, denv) e1
|
adamc@210
|
1393 val (e1', t1, gs2) = elabHead (env, denv) e1' t1
|
adamc@210
|
1394 val (t1, gs3) = hnormCon (env, denv) t1
|
adamc@210
|
1395 in
|
adamc@210
|
1396 case t1 of
|
adamc@211
|
1397 (L'.TFun (dom, ran), _) =>
|
adamc@216
|
1398 let
|
adamc@216
|
1399 val (dom, gs4) = normClassConstraint (env, denv) dom
|
adamc@216
|
1400 in
|
adamc@216
|
1401 case E.resolveClass env dom of
|
adamc@228
|
1402 NONE =>
|
adamc@228
|
1403 let
|
adamc@228
|
1404 val r = ref NONE
|
adamc@228
|
1405 in
|
adamc@233
|
1406 ((L'.EApp (e1', (L'.EUnif r, loc)), loc),
|
adamc@233
|
1407 ran, [TypeClass (env, dom, r, loc)])
|
adamc@228
|
1408 end
|
adamc@228
|
1409 | SOME pf => ((L'.EApp (e1', pf), loc), ran, gs1 @ gs2 @ enD gs3 @ enD gs4)
|
adamc@216
|
1410 end
|
adamc@220
|
1411 | _ => (expError env (OutOfContext (loc, SOME (e1', t1)));
|
adamc@211
|
1412 (eerror, cerror, []))
|
adamc@210
|
1413 end
|
adamc@220
|
1414 | L.EWild => (expError env (OutOfContext (loc, NONE));
|
adamc@211
|
1415 (eerror, cerror, []))
|
adamc@210
|
1416
|
adamc@91
|
1417 | L.EApp (e1, e2) =>
|
adamc@91
|
1418 let
|
adamc@91
|
1419 val (e1', t1, gs1) = elabExp (env, denv) e1
|
adamc@91
|
1420 val (e1', t1, gs2) = elabHead (env, denv) e1' t1
|
adamc@91
|
1421 val (e2', t2, gs3) = elabExp (env, denv) e2
|
adamc@71
|
1422
|
adamc@91
|
1423 val dom = cunif (loc, ktype)
|
adamc@91
|
1424 val ran = cunif (loc, ktype)
|
adamc@91
|
1425 val t = (L'.TFun (dom, ran), dummy)
|
adamc@91
|
1426
|
adamc@91
|
1427 val gs4 = checkCon (env, denv) e1' t1 t
|
adamc@91
|
1428 val gs5 = checkCon (env, denv) e2' t2 dom
|
adamc@205
|
1429
|
adamc@228
|
1430 val gs = gs1 @ gs2 @ gs3 @ enD gs4 @ enD gs5
|
adamc@91
|
1431 in
|
adamc@205
|
1432 ((L'.EApp (e1', e2'), loc), ran, gs)
|
adamc@91
|
1433 end
|
adamc@91
|
1434 | L.EAbs (x, to, e) =>
|
adamc@91
|
1435 let
|
adamc@91
|
1436 val (t', gs1) = case to of
|
adamc@91
|
1437 NONE => (cunif (loc, ktype), [])
|
adamc@91
|
1438 | SOME t =>
|
adamc@91
|
1439 let
|
adamc@91
|
1440 val (t', tk, gs) = elabCon (env, denv) t
|
adamc@91
|
1441 in
|
adamc@91
|
1442 checkKind env t' tk ktype;
|
adamc@91
|
1443 (t', gs)
|
adamc@91
|
1444 end
|
adamc@256
|
1445 val (dom, gs2) = normClassConstraint (env, denv) t'
|
adamc@256
|
1446 val (e', et, gs3) = elabExp (E.pushERel env x dom, denv) e
|
adamc@91
|
1447 in
|
adamc@91
|
1448 ((L'.EAbs (x, t', et, e'), loc),
|
adamc@91
|
1449 (L'.TFun (t', et), loc),
|
adamc@256
|
1450 enD gs1 @ enD gs2 @ gs3)
|
adamc@91
|
1451 end
|
adamc@91
|
1452 | L.ECApp (e, c) =>
|
adamc@91
|
1453 let
|
adamc@91
|
1454 val (e', et, gs1) = elabExp (env, denv) e
|
adamc@328
|
1455 val oldEt = et
|
adamc@91
|
1456 val (e', et, gs2) = elabHead (env, denv) e' et
|
adamc@91
|
1457 val (c', ck, gs3) = elabCon (env, denv) c
|
adamc@91
|
1458 val ((et', _), gs4) = hnormCon (env, denv) et
|
adamc@91
|
1459 in
|
adamc@91
|
1460 case et' of
|
adamc@91
|
1461 L'.CError => (eerror, cerror, [])
|
adamc@328
|
1462 | L'.TCFun (_, x, k, eb) =>
|
adamc@91
|
1463 let
|
adamc@91
|
1464 val () = checkKind env c' ck k
|
adamc@91
|
1465 val eb' = subConInCon (0, c') eb
|
adamc@339
|
1466 handle SynUnif => (expError env (Unif ("substitution", loc, eb));
|
adamc@91
|
1467 cerror)
|
adamc@91
|
1468 in
|
adamc@328
|
1469 (*prefaces "Elab ECApp" [("e", SourcePrint.p_exp eAll),
|
adamc@328
|
1470 ("et", p_con env oldEt),
|
adamc@328
|
1471 ("x", PD.string x),
|
adamc@328
|
1472 ("eb", p_con (E.pushCRel env x k) eb),
|
adamc@328
|
1473 ("c", p_con env c'),
|
adamc@328
|
1474 ("eb'", p_con env eb')];*)
|
adamc@228
|
1475 ((L'.ECApp (e', c'), loc), eb', gs1 @ gs2 @ enD gs3 @ enD gs4)
|
adamc@91
|
1476 end
|
adamc@91
|
1477
|
adamc@91
|
1478 | _ =>
|
adamc@91
|
1479 (expError env (WrongForm ("constructor function", e', et));
|
adamc@91
|
1480 (eerror, cerror, []))
|
adamc@91
|
1481 end
|
adamc@91
|
1482 | L.ECAbs (expl, x, k, e) =>
|
adamc@91
|
1483 let
|
adamc@91
|
1484 val expl' = elabExplicitness expl
|
adamc@91
|
1485 val k' = elabKind k
|
adamc@328
|
1486
|
adamc@328
|
1487 val env' = E.pushCRel env x k'
|
adamc@328
|
1488 val (e', et, gs) = elabExp (env', D.enter denv) e
|
adamc@91
|
1489 in
|
adamc@91
|
1490 ((L'.ECAbs (expl', x, k', e'), loc),
|
adamc@91
|
1491 (L'.TCFun (expl', x, k', et), loc),
|
adamc@91
|
1492 gs)
|
adamc@91
|
1493 end
|
adamc@91
|
1494
|
adamc@91
|
1495 | L.EDisjoint (c1, c2, e) =>
|
adamc@91
|
1496 let
|
adamc@91
|
1497 val (c1', k1, gs1) = elabCon (env, denv) c1
|
adamc@91
|
1498 val (c2', k2, gs2) = elabCon (env, denv) c2
|
adamc@91
|
1499
|
adamc@91
|
1500 val ku1 = kunif loc
|
adamc@91
|
1501 val ku2 = kunif loc
|
adamc@91
|
1502
|
adamc@91
|
1503 val (denv', gs3) = D.assert env denv (c1', c2')
|
adamc@91
|
1504 val (e', t, gs4) = elabExp (env, denv') e
|
adamc@91
|
1505 in
|
adamc@91
|
1506 checkKind env c1' k1 (L'.KRecord ku1, loc);
|
adamc@91
|
1507 checkKind env c2' k2 (L'.KRecord ku2, loc);
|
adamc@91
|
1508
|
adamc@345
|
1509 (e', (L'.CDisjoint (L'.LeaveAlone, c1', c2', t), loc), enD gs1 @ enD gs2 @ enD gs3 @ gs4)
|
adamc@91
|
1510 end
|
adamc@91
|
1511
|
adamc@91
|
1512 | L.ERecord xes =>
|
adamc@91
|
1513 let
|
adamc@91
|
1514 val (xes', gs) = ListUtil.foldlMap (fn ((x, e), gs) =>
|
adamc@91
|
1515 let
|
adamc@91
|
1516 val (x', xk, gs1) = elabCon (env, denv) x
|
adamc@91
|
1517 val (e', et, gs2) = elabExp (env, denv) e
|
adamc@91
|
1518 in
|
adamc@91
|
1519 checkKind env x' xk kname;
|
adamc@228
|
1520 ((x', e', et), enD gs1 @ gs2 @ gs)
|
adamc@91
|
1521 end)
|
adamc@91
|
1522 [] xes
|
adamc@91
|
1523
|
adamc@91
|
1524 val k = (L'.KType, loc)
|
adamc@91
|
1525
|
adamc@91
|
1526 fun prove (xets, gs) =
|
adamc@91
|
1527 case xets of
|
adamc@91
|
1528 [] => gs
|
adamc@91
|
1529 | (x, _, t) :: rest =>
|
adamc@91
|
1530 let
|
adamc@91
|
1531 val xc = (x, t)
|
adamc@91
|
1532 val r1 = (L'.CRecord (k, [xc]), loc)
|
adamc@91
|
1533 val gs = foldl (fn ((x', _, t'), gs) =>
|
adamc@91
|
1534 let
|
adamc@91
|
1535 val xc' = (x', t')
|
adamc@91
|
1536 val r2 = (L'.CRecord (k, [xc']), loc)
|
adamc@91
|
1537 in
|
adamc@91
|
1538 D.prove env denv (r1, r2, loc) @ gs
|
adamc@91
|
1539 end)
|
adamc@91
|
1540 gs rest
|
adamc@91
|
1541 in
|
adamc@91
|
1542 prove (rest, gs)
|
adamc@91
|
1543 end
|
adamc@228
|
1544
|
adamc@228
|
1545 val gsD = List.mapPartial (fn Disjoint d => SOME d | _ => NONE) gs
|
adamc@228
|
1546 val gsO = List.filter (fn Disjoint _ => false | _ => true) gs
|
adamc@91
|
1547 in
|
adamc@255
|
1548 (*TextIO.print ("|gsO| = " ^ Int.toString (length gsO) ^ "\n");*)
|
adamc@91
|
1549 ((L'.ERecord xes', loc),
|
adamc@91
|
1550 (L'.TRecord (L'.CRecord (ktype, map (fn (x', _, et) => (x', et)) xes'), loc), loc),
|
adamc@228
|
1551 enD (prove (xes', gsD)) @ gsO)
|
adamc@91
|
1552 end
|
adamc@91
|
1553
|
adamc@91
|
1554 | L.EField (e, c) =>
|
adamc@91
|
1555 let
|
adamc@91
|
1556 val (e', et, gs1) = elabExp (env, denv) e
|
adamc@91
|
1557 val (c', ck, gs2) = elabCon (env, denv) c
|
adamc@91
|
1558
|
adamc@91
|
1559 val ft = cunif (loc, ktype)
|
adamc@91
|
1560 val rest = cunif (loc, ktype_record)
|
adamc@91
|
1561 val first = (L'.CRecord (ktype, [(c', ft)]), loc)
|
adamc@91
|
1562
|
adamc@91
|
1563 val gs3 =
|
adamc@91
|
1564 checkCon (env, denv) e' et
|
adamc@91
|
1565 (L'.TRecord (L'.CConcat (first, rest), loc), loc)
|
adamc@91
|
1566 val gs4 = D.prove env denv (first, rest, loc)
|
adamc@91
|
1567 in
|
adamc@228
|
1568 ((L'.EField (e', c', {field = ft, rest = rest}), loc), ft, gs1 @ enD gs2 @ enD gs3 @ enD gs4)
|
adamc@91
|
1569 end
|
adamc@91
|
1570
|
adamc@339
|
1571 | L.EWith (e1, c, e2) =>
|
adamc@339
|
1572 let
|
adamc@339
|
1573 val (e1', e1t, gs1) = elabExp (env, denv) e1
|
adamc@339
|
1574 val (c', ck, gs2) = elabCon (env, denv) c
|
adamc@339
|
1575 val (e2', e2t, gs3) = elabExp (env, denv) e2
|
adamc@339
|
1576
|
adamc@339
|
1577 val rest = cunif (loc, ktype_record)
|
adamc@339
|
1578 val first = (L'.CRecord (ktype, [(c', e2t)]), loc)
|
adamc@339
|
1579
|
adamc@339
|
1580 val gs4 = checkCon (env, denv) e1' e1t (L'.TRecord rest, loc)
|
adamc@339
|
1581 val gs5 = D.prove env denv (first, rest, loc)
|
adamc@339
|
1582 in
|
adamc@339
|
1583 ((L'.EWith (e1', c', e2', {field = e2t, rest = rest}), loc),
|
adamc@339
|
1584 (L'.TRecord ((L'.CConcat (first, rest), loc)), loc),
|
adamc@339
|
1585 gs1 @ enD gs2 @ gs3 @ enD gs4 @ enD gs5)
|
adamc@339
|
1586 end
|
adamc@149
|
1587 | L.ECut (e, c) =>
|
adamc@149
|
1588 let
|
adamc@149
|
1589 val (e', et, gs1) = elabExp (env, denv) e
|
adamc@149
|
1590 val (c', ck, gs2) = elabCon (env, denv) c
|
adamc@149
|
1591
|
adamc@149
|
1592 val ft = cunif (loc, ktype)
|
adamc@149
|
1593 val rest = cunif (loc, ktype_record)
|
adamc@149
|
1594 val first = (L'.CRecord (ktype, [(c', ft)]), loc)
|
adamc@149
|
1595
|
adamc@149
|
1596 val gs3 =
|
adamc@149
|
1597 checkCon (env, denv) e' et
|
adamc@149
|
1598 (L'.TRecord (L'.CConcat (first, rest), loc), loc)
|
adamc@149
|
1599 val gs4 = D.prove env denv (first, rest, loc)
|
adamc@149
|
1600 in
|
adamc@228
|
1601 ((L'.ECut (e', c', {field = ft, rest = rest}), loc), (L'.TRecord rest, loc),
|
adamc@228
|
1602 gs1 @ enD gs2 @ enD gs3 @ enD gs4)
|
adamc@149
|
1603 end
|
adamc@149
|
1604
|
adamc@91
|
1605 | L.EFold =>
|
adamc@91
|
1606 let
|
adamc@91
|
1607 val dom = kunif loc
|
adamc@91
|
1608 in
|
adamc@91
|
1609 ((L'.EFold dom, loc), foldType (dom, loc), [])
|
adamc@91
|
1610 end
|
adamc@170
|
1611
|
adamc@171
|
1612 | L.ECase (e, pes) =>
|
adamc@171
|
1613 let
|
adamc@171
|
1614 val (e', et, gs1) = elabExp (env, denv) e
|
adamc@171
|
1615 val result = cunif (loc, (L'.KType, loc))
|
adamc@171
|
1616 val (pes', gs) = ListUtil.foldlMap
|
adamc@171
|
1617 (fn ((p, e), gs) =>
|
adamc@171
|
1618 let
|
adamc@174
|
1619 val ((p', pt), (env, _)) = elabPat (p, (env, denv, SS.empty))
|
adamc@171
|
1620
|
adamc@171
|
1621 val gs1 = checkPatCon (env, denv) p' pt et
|
adamc@171
|
1622 val (e', et, gs2) = elabExp (env, denv) e
|
adamc@171
|
1623 val gs3 = checkCon (env, denv) e' et result
|
adamc@171
|
1624 in
|
adamc@228
|
1625 ((p', e'), enD gs1 @ gs2 @ enD gs3 @ gs)
|
adamc@171
|
1626 end)
|
adamc@171
|
1627 gs1 pes
|
adamc@172
|
1628
|
adamc@172
|
1629 val (total, gs') = exhaustive (env, denv, et, map #1 pes')
|
adamc@171
|
1630 in
|
adamc@172
|
1631 if total then
|
adamc@172
|
1632 ()
|
adamc@172
|
1633 else
|
adamc@172
|
1634 expError env (Inexhaustive loc);
|
adamc@172
|
1635
|
adamc@228
|
1636 ((L'.ECase (e', pes', {disc = et, result = result}), loc), result, enD gs' @ gs)
|
adamc@171
|
1637 end
|
adamc@280
|
1638
|
adamc@280
|
1639 (*val tcs = List.filter (fn TypeClass _ => true | _ => false) (#3 r)*)
|
adamc@280
|
1640 in
|
adamc@280
|
1641 (*prefaces "elabExp" [("e", SourcePrint.p_exp eAll),
|
adamc@280
|
1642 ("|tcs|", PD.string (Int.toString (length tcs)))];*)
|
adamc@280
|
1643 r
|
adamc@91
|
1644 end
|
adamc@31
|
1645
|
adamc@42
|
1646 val hnormSgn = E.hnormSgn
|
adamc@31
|
1647
|
adamc@210
|
1648 fun tableOf () = (L'.CModProj (!basis_r, [], "sql_table"), ErrorMsg.dummySpan)
|
adamc@338
|
1649 fun sequenceOf () = (L'.CModProj (!basis_r, [], "sql_sequence"), ErrorMsg.dummySpan)
|
adamc@205
|
1650
|
adamc@88
|
1651 fun elabSgn_item ((sgi, loc), (env, denv, gs)) =
|
adamc@76
|
1652 case sgi of
|
adamc@76
|
1653 L.SgiConAbs (x, k) =>
|
adamc@76
|
1654 let
|
adamc@76
|
1655 val k' = elabKind k
|
adamc@31
|
1656
|
adamc@76
|
1657 val (env', n) = E.pushCNamed env x k' NONE
|
adamc@76
|
1658 in
|
adamc@88
|
1659 ([(L'.SgiConAbs (x, n, k'), loc)], (env', denv, gs))
|
adamc@76
|
1660 end
|
adamc@31
|
1661
|
adamc@76
|
1662 | L.SgiCon (x, ko, c) =>
|
adamc@76
|
1663 let
|
adamc@76
|
1664 val k' = case ko of
|
adamc@76
|
1665 NONE => kunif loc
|
adamc@76
|
1666 | SOME k => elabKind k
|
adamc@31
|
1667
|
adamc@83
|
1668 val (c', ck, gs') = elabCon (env, denv) c
|
adamc@76
|
1669 val (env', n) = E.pushCNamed env x k' (SOME c')
|
adamc@76
|
1670 in
|
adamc@76
|
1671 checkKind env c' ck k';
|
adamc@31
|
1672
|
adamc@88
|
1673 ([(L'.SgiCon (x, n, k', c'), loc)], (env', denv, gs' @ gs))
|
adamc@76
|
1674 end
|
adamc@31
|
1675
|
adamc@191
|
1676 | L.SgiDatatype (x, xs, xcs) =>
|
adamc@157
|
1677 let
|
adamc@157
|
1678 val k = (L'.KType, loc)
|
adamc@191
|
1679 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
|
adamc@191
|
1680 val (env, n) = E.pushCNamed env x k' NONE
|
adamc@157
|
1681 val t = (L'.CNamed n, loc)
|
adamc@194
|
1682 val nxs = length xs - 1
|
adamc@194
|
1683 val t = ListUtil.foldli (fn (i, _, t) => (L'.CApp (t, (L'.CRel (nxs - i), loc)), loc)) t xs
|
adamc@157
|
1684
|
adamc@284
|
1685 val (env', denv') = foldl (fn (x, (env', denv')) =>
|
adamc@284
|
1686 (E.pushCRel env' x k,
|
adamc@284
|
1687 D.enter denv')) (env, denv) xs
|
adamc@284
|
1688
|
adamc@157
|
1689 val (xcs, (used, env, gs)) =
|
adamc@157
|
1690 ListUtil.foldlMap
|
adamc@157
|
1691 (fn ((x, to), (used, env, gs)) =>
|
adamc@157
|
1692 let
|
adamc@157
|
1693 val (to, t, gs') = case to of
|
adamc@157
|
1694 NONE => (NONE, t, gs)
|
adamc@157
|
1695 | SOME t' =>
|
adamc@157
|
1696 let
|
adamc@284
|
1697 val (t', tk, gs') = elabCon (env', denv') t'
|
adamc@157
|
1698 in
|
adamc@284
|
1699 checkKind env' t' tk k;
|
adamc@157
|
1700 (SOME t', (L'.TFun (t', t), loc), gs' @ gs)
|
adamc@157
|
1701 end
|
adamc@191
|
1702 val t = foldl (fn (x, t) => (L'.TCFun (L'.Implicit, x, k, t), loc)) t xs
|
adamc@157
|
1703
|
adamc@157
|
1704 val (env, n') = E.pushENamed env x t
|
adamc@157
|
1705 in
|
adamc@157
|
1706 if SS.member (used, x) then
|
adamc@157
|
1707 strError env (DuplicateConstructor (x, loc))
|
adamc@157
|
1708 else
|
adamc@157
|
1709 ();
|
adamc@157
|
1710 ((x, n', to), (SS.add (used, x), env, gs'))
|
adamc@157
|
1711 end)
|
adamc@157
|
1712 (SS.empty, env, []) xcs
|
adamc@191
|
1713
|
adamc@191
|
1714 val env = E.pushDatatype env n xs xcs
|
adamc@157
|
1715 in
|
adamc@191
|
1716 ([(L'.SgiDatatype (x, n, xs, xcs), loc)], (env, denv, gs))
|
adamc@157
|
1717 end
|
adamc@156
|
1718
|
adamc@158
|
1719 | L.SgiDatatypeImp (_, [], _) => raise Fail "Empty SgiDatatypeImp"
|
adamc@158
|
1720
|
adamc@158
|
1721 | L.SgiDatatypeImp (x, m1 :: ms, s) =>
|
adamc@158
|
1722 (case E.lookupStr env m1 of
|
adamc@158
|
1723 NONE => (strError env (UnboundStr (loc, m1));
|
adamc@158
|
1724 ([], (env, denv, gs)))
|
adamc@158
|
1725 | SOME (n, sgn) =>
|
adamc@158
|
1726 let
|
adamc@158
|
1727 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
|
adamc@158
|
1728 case E.projectStr env {sgn = sgn, str = str, field = m} of
|
adamc@158
|
1729 NONE => (conError env (UnboundStrInCon (loc, m));
|
adamc@158
|
1730 (strerror, sgnerror))
|
adamc@158
|
1731 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
|
adamc@158
|
1732 ((L'.StrVar n, loc), sgn) ms
|
adamc@158
|
1733 in
|
adamc@161
|
1734 case hnormCon (env, denv) (L'.CModProj (n, ms, s), loc) of
|
adamc@161
|
1735 ((L'.CModProj (n, ms, s), _), gs) =>
|
adamc@161
|
1736 (case E.projectDatatype env {sgn = sgn, str = str, field = s} of
|
adamc@161
|
1737 NONE => (conError env (UnboundDatatype (loc, s));
|
adamc@161
|
1738 ([], (env, denv, gs)))
|
adamc@191
|
1739 | SOME (xs, xncs) =>
|
adamc@161
|
1740 let
|
adamc@161
|
1741 val k = (L'.KType, loc)
|
adamc@191
|
1742 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
|
adamc@191
|
1743
|
adamc@161
|
1744 val t = (L'.CModProj (n, ms, s), loc)
|
adamc@191
|
1745 val (env, n') = E.pushCNamed env x k' (SOME t)
|
adamc@191
|
1746 val env = E.pushDatatype env n' xs xncs
|
adamc@158
|
1747
|
adamc@161
|
1748 val t = (L'.CNamed n', loc)
|
adamc@161
|
1749 val env = foldl (fn ((x, n, to), env) =>
|
adamc@161
|
1750 let
|
adamc@161
|
1751 val t = case to of
|
adamc@161
|
1752 NONE => t
|
adamc@161
|
1753 | SOME t' => (L'.TFun (t', t), loc)
|
adamc@191
|
1754
|
adamc@191
|
1755 val t = foldr (fn (x, t) =>
|
adamc@191
|
1756 (L'.TCFun (L'.Implicit, x, k, t), loc))
|
adamc@191
|
1757 t xs
|
adamc@161
|
1758 in
|
adamc@161
|
1759 E.pushENamedAs env x n t
|
adamc@161
|
1760 end) env xncs
|
adamc@161
|
1761 in
|
adamc@191
|
1762 ([(L'.SgiDatatypeImp (x, n', n, ms, s, xs, xncs), loc)], (env, denv, gs))
|
adamc@161
|
1763 end)
|
adamc@161
|
1764 | _ => (strError env (NotDatatype loc);
|
adamc@161
|
1765 ([], (env, denv, [])))
|
adamc@158
|
1766 end)
|
adamc@156
|
1767
|
adamc@76
|
1768 | L.SgiVal (x, c) =>
|
adamc@76
|
1769 let
|
adamc@83
|
1770 val (c', ck, gs') = elabCon (env, denv) c
|
adamc@31
|
1771
|
adamc@76
|
1772 val (env', n) = E.pushENamed env x c'
|
adamc@218
|
1773 val (c', gs'') = normClassConstraint (env, denv) c'
|
adamc@76
|
1774 in
|
adamc@76
|
1775 (unifyKinds ck ktype
|
adamc@76
|
1776 handle KUnify ue => strError env (NotType (ck, ue)));
|
adamc@31
|
1777
|
adamc@218
|
1778 ([(L'.SgiVal (x, n, c'), loc)], (env', denv, gs' @ gs'' @ gs))
|
adamc@76
|
1779 end
|
adamc@31
|
1780
|
adamc@76
|
1781 | L.SgiStr (x, sgn) =>
|
adamc@76
|
1782 let
|
adamc@83
|
1783 val (sgn', gs') = elabSgn (env, denv) sgn
|
adamc@76
|
1784 val (env', n) = E.pushStrNamed env x sgn'
|
adamc@76
|
1785 in
|
adamc@88
|
1786 ([(L'.SgiStr (x, n, sgn'), loc)], (env', denv, gs' @ gs))
|
adamc@76
|
1787 end
|
adamc@31
|
1788
|
adamc@76
|
1789 | L.SgiSgn (x, sgn) =>
|
adamc@76
|
1790 let
|
adamc@83
|
1791 val (sgn', gs') = elabSgn (env, denv) sgn
|
adamc@76
|
1792 val (env', n) = E.pushSgnNamed env x sgn'
|
adamc@76
|
1793 in
|
adamc@88
|
1794 ([(L'.SgiSgn (x, n, sgn'), loc)], (env', denv, gs' @ gs))
|
adamc@76
|
1795 end
|
adamc@31
|
1796
|
adamc@76
|
1797 | L.SgiInclude sgn =>
|
adamc@76
|
1798 let
|
adamc@83
|
1799 val (sgn', gs') = elabSgn (env, denv) sgn
|
adamc@76
|
1800 in
|
adamc@76
|
1801 case #1 (hnormSgn env sgn') of
|
adamc@76
|
1802 L'.SgnConst sgis =>
|
adamc@88
|
1803 (sgis, (foldl (fn (sgi, env) => E.sgiBinds env sgi) env sgis, denv, gs' @ gs))
|
adamc@76
|
1804 | _ => (sgnError env (NotIncludable sgn');
|
adamc@88
|
1805 ([], (env, denv, [])))
|
adamc@88
|
1806 end
|
adamc@88
|
1807
|
adamc@88
|
1808 | L.SgiConstraint (c1, c2) =>
|
adamc@88
|
1809 let
|
adamc@88
|
1810 val (c1', k1, gs1) = elabCon (env, denv) c1
|
adamc@88
|
1811 val (c2', k2, gs2) = elabCon (env, denv) c2
|
adamc@88
|
1812
|
adamc@90
|
1813 val (denv, gs3) = D.assert env denv (c1', c2')
|
adamc@88
|
1814 in
|
adamc@88
|
1815 checkKind env c1' k1 (L'.KRecord (kunif loc), loc);
|
adamc@88
|
1816 checkKind env c2' k2 (L'.KRecord (kunif loc), loc);
|
adamc@88
|
1817
|
adamc@90
|
1818 ([(L'.SgiConstraint (c1', c2'), loc)], (env, denv, gs1 @ gs2 @ gs3))
|
adamc@76
|
1819 end
|
adamc@31
|
1820
|
adamc@203
|
1821 | L.SgiTable (x, c) =>
|
adamc@203
|
1822 let
|
adamc@203
|
1823 val (c', k, gs) = elabCon (env, denv) c
|
adamc@210
|
1824 val (env, n) = E.pushENamed env x (L'.CApp (tableOf (), c'), loc)
|
adamc@203
|
1825 in
|
adamc@203
|
1826 checkKind env c' k (L'.KRecord (L'.KType, loc), loc);
|
adamc@210
|
1827 ([(L'.SgiTable (!basis_r, x, n, c'), loc)], (env, denv, gs))
|
adamc@203
|
1828 end
|
adamc@203
|
1829
|
adamc@338
|
1830 | L.SgiSequence x =>
|
adamc@338
|
1831 let
|
adamc@338
|
1832 val (env, n) = E.pushENamed env x (sequenceOf ())
|
adamc@338
|
1833 in
|
adamc@338
|
1834 ([(L'.SgiSequence (!basis_r, x, n), loc)], (env, denv, gs))
|
adamc@338
|
1835 end
|
adamc@338
|
1836
|
adamc@211
|
1837 | L.SgiClassAbs x =>
|
adamc@211
|
1838 let
|
adamc@211
|
1839 val k = (L'.KArrow ((L'.KType, loc), (L'.KType, loc)), loc)
|
adamc@211
|
1840 val (env, n) = E.pushCNamed env x k NONE
|
adamc@211
|
1841 val env = E.pushClass env n
|
adamc@211
|
1842 in
|
adamc@211
|
1843 ([(L'.SgiClassAbs (x, n), loc)], (env, denv, []))
|
adamc@211
|
1844 end
|
adamc@211
|
1845
|
adamc@211
|
1846 | L.SgiClass (x, c) =>
|
adamc@211
|
1847 let
|
adamc@211
|
1848 val k = (L'.KArrow ((L'.KType, loc), (L'.KType, loc)), loc)
|
adamc@211
|
1849 val (c', ck, gs) = elabCon (env, denv) c
|
adamc@211
|
1850 val (env, n) = E.pushCNamed env x k (SOME c')
|
adamc@211
|
1851 val env = E.pushClass env n
|
adamc@211
|
1852 in
|
adamc@211
|
1853 checkKind env c' ck k;
|
adamc@211
|
1854 ([(L'.SgiClass (x, n, c'), loc)], (env, denv, []))
|
adamc@211
|
1855 end
|
adamc@211
|
1856
|
adamc@83
|
1857 and elabSgn (env, denv) (sgn, loc) =
|
adamc@31
|
1858 case sgn of
|
adamc@31
|
1859 L.SgnConst sgis =>
|
adamc@31
|
1860 let
|
adamc@88
|
1861 val (sgis', (_, _, gs)) = ListUtil.foldlMapConcat elabSgn_item (env, denv, []) sgis
|
adamc@62
|
1862
|
adamc@62
|
1863 val _ = foldl (fn ((sgi, loc), (cons, vals, sgns, strs)) =>
|
adamc@62
|
1864 case sgi of
|
adamc@62
|
1865 L'.SgiConAbs (x, _, _) =>
|
adamc@62
|
1866 (if SS.member (cons, x) then
|
adamc@62
|
1867 sgnError env (DuplicateCon (loc, x))
|
adamc@62
|
1868 else
|
adamc@62
|
1869 ();
|
adamc@62
|
1870 (SS.add (cons, x), vals, sgns, strs))
|
adamc@62
|
1871 | L'.SgiCon (x, _, _, _) =>
|
adamc@62
|
1872 (if SS.member (cons, x) then
|
adamc@62
|
1873 sgnError env (DuplicateCon (loc, x))
|
adamc@62
|
1874 else
|
adamc@62
|
1875 ();
|
adamc@62
|
1876 (SS.add (cons, x), vals, sgns, strs))
|
adamc@191
|
1877 | L'.SgiDatatype (x, _, _, xncs) =>
|
adamc@156
|
1878 let
|
adamc@156
|
1879 val vals = foldl (fn ((x, _, _), vals) =>
|
adamc@156
|
1880 (if SS.member (vals, x) then
|
adamc@156
|
1881 sgnError env (DuplicateVal (loc, x))
|
adamc@156
|
1882 else
|
adamc@156
|
1883 ();
|
adamc@156
|
1884 SS.add (vals, x)))
|
adamc@156
|
1885 vals xncs
|
adamc@156
|
1886 in
|
adamc@156
|
1887 if SS.member (cons, x) then
|
adamc@156
|
1888 sgnError env (DuplicateCon (loc, x))
|
adamc@156
|
1889 else
|
adamc@156
|
1890 ();
|
adamc@156
|
1891 (SS.add (cons, x), vals, sgns, strs)
|
adamc@156
|
1892 end
|
adamc@191
|
1893 | L'.SgiDatatypeImp (x, _, _, _, _, _, _) =>
|
adamc@156
|
1894 (if SS.member (cons, x) then
|
adamc@156
|
1895 sgnError env (DuplicateCon (loc, x))
|
adamc@156
|
1896 else
|
adamc@156
|
1897 ();
|
adamc@156
|
1898 (SS.add (cons, x), vals, sgns, strs))
|
adamc@62
|
1899 | L'.SgiVal (x, _, _) =>
|
adamc@62
|
1900 (if SS.member (vals, x) then
|
adamc@62
|
1901 sgnError env (DuplicateVal (loc, x))
|
adamc@62
|
1902 else
|
adamc@62
|
1903 ();
|
adamc@62
|
1904 (cons, SS.add (vals, x), sgns, strs))
|
adamc@62
|
1905 | L'.SgiSgn (x, _, _) =>
|
adamc@62
|
1906 (if SS.member (sgns, x) then
|
adamc@62
|
1907 sgnError env (DuplicateSgn (loc, x))
|
adamc@62
|
1908 else
|
adamc@62
|
1909 ();
|
adamc@62
|
1910 (cons, vals, SS.add (sgns, x), strs))
|
adamc@62
|
1911 | L'.SgiStr (x, _, _) =>
|
adamc@62
|
1912 (if SS.member (strs, x) then
|
adamc@62
|
1913 sgnError env (DuplicateStr (loc, x))
|
adamc@62
|
1914 else
|
adamc@62
|
1915 ();
|
adamc@88
|
1916 (cons, vals, sgns, SS.add (strs, x)))
|
adamc@203
|
1917 | L'.SgiConstraint _ => (cons, vals, sgns, strs)
|
adamc@205
|
1918 | L'.SgiTable (_, x, _, _) =>
|
adamc@203
|
1919 (if SS.member (vals, x) then
|
adamc@203
|
1920 sgnError env (DuplicateVal (loc, x))
|
adamc@203
|
1921 else
|
adamc@203
|
1922 ();
|
adamc@211
|
1923 (cons, SS.add (vals, x), sgns, strs))
|
adamc@338
|
1924 | L'.SgiSequence (_, x, _) =>
|
adamc@338
|
1925 (if SS.member (vals, x) then
|
adamc@338
|
1926 sgnError env (DuplicateVal (loc, x))
|
adamc@338
|
1927 else
|
adamc@338
|
1928 ();
|
adamc@338
|
1929 (cons, SS.add (vals, x), sgns, strs))
|
adamc@211
|
1930 | L'.SgiClassAbs (x, _) =>
|
adamc@211
|
1931 (if SS.member (cons, x) then
|
adamc@211
|
1932 sgnError env (DuplicateCon (loc, x))
|
adamc@211
|
1933 else
|
adamc@211
|
1934 ();
|
adamc@211
|
1935 (SS.add (cons, x), vals, sgns, strs))
|
adamc@211
|
1936 | L'.SgiClass (x, _, _) =>
|
adamc@211
|
1937 (if SS.member (cons, x) then
|
adamc@211
|
1938 sgnError env (DuplicateCon (loc, x))
|
adamc@211
|
1939 else
|
adamc@211
|
1940 ();
|
adamc@211
|
1941 (SS.add (cons, x), vals, sgns, strs)))
|
adamc@62
|
1942 (SS.empty, SS.empty, SS.empty, SS.empty) sgis'
|
adamc@31
|
1943 in
|
adamc@83
|
1944 ((L'.SgnConst sgis', loc), gs)
|
adamc@31
|
1945 end
|
adamc@31
|
1946 | L.SgnVar x =>
|
adamc@31
|
1947 (case E.lookupSgn env x of
|
adamc@31
|
1948 NONE =>
|
adamc@31
|
1949 (sgnError env (UnboundSgn (loc, x));
|
adamc@83
|
1950 ((L'.SgnError, loc), []))
|
adamc@83
|
1951 | SOME (n, sgis) => ((L'.SgnVar n, loc), []))
|
adamc@41
|
1952 | L.SgnFun (m, dom, ran) =>
|
adamc@41
|
1953 let
|
adamc@83
|
1954 val (dom', gs1) = elabSgn (env, denv) dom
|
adamc@41
|
1955 val (env', n) = E.pushStrNamed env m dom'
|
adamc@83
|
1956 val (ran', gs2) = elabSgn (env', denv) ran
|
adamc@41
|
1957 in
|
adamc@83
|
1958 ((L'.SgnFun (m, n, dom', ran'), loc), gs1 @ gs2)
|
adamc@41
|
1959 end
|
adamc@42
|
1960 | L.SgnWhere (sgn, x, c) =>
|
adamc@42
|
1961 let
|
adamc@83
|
1962 val (sgn', ds1) = elabSgn (env, denv) sgn
|
adamc@83
|
1963 val (c', ck, ds2) = elabCon (env, denv) c
|
adamc@42
|
1964 in
|
adamc@42
|
1965 case #1 (hnormSgn env sgn') of
|
adamc@83
|
1966 L'.SgnError => (sgnerror, [])
|
adamc@42
|
1967 | L'.SgnConst sgis =>
|
adamc@75
|
1968 if List.exists (fn (L'.SgiConAbs (x', _, k), _) =>
|
adamc@75
|
1969 x' = x andalso
|
adamc@75
|
1970 (unifyKinds k ck
|
adamc@75
|
1971 handle KUnify x => sgnError env (WhereWrongKind x);
|
adamc@42
|
1972 true)
|
adamc@42
|
1973 | _ => false) sgis then
|
adamc@83
|
1974 ((L'.SgnWhere (sgn', x, c'), loc), ds1 @ ds2)
|
adamc@42
|
1975 else
|
adamc@42
|
1976 (sgnError env (UnWhereable (sgn', x));
|
adamc@83
|
1977 (sgnerror, []))
|
adamc@42
|
1978 | _ => (sgnError env (UnWhereable (sgn', x));
|
adamc@83
|
1979 (sgnerror, []))
|
adamc@42
|
1980 end
|
adamc@59
|
1981 | L.SgnProj (m, ms, x) =>
|
adamc@59
|
1982 (case E.lookupStr env m of
|
adamc@59
|
1983 NONE => (strError env (UnboundStr (loc, m));
|
adamc@83
|
1984 (sgnerror, []))
|
adamc@59
|
1985 | SOME (n, sgn) =>
|
adamc@59
|
1986 let
|
adamc@59
|
1987 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
|
adamc@59
|
1988 case E.projectStr env {sgn = sgn, str = str, field = m} of
|
adamc@59
|
1989 NONE => (strError env (UnboundStr (loc, m));
|
adamc@59
|
1990 (strerror, sgnerror))
|
adamc@59
|
1991 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
|
adamc@59
|
1992 ((L'.StrVar n, loc), sgn) ms
|
adamc@59
|
1993 in
|
adamc@59
|
1994 case E.projectSgn env {sgn = sgn, str = str, field = x} of
|
adamc@59
|
1995 NONE => (sgnError env (UnboundSgn (loc, x));
|
adamc@83
|
1996 (sgnerror, []))
|
adamc@83
|
1997 | SOME _ => ((L'.SgnProj (n, ms, x), loc), [])
|
adamc@59
|
1998 end)
|
adamc@59
|
1999
|
adamc@31
|
2000
|
adamc@66
|
2001 fun selfify env {str, strs, sgn} =
|
adamc@66
|
2002 case #1 (hnormSgn env sgn) of
|
adamc@66
|
2003 L'.SgnError => sgn
|
adamc@66
|
2004 | L'.SgnVar _ => sgn
|
adamc@66
|
2005
|
adamc@66
|
2006 | L'.SgnConst sgis =>
|
adamc@66
|
2007 (L'.SgnConst (map (fn (L'.SgiConAbs (x, n, k), loc) =>
|
adamc@66
|
2008 (L'.SgiCon (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)
|
adamc@191
|
2009 | (L'.SgiDatatype (x, n, xs, xncs), loc) =>
|
adamc@191
|
2010 (L'.SgiDatatypeImp (x, n, str, strs, x, xs, xncs), loc)
|
adamc@218
|
2011 | (L'.SgiClassAbs (x, n), loc) =>
|
adamc@218
|
2012 (L'.SgiClass (x, n, (L'.CModProj (str, strs, x), loc)), loc)
|
adamc@66
|
2013 | (L'.SgiStr (x, n, sgn), loc) =>
|
adamc@66
|
2014 (L'.SgiStr (x, n, selfify env {str = str, strs = strs @ [x], sgn = sgn}), loc)
|
adamc@66
|
2015 | x => x) sgis), #2 sgn)
|
adamc@66
|
2016 | L'.SgnFun _ => sgn
|
adamc@66
|
2017 | L'.SgnWhere _ => sgn
|
adamc@66
|
2018 | L'.SgnProj (m, ms, x) =>
|
adamc@66
|
2019 case E.projectSgn env {str = foldl (fn (m, str) => (L'.StrProj (str, m), #2 sgn))
|
adamc@66
|
2020 (L'.StrVar m, #2 sgn) ms,
|
adamc@66
|
2021 sgn = #2 (E.lookupStrNamed env m),
|
adamc@66
|
2022 field = x} of
|
adamc@66
|
2023 NONE => raise Fail "Elaborate.selfify: projectSgn returns NONE"
|
adamc@66
|
2024 | SOME sgn => selfify env {str = str, strs = strs, sgn = sgn}
|
adamc@66
|
2025
|
adamc@66
|
2026 fun selfifyAt env {str, sgn} =
|
adamc@66
|
2027 let
|
adamc@66
|
2028 fun self (str, _) =
|
adamc@66
|
2029 case str of
|
adamc@66
|
2030 L'.StrVar x => SOME (x, [])
|
adamc@66
|
2031 | L'.StrProj (str, x) =>
|
adamc@66
|
2032 (case self str of
|
adamc@66
|
2033 NONE => NONE
|
adamc@66
|
2034 | SOME (m, ms) => SOME (m, ms @ [x]))
|
adamc@66
|
2035 | _ => NONE
|
adamc@66
|
2036 in
|
adamc@66
|
2037 case self str of
|
adamc@66
|
2038 NONE => sgn
|
adamc@66
|
2039 | SOME (str, strs) => selfify env {sgn = sgn, str = str, strs = strs}
|
adamc@66
|
2040 end
|
adamc@66
|
2041
|
adamc@88
|
2042 fun dopen (env, denv) {str, strs, sgn} =
|
adamc@66
|
2043 let
|
adamc@66
|
2044 val m = foldl (fn (m, str) => (L'.StrProj (str, m), #2 sgn))
|
adamc@66
|
2045 (L'.StrVar str, #2 sgn) strs
|
adamc@66
|
2046 in
|
adamc@66
|
2047 case #1 (hnormSgn env sgn) of
|
adamc@66
|
2048 L'.SgnConst sgis =>
|
adamc@88
|
2049 ListUtil.foldlMap (fn ((sgi, loc), (env', denv')) =>
|
adamc@162
|
2050 let
|
adamc@162
|
2051 val d =
|
adamc@162
|
2052 case sgi of
|
adamc@162
|
2053 L'.SgiConAbs (x, n, k) =>
|
adamc@162
|
2054 let
|
adamc@162
|
2055 val c = (L'.CModProj (str, strs, x), loc)
|
adamc@162
|
2056 in
|
adamc@162
|
2057 (L'.DCon (x, n, k, c), loc)
|
adamc@162
|
2058 end
|
adamc@162
|
2059 | L'.SgiCon (x, n, k, c) =>
|
adamc@162
|
2060 (L'.DCon (x, n, k, (L'.CModProj (str, strs, x), loc)), loc)
|
adamc@191
|
2061 | L'.SgiDatatype (x, n, xs, xncs) =>
|
adamc@191
|
2062 (L'.DDatatypeImp (x, n, str, strs, x, xs, xncs), loc)
|
adamc@191
|
2063 | L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
|
adamc@191
|
2064 (L'.DDatatypeImp (x, n, m1, ms, x', xs, xncs), loc)
|
adamc@162
|
2065 | L'.SgiVal (x, n, t) =>
|
adamc@162
|
2066 (L'.DVal (x, n, t, (L'.EModProj (str, strs, x), loc)), loc)
|
adamc@162
|
2067 | L'.SgiStr (x, n, sgn) =>
|
adamc@162
|
2068 (L'.DStr (x, n, sgn, (L'.StrProj (m, x), loc)), loc)
|
adamc@162
|
2069 | L'.SgiSgn (x, n, sgn) =>
|
adamc@162
|
2070 (L'.DSgn (x, n, (L'.SgnProj (str, strs, x), loc)), loc)
|
adamc@162
|
2071 | L'.SgiConstraint (c1, c2) =>
|
adamc@162
|
2072 (L'.DConstraint (c1, c2), loc)
|
adamc@205
|
2073 | L'.SgiTable (_, x, n, c) =>
|
adamc@210
|
2074 (L'.DVal (x, n, (L'.CApp (tableOf (), c), loc),
|
adamc@203
|
2075 (L'.EModProj (str, strs, x), loc)), loc)
|
adamc@338
|
2076 | L'.SgiSequence (_, x, n) =>
|
adamc@338
|
2077 (L'.DVal (x, n, sequenceOf (),
|
adamc@338
|
2078 (L'.EModProj (str, strs, x), loc)), loc)
|
adamc@211
|
2079 | L'.SgiClassAbs (x, n) =>
|
adamc@211
|
2080 let
|
adamc@211
|
2081 val k = (L'.KArrow ((L'.KType, loc), (L'.KType, loc)), loc)
|
adamc@211
|
2082 val c = (L'.CModProj (str, strs, x), loc)
|
adamc@211
|
2083 in
|
adamc@211
|
2084 (L'.DCon (x, n, k, c), loc)
|
adamc@211
|
2085 end
|
adamc@211
|
2086 | L'.SgiClass (x, n, _) =>
|
adamc@211
|
2087 let
|
adamc@211
|
2088 val k = (L'.KArrow ((L'.KType, loc), (L'.KType, loc)), loc)
|
adamc@211
|
2089 val c = (L'.CModProj (str, strs, x), loc)
|
adamc@211
|
2090 in
|
adamc@211
|
2091 (L'.DCon (x, n, k, c), loc)
|
adamc@211
|
2092 end
|
adamc@162
|
2093 in
|
adamc@162
|
2094 (d, (E.declBinds env' d, denv'))
|
adamc@162
|
2095 end)
|
adamc@88
|
2096 (env, denv) sgis
|
adamc@66
|
2097 | _ => (strError env (UnOpenable sgn);
|
adamc@88
|
2098 ([], (env, denv)))
|
adamc@66
|
2099 end
|
adamc@66
|
2100
|
adamc@88
|
2101 fun dopenConstraints (loc, env, denv) {str, strs} =
|
adamc@88
|
2102 case E.lookupStr env str of
|
adamc@88
|
2103 NONE => (strError env (UnboundStr (loc, str));
|
adamc@88
|
2104 denv)
|
adamc@88
|
2105 | SOME (n, sgn) =>
|
adamc@88
|
2106 let
|
adamc@88
|
2107 val (st, sgn) = foldl (fn (m, (str, sgn)) =>
|
adamc@88
|
2108 case E.projectStr env {str = str, sgn = sgn, field = m} of
|
adamc@88
|
2109 NONE => (strError env (UnboundStr (loc, m));
|
adamc@88
|
2110 (strerror, sgnerror))
|
adamc@88
|
2111 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
|
adamc@88
|
2112 ((L'.StrVar n, loc), sgn) strs
|
adamc@88
|
2113
|
adamc@88
|
2114 val cso = E.projectConstraints env {sgn = sgn, str = st}
|
adamc@88
|
2115
|
adamc@88
|
2116 val denv = case cso of
|
adamc@88
|
2117 NONE => (strError env (UnboundStr (loc, str));
|
adamc@88
|
2118 denv)
|
adamc@90
|
2119 | SOME cs => foldl (fn ((c1, c2), denv) =>
|
adamc@90
|
2120 let
|
adamc@90
|
2121 val (denv, gs) = D.assert env denv (c1, c2)
|
adamc@90
|
2122 in
|
adamc@90
|
2123 case gs of
|
adamc@90
|
2124 [] => ()
|
adamc@90
|
2125 | _ => raise Fail "dopenConstraints: Sub-constraints remain";
|
adamc@90
|
2126
|
adamc@90
|
2127 denv
|
adamc@90
|
2128 end) denv cs
|
adamc@88
|
2129 in
|
adamc@88
|
2130 denv
|
adamc@88
|
2131 end
|
adamc@88
|
2132
|
adamc@31
|
2133 fun sgiOfDecl (d, loc) =
|
adamc@31
|
2134 case d of
|
adamc@123
|
2135 L'.DCon (x, n, k, c) => [(L'.SgiCon (x, n, k, c), loc)]
|
adamc@156
|
2136 | L'.DDatatype x => [(L'.SgiDatatype x, loc)]
|
adamc@156
|
2137 | L'.DDatatypeImp x => [(L'.SgiDatatypeImp x, loc)]
|
adamc@123
|
2138 | L'.DVal (x, n, t, _) => [(L'.SgiVal (x, n, t), loc)]
|
adamc@123
|
2139 | L'.DValRec vis => map (fn (x, n, t, _) => (L'.SgiVal (x, n, t), loc)) vis
|
adamc@123
|
2140 | L'.DSgn (x, n, sgn) => [(L'.SgiSgn (x, n, sgn), loc)]
|
adamc@123
|
2141 | L'.DStr (x, n, sgn, _) => [(L'.SgiStr (x, n, sgn), loc)]
|
adamc@123
|
2142 | L'.DFfiStr (x, n, sgn) => [(L'.SgiStr (x, n, sgn), loc)]
|
adamc@123
|
2143 | L'.DConstraint cs => [(L'.SgiConstraint cs, loc)]
|
adamc@123
|
2144 | L'.DExport _ => []
|
adamc@205
|
2145 | L'.DTable (tn, x, n, c) => [(L'.SgiTable (tn, x, n, c), loc)]
|
adamc@338
|
2146 | L'.DSequence (tn, x, n) => [(L'.SgiSequence (tn, x, n), loc)]
|
adamc@213
|
2147 | L'.DClass (x, n, c) => [(L'.SgiClass (x, n, c), loc)]
|
adamc@271
|
2148 | L'.DDatabase _ => []
|
adamc@88
|
2149
|
adamc@88
|
2150 fun sgiBindsD (env, denv) (sgi, _) =
|
adamc@88
|
2151 case sgi of
|
adamc@90
|
2152 L'.SgiConstraint (c1, c2) =>
|
adamc@90
|
2153 (case D.assert env denv (c1, c2) of
|
adamc@90
|
2154 (denv, []) => denv
|
adamc@90
|
2155 | _ => raise Fail "sgiBindsD: Sub-constraints remain")
|
adamc@88
|
2156 | _ => denv
|
adamc@31
|
2157
|
adamc@86
|
2158 fun subSgn (env, denv) sgn1 (sgn2 as (_, loc2)) =
|
adamc@35
|
2159 case (#1 (hnormSgn env sgn1), #1 (hnormSgn env sgn2)) of
|
adamc@31
|
2160 (L'.SgnError, _) => ()
|
adamc@31
|
2161 | (_, L'.SgnError) => ()
|
adamc@31
|
2162
|
adamc@31
|
2163 | (L'.SgnConst sgis1, L'.SgnConst sgis2) =>
|
adamc@31
|
2164 let
|
adamc@156
|
2165 fun folder (sgi2All as (sgi, loc), (env, denv)) =
|
adamc@31
|
2166 let
|
adamc@31
|
2167 fun seek p =
|
adamc@31
|
2168 let
|
adamc@88
|
2169 fun seek (env, denv) ls =
|
adamc@31
|
2170 case ls of
|
adamc@31
|
2171 [] => (sgnError env (UnmatchedSgi sgi2All);
|
adamc@88
|
2172 (env, denv))
|
adamc@31
|
2173 | h :: t =>
|
adamc@31
|
2174 case p h of
|
adamc@88
|
2175 NONE => seek (E.sgiBinds env h, sgiBindsD (env, denv) h) t
|
adamc@88
|
2176 | SOME envs => envs
|
adamc@31
|
2177 in
|
adamc@88
|
2178 seek (env, denv) sgis1
|
adamc@31
|
2179 end
|
adamc@31
|
2180 in
|
adamc@31
|
2181 case sgi of
|
adamc@31
|
2182 L'.SgiConAbs (x, n2, k2) =>
|
adamc@31
|
2183 seek (fn sgi1All as (sgi1, _) =>
|
adamc@31
|
2184 let
|
adamc@41
|
2185 fun found (x', n1, k1, co1) =
|
adamc@41
|
2186 if x = x' then
|
adamc@41
|
2187 let
|
adamc@41
|
2188 val () = unifyKinds k1 k2
|
adamc@41
|
2189 handle KUnify (k1, k2, err) =>
|
adamc@41
|
2190 sgnError env (SgiWrongKind (sgi1All, k1, sgi2All, k2, err))
|
adamc@41
|
2191 val env = E.pushCNamedAs env x n1 k1 co1
|
adamc@41
|
2192 in
|
adamc@41
|
2193 SOME (if n1 = n2 then
|
adamc@41
|
2194 env
|
adamc@41
|
2195 else
|
adamc@88
|
2196 E.pushCNamedAs env x n2 k2 (SOME (L'.CNamed n1, loc2)),
|
adamc@88
|
2197 denv)
|
adamc@41
|
2198 end
|
adamc@41
|
2199 else
|
adamc@41
|
2200 NONE
|
adamc@31
|
2201 in
|
adamc@31
|
2202 case sgi1 of
|
adamc@41
|
2203 L'.SgiConAbs (x', n1, k1) => found (x', n1, k1, NONE)
|
adamc@41
|
2204 | L'.SgiCon (x', n1, k1, c1) => found (x', n1, k1, SOME c1)
|
adamc@191
|
2205 | L'.SgiDatatype (x', n1, xs, _) =>
|
adamc@191
|
2206 let
|
adamc@191
|
2207 val k = (L'.KType, loc)
|
adamc@191
|
2208 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
|
adamc@191
|
2209 in
|
adamc@191
|
2210 found (x', n1, k', NONE)
|
adamc@191
|
2211 end
|
adamc@191
|
2212 | L'.SgiDatatypeImp (x', n1, m1, ms, s, xs, _) =>
|
adamc@191
|
2213 let
|
adamc@191
|
2214 val k = (L'.KType, loc)
|
adamc@191
|
2215 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
|
adamc@191
|
2216 in
|
adamc@191
|
2217 found (x', n1, k', SOME (L'.CModProj (m1, ms, s), loc))
|
adamc@191
|
2218 end
|
adamc@211
|
2219 | L'.SgiClassAbs (x', n1) => found (x', n1,
|
adamc@218
|
2220 (L'.KArrow ((L'.KType, loc),
|
adamc@218
|
2221 (L'.KType, loc)), loc),
|
adamc@218
|
2222 NONE)
|
adamc@211
|
2223 | L'.SgiClass (x', n1, c) => found (x', n1,
|
adamc@211
|
2224 (L'.KArrow ((L'.KType, loc),
|
adamc@211
|
2225 (L'.KType, loc)), loc),
|
adamc@211
|
2226 SOME c)
|
adamc@31
|
2227 | _ => NONE
|
adamc@31
|
2228 end)
|
adamc@31
|
2229
|
adamc@31
|
2230 | L'.SgiCon (x, n2, k2, c2) =>
|
adamc@31
|
2231 seek (fn sgi1All as (sgi1, _) =>
|
adamc@211
|
2232 let
|
adamc@211
|
2233 fun found (x', n1, k1, c1) =
|
adamc@211
|
2234 if x = x' then
|
adamc@211
|
2235 let
|
adamc@327
|
2236 fun good () =
|
adamc@327
|
2237 let
|
adamc@327
|
2238 val env = E.pushCNamedAs env x n2 k2 (SOME c2)
|
adamc@327
|
2239 val env = if n1 = n2 then
|
adamc@327
|
2240 env
|
adamc@327
|
2241 else
|
adamc@327
|
2242 E.pushCNamedAs env x n1 k1 (SOME c1)
|
adamc@327
|
2243 in
|
adamc@327
|
2244 SOME (env, denv)
|
adamc@327
|
2245 end
|
adamc@211
|
2246 in
|
adamc@211
|
2247 (case unifyCons (env, denv) c1 c2 of
|
adamc@211
|
2248 [] => good ()
|
adamc@211
|
2249 | _ => NONE)
|
adamc@211
|
2250 handle CUnify (c1, c2, err) =>
|
adamc@211
|
2251 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
|
adamc@211
|
2252 good ())
|
adamc@211
|
2253 end
|
adamc@211
|
2254 else
|
adamc@211
|
2255 NONE
|
adamc@211
|
2256 in
|
adamc@211
|
2257 case sgi1 of
|
adamc@211
|
2258 L'.SgiCon (x', n1, k1, c1) => found (x', n1, k1, c1)
|
adamc@211
|
2259 | L'.SgiClass (x', n1, c1) =>
|
adamc@211
|
2260 found (x', n1, (L'.KArrow ((L'.KType, loc), (L'.KType, loc)), loc), c1)
|
adamc@211
|
2261 | _ => NONE
|
adamc@211
|
2262 end)
|
adamc@31
|
2263
|
adamc@191
|
2264 | L'.SgiDatatype (x, n2, xs2, xncs2) =>
|
adamc@156
|
2265 seek (fn sgi1All as (sgi1, _) =>
|
adamc@160
|
2266 let
|
adamc@191
|
2267 fun found (n1, xs1, xncs1) =
|
adamc@160
|
2268 let
|
adamc@160
|
2269 fun mismatched ue =
|
adamc@160
|
2270 (sgnError env (SgiMismatchedDatatypes (sgi1All, sgi2All, ue));
|
adamc@160
|
2271 SOME (env, denv))
|
adamc@156
|
2272
|
adamc@191
|
2273 val k = (L'.KType, loc)
|
adamc@191
|
2274 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs1
|
adamc@191
|
2275
|
adamc@160
|
2276 fun good () =
|
adamc@160
|
2277 let
|
adamc@160
|
2278 val env = E.sgiBinds env sgi2All
|
adamc@160
|
2279 val env = if n1 = n2 then
|
adamc@160
|
2280 env
|
adamc@160
|
2281 else
|
adamc@160
|
2282 E.pushCNamedAs env x n1 (L'.KType, loc)
|
adamc@160
|
2283 (SOME (L'.CNamed n1, loc))
|
adamc@160
|
2284 in
|
adamc@160
|
2285 SOME (env, denv)
|
adamc@160
|
2286 end
|
adamc@156
|
2287
|
adamc@191
|
2288 val env = foldl (fn (x, env) => E.pushCRel env x k) env xs1
|
adamc@160
|
2289 fun xncBad ((x1, _, t1), (x2, _, t2)) =
|
adamc@160
|
2290 String.compare (x1, x2) <> EQUAL
|
adamc@160
|
2291 orelse case (t1, t2) of
|
adamc@160
|
2292 (NONE, NONE) => false
|
adamc@160
|
2293 | (SOME t1, SOME t2) =>
|
adamc@160
|
2294 not (List.null (unifyCons (env, denv) t1 t2))
|
adamc@160
|
2295 | _ => true
|
adamc@160
|
2296 in
|
adamc@191
|
2297 (if xs1 <> xs2
|
adamc@191
|
2298 orelse length xncs1 <> length xncs2
|
adamc@160
|
2299 orelse ListPair.exists xncBad (xncs1, xncs2) then
|
adamc@160
|
2300 mismatched NONE
|
adamc@160
|
2301 else
|
adamc@160
|
2302 good ())
|
adamc@160
|
2303 handle CUnify ue => mismatched (SOME ue)
|
adamc@160
|
2304 end
|
adamc@160
|
2305 in
|
adamc@160
|
2306 case sgi1 of
|
adamc@191
|
2307 L'.SgiDatatype (x', n1, xs, xncs1) =>
|
adamc@160
|
2308 if x' = x then
|
adamc@191
|
2309 found (n1, xs, xncs1)
|
adamc@160
|
2310 else
|
adamc@160
|
2311 NONE
|
adamc@191
|
2312 | L'.SgiDatatypeImp (x', n1, _, _, _, xs, xncs1) =>
|
adamc@162
|
2313 if x' = x then
|
adamc@191
|
2314 found (n1, xs, xncs1)
|
adamc@162
|
2315 else
|
adamc@162
|
2316 NONE
|
adamc@160
|
2317 | _ => NONE
|
adamc@160
|
2318 end)
|
adamc@156
|
2319
|
adamc@191
|
2320 | L'.SgiDatatypeImp (x, n2, m12, ms2, s2, xs, _) =>
|
adamc@158
|
2321 seek (fn sgi1All as (sgi1, _) =>
|
adamc@158
|
2322 case sgi1 of
|
adamc@191
|
2323 L'.SgiDatatypeImp (x', n1, m11, ms1, s1, _, _) =>
|
adamc@158
|
2324 if x = x' then
|
adamc@158
|
2325 let
|
adamc@158
|
2326 val k = (L'.KType, loc)
|
adamc@191
|
2327 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
|
adamc@158
|
2328 val t1 = (L'.CModProj (m11, ms1, s1), loc)
|
adamc@158
|
2329 val t2 = (L'.CModProj (m12, ms2, s2), loc)
|
adamc@158
|
2330
|
adamc@158
|
2331 fun good () =
|
adamc@158
|
2332 let
|
adamc@191
|
2333 val env = E.pushCNamedAs env x n1 k' (SOME t1)
|
adamc@191
|
2334 val env = E.pushCNamedAs env x n2 k' (SOME t2)
|
adamc@158
|
2335 in
|
adamc@158
|
2336 SOME (env, denv)
|
adamc@158
|
2337 end
|
adamc@158
|
2338 in
|
adamc@158
|
2339 (case unifyCons (env, denv) t1 t2 of
|
adamc@158
|
2340 [] => good ()
|
adamc@158
|
2341 | _ => NONE)
|
adamc@158
|
2342 handle CUnify (c1, c2, err) =>
|
adamc@158
|
2343 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
|
adamc@158
|
2344 good ())
|
adamc@158
|
2345 end
|
adamc@158
|
2346 else
|
adamc@158
|
2347 NONE
|
adamc@158
|
2348
|
adamc@158
|
2349 | _ => NONE)
|
adamc@156
|
2350
|
adamc@32
|
2351 | L'.SgiVal (x, n2, c2) =>
|
adamc@32
|
2352 seek (fn sgi1All as (sgi1, _) =>
|
adamc@32
|
2353 case sgi1 of
|
adamc@41
|
2354 L'.SgiVal (x', n1, c1) =>
|
adamc@41
|
2355 if x = x' then
|
adamc@86
|
2356 (case unifyCons (env, denv) c1 c2 of
|
adamc@88
|
2357 [] => SOME (env, denv)
|
adamc@86
|
2358 | _ => NONE)
|
adamc@86
|
2359 handle CUnify (c1, c2, err) =>
|
adamc@86
|
2360 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
|
adamc@88
|
2361 SOME (env, denv))
|
adamc@41
|
2362 else
|
adamc@41
|
2363 NONE
|
adamc@205
|
2364 | L'.SgiTable (_, x', n1, c1) =>
|
adamc@203
|
2365 if x = x' then
|
adamc@210
|
2366 (case unifyCons (env, denv) (L'.CApp (tableOf (), c1), loc) c2 of
|
adamc@203
|
2367 [] => SOME (env, denv)
|
adamc@203
|
2368 | _ => NONE)
|
adamc@203
|
2369 handle CUnify (c1, c2, err) =>
|
adamc@203
|
2370 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
|
adamc@203
|
2371 SOME (env, denv))
|
adamc@203
|
2372 else
|
adamc@203
|
2373 NONE
|
adamc@338
|
2374 | L'.SgiSequence (_, x', n1) =>
|
adamc@338
|
2375 if x = x' then
|
adamc@338
|
2376 (case unifyCons (env, denv) (sequenceOf ()) c2 of
|
adamc@338
|
2377 [] => SOME (env, denv)
|
adamc@338
|
2378 | _ => NONE)
|
adamc@338
|
2379 handle CUnify (c1, c2, err) =>
|
adamc@338
|
2380 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
|
adamc@338
|
2381 SOME (env, denv))
|
adamc@338
|
2382 else
|
adamc@338
|
2383 NONE
|
adamc@32
|
2384 | _ => NONE)
|
adamc@32
|
2385
|
adamc@33
|
2386 | L'.SgiStr (x, n2, sgn2) =>
|
adamc@33
|
2387 seek (fn sgi1All as (sgi1, _) =>
|
adamc@33
|
2388 case sgi1 of
|
adamc@41
|
2389 L'.SgiStr (x', n1, sgn1) =>
|
adamc@41
|
2390 if x = x' then
|
adamc@66
|
2391 let
|
adamc@86
|
2392 val () = subSgn (env, denv) sgn1 sgn2
|
adamc@66
|
2393 val env = E.pushStrNamedAs env x n1 sgn1
|
adamc@66
|
2394 val env = if n1 = n2 then
|
adamc@66
|
2395 env
|
adamc@66
|
2396 else
|
adamc@66
|
2397 E.pushStrNamedAs env x n2
|
adamc@66
|
2398 (selfifyAt env {str = (L'.StrVar n1, #2 sgn2),
|
adamc@66
|
2399 sgn = sgn2})
|
adamc@66
|
2400 in
|
adamc@88
|
2401 SOME (env, denv)
|
adamc@66
|
2402 end
|
adamc@41
|
2403 else
|
adamc@41
|
2404 NONE
|
adamc@33
|
2405 | _ => NONE)
|
adamc@59
|
2406
|
adamc@59
|
2407 | L'.SgiSgn (x, n2, sgn2) =>
|
adamc@59
|
2408 seek (fn sgi1All as (sgi1, _) =>
|
adamc@59
|
2409 case sgi1 of
|
adamc@59
|
2410 L'.SgiSgn (x', n1, sgn1) =>
|
adamc@59
|
2411 if x = x' then
|
adamc@65
|
2412 let
|
adamc@86
|
2413 val () = subSgn (env, denv) sgn1 sgn2
|
adamc@86
|
2414 val () = subSgn (env, denv) sgn2 sgn1
|
adamc@65
|
2415
|
adamc@65
|
2416 val env = E.pushSgnNamedAs env x n2 sgn2
|
adamc@65
|
2417 val env = if n1 = n2 then
|
adamc@65
|
2418 env
|
adamc@65
|
2419 else
|
adamc@65
|
2420 E.pushSgnNamedAs env x n1 sgn2
|
adamc@65
|
2421 in
|
adamc@88
|
2422 SOME (env, denv)
|
adamc@65
|
2423 end
|
adamc@59
|
2424 else
|
adamc@59
|
2425 NONE
|
adamc@59
|
2426 | _ => NONE)
|
adamc@88
|
2427
|
adamc@88
|
2428 | L'.SgiConstraint (c2, d2) =>
|
adamc@88
|
2429 seek (fn sgi1All as (sgi1, _) =>
|
adamc@88
|
2430 case sgi1 of
|
adamc@88
|
2431 L'.SgiConstraint (c1, d1) =>
|
adamc@88
|
2432 if consEq (env, denv) (c1, c2) andalso consEq (env, denv) (d1, d2) then
|
adamc@90
|
2433 let
|
adamc@90
|
2434 val (denv, gs) = D.assert env denv (c2, d2)
|
adamc@90
|
2435 in
|
adamc@90
|
2436 case gs of
|
adamc@90
|
2437 [] => ()
|
adamc@90
|
2438 | _ => raise Fail "subSgn: Sub-constraints remain";
|
adamc@90
|
2439
|
adamc@90
|
2440 SOME (env, denv)
|
adamc@90
|
2441 end
|
adamc@88
|
2442 else
|
adamc@88
|
2443 NONE
|
adamc@88
|
2444 | _ => NONE)
|
adamc@203
|
2445
|
adamc@205
|
2446 | L'.SgiTable (_, x, n2, c2) =>
|
adamc@203
|
2447 seek (fn sgi1All as (sgi1, _) =>
|
adamc@203
|
2448 case sgi1 of
|
adamc@205
|
2449 L'.SgiTable (_, x', n1, c1) =>
|
adamc@203
|
2450 if x = x' then
|
adamc@203
|
2451 (case unifyCons (env, denv) c1 c2 of
|
adamc@203
|
2452 [] => SOME (env, denv)
|
adamc@203
|
2453 | _ => NONE)
|
adamc@203
|
2454 handle CUnify (c1, c2, err) =>
|
adamc@203
|
2455 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
|
adamc@203
|
2456 SOME (env, denv))
|
adamc@203
|
2457 else
|
adamc@203
|
2458 NONE
|
adamc@203
|
2459 | _ => NONE)
|
adamc@211
|
2460
|
adamc@338
|
2461 | L'.SgiSequence (_, x, n2) =>
|
adamc@338
|
2462 seek (fn sgi1All as (sgi1, _) =>
|
adamc@338
|
2463 case sgi1 of
|
adamc@338
|
2464 L'.SgiSequence (_, x', n1) =>
|
adamc@338
|
2465 if x = x' then
|
adamc@338
|
2466 SOME (env, denv)
|
adamc@338
|
2467 else
|
adamc@338
|
2468 NONE
|
adamc@338
|
2469 | _ => NONE)
|
adamc@338
|
2470
|
adamc@211
|
2471 | L'.SgiClassAbs (x, n2) =>
|
adamc@211
|
2472 seek (fn sgi1All as (sgi1, _) =>
|
adamc@211
|
2473 let
|
adamc@211
|
2474 fun found (x', n1, co) =
|
adamc@211
|
2475 if x = x' then
|
adamc@211
|
2476 let
|
adamc@211
|
2477 val k = (L'.KArrow ((L'.KType, loc), (L'.KType, loc)), loc)
|
adamc@211
|
2478 val env = E.pushCNamedAs env x n1 k co
|
adamc@211
|
2479 in
|
adamc@211
|
2480 SOME (if n1 = n2 then
|
adamc@211
|
2481 env
|
adamc@211
|
2482 else
|
adamc@211
|
2483 E.pushCNamedAs env x n2 k (SOME (L'.CNamed n1, loc2)),
|
adamc@211
|
2484 denv)
|
adamc@211
|
2485 end
|
adamc@211
|
2486 else
|
adamc@211
|
2487 NONE
|
adamc@211
|
2488 in
|
adamc@211
|
2489 case sgi1 of
|
adamc@211
|
2490 L'.SgiClassAbs (x', n1) => found (x', n1, NONE)
|
adamc@211
|
2491 | L'.SgiClass (x', n1, c) => found (x', n1, SOME c)
|
adamc@211
|
2492 | _ => NONE
|
adamc@211
|
2493 end)
|
adamc@211
|
2494 | L'.SgiClass (x, n2, c2) =>
|
adamc@211
|
2495 seek (fn sgi1All as (sgi1, _) =>
|
adamc@211
|
2496 let
|
adamc@211
|
2497 val k = (L'.KArrow ((L'.KType, loc), (L'.KType, loc)), loc)
|
adamc@211
|
2498
|
adamc@211
|
2499 fun found (x', n1, c1) =
|
adamc@211
|
2500 if x = x' then
|
adamc@211
|
2501 let
|
adamc@218
|
2502 fun good () =
|
adamc@218
|
2503 let
|
adamc@218
|
2504 val env = E.pushCNamedAs env x n2 k (SOME c2)
|
adamc@218
|
2505 val env = if n1 = n2 then
|
adamc@218
|
2506 env
|
adamc@218
|
2507 else
|
adamc@218
|
2508 E.pushCNamedAs env x n1 k (SOME c1)
|
adamc@218
|
2509 in
|
adamc@218
|
2510 SOME (env, denv)
|
adamc@218
|
2511 end
|
adamc@211
|
2512 in
|
adamc@211
|
2513 (case unifyCons (env, denv) c1 c2 of
|
adamc@211
|
2514 [] => good ()
|
adamc@211
|
2515 | _ => NONE)
|
adamc@211
|
2516 handle CUnify (c1, c2, err) =>
|
adamc@211
|
2517 (sgnError env (SgiWrongCon (sgi1All, c1, sgi2All, c2, err));
|
adamc@211
|
2518 good ())
|
adamc@211
|
2519 end
|
adamc@211
|
2520 else
|
adamc@211
|
2521 NONE
|
adamc@211
|
2522 in
|
adamc@211
|
2523 case sgi1 of
|
adamc@211
|
2524 L'.SgiClass (x', n1, c1) => found (x', n1, c1)
|
adamc@211
|
2525 | _ => NONE
|
adamc@211
|
2526 end)
|
adamc@31
|
2527 end
|
adamc@31
|
2528 in
|
adamc@88
|
2529 ignore (foldl folder (env, denv) sgis2)
|
adamc@31
|
2530 end
|
adamc@31
|
2531
|
adamc@41
|
2532 | (L'.SgnFun (m1, n1, dom1, ran1), L'.SgnFun (m2, n2, dom2, ran2)) =>
|
adamc@43
|
2533 let
|
adamc@43
|
2534 val ran1 =
|
adamc@43
|
2535 if n1 = n2 then
|
adamc@43
|
2536 ran1
|
adamc@43
|
2537 else
|
adamc@43
|
2538 subStrInSgn (n1, n2) ran1
|
adamc@43
|
2539 in
|
adamc@86
|
2540 subSgn (env, denv) dom2 dom1;
|
adamc@86
|
2541 subSgn (E.pushStrNamedAs env m2 n2 dom2, denv) ran1 ran2
|
adamc@43
|
2542 end
|
adamc@41
|
2543
|
adamc@41
|
2544 | _ => sgnError env (SgnWrongForm (sgn1, sgn2))
|
adamc@41
|
2545
|
adamc@61
|
2546
|
adamc@312
|
2547 fun positive self =
|
adamc@312
|
2548 let
|
adamc@312
|
2549 open L
|
adamc@312
|
2550
|
adamc@312
|
2551 fun none (c, _) =
|
adamc@312
|
2552 case c of
|
adamc@312
|
2553 CAnnot (c, _) => none c
|
adamc@312
|
2554
|
adamc@312
|
2555 | TFun (c1, c2) => none c1 andalso none c2
|
adamc@312
|
2556 | TCFun (_, _, _, c) => none c
|
adamc@312
|
2557 | TRecord c => none c
|
adamc@312
|
2558
|
adamc@312
|
2559 | CVar ([], x) => x <> self
|
adamc@312
|
2560 | CVar _ => true
|
adamc@312
|
2561 | CApp (c1, c2) => none c1 andalso none c2
|
adamc@312
|
2562 | CAbs _ => false
|
adamc@312
|
2563 | CDisjoint (c1, c2, c3) => none c1 andalso none c2 andalso none c3
|
adamc@312
|
2564
|
adamc@312
|
2565 | CName _ => true
|
adamc@312
|
2566
|
adamc@312
|
2567 | CRecord xcs => List.all (fn (c1, c2) => none c1 andalso none c2) xcs
|
adamc@312
|
2568 | CConcat (c1, c2) => none c1 andalso none c2
|
adamc@312
|
2569 | CFold => true
|
adamc@312
|
2570
|
adamc@312
|
2571 | CUnit => true
|
adamc@312
|
2572
|
adamc@312
|
2573 | CTuple cs => List.all none cs
|
adamc@312
|
2574 | CProj (c, _) => none c
|
adamc@312
|
2575
|
adamc@312
|
2576 | CWild _ => false
|
adamc@312
|
2577
|
adamc@312
|
2578 fun pos (c, _) =
|
adamc@312
|
2579 case c of
|
adamc@312
|
2580 CAnnot (c, _) => pos c
|
adamc@312
|
2581
|
adamc@312
|
2582 | TFun (c1, c2) => none c1 andalso pos c2
|
adamc@312
|
2583 | TCFun (_, _, _, c) => pos c
|
adamc@312
|
2584 | TRecord c => pos c
|
adamc@312
|
2585
|
adamc@312
|
2586 | CVar _ => true
|
adamc@312
|
2587 | CApp (c1, c2) => pos c1 andalso none c2
|
adamc@312
|
2588 | CAbs _ => false
|
adamc@312
|
2589 | CDisjoint (c1, c2, c3) => none c1 andalso none c2 andalso none c3
|
adamc@312
|
2590
|
adamc@312
|
2591 | CName _ => true
|
adamc@312
|
2592
|
adamc@312
|
2593 | CRecord xcs => List.all (fn (c1, c2) => none c1 andalso pos c2) xcs
|
adamc@312
|
2594 | CConcat (c1, c2) => pos c1 andalso pos c2
|
adamc@312
|
2595 | CFold => true
|
adamc@312
|
2596
|
adamc@312
|
2597 | CUnit => true
|
adamc@312
|
2598
|
adamc@312
|
2599 | CTuple cs => List.all pos cs
|
adamc@312
|
2600 | CProj (c, _) => pos c
|
adamc@312
|
2601
|
adamc@312
|
2602 | CWild _ => false
|
adamc@312
|
2603 in
|
adamc@312
|
2604 pos
|
adamc@312
|
2605 end
|
adamc@312
|
2606
|
adamc@325
|
2607 fun wildifyStr env (str, sgn) =
|
adamc@325
|
2608 case #1 (hnormSgn env sgn) of
|
adamc@325
|
2609 L'.SgnConst sgis =>
|
adamc@325
|
2610 (case #1 str of
|
adamc@325
|
2611 L.StrConst ds =>
|
adamc@325
|
2612 let
|
adamc@325
|
2613 fun decompileCon env (c, loc) =
|
adamc@325
|
2614 case c of
|
adamc@325
|
2615 L'.CRel i =>
|
adamc@325
|
2616 let
|
adamc@325
|
2617 val (s, _) = E.lookupCRel env i
|
adamc@325
|
2618 in
|
adamc@325
|
2619 SOME (L.CVar ([], s), loc)
|
adamc@325
|
2620 end
|
adamc@325
|
2621 | L'.CNamed i =>
|
adamc@325
|
2622 let
|
adamc@325
|
2623 val (s, _, _) = E.lookupCNamed env i
|
adamc@325
|
2624 in
|
adamc@325
|
2625 SOME (L.CVar ([], s), loc)
|
adamc@325
|
2626 end
|
adamc@325
|
2627 | L'.CModProj (m1, ms, x) =>
|
adamc@325
|
2628 let
|
adamc@325
|
2629 val (s, _) = E.lookupStrNamed env m1
|
adamc@325
|
2630 in
|
adamc@325
|
2631 SOME (L.CVar (s :: ms, x), loc)
|
adamc@325
|
2632 end
|
adamc@325
|
2633 | L'.CName s => SOME (L.CName s, loc)
|
adamc@325
|
2634 | L'.CRecord (_, xcs) =>
|
adamc@325
|
2635 let
|
adamc@325
|
2636 fun fields xcs =
|
adamc@325
|
2637 case xcs of
|
adamc@325
|
2638 [] => SOME []
|
adamc@325
|
2639 | (x, t) :: xcs =>
|
adamc@325
|
2640 case (decompileCon env x, decompileCon env t, fields xcs) of
|
adamc@325
|
2641 (SOME x, SOME t, SOME xcs) => SOME ((x, t) :: xcs)
|
adamc@325
|
2642 | _ => NONE
|
adamc@325
|
2643 in
|
adamc@325
|
2644 Option.map (fn xcs => (L.CRecord xcs, loc))
|
adamc@325
|
2645 (fields xcs)
|
adamc@325
|
2646 end
|
adamc@325
|
2647 | L'.CConcat (c1, c2) =>
|
adamc@325
|
2648 (case (decompileCon env c1, decompileCon env c2) of
|
adamc@325
|
2649 (SOME c1, SOME c2) => SOME (L.CConcat (c1, c2), loc)
|
adamc@325
|
2650 | _ => NONE)
|
adamc@325
|
2651 | L'.CUnit => SOME (L.CUnit, loc)
|
adamc@325
|
2652
|
adamc@325
|
2653 | _ => NONE
|
adamc@325
|
2654
|
adamc@325
|
2655 val (needed, constraints, _) =
|
adamc@325
|
2656 foldl (fn ((sgi, loc), (needed, constraints, env')) =>
|
adamc@325
|
2657 let
|
adamc@325
|
2658 val (needed, constraints) =
|
adamc@325
|
2659 case sgi of
|
adamc@325
|
2660 L'.SgiConAbs (x, _, _) => (SS.add (needed, x), constraints)
|
adamc@325
|
2661 | L'.SgiConstraint cs => (needed, (env', cs, loc) :: constraints)
|
adamc@325
|
2662 | _ => (needed, constraints)
|
adamc@325
|
2663 in
|
adamc@325
|
2664 (needed, constraints, E.sgiBinds env' (sgi, loc))
|
adamc@325
|
2665 end)
|
adamc@325
|
2666 (SS.empty, [], env) sgis
|
adamc@325
|
2667
|
adamc@325
|
2668 val needed = foldl (fn ((d, _), needed) =>
|
adamc@325
|
2669 case d of
|
adamc@325
|
2670 L.DCon (x, _, _) => (SS.delete (needed, x)
|
adamc@325
|
2671 handle NotFound =>
|
adamc@325
|
2672 needed)
|
adamc@325
|
2673 | L.DClass (x, _) => (SS.delete (needed, x)
|
adamc@325
|
2674 handle NotFound => needed)
|
adamc@325
|
2675 | L.DOpen _ => SS.empty
|
adamc@325
|
2676 | _ => needed)
|
adamc@325
|
2677 needed ds
|
adamc@325
|
2678
|
adamc@325
|
2679 val cds = List.mapPartial (fn (env', (c1, c2), loc) =>
|
adamc@325
|
2680 case (decompileCon env' c1, decompileCon env' c2) of
|
adamc@325
|
2681 (SOME c1, SOME c2) =>
|
adamc@325
|
2682 SOME (L.DConstraint (c1, c2), loc)
|
adamc@325
|
2683 | _ => NONE) constraints
|
adamc@325
|
2684 in
|
adamc@325
|
2685 case SS.listItems needed of
|
adamc@325
|
2686 [] => (L.StrConst (ds @ cds), #2 str)
|
adamc@325
|
2687 | xs =>
|
adamc@325
|
2688 let
|
adamc@325
|
2689 val kwild = (L.KWild, #2 str)
|
adamc@325
|
2690 val cwild = (L.CWild kwild, #2 str)
|
adamc@325
|
2691 val ds' = map (fn x => (L.DCon (x, NONE, cwild), #2 str)) xs
|
adamc@325
|
2692 in
|
adamc@325
|
2693 (L.StrConst (ds @ ds' @ cds), #2 str)
|
adamc@325
|
2694 end
|
adamc@325
|
2695 end
|
adamc@325
|
2696 | _ => str)
|
adamc@325
|
2697 | _ => str
|
adamc@325
|
2698
|
adamc@334
|
2699 val makeInstantiable =
|
adamc@334
|
2700 let
|
adamc@334
|
2701 fun kind k = k
|
adamc@334
|
2702 fun con c =
|
adamc@334
|
2703 case c of
|
adamc@345
|
2704 L'.CDisjoint (L'.LeaveAlone, c1, c2, c) => L'.CDisjoint (L'.Instantiate, c1, c2, c)
|
adamc@334
|
2705 | _ => c
|
adamc@334
|
2706 in
|
adamc@334
|
2707 U.Con.map {kind = kind, con = con}
|
adamc@334
|
2708 end
|
adamc@334
|
2709
|
adamc@280
|
2710 fun elabDecl (dAll as (d, loc), (env, denv, gs : constraint list)) =
|
adamc@255
|
2711 let
|
adamc@255
|
2712 (*val () = preface ("elabDecl", SourcePrint.p_decl (d, loc))*)
|
adamc@255
|
2713
|
adamc@255
|
2714 val r =
|
adamc@255
|
2715 case d of
|
adamc@255
|
2716 L.DCon (x, ko, c) =>
|
adamc@255
|
2717 let
|
adamc@255
|
2718 val k' = case ko of
|
adamc@255
|
2719 NONE => kunif loc
|
adamc@255
|
2720 | SOME k => elabKind k
|
adamc@255
|
2721
|
adamc@255
|
2722 val (c', ck, gs') = elabCon (env, denv) c
|
adamc@255
|
2723 val (env', n) = E.pushCNamed env x k' (SOME c')
|
adamc@255
|
2724 in
|
adamc@255
|
2725 checkKind env c' ck k';
|
adamc@255
|
2726
|
adamc@255
|
2727 ([(L'.DCon (x, n, k', c'), loc)], (env', denv, enD gs' @ gs))
|
adamc@255
|
2728 end
|
adamc@255
|
2729 | L.DDatatype (x, xs, xcs) =>
|
adamc@255
|
2730 let
|
adamc@312
|
2731 val positive = List.all (fn (_, to) =>
|
adamc@312
|
2732 case to of
|
adamc@312
|
2733 NONE => true
|
adamc@312
|
2734 | SOME t => positive x t) xcs
|
adamc@312
|
2735
|
adamc@255
|
2736 val k = (L'.KType, loc)
|
adamc@255
|
2737 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
|
adamc@255
|
2738 val (env, n) = E.pushCNamed env x k' NONE
|
adamc@255
|
2739 val t = (L'.CNamed n, loc)
|
adamc@255
|
2740 val nxs = length xs - 1
|
adamc@255
|
2741 val t = ListUtil.foldli (fn (i, _, t) => (L'.CApp (t, (L'.CRel (nxs - i), loc)), loc)) t xs
|
adamc@255
|
2742
|
adamc@255
|
2743 val (env', denv') = foldl (fn (x, (env', denv')) =>
|
adamc@255
|
2744 (E.pushCRel env' x k,
|
adamc@255
|
2745 D.enter denv')) (env, denv) xs
|
adamc@255
|
2746
|
adamc@255
|
2747 val (xcs, (used, env, gs')) =
|
adamc@255
|
2748 ListUtil.foldlMap
|
adamc@255
|
2749 (fn ((x, to), (used, env, gs)) =>
|
adamc@255
|
2750 let
|
adamc@255
|
2751 val (to, t, gs') = case to of
|
adamc@255
|
2752 NONE => (NONE, t, gs)
|
adamc@255
|
2753 | SOME t' =>
|
adamc@255
|
2754 let
|
adamc@255
|
2755 val (t', tk, gs') = elabCon (env', denv') t'
|
adamc@255
|
2756 in
|
adamc@255
|
2757 checkKind env' t' tk k;
|
adamc@255
|
2758 (SOME t', (L'.TFun (t', t), loc), enD gs' @ gs)
|
adamc@255
|
2759 end
|
adamc@255
|
2760 val t = foldr (fn (x, t) => (L'.TCFun (L'.Implicit, x, k, t), loc)) t xs
|
adamc@255
|
2761
|
adamc@255
|
2762 val (env, n') = E.pushENamed env x t
|
adamc@255
|
2763 in
|
adamc@255
|
2764 if SS.member (used, x) then
|
adamc@255
|
2765 strError env (DuplicateConstructor (x, loc))
|
adamc@255
|
2766 else
|
adamc@255
|
2767 ();
|
adamc@255
|
2768 ((x, n', to), (SS.add (used, x), env, gs'))
|
adamc@255
|
2769 end)
|
adamc@255
|
2770 (SS.empty, env, []) xcs
|
adamc@255
|
2771
|
adamc@255
|
2772 val env = E.pushDatatype env n xs xcs
|
adamc@312
|
2773 val d' = (L'.DDatatype (x, n, xs, xcs), loc)
|
adamc@255
|
2774 in
|
adamc@312
|
2775 if positive then
|
adamc@312
|
2776 ()
|
adamc@312
|
2777 else
|
adamc@312
|
2778 declError env (Nonpositive d');
|
adamc@312
|
2779
|
adamc@312
|
2780 ([d'], (env, denv, gs' @ gs))
|
adamc@255
|
2781 end
|
adamc@255
|
2782
|
adamc@255
|
2783 | L.DDatatypeImp (_, [], _) => raise Fail "Empty DDatatypeImp"
|
adamc@255
|
2784
|
adamc@255
|
2785 | L.DDatatypeImp (x, m1 :: ms, s) =>
|
adamc@255
|
2786 (case E.lookupStr env m1 of
|
adamc@255
|
2787 NONE => (expError env (UnboundStrInExp (loc, m1));
|
adamc@255
|
2788 ([], (env, denv, gs)))
|
adamc@255
|
2789 | SOME (n, sgn) =>
|
adamc@255
|
2790 let
|
adamc@255
|
2791 val (str, sgn) = foldl (fn (m, (str, sgn)) =>
|
adamc@255
|
2792 case E.projectStr env {sgn = sgn, str = str, field = m} of
|
adamc@255
|
2793 NONE => (conError env (UnboundStrInCon (loc, m));
|
adamc@255
|
2794 (strerror, sgnerror))
|
adamc@255
|
2795 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
|
adamc@255
|
2796 ((L'.StrVar n, loc), sgn) ms
|
adamc@255
|
2797 in
|
adamc@255
|
2798 case hnormCon (env, denv) (L'.CModProj (n, ms, s), loc) of
|
adamc@255
|
2799 ((L'.CModProj (n, ms, s), _), gs') =>
|
adamc@255
|
2800 (case E.projectDatatype env {sgn = sgn, str = str, field = s} of
|
adamc@255
|
2801 NONE => (conError env (UnboundDatatype (loc, s));
|
adamc@255
|
2802 ([], (env, denv, gs)))
|
adamc@255
|
2803 | SOME (xs, xncs) =>
|
adamc@255
|
2804 let
|
adamc@255
|
2805 val k = (L'.KType, loc)
|
adamc@255
|
2806 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
|
adamc@255
|
2807 val t = (L'.CModProj (n, ms, s), loc)
|
adamc@255
|
2808 val (env, n') = E.pushCNamed env x k' (SOME t)
|
adamc@255
|
2809 val env = E.pushDatatype env n' xs xncs
|
adamc@255
|
2810
|
adamc@255
|
2811 val t = (L'.CNamed n', loc)
|
adamc@255
|
2812 val env = foldl (fn ((x, n, to), env) =>
|
adamc@255
|
2813 let
|
adamc@255
|
2814 val t = case to of
|
adamc@255
|
2815 NONE => t
|
adamc@255
|
2816 | SOME t' => (L'.TFun (t', t), loc)
|
adamc@255
|
2817
|
adamc@255
|
2818 val t = foldr (fn (x, t) =>
|
adamc@255
|
2819 (L'.TCFun (L'.Implicit, x, k, t), loc))
|
adamc@255
|
2820 t xs
|
adamc@255
|
2821 in
|
adamc@255
|
2822 E.pushENamedAs env x n t
|
adamc@255
|
2823 end) env xncs
|
adamc@255
|
2824 in
|
adamc@255
|
2825 ([(L'.DDatatypeImp (x, n', n, ms, s, xs, xncs), loc)], (env, denv, enD gs' @ gs))
|
adamc@255
|
2826 end)
|
adamc@255
|
2827 | _ => (strError env (NotDatatype loc);
|
adamc@255
|
2828 ([], (env, denv, [])))
|
adamc@255
|
2829 end)
|
adamc@255
|
2830
|
adamc@255
|
2831 | L.DVal (x, co, e) =>
|
adamc@255
|
2832 let
|
adamc@255
|
2833 val (c', _, gs1) = case co of
|
adamc@255
|
2834 NONE => (cunif (loc, ktype), ktype, [])
|
adamc@255
|
2835 | SOME c => elabCon (env, denv) c
|
adamc@255
|
2836
|
adamc@255
|
2837 val (e', et, gs2) = elabExp (env, denv) e
|
adamc@255
|
2838 val gs3 = checkCon (env, denv) e' et c'
|
adamc@255
|
2839 val (c', gs4) = normClassConstraint (env, denv) c'
|
adamc@255
|
2840 val (env', n) = E.pushENamed env x c'
|
adamc@334
|
2841 val c' = makeInstantiable c'
|
adamc@255
|
2842 in
|
adamc@255
|
2843 (*prefaces "DVal" [("x", Print.PD.string x),
|
adamc@255
|
2844 ("c'", p_con env c')];*)
|
adamc@255
|
2845 ([(L'.DVal (x, n, c', e'), loc)], (env', denv, enD gs1 @ gs2 @ enD gs3 @ enD gs4 @ gs))
|
adamc@255
|
2846 end
|
adamc@255
|
2847 | L.DValRec vis =>
|
adamc@255
|
2848 let
|
adamc@255
|
2849 fun allowable (e, _) =
|
adamc@255
|
2850 case e of
|
adamc@255
|
2851 L.EAbs _ => true
|
adamc@255
|
2852 | L.ECAbs (_, _, _, e) => allowable e
|
adamc@255
|
2853 | L.EDisjoint (_, _, e) => allowable e
|
adamc@255
|
2854 | _ => false
|
adamc@255
|
2855
|
adamc@255
|
2856 val (vis, gs) = ListUtil.foldlMap
|
adamc@255
|
2857 (fn ((x, co, e), gs) =>
|
adamc@255
|
2858 let
|
adamc@255
|
2859 val (c', _, gs1) = case co of
|
adamc@255
|
2860 NONE => (cunif (loc, ktype), ktype, [])
|
adamc@255
|
2861 | SOME c => elabCon (env, denv) c
|
adamc@255
|
2862 in
|
adamc@255
|
2863 ((x, c', e), enD gs1 @ gs)
|
adamc@280
|
2864 end) gs vis
|
adamc@255
|
2865
|
adamc@255
|
2866 val (vis, env) = ListUtil.foldlMap (fn ((x, c', e), env) =>
|
adamc@255
|
2867 let
|
adamc@255
|
2868 val (env, n) = E.pushENamed env x c'
|
adamc@255
|
2869 in
|
adamc@255
|
2870 ((x, n, c', e), env)
|
adamc@255
|
2871 end) env vis
|
adamc@255
|
2872
|
adamc@255
|
2873 val (vis, gs) = ListUtil.foldlMap (fn ((x, n, c', e), gs) =>
|
adamc@255
|
2874 let
|
adamc@255
|
2875 val (e', et, gs1) = elabExp (env, denv) e
|
adamc@255
|
2876
|
adamc@255
|
2877 val gs2 = checkCon (env, denv) e' et c'
|
adamc@334
|
2878
|
adamc@334
|
2879 val c' = makeInstantiable c'
|
adamc@255
|
2880 in
|
adamc@255
|
2881 if allowable e then
|
adamc@255
|
2882 ()
|
adamc@255
|
2883 else
|
adamc@255
|
2884 expError env (IllegalRec (x, e'));
|
adamc@255
|
2885 ((x, n, c', e'), gs1 @ enD gs2 @ gs)
|
adamc@255
|
2886 end) gs vis
|
adamc@255
|
2887 in
|
adamc@255
|
2888 ([(L'.DValRec vis, loc)], (env, denv, gs))
|
adamc@255
|
2889 end
|
adamc@255
|
2890
|
adamc@255
|
2891 | L.DSgn (x, sgn) =>
|
adamc@255
|
2892 let
|
adamc@255
|
2893 val (sgn', gs') = elabSgn (env, denv) sgn
|
adamc@255
|
2894 val (env', n) = E.pushSgnNamed env x sgn'
|
adamc@255
|
2895 in
|
adamc@255
|
2896 ([(L'.DSgn (x, n, sgn'), loc)], (env', denv, enD gs' @ gs))
|
adamc@255
|
2897 end
|
adamc@255
|
2898
|
adamc@255
|
2899 | L.DStr (x, sgno, str) =>
|
adamc@255
|
2900 let
|
adamc@255
|
2901 val () = if x = "Basis" then
|
adamc@255
|
2902 raise Fail "Not allowed to redefine structure 'Basis'"
|
adamc@255
|
2903 else
|
adamc@255
|
2904 ()
|
adamc@255
|
2905
|
adamc@255
|
2906 val formal = Option.map (elabSgn (env, denv)) sgno
|
adamc@255
|
2907
|
adamc@255
|
2908 val (str', sgn', gs') =
|
adamc@255
|
2909 case formal of
|
adamc@255
|
2910 NONE =>
|
adamc@255
|
2911 let
|
adamc@255
|
2912 val (str', actual, gs') = elabStr (env, denv) str
|
adamc@255
|
2913 in
|
adamc@255
|
2914 (str', selfifyAt env {str = str', sgn = actual}, gs')
|
adamc@255
|
2915 end
|
adamc@255
|
2916 | SOME (formal, gs1) =>
|
adamc@255
|
2917 let
|
adamc@325
|
2918 val str = wildifyStr env (str, formal)
|
adamc@255
|
2919 val (str', actual, gs2) = elabStr (env, denv) str
|
adamc@255
|
2920 in
|
adamc@255
|
2921 subSgn (env, denv) (selfifyAt env {str = str', sgn = actual}) formal;
|
adamc@255
|
2922 (str', formal, enD gs1 @ gs2)
|
adamc@255
|
2923 end
|
adamc@255
|
2924
|
adamc@255
|
2925 val (env', n) = E.pushStrNamed env x sgn'
|
adamc@255
|
2926 in
|
adamc@255
|
2927 case #1 (hnormSgn env sgn') of
|
adamc@255
|
2928 L'.SgnFun _ =>
|
adamc@255
|
2929 (case #1 str' of
|
adamc@255
|
2930 L'.StrFun _ => ()
|
adamc@255
|
2931 | _ => strError env (FunctorRebind loc))
|
adamc@255
|
2932 | _ => ();
|
adamc@255
|
2933
|
adamc@255
|
2934 ([(L'.DStr (x, n, sgn', str'), loc)], (env', denv, gs' @ gs))
|
adamc@255
|
2935 end
|
adamc@255
|
2936
|
adamc@255
|
2937 | L.DFfiStr (x, sgn) =>
|
adamc@255
|
2938 let
|
adamc@255
|
2939 val (sgn', gs') = elabSgn (env, denv) sgn
|
adamc@255
|
2940
|
adamc@255
|
2941 val (env', n) = E.pushStrNamed env x sgn'
|
adamc@255
|
2942 in
|
adamc@255
|
2943 ([(L'.DFfiStr (x, n, sgn'), loc)], (env', denv, enD gs' @ gs))
|
adamc@255
|
2944 end
|
adamc@255
|
2945
|
adamc@255
|
2946 | L.DOpen (m, ms) =>
|
adamc@255
|
2947 (case E.lookupStr env m of
|
adamc@255
|
2948 NONE => (strError env (UnboundStr (loc, m));
|
adamc@255
|
2949 ([], (env, denv, gs)))
|
adamc@255
|
2950 | SOME (n, sgn) =>
|
adamc@255
|
2951 let
|
adamc@255
|
2952 val (_, sgn) = foldl (fn (m, (str, sgn)) =>
|
adamc@255
|
2953 case E.projectStr env {str = str, sgn = sgn, field = m} of
|
adamc@255
|
2954 NONE => (strError env (UnboundStr (loc, m));
|
adamc@255
|
2955 (strerror, sgnerror))
|
adamc@255
|
2956 | SOME sgn => ((L'.StrProj (str, m), loc), sgn))
|
adamc@255
|
2957 ((L'.StrVar n, loc), sgn) ms
|
adamc@255
|
2958
|
adamc@255
|
2959 val (ds, (env', denv')) = dopen (env, denv) {str = n, strs = ms, sgn = sgn}
|
adamc@255
|
2960 val denv' = dopenConstraints (loc, env', denv') {str = m, strs = ms}
|
adamc@255
|
2961 in
|
adamc@255
|
2962 (ds, (env', denv', gs))
|
adamc@255
|
2963 end)
|
adamc@255
|
2964
|
adamc@255
|
2965 | L.DConstraint (c1, c2) =>
|
adamc@255
|
2966 let
|
adamc@255
|
2967 val (c1', k1, gs1) = elabCon (env, denv) c1
|
adamc@255
|
2968 val (c2', k2, gs2) = elabCon (env, denv) c2
|
adamc@255
|
2969 val gs3 = D.prove env denv (c1', c2', loc)
|
adamc@255
|
2970
|
adamc@255
|
2971 val (denv', gs4) = D.assert env denv (c1', c2')
|
adamc@255
|
2972 in
|
adamc@255
|
2973 checkKind env c1' k1 (L'.KRecord (kunif loc), loc);
|
adamc@255
|
2974 checkKind env c2' k2 (L'.KRecord (kunif loc), loc);
|
adamc@255
|
2975
|
adamc@255
|
2976 ([(L'.DConstraint (c1', c2'), loc)], (env, denv', enD gs1 @ enD gs2 @ enD gs3 @ enD gs4 @ gs))
|
adamc@255
|
2977 end
|
adamc@255
|
2978
|
adamc@255
|
2979 | L.DOpenConstraints (m, ms) =>
|
adamc@255
|
2980 let
|
adamc@255
|
2981 val denv = dopenConstraints (loc, env, denv) {str = m, strs = ms}
|
adamc@255
|
2982 in
|
adamc@255
|
2983 ([], (env, denv, gs))
|
adamc@255
|
2984 end
|
adamc@255
|
2985
|
adamc@255
|
2986 | L.DExport str =>
|
adamc@255
|
2987 let
|
adamc@255
|
2988 val (str', sgn, gs') = elabStr (env, denv) str
|
adamc@255
|
2989
|
adamc@255
|
2990 val sgn =
|
adamc@255
|
2991 case #1 (hnormSgn env sgn) of
|
adamc@255
|
2992 L'.SgnConst sgis =>
|
adamc@255
|
2993 let
|
adamc@255
|
2994 fun doOne (all as (sgi, _), env) =
|
adamc@255
|
2995 (case sgi of
|
adamc@255
|
2996 L'.SgiVal (x, n, t) =>
|
adamc@325
|
2997 let
|
adamc@325
|
2998 fun doPage (makeRes, ran) =
|
adamc@325
|
2999 case hnormCon (env, denv) ran of
|
adamc@325
|
3000 ((L'.CApp (tf, arg), _), []) =>
|
adamc@325
|
3001 (case (hnormCon (env, denv) tf, hnormCon (env, denv) arg) of
|
adamc@325
|
3002 (((L'.CModProj (basis, [], "transaction"), _), []),
|
adamc@325
|
3003 ((L'.CApp (tf, arg3), _), [])) =>
|
adamc@325
|
3004 (case (basis = !basis_r,
|
adamc@325
|
3005 hnormCon (env, denv) tf, hnormCon (env, denv) arg3) of
|
adamc@325
|
3006 (true,
|
adamc@325
|
3007 ((L'.CApp (tf, arg2), _), []),
|
adamc@325
|
3008 (((L'.CRecord (_, []), _), []))) =>
|
adamc@325
|
3009 (case (hnormCon (env, denv) tf) of
|
adamc@325
|
3010 ((L'.CApp (tf, arg1), _), []) =>
|
adamc@325
|
3011 (case (hnormCon (env, denv) tf,
|
adamc@325
|
3012 hnormCon (env, denv) arg1,
|
adamc@325
|
3013 hnormCon (env, denv) arg2) of
|
adamc@325
|
3014 ((tf, []), (arg1, []),
|
adamc@325
|
3015 ((L'.CRecord (_, []), _), [])) =>
|
adamc@325
|
3016 let
|
adamc@325
|
3017 val t = (L'.CApp (tf, arg1), loc)
|
adamc@325
|
3018 val t = (L'.CApp (t, arg2), loc)
|
adamc@325
|
3019 val t = (L'.CApp (t, arg3), loc)
|
adamc@325
|
3020 val t = (L'.CApp (
|
adamc@325
|
3021 (L'.CModProj
|
adamc@325
|
3022 (basis, [], "transaction"), loc),
|
adamc@325
|
3023 t), loc)
|
adamc@325
|
3024 in
|
adamc@325
|
3025 (L'.SgiVal (x, n, makeRes t), loc)
|
adamc@325
|
3026 end
|
adamc@325
|
3027 | _ => all)
|
adamc@325
|
3028 | _ => all)
|
adamc@325
|
3029 | _ => all)
|
adamc@325
|
3030 | _ => all)
|
adamc@325
|
3031 | _ => all
|
adamc@325
|
3032 in
|
adamc@325
|
3033 case hnormCon (env, denv) t of
|
adamc@325
|
3034 ((L'.TFun (dom, ran), _), []) =>
|
adamc@325
|
3035 (case hnormCon (env, denv) dom of
|
adamc@325
|
3036 ((L'.TRecord domR, _), []) =>
|
adamc@325
|
3037 doPage (fn t => (L'.TFun ((L'.TRecord domR,
|
adamc@325
|
3038 loc),
|
adamc@325
|
3039 t), loc), ran)
|
adamc@325
|
3040 | _ => all)
|
adamc@325
|
3041 | _ => doPage (fn t => t, t)
|
adamc@325
|
3042 end
|
adamc@255
|
3043 | _ => all,
|
adamc@255
|
3044 E.sgiBinds env all)
|
adamc@255
|
3045 in
|
adamc@255
|
3046 (L'.SgnConst (#1 (ListUtil.foldlMap doOne env sgis)), loc)
|
adamc@255
|
3047 end
|
adamc@255
|
3048 | _ => sgn
|
adamc@255
|
3049 in
|
adamc@255
|
3050 ([(L'.DExport (E.newNamed (), sgn, str'), loc)], (env, denv, gs' @ gs))
|
adamc@255
|
3051 end
|
adamc@255
|
3052
|
adamc@255
|
3053 | L.DTable (x, c) =>
|
adamc@255
|
3054 let
|
adamc@255
|
3055 val (c', k, gs') = elabCon (env, denv) c
|
adamc@255
|
3056 val (env, n) = E.pushENamed env x (L'.CApp (tableOf (), c'), loc)
|
adamc@255
|
3057 in
|
adamc@255
|
3058 checkKind env c' k (L'.KRecord (L'.KType, loc), loc);
|
adamc@255
|
3059 ([(L'.DTable (!basis_r, x, n, c'), loc)], (env, denv, enD gs' @ gs))
|
adamc@255
|
3060 end
|
adamc@338
|
3061 | L.DSequence x =>
|
adamc@338
|
3062 let
|
adamc@338
|
3063 val (env, n) = E.pushENamed env x (sequenceOf ())
|
adamc@338
|
3064 in
|
adamc@338
|
3065 ([(L'.DSequence (!basis_r, x, n), loc)], (env, denv, gs))
|
adamc@338
|
3066 end
|
adamc@255
|
3067
|
adamc@255
|
3068 | L.DClass (x, c) =>
|
adamc@255
|
3069 let
|
adamc@255
|
3070 val k = (L'.KArrow ((L'.KType, loc), (L'.KType, loc)), loc)
|
adamc@280
|
3071 val (c', ck, gs') = elabCon (env, denv) c
|
adamc@255
|
3072 val (env, n) = E.pushCNamed env x k (SOME c')
|
adamc@255
|
3073 val env = E.pushClass env n
|
adamc@255
|
3074 in
|
adamc@255
|
3075 checkKind env c' ck k;
|
adamc@280
|
3076 ([(L'.DClass (x, n, c'), loc)], (env, denv, enD gs' @ gs))
|
adamc@255
|
3077 end
|
adamc@271
|
3078
|
adamc@280
|
3079 | L.DDatabase s => ([(L'.DDatabase s, loc)], (env, denv, gs))
|
adamc@280
|
3080
|
adamc@280
|
3081 (*val tcs = List.filter (fn TypeClass _ => true | _ => false) (#3 (#2 r))*)
|
adamc@255
|
3082 in
|
adamc@280
|
3083 (*prefaces "elabDecl" [("e", SourcePrint.p_decl dAll),
|
adamc@280
|
3084 ("|tcs|", PD.string (Int.toString (length tcs)))];*)
|
adamc@280
|
3085
|
adamc@255
|
3086 r
|
adamc@255
|
3087 end
|
adamc@211
|
3088
|
adamc@83
|
3089 and elabStr (env, denv) (str, loc) =
|
adamc@31
|
3090 case str of
|
adamc@31
|
3091 L.StrConst ds =>
|
adamc@31
|
3092 let
|
adamc@88
|
3093 val (ds', (_, _, gs)) = ListUtil.foldlMapConcat elabDecl (env, denv, []) ds
|
adamc@123
|
3094 val sgis = ListUtil.mapConcat sgiOfDecl ds'
|
adamc@63
|
3095
|
adamc@63
|
3096 val (sgis, _, _, _, _) =
|
adamc@64
|
3097 foldr (fn ((sgi, loc), (sgis, cons, vals, sgns, strs)) =>
|
adamc@63
|
3098 case sgi of
|
adamc@64
|
3099 L'.SgiConAbs (x, n, k) =>
|
adamc@64
|
3100 let
|
adamc@64
|
3101 val (cons, x) =
|
adamc@64
|
3102 if SS.member (cons, x) then
|
adamc@64
|
3103 (cons, "?" ^ x)
|
adamc@64
|
3104 else
|
adamc@64
|
3105 (SS.add (cons, x), x)
|
adamc@64
|
3106 in
|
adamc@64
|
3107 ((L'.SgiConAbs (x, n, k), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@64
|
3108 end
|
adamc@64
|
3109 | L'.SgiCon (x, n, k, c) =>
|
adamc@64
|
3110 let
|
adamc@64
|
3111 val (cons, x) =
|
adamc@64
|
3112 if SS.member (cons, x) then
|
adamc@64
|
3113 (cons, "?" ^ x)
|
adamc@64
|
3114 else
|
adamc@64
|
3115 (SS.add (cons, x), x)
|
adamc@64
|
3116 in
|
adamc@64
|
3117 ((L'.SgiCon (x, n, k, c), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@64
|
3118 end
|
adamc@191
|
3119 | L'.SgiDatatype (x, n, xs, xncs) =>
|
adamc@156
|
3120 let
|
adamc@156
|
3121 val (cons, x) =
|
adamc@156
|
3122 if SS.member (cons, x) then
|
adamc@156
|
3123 (cons, "?" ^ x)
|
adamc@156
|
3124 else
|
adamc@156
|
3125 (SS.add (cons, x), x)
|
adamc@156
|
3126
|
adamc@156
|
3127 val (xncs, vals) =
|
adamc@156
|
3128 ListUtil.foldlMap
|
adamc@156
|
3129 (fn ((x, n, t), vals) =>
|
adamc@156
|
3130 if SS.member (vals, x) then
|
adamc@156
|
3131 (("?" ^ x, n, t), vals)
|
adamc@156
|
3132 else
|
adamc@156
|
3133 ((x, n, t), SS.add (vals, x)))
|
adamc@156
|
3134 vals xncs
|
adamc@156
|
3135 in
|
adamc@191
|
3136 ((L'.SgiDatatype (x, n, xs, xncs), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@156
|
3137 end
|
adamc@191
|
3138 | L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
|
adamc@156
|
3139 let
|
adamc@156
|
3140 val (cons, x) =
|
adamc@156
|
3141 if SS.member (cons, x) then
|
adamc@156
|
3142 (cons, "?" ^ x)
|
adamc@156
|
3143 else
|
adamc@156
|
3144 (SS.add (cons, x), x)
|
adamc@156
|
3145 in
|
adamc@191
|
3146 ((L'.SgiDatatypeImp (x, n, m1, ms, x', xs, xncs), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@156
|
3147 end
|
adamc@64
|
3148 | L'.SgiVal (x, n, c) =>
|
adamc@64
|
3149 let
|
adamc@64
|
3150 val (vals, x) =
|
adamc@64
|
3151 if SS.member (vals, x) then
|
adamc@64
|
3152 (vals, "?" ^ x)
|
adamc@64
|
3153 else
|
adamc@64
|
3154 (SS.add (vals, x), x)
|
adamc@64
|
3155 in
|
adamc@64
|
3156 ((L'.SgiVal (x, n, c), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@64
|
3157 end
|
adamc@64
|
3158 | L'.SgiSgn (x, n, sgn) =>
|
adamc@64
|
3159 let
|
adamc@64
|
3160 val (sgns, x) =
|
adamc@64
|
3161 if SS.member (sgns, x) then
|
adamc@64
|
3162 (sgns, "?" ^ x)
|
adamc@64
|
3163 else
|
adamc@64
|
3164 (SS.add (sgns, x), x)
|
adamc@64
|
3165 in
|
adamc@64
|
3166 ((L'.SgiSgn (x, n, sgn), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@64
|
3167 end
|
adamc@64
|
3168
|
adamc@64
|
3169 | L'.SgiStr (x, n, sgn) =>
|
adamc@64
|
3170 let
|
adamc@64
|
3171 val (strs, x) =
|
adamc@64
|
3172 if SS.member (strs, x) then
|
adamc@64
|
3173 (strs, "?" ^ x)
|
adamc@64
|
3174 else
|
adamc@64
|
3175 (SS.add (strs, x), x)
|
adamc@64
|
3176 in
|
adamc@64
|
3177 ((L'.SgiStr (x, n, sgn), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@88
|
3178 end
|
adamc@203
|
3179 | L'.SgiConstraint _ => ((sgi, loc) :: sgis, cons, vals, sgns, strs)
|
adamc@205
|
3180 | L'.SgiTable (tn, x, n, c) =>
|
adamc@203
|
3181 let
|
adamc@203
|
3182 val (vals, x) =
|
adamc@203
|
3183 if SS.member (vals, x) then
|
adamc@203
|
3184 (vals, "?" ^ x)
|
adamc@203
|
3185 else
|
adamc@203
|
3186 (SS.add (vals, x), x)
|
adamc@203
|
3187 in
|
adamc@205
|
3188 ((L'.SgiTable (tn, x, n, c), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@211
|
3189 end
|
adamc@338
|
3190 | L'.SgiSequence (tn, x, n) =>
|
adamc@338
|
3191 let
|
adamc@338
|
3192 val (vals, x) =
|
adamc@338
|
3193 if SS.member (vals, x) then
|
adamc@338
|
3194 (vals, "?" ^ x)
|
adamc@338
|
3195 else
|
adamc@338
|
3196 (SS.add (vals, x), x)
|
adamc@338
|
3197 in
|
adamc@338
|
3198 ((L'.SgiSequence (tn, x, n), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@338
|
3199 end
|
adamc@211
|
3200 | L'.SgiClassAbs (x, n) =>
|
adamc@211
|
3201 let
|
adamc@211
|
3202 val k = (L'.KArrow ((L'.KType, loc), (L'.KType, loc)), loc)
|
adamc@211
|
3203
|
adamc@211
|
3204 val (cons, x) =
|
adamc@211
|
3205 if SS.member (cons, x) then
|
adamc@211
|
3206 (cons, "?" ^ x)
|
adamc@211
|
3207 else
|
adamc@211
|
3208 (SS.add (cons, x), x)
|
adamc@211
|
3209 in
|
adamc@211
|
3210 ((L'.SgiClassAbs (x, n), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@211
|
3211 end
|
adamc@211
|
3212 | L'.SgiClass (x, n, c) =>
|
adamc@211
|
3213 let
|
adamc@211
|
3214 val k = (L'.KArrow ((L'.KType, loc), (L'.KType, loc)), loc)
|
adamc@211
|
3215
|
adamc@211
|
3216 val (cons, x) =
|
adamc@211
|
3217 if SS.member (cons, x) then
|
adamc@211
|
3218 (cons, "?" ^ x)
|
adamc@211
|
3219 else
|
adamc@211
|
3220 (SS.add (cons, x), x)
|
adamc@211
|
3221 in
|
adamc@211
|
3222 ((L'.SgiClass (x, n, c), loc) :: sgis, cons, vals, sgns, strs)
|
adamc@203
|
3223 end)
|
adamc@64
|
3224
|
adamc@63
|
3225 ([], SS.empty, SS.empty, SS.empty, SS.empty) sgis
|
adamc@31
|
3226 in
|
adamc@83
|
3227 ((L'.StrConst ds', loc), (L'.SgnConst sgis, loc), gs)
|
adamc@31
|
3228 end
|
adamc@31
|
3229 | L.StrVar x =>
|
adamc@31
|
3230 (case E.lookupStr env x of
|
adamc@31
|
3231 NONE =>
|
adamc@31
|
3232 (strError env (UnboundStr (loc, x));
|
adamc@83
|
3233 (strerror, sgnerror, []))
|
adamc@83
|
3234 | SOME (n, sgn) => ((L'.StrVar n, loc), sgn, []))
|
adamc@34
|
3235 | L.StrProj (str, x) =>
|
adamc@34
|
3236 let
|
adamc@83
|
3237 val (str', sgn, gs) = elabStr (env, denv) str
|
adamc@34
|
3238 in
|
adamc@34
|
3239 case E.projectStr env {str = str', sgn = sgn, field = x} of
|
adamc@34
|
3240 NONE => (strError env (UnboundStr (loc, x));
|
adamc@83
|
3241 (strerror, sgnerror, []))
|
adamc@83
|
3242 | SOME sgn => ((L'.StrProj (str', x), loc), sgn, gs)
|
adamc@34
|
3243 end
|
adamc@41
|
3244 | L.StrFun (m, dom, ranO, str) =>
|
adamc@41
|
3245 let
|
adamc@83
|
3246 val (dom', gs1) = elabSgn (env, denv) dom
|
adamc@41
|
3247 val (env', n) = E.pushStrNamed env m dom'
|
adamc@83
|
3248 val (str', actual, gs2) = elabStr (env', denv) str
|
adamc@41
|
3249
|
adamc@83
|
3250 val (formal, gs3) =
|
adamc@41
|
3251 case ranO of
|
adamc@83
|
3252 NONE => (actual, [])
|
adamc@41
|
3253 | SOME ran =>
|
adamc@41
|
3254 let
|
adamc@83
|
3255 val (ran', gs) = elabSgn (env', denv) ran
|
adamc@41
|
3256 in
|
adamc@86
|
3257 subSgn (env', denv) actual ran';
|
adamc@83
|
3258 (ran', gs)
|
adamc@41
|
3259 end
|
adamc@41
|
3260 in
|
adamc@41
|
3261 ((L'.StrFun (m, n, dom', formal, str'), loc),
|
adamc@83
|
3262 (L'.SgnFun (m, n, dom', formal), loc),
|
adamc@228
|
3263 enD gs1 @ gs2 @ enD gs3)
|
adamc@41
|
3264 end
|
adamc@44
|
3265 | L.StrApp (str1, str2) =>
|
adamc@44
|
3266 let
|
adamc@83
|
3267 val (str1', sgn1, gs1) = elabStr (env, denv) str1
|
adamc@325
|
3268 val str2 =
|
adamc@325
|
3269 case sgn1 of
|
adamc@325
|
3270 (L'.SgnFun (_, _, dom, _), _) =>
|
adamc@325
|
3271 wildifyStr env (str2, dom)
|
adamc@325
|
3272 | _ => str2
|
adamc@83
|
3273 val (str2', sgn2, gs2) = elabStr (env, denv) str2
|
adamc@44
|
3274 in
|
adamc@44
|
3275 case #1 (hnormSgn env sgn1) of
|
adamc@83
|
3276 L'.SgnError => (strerror, sgnerror, [])
|
adamc@44
|
3277 | L'.SgnFun (m, n, dom, ran) =>
|
adamc@86
|
3278 (subSgn (env, denv) sgn2 dom;
|
adamc@44
|
3279 case #1 (hnormSgn env ran) of
|
adamc@83
|
3280 L'.SgnError => (strerror, sgnerror, [])
|
adamc@44
|
3281 | L'.SgnConst sgis =>
|
adamc@44
|
3282 ((L'.StrApp (str1', str2'), loc),
|
adamc@83
|
3283 (L'.SgnConst ((L'.SgiStr (m, n, selfifyAt env {str = str2', sgn = sgn2}), loc) :: sgis), loc),
|
adamc@83
|
3284 gs1 @ gs2)
|
adamc@44
|
3285 | _ => raise Fail "Unable to hnormSgn in functor application")
|
adamc@44
|
3286 | _ => (strError env (NotFunctor sgn1);
|
adamc@83
|
3287 (strerror, sgnerror, []))
|
adamc@44
|
3288 end
|
adamc@31
|
3289
|
adamc@325
|
3290 fun elabFile basis topStr topSgn env file =
|
adamc@56
|
3291 let
|
adamc@83
|
3292 val (sgn, gs) = elabSgn (env, D.empty) (L.SgnConst basis, ErrorMsg.dummySpan)
|
adamc@83
|
3293 val () = case gs of
|
adamc@83
|
3294 [] => ()
|
adamc@207
|
3295 | _ => (app (fn (_, env, _, c1, c2) =>
|
adamc@207
|
3296 prefaces "Unresolved"
|
adamc@207
|
3297 [("c1", p_con env c1),
|
adamc@207
|
3298 ("c2", p_con env c2)]) gs;
|
adamc@207
|
3299 raise Fail "Unresolved disjointness constraints in Basis")
|
adamc@83
|
3300
|
adamc@56
|
3301 val (env', basis_n) = E.pushStrNamed env "Basis" sgn
|
adamc@210
|
3302 val () = basis_r := basis_n
|
adamc@56
|
3303
|
adamc@88
|
3304 val (ds, (env', _)) = dopen (env', D.empty) {str = basis_n, strs = [], sgn = sgn}
|
adamc@56
|
3305
|
adamc@56
|
3306 fun discoverC r x =
|
adamc@56
|
3307 case E.lookupC env' x of
|
adamc@56
|
3308 E.NotBound => raise Fail ("Constructor " ^ x ^ " unbound in Basis")
|
adamc@56
|
3309 | E.Rel _ => raise Fail ("Constructor " ^ x ^ " bound relatively in Basis")
|
adamc@56
|
3310 | E.Named (n, (_, loc)) => r := (L'.CNamed n, loc)
|
adamc@56
|
3311
|
adamc@56
|
3312 val () = discoverC int "int"
|
adamc@56
|
3313 val () = discoverC float "float"
|
adamc@56
|
3314 val () = discoverC string "string"
|
adamc@203
|
3315 val () = discoverC table "sql_table"
|
adamc@56
|
3316
|
adamc@325
|
3317 val (topSgn, gs) = elabSgn (env', D.empty) (L.SgnConst topSgn, ErrorMsg.dummySpan)
|
adamc@325
|
3318 val () = case gs of
|
adamc@325
|
3319 [] => ()
|
adamc@325
|
3320 | _ => raise Fail "Unresolved disjointness constraints in top.urs"
|
adamc@325
|
3321 val (topStr, topSgn', gs) = elabStr (env', D.empty) (L.StrConst topStr, ErrorMsg.dummySpan)
|
adamc@325
|
3322 val () = case gs of
|
adamc@325
|
3323 [] => ()
|
adamc@329
|
3324 | _ => app (fn Disjoint (loc, env, denv, c1, c2) =>
|
adamc@329
|
3325 (case D.prove env denv (c1, c2, loc) of
|
adamc@329
|
3326 [] => ()
|
adamc@329
|
3327 | _ =>
|
adamc@329
|
3328 (prefaces "Unresolved constraint in top.ur"
|
adamc@329
|
3329 [("loc", PD.string (ErrorMsg.spanToString loc)),
|
adamc@329
|
3330 ("c1", p_con env c1),
|
adamc@329
|
3331 ("c2", p_con env c2)];
|
adamc@329
|
3332 raise Fail "Unresolve constraint in top.ur"))
|
adamc@329
|
3333 | TypeClass _ => raise Fail "Unresolved type class constraint in top.ur") gs
|
adamc@325
|
3334 val () = subSgn (env', D.empty) topSgn' topSgn
|
adamc@325
|
3335
|
adamc@325
|
3336 val (env', top_n) = E.pushStrNamed env' "Top" topSgn
|
adamc@325
|
3337
|
adamc@325
|
3338 val (ds', (env', _)) = dopen (env', D.empty) {str = top_n, strs = [], sgn = topSgn}
|
adamc@325
|
3339
|
adamc@83
|
3340 fun elabDecl' (d, (env, gs)) =
|
adamc@76
|
3341 let
|
adamc@76
|
3342 val () = resetKunif ()
|
adamc@76
|
3343 val () = resetCunif ()
|
adamc@88
|
3344 val (ds, (env, _, gs)) = elabDecl (d, (env, D.empty, gs))
|
adamc@76
|
3345 in
|
adamc@76
|
3346 if ErrorMsg.anyErrors () then
|
adamc@76
|
3347 ()
|
adamc@76
|
3348 else (
|
adamc@76
|
3349 if List.exists kunifsInDecl ds then
|
adamc@91
|
3350 declError env (KunifsRemain ds)
|
adamc@76
|
3351 else
|
adamc@76
|
3352 ();
|
adamc@76
|
3353
|
adamc@76
|
3354 case ListUtil.search cunifsInDecl ds of
|
adamc@76
|
3355 NONE => ()
|
adamc@76
|
3356 | SOME loc =>
|
adamc@91
|
3357 declError env (CunifsRemain ds)
|
adamc@76
|
3358 );
|
adamc@76
|
3359
|
adamc@83
|
3360 (ds, (env, gs))
|
adamc@76
|
3361 end
|
adamc@76
|
3362
|
adamc@83
|
3363 val (file, (_, gs)) = ListUtil.foldlMapConcat elabDecl' (env', []) file
|
adamc@56
|
3364 in
|
adamc@84
|
3365 if ErrorMsg.anyErrors () then
|
adamc@84
|
3366 ()
|
adamc@84
|
3367 else
|
adamc@228
|
3368 app (fn Disjoint (loc, env, denv, c1, c2) =>
|
adamc@228
|
3369 (case D.prove env denv (c1, c2, loc) of
|
adamc@228
|
3370 [] => ()
|
adamc@228
|
3371 | _ =>
|
adamc@228
|
3372 (ErrorMsg.errorAt loc "Couldn't prove field name disjointness";
|
adamc@228
|
3373 eprefaces' [("Con 1", p_con env c1),
|
adamc@228
|
3374 ("Con 2", p_con env c2),
|
adamc@228
|
3375 ("Hnormed 1", p_con env (ElabOps.hnormCon env c1)),
|
adamc@228
|
3376 ("Hnormed 2", p_con env (ElabOps.hnormCon env c2))]))
|
adamc@228
|
3377 | TypeClass (env, c, r, loc) =>
|
adamc@228
|
3378 case E.resolveClass env c of
|
adamc@228
|
3379 SOME e => r := SOME e
|
adamc@228
|
3380 | NONE => expError env (Unresolvable (loc, c))) gs;
|
adamc@83
|
3381
|
adamc@325
|
3382 (L'.DFfiStr ("Basis", basis_n, sgn), ErrorMsg.dummySpan)
|
adamc@325
|
3383 :: ds
|
adamc@325
|
3384 @ (L'.DStr ("Top", top_n, topSgn, topStr), ErrorMsg.dummySpan)
|
adamc@325
|
3385 :: ds' @ file
|
adamc@56
|
3386 end
|
adamc@2
|
3387
|
adamc@2
|
3388 end
|