adamc@674
|
1 (* Copyright (c) 2008-2009, 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 ElabEnv :> ELAB_ENV = struct
|
adamc@2
|
29
|
adamc@2
|
30 open Elab
|
adamc@2
|
31
|
adamc@13
|
32 structure U = ElabUtil
|
adamc@13
|
33
|
adamc@2
|
34 structure IM = IntBinaryMap
|
adamc@2
|
35 structure SM = BinaryMapFn(struct
|
adamc@2
|
36 type ord_key = string
|
adamc@2
|
37 val compare = String.compare
|
adamc@2
|
38 end)
|
adamc@2
|
39
|
adamc@2
|
40 exception UnboundRel of int
|
adamc@2
|
41 exception UnboundNamed of int
|
adamc@2
|
42
|
adamc@13
|
43
|
adamc@13
|
44 (* AST utility functions *)
|
adamc@13
|
45
|
adamc@623
|
46 val liftKindInKind =
|
adamc@623
|
47 U.Kind.mapB {kind = fn bound => fn k =>
|
adamc@623
|
48 case k of
|
adamc@623
|
49 KRel xn =>
|
adamc@623
|
50 if xn < bound then
|
adamc@623
|
51 k
|
adamc@623
|
52 else
|
adamc@623
|
53 KRel (xn + 1)
|
adamc@623
|
54 | _ => k,
|
adamc@623
|
55 bind = fn (bound, _) => bound + 1}
|
adamc@623
|
56
|
adamc@623
|
57 val liftKindInCon =
|
adamc@623
|
58 U.Con.mapB {kind = fn bound => fn k =>
|
adamc@623
|
59 case k of
|
adamc@623
|
60 KRel xn =>
|
adamc@623
|
61 if xn < bound then
|
adamc@623
|
62 k
|
adamc@623
|
63 else
|
adamc@623
|
64 KRel (xn + 1)
|
adamc@623
|
65 | _ => k,
|
adamc@623
|
66 con = fn _ => fn c => c,
|
adamc@623
|
67 bind = fn (bound, U.Con.RelK _) => bound + 1
|
adamc@623
|
68 | (bound, _) => bound}
|
adamc@623
|
69
|
adamc@13
|
70 val liftConInCon =
|
adamc@623
|
71 U.Con.mapB {kind = fn _ => fn k => k,
|
adamc@13
|
72 con = fn bound => fn c =>
|
adamc@13
|
73 case c of
|
adamc@16
|
74 CRel xn =>
|
adamc@13
|
75 if xn < bound then
|
adamc@13
|
76 c
|
adamc@13
|
77 else
|
adamc@16
|
78 CRel (xn + 1)
|
adam@1303
|
79 | CUnif (nl, loc, k, s, r) => CUnif (nl+1, loc, k, s, r)
|
adamc@13
|
80 | _ => c,
|
adamc@623
|
81 bind = fn (bound, U.Con.RelC _) => bound + 1
|
adamc@13
|
82 | (bound, _) => bound}
|
adamc@13
|
83
|
adamc@13
|
84 val lift = liftConInCon 0
|
adamc@13
|
85
|
adam@1303
|
86 fun mliftConInCon by c =
|
adam@1303
|
87 if by = 0 then
|
adam@1303
|
88 c
|
adam@1303
|
89 else
|
adam@1303
|
90 U.Con.mapB {kind = fn _ => fn k => k,
|
adam@1303
|
91 con = fn bound => fn c =>
|
adam@1303
|
92 case c of
|
adam@1303
|
93 CRel xn =>
|
adam@1303
|
94 if xn < bound then
|
adam@1303
|
95 c
|
adam@1303
|
96 else
|
adam@1303
|
97 CRel (xn + by)
|
adam@1303
|
98 | CUnif (nl, loc, k, s, r) => CUnif (nl+by, loc, k, s, r)
|
adam@1303
|
99 | _ => c,
|
adam@1303
|
100 bind = fn (bound, U.Con.RelC _) => bound + 1
|
adam@1303
|
101 | (bound, _) => bound} 0 c
|
adam@1303
|
102
|
adam@1303
|
103 val () = U.mliftConInCon := mliftConInCon
|
adam@1303
|
104
|
adamc@623
|
105 val liftKindInExp =
|
adamc@623
|
106 U.Exp.mapB {kind = fn bound => fn k =>
|
adamc@623
|
107 case k of
|
adamc@623
|
108 KRel xn =>
|
adamc@623
|
109 if xn < bound then
|
adamc@623
|
110 k
|
adamc@623
|
111 else
|
adamc@623
|
112 KRel (xn + 1)
|
adamc@623
|
113 | _ => k,
|
adamc@623
|
114 con = fn _ => fn c => c,
|
adamc@623
|
115 exp = fn _ => fn e => e,
|
adamc@623
|
116 bind = fn (bound, U.Exp.RelK _) => bound + 1
|
adamc@623
|
117 | (bound, _) => bound}
|
adamc@623
|
118
|
adamc@448
|
119 val liftConInExp =
|
adamc@623
|
120 U.Exp.mapB {kind = fn _ => fn k => k,
|
adamc@448
|
121 con = fn bound => fn c =>
|
adamc@448
|
122 case c of
|
adamc@448
|
123 CRel xn =>
|
adamc@448
|
124 if xn < bound then
|
adamc@448
|
125 c
|
adamc@448
|
126 else
|
adamc@448
|
127 CRel (xn + 1)
|
adam@1303
|
128 | CUnif (nl, loc, k, s, r) => CUnif (nl+1, loc, k, s, r)
|
adamc@448
|
129 | _ => c,
|
adamc@448
|
130 exp = fn _ => fn e => e,
|
adamc@448
|
131 bind = fn (bound, U.Exp.RelC _) => bound + 1
|
adamc@448
|
132 | (bound, _) => bound}
|
adamc@448
|
133
|
adamc@211
|
134 val liftExpInExp =
|
adamc@623
|
135 U.Exp.mapB {kind = fn _ => fn k => k,
|
adamc@211
|
136 con = fn _ => fn c => c,
|
adamc@211
|
137 exp = fn bound => fn e =>
|
adamc@211
|
138 case e of
|
adamc@211
|
139 ERel xn =>
|
adamc@211
|
140 if xn < bound then
|
adamc@211
|
141 e
|
adamc@211
|
142 else
|
adamc@211
|
143 ERel (xn + 1)
|
adamc@211
|
144 | _ => e,
|
adamc@211
|
145 bind = fn (bound, U.Exp.RelE _) => bound + 1
|
adamc@211
|
146 | (bound, _) => bound}
|
adamc@211
|
147
|
adamc@211
|
148
|
adamc@211
|
149 val liftExp = liftExpInExp 0
|
adamc@13
|
150
|
adamc@448
|
151 val subExpInExp =
|
adamc@623
|
152 U.Exp.mapB {kind = fn _ => fn k => k,
|
adamc@448
|
153 con = fn _ => fn c => c,
|
adamc@448
|
154 exp = fn (xn, rep) => fn e =>
|
adamc@448
|
155 case e of
|
adamc@448
|
156 ERel xn' =>
|
adamc@448
|
157 (case Int.compare (xn', xn) of
|
adamc@448
|
158 EQUAL => #1 rep
|
adamc@448
|
159 | GREATER=> ERel (xn' - 1)
|
adamc@448
|
160 | LESS => e)
|
adamc@448
|
161 | _ => e,
|
adamc@448
|
162 bind = fn ((xn, rep), U.Exp.RelE _) => (xn+1, liftExpInExp 0 rep)
|
adamc@448
|
163 | ((xn, rep), U.Exp.RelC _) => (xn, liftConInExp 0 rep)
|
adamc@448
|
164 | (ctx, _) => ctx}
|
adamc@448
|
165
|
adam@1795
|
166 val openCon =
|
adam@1795
|
167 U.Con.existsB {kind = fn ((nk, _), k) =>
|
adam@1795
|
168 case k of
|
adam@1795
|
169 KRel n => n >= nk
|
adam@1795
|
170 | _ => false,
|
adam@1795
|
171 con = fn ((_, nc), c) =>
|
adam@1795
|
172 case c of
|
adam@1795
|
173 CRel n => n >= nc
|
adam@1795
|
174 | _ => false,
|
adam@1795
|
175 bind = fn (all as (nk, nc), b) =>
|
adam@1795
|
176 case b of
|
adam@1795
|
177 U.Con.RelK _ => (nk+1, nc)
|
adam@1795
|
178 | U.Con.RelC _ => (nk, nc+1)
|
adam@1795
|
179 | _ => all}
|
adam@1795
|
180 (0, 0)
|
adam@1795
|
181
|
adamc@13
|
182 (* Back to environments *)
|
adamc@13
|
183
|
adamc@9
|
184 datatype 'a var' =
|
adamc@9
|
185 Rel' of int * 'a
|
adamc@9
|
186 | Named' of int * 'a
|
adamc@2
|
187
|
adamc@9
|
188 datatype 'a var =
|
adamc@9
|
189 NotBound
|
adamc@9
|
190 | Rel of int * 'a
|
adamc@9
|
191 | Named of int * 'a
|
adamc@2
|
192
|
adamc@191
|
193 type datatyp = string list * (string * con option) IM.map
|
adamc@157
|
194
|
adamc@211
|
195 datatype class_name =
|
adamc@211
|
196 ClNamed of int
|
adamc@211
|
197 | ClProj of int * string list * string
|
adamc@211
|
198
|
adamc@711
|
199 fun class_name_out cn =
|
adamc@711
|
200 case cn of
|
adamc@711
|
201 ClNamed n => (CNamed n, ErrorMsg.dummySpan)
|
adamc@711
|
202 | ClProj x => (CModProj x, ErrorMsg.dummySpan)
|
adamc@711
|
203
|
adamc@216
|
204 fun cn2s cn =
|
adamc@216
|
205 case cn of
|
adamc@216
|
206 ClNamed n => "Named(" ^ Int.toString n ^ ")"
|
adamc@216
|
207 | ClProj (m, ms, x) => "Proj(" ^ Int.toString m ^ "," ^ String.concatWith "," ms ^ "," ^ x ^ ")"
|
adamc@216
|
208
|
adamc@211
|
209 structure CK = struct
|
adamc@211
|
210 type ord_key = class_name
|
adamc@211
|
211 open Order
|
adamc@211
|
212 fun compare x =
|
adamc@211
|
213 case x of
|
adamc@211
|
214 (ClNamed n1, ClNamed n2) => Int.compare (n1, n2)
|
adamc@211
|
215 | (ClNamed _, _) => LESS
|
adamc@211
|
216 | (_, ClNamed _) => GREATER
|
adamc@211
|
217
|
adamc@211
|
218 | (ClProj (m1, ms1, x1), ClProj (m2, ms2, x2)) =>
|
adamc@211
|
219 join (Int.compare (m1, m2),
|
adamc@211
|
220 fn () => join (joinL String.compare (ms1, ms2),
|
adamc@211
|
221 fn () => String.compare (x1, x2)))
|
adamc@211
|
222 end
|
adamc@211
|
223
|
adamc@677
|
224 structure CS = BinarySetFn(CK)
|
adamc@211
|
225 structure CM = BinaryMapFn(CK)
|
adamc@211
|
226
|
adam@1795
|
227 type rules = (int * con list * con * exp) list
|
adam@1795
|
228
|
adam@1795
|
229 type class = {closedRules : rules,
|
adam@1795
|
230 openRules : rules}
|
adam@1795
|
231 val empty_class = {closedRules = [],
|
adam@1795
|
232 openRules = []}
|
adamc@216
|
233
|
adamc@2
|
234 type env = {
|
adamc@623
|
235 renameK : int SM.map,
|
adamc@623
|
236 relK : string list,
|
adamc@623
|
237
|
adamc@9
|
238 renameC : kind var' SM.map,
|
adamc@2
|
239 relC : (string * kind) list,
|
adamc@11
|
240 namedC : (string * kind * con option) IM.map,
|
adamc@9
|
241
|
adamc@157
|
242 datatypes : datatyp IM.map,
|
adamc@191
|
243 constructors : (datatype_kind * int * string list * con option * int) SM.map,
|
adamc@157
|
244
|
adamc@211
|
245 classes : class CM.map,
|
adamc@211
|
246
|
adamc@9
|
247 renameE : con var' SM.map,
|
adamc@9
|
248 relE : (string * con) list,
|
adamc@31
|
249 namedE : (string * con) IM.map,
|
adamc@31
|
250
|
adamc@31
|
251 renameSgn : (int * sgn) SM.map,
|
adamc@31
|
252 sgn : (string * sgn) IM.map,
|
adamc@31
|
253
|
adamc@31
|
254 renameStr : (int * sgn) SM.map,
|
adamc@31
|
255 str : (string * sgn) IM.map
|
adamc@2
|
256 }
|
adamc@2
|
257
|
adamc@2
|
258 val namedCounter = ref 0
|
adamc@2
|
259
|
adamc@109
|
260 fun newNamed () =
|
adamc@109
|
261 let
|
adamc@109
|
262 val r = !namedCounter
|
adamc@109
|
263 in
|
adamc@109
|
264 namedCounter := r + 1;
|
adamc@109
|
265 r
|
adamc@109
|
266 end
|
adamc@109
|
267
|
adamc@2
|
268 val empty = {
|
adamc@623
|
269 renameK = SM.empty,
|
adamc@623
|
270 relK = [],
|
adamc@623
|
271
|
adamc@2
|
272 renameC = SM.empty,
|
adamc@2
|
273 relC = [],
|
adamc@9
|
274 namedC = IM.empty,
|
adamc@9
|
275
|
adamc@157
|
276 datatypes = IM.empty,
|
adamc@171
|
277 constructors = SM.empty,
|
adamc@157
|
278
|
adamc@211
|
279 classes = CM.empty,
|
adamc@211
|
280
|
adamc@9
|
281 renameE = SM.empty,
|
adamc@9
|
282 relE = [],
|
adamc@31
|
283 namedE = IM.empty,
|
adamc@31
|
284
|
adamc@31
|
285 renameSgn = SM.empty,
|
adamc@31
|
286 sgn = IM.empty,
|
adamc@31
|
287
|
adamc@31
|
288 renameStr = SM.empty,
|
adamc@31
|
289 str = IM.empty
|
adamc@2
|
290 }
|
adamc@2
|
291
|
adamc@623
|
292 fun pushKRel (env : env) x =
|
adamc@623
|
293 let
|
adamc@623
|
294 val renameK = SM.map (fn n => n+1) (#renameK env)
|
adamc@623
|
295 in
|
adamc@623
|
296 {renameK = SM.insert (renameK, x, 0),
|
adamc@623
|
297 relK = x :: #relK env,
|
adamc@623
|
298
|
adamc@623
|
299 renameC = SM.map (fn Rel' (n, k) => Rel' (n, liftKindInKind 0 k)
|
adamc@623
|
300 | x => x) (#renameC env),
|
adamc@623
|
301 relC = map (fn (x, k) => (x, liftKindInKind 0 k)) (#relC env),
|
adamc@623
|
302 namedC = #namedC env,
|
adamc@623
|
303
|
adamc@623
|
304 datatypes = #datatypes env,
|
adamc@623
|
305 constructors = #constructors env,
|
adamc@623
|
306
|
adam@1795
|
307 classes = CM.map (fn cl => {closedRules = #closedRules cl,
|
adam@1795
|
308 openRules = map (fn (nvs, cs, c, e) =>
|
adam@1795
|
309 (nvs,
|
adam@1795
|
310 map (liftKindInCon 0) cs,
|
adam@1795
|
311 liftKindInCon 0 c,
|
adam@1795
|
312 liftKindInExp 0 e))
|
adam@1795
|
313 (#openRules cl)})
|
adamc@711
|
314 (#classes env),
|
adamc@623
|
315
|
adamc@623
|
316 renameE = SM.map (fn Rel' (n, c) => Rel' (n, liftKindInCon 0 c)
|
adamc@623
|
317 | Named' (n, c) => Named' (n, c)) (#renameE env),
|
adamc@623
|
318 relE = map (fn (x, c) => (x, liftKindInCon 0 c)) (#relE env),
|
adamc@623
|
319 namedE = #namedE env,
|
adamc@623
|
320
|
adamc@623
|
321 renameSgn = #renameSgn env,
|
adamc@623
|
322 sgn = #sgn env,
|
adamc@623
|
323
|
adamc@623
|
324 renameStr = #renameStr env,
|
adamc@623
|
325 str = #str env
|
adamc@623
|
326 }
|
adamc@623
|
327 end
|
adamc@623
|
328
|
adamc@623
|
329 fun lookupKRel (env : env) n =
|
adamc@623
|
330 (List.nth (#relK env, n))
|
adamc@623
|
331 handle Subscript => raise UnboundRel n
|
adamc@623
|
332
|
adamc@623
|
333 fun lookupK (env : env) x = SM.find (#renameK env, x)
|
adamc@623
|
334
|
adamc@2
|
335 fun pushCRel (env : env) x k =
|
adamc@2
|
336 let
|
adamc@9
|
337 val renameC = SM.map (fn Rel' (n, k) => Rel' (n+1, k)
|
adamc@2
|
338 | x => x) (#renameC env)
|
adamc@2
|
339 in
|
adamc@623
|
340 {renameK = #renameK env,
|
adamc@623
|
341 relK = #relK env,
|
adamc@623
|
342
|
adamc@623
|
343 renameC = SM.insert (renameC, x, Rel' (0, k)),
|
adamc@2
|
344 relC = (x, k) :: #relC env,
|
adamc@514
|
345 namedC = #namedC env,
|
adamc@9
|
346
|
adamc@157
|
347 datatypes = #datatypes env,
|
adamc@171
|
348 constructors = #constructors env,
|
adamc@157
|
349
|
adamc@674
|
350 classes = CM.map (fn class =>
|
adam@1795
|
351 {closedRules = #closedRules class,
|
adam@1795
|
352 openRules = map (fn (nvs, cs, c, e) =>
|
adam@1795
|
353 (nvs,
|
adam@1795
|
354 map (liftConInCon 0) cs,
|
adam@1795
|
355 liftConInCon 0 c,
|
adam@1795
|
356 liftConInExp 0 e))
|
adam@1795
|
357 (#openRules class)})
|
adamc@211
|
358 (#classes env),
|
adamc@211
|
359
|
adamc@328
|
360 renameE = SM.map (fn Rel' (n, c) => Rel' (n, lift c)
|
adamc@517
|
361 | Named' (n, c) => Named' (n, c)) (#renameE env),
|
adamc@13
|
362 relE = map (fn (x, c) => (x, lift c)) (#relE env),
|
adamc@514
|
363 namedE = #namedE env,
|
adamc@31
|
364
|
adamc@31
|
365 renameSgn = #renameSgn env,
|
adamc@31
|
366 sgn = #sgn env,
|
adamc@31
|
367
|
adamc@31
|
368 renameStr = #renameStr env,
|
adamc@31
|
369 str = #str env
|
adamc@31
|
370 }
|
adamc@2
|
371 end
|
adamc@2
|
372
|
adamc@2
|
373 fun lookupCRel (env : env) n =
|
adamc@2
|
374 (List.nth (#relC env, n))
|
adamc@2
|
375 handle Subscript => raise UnboundRel n
|
adamc@2
|
376
|
adamc@11
|
377 fun pushCNamedAs (env : env) x n k co =
|
adamc@623
|
378 {renameK = #renameK env,
|
adamc@623
|
379 relK = #relK env,
|
adamc@623
|
380
|
adamc@623
|
381 renameC = SM.insert (#renameC env, x, Named' (n, k)),
|
adamc@5
|
382 relC = #relC env,
|
adamc@11
|
383 namedC = IM.insert (#namedC env, n, (x, k, co)),
|
adamc@9
|
384
|
adamc@157
|
385 datatypes = #datatypes env,
|
adamc@171
|
386 constructors = #constructors env,
|
adamc@157
|
387
|
adamc@211
|
388 classes = #classes env,
|
adamc@211
|
389
|
adamc@9
|
390 renameE = #renameE env,
|
adamc@9
|
391 relE = #relE env,
|
adamc@31
|
392 namedE = #namedE env,
|
adamc@31
|
393
|
adamc@31
|
394 renameSgn = #renameSgn env,
|
adamc@31
|
395 sgn = #sgn env,
|
adamc@31
|
396
|
adamc@31
|
397 renameStr = #renameStr env,
|
adamc@31
|
398 str = #str env}
|
adamc@5
|
399
|
adamc@11
|
400 fun pushCNamed env x k co =
|
adamc@2
|
401 let
|
adamc@2
|
402 val n = !namedCounter
|
adamc@2
|
403 in
|
adamc@2
|
404 namedCounter := n + 1;
|
adamc@11
|
405 (pushCNamedAs env x n k co, n)
|
adamc@2
|
406 end
|
adamc@2
|
407
|
adamc@2
|
408 fun lookupCNamed (env : env) n =
|
adamc@2
|
409 case IM.find (#namedC env, n) of
|
adamc@2
|
410 NONE => raise UnboundNamed n
|
adamc@2
|
411 | SOME x => x
|
adamc@2
|
412
|
adamc@2
|
413 fun lookupC (env : env) x =
|
adamc@2
|
414 case SM.find (#renameC env, x) of
|
adamc@9
|
415 NONE => NotBound
|
adamc@9
|
416 | SOME (Rel' x) => Rel x
|
adamc@9
|
417 | SOME (Named' x) => Named x
|
adamc@9
|
418
|
adamc@191
|
419 fun pushDatatype (env : env) n xs xncs =
|
adamc@188
|
420 let
|
adamc@188
|
421 val dk = U.classifyDatatype xncs
|
adamc@188
|
422 in
|
adamc@623
|
423 {renameK = #renameK env,
|
adamc@623
|
424 relK = #relK env,
|
adamc@623
|
425
|
adamc@623
|
426 renameC = #renameC env,
|
adamc@188
|
427 relC = #relC env,
|
adamc@188
|
428 namedC = #namedC env,
|
adamc@157
|
429
|
adamc@188
|
430 datatypes = IM.insert (#datatypes env, n,
|
adamc@191
|
431 (xs, foldl (fn ((x, n, to), cons) =>
|
adamc@191
|
432 IM.insert (cons, n, (x, to))) IM.empty xncs)),
|
adamc@188
|
433 constructors = foldl (fn ((x, n', to), cmap) =>
|
adamc@191
|
434 SM.insert (cmap, x, (dk, n', xs, to, n)))
|
adamc@188
|
435 (#constructors env) xncs,
|
adamc@157
|
436
|
adamc@211
|
437 classes = #classes env,
|
adamc@211
|
438
|
adamc@188
|
439 renameE = #renameE env,
|
adamc@188
|
440 relE = #relE env,
|
adamc@188
|
441 namedE = #namedE env,
|
adamc@157
|
442
|
adamc@188
|
443 renameSgn = #renameSgn env,
|
adamc@188
|
444 sgn = #sgn env,
|
adamc@157
|
445
|
adamc@188
|
446 renameStr = #renameStr env,
|
adamc@188
|
447 str = #str env}
|
adamc@188
|
448 end
|
adamc@157
|
449
|
adamc@157
|
450 fun lookupDatatype (env : env) n =
|
adamc@157
|
451 case IM.find (#datatypes env, n) of
|
adamc@157
|
452 NONE => raise UnboundNamed n
|
adamc@157
|
453 | SOME x => x
|
adamc@157
|
454
|
adamc@191
|
455 fun lookupDatatypeConstructor (_, dt) n =
|
adamc@157
|
456 case IM.find (dt, n) of
|
adamc@157
|
457 NONE => raise UnboundNamed n
|
adamc@157
|
458 | SOME x => x
|
adamc@157
|
459
|
adamc@171
|
460 fun lookupConstructor (env : env) s = SM.find (#constructors env, s)
|
adamc@171
|
461
|
adamc@191
|
462 fun datatypeArgs (xs, _) = xs
|
adamc@191
|
463 fun constructors (_, dt) = IM.foldri (fn (n, (x, to), ls) => (x, n, to) :: ls) [] dt
|
adamc@157
|
464
|
adamc@711
|
465 fun listClasses (env : env) =
|
adam@1795
|
466 map (fn (cn, {closedRules, openRules}) =>
|
adamc@711
|
467 (class_name_out cn,
|
adam@1795
|
468 map (fn (nvs, cs, c, e) =>
|
adamc@711
|
469 let
|
adamc@711
|
470 val loc = #2 c
|
adamc@711
|
471 val c = foldr (fn (c', c) => (TFun (c', c), loc)) c cs
|
adamc@711
|
472 val c = ListUtil.foldli (fn (n, (), c) => (TCFun (Explicit,
|
adamc@711
|
473 "x" ^ Int.toString n,
|
adamc@711
|
474 (KError, loc),
|
adamc@711
|
475 c), loc))
|
adamc@711
|
476 c (List.tabulate (nvs, fn _ => ()))
|
adamc@711
|
477 in
|
adamc@711
|
478 (c, e)
|
adam@1795
|
479 end) (closedRules @ openRules))) (CM.listItemsi (#classes env))
|
adamc@711
|
480
|
adamc@211
|
481 fun pushClass (env : env) n =
|
adamc@623
|
482 {renameK = #renameK env,
|
adamc@623
|
483 relK = #relK env,
|
adamc@623
|
484
|
adamc@623
|
485 renameC = #renameC env,
|
adamc@211
|
486 relC = #relC env,
|
adamc@211
|
487 namedC = #namedC env,
|
adamc@211
|
488
|
adamc@211
|
489 datatypes = #datatypes env,
|
adamc@211
|
490 constructors = #constructors env,
|
adamc@211
|
491
|
adamc@675
|
492 classes = CM.insert (#classes env, ClNamed n, empty_class),
|
adamc@211
|
493
|
adamc@211
|
494 renameE = #renameE env,
|
adamc@211
|
495 relE = #relE env,
|
adamc@211
|
496 namedE = #namedE env,
|
adamc@211
|
497
|
adamc@211
|
498 renameSgn = #renameSgn env,
|
adamc@211
|
499 sgn = #sgn env,
|
adamc@211
|
500
|
adamc@211
|
501 renameStr = #renameStr env,
|
adamc@403
|
502 str = #str env}
|
adamc@211
|
503
|
adamc@211
|
504 fun class_name_in (c, _) =
|
adamc@211
|
505 case c of
|
adamc@211
|
506 CNamed n => SOME (ClNamed n)
|
adamc@211
|
507 | CModProj x => SOME (ClProj x)
|
adam@1639
|
508 | CUnif (_, _, _, _, ref (Known c)) => class_name_in c
|
adamc@211
|
509 | _ => NONE
|
adamc@211
|
510
|
adamc@403
|
511 fun isClass (env : env) c =
|
adamc@403
|
512 let
|
adamc@403
|
513 fun find NONE = false
|
adamc@403
|
514 | find (SOME c) = Option.isSome (CM.find (#classes env, c))
|
adamc@403
|
515 in
|
adamc@403
|
516 find (class_name_in c)
|
adamc@403
|
517 end
|
adamc@403
|
518
|
adamc@711
|
519 fun class_head_in c =
|
adamc@711
|
520 case #1 c of
|
adamc@711
|
521 CApp (f, _) => class_head_in f
|
adam@1639
|
522 | CUnif (_, _, _, _, ref (Known c)) => class_head_in c
|
adamc@711
|
523 | _ => class_name_in c
|
adamc@211
|
524
|
adamc@711
|
525 exception Unify
|
adamc@711
|
526
|
adamc@711
|
527 fun unifyKinds (k1, k2) =
|
adamc@711
|
528 case (#1 k1, #1 k2) of
|
adamc@711
|
529 (KType, KType) => ()
|
adamc@711
|
530 | (KArrow (d1, r1), KArrow (d2, r2)) => (unifyKinds (d1, d2); unifyKinds (r1, r2))
|
adamc@711
|
531 | (KName, KName) => ()
|
adamc@711
|
532 | (KRecord k1, KRecord k2) => unifyKinds (k1, k2)
|
adamc@711
|
533 | (KUnit, KUnit) => ()
|
adamc@711
|
534 | (KTuple ks1, KTuple ks2) => (ListPair.appEq unifyKinds (ks1, ks2)
|
adamc@711
|
535 handle ListPair.UnequalLengths => raise Unify)
|
adam@1639
|
536 | (KUnif (_, _, ref (KKnown k1)), _) => unifyKinds (k1, k2)
|
adam@1639
|
537 | (_, KUnif (_, _, ref (KKnown k2))) => unifyKinds (k1, k2)
|
adamc@711
|
538 | (KRel n1, KRel n2) => if n1 = n2 then () else raise Unify
|
adamc@711
|
539 | (KFun (_, k1), KFun (_, k2)) => unifyKinds (k1, k2)
|
adamc@711
|
540 | _ => raise Unify
|
adamc@711
|
541
|
adamc@904
|
542 fun eqCons (c1, c2) =
|
adamc@904
|
543 case (#1 c1, #1 c2) of
|
adam@1639
|
544 (CUnif (nl, _, _, _, ref (Known c1)), _) => eqCons (mliftConInCon nl c1, c2)
|
adam@1639
|
545 | (_, CUnif (nl, _, _, _, ref (Known c2))) => eqCons (c1, mliftConInCon nl c2)
|
adamc@904
|
546
|
adamc@904
|
547 | (CRel n1, CRel n2) => if n1 = n2 then () else raise Unify
|
adamc@904
|
548
|
adamc@904
|
549 | (TFun (d1, r1), TFun (d2, r2)) => (eqCons (d1, d2); eqCons (r1, r2))
|
adamc@904
|
550 | (TCFun (_, _, k1, r1), TCFun (_, _, k2, r2)) => (unifyKinds (k1, k2); eqCons (r1, r2))
|
adamc@904
|
551 | (TRecord c1, TRecord c2) => eqCons (c1, c2)
|
adamc@904
|
552 | (TDisjoint (a1, b1, c1), TDisjoint (a2, b2, c2)) =>
|
adamc@904
|
553 (eqCons (a1, a2); eqCons (b1, b2); eqCons (c1, c2))
|
adamc@904
|
554
|
adamc@904
|
555 | (CNamed n1, CNamed n2) => if n1 = n2 then () else raise Unify
|
adamc@904
|
556 | (CModProj (n1, ms1, x1), CModProj (n2, ms2, x2)) =>
|
adamc@904
|
557 if n1 = n2 andalso ms1 = ms2 andalso x1 = x2 then () else raise Unify
|
adamc@904
|
558 | (CApp (f1, x1), CApp (f2, x2)) => (eqCons (f1, f2); eqCons (x1, x2))
|
adamc@904
|
559 | (CAbs (_, k1, b1), CAbs (_, k2, b2)) => (unifyKinds (k1, k2); eqCons (b1, b2))
|
adamc@904
|
560
|
adamc@904
|
561 | (CKAbs (_, b1), CKAbs (_, b2)) => eqCons (b1, b2)
|
adamc@904
|
562 | (CKApp (c1, k1), CKApp (c2, k2)) => (eqCons (c1, c2); unifyKinds (k1, k2))
|
adamc@904
|
563 | (TKFun (_, c1), TKFun (_, c2)) => eqCons (c1, c2)
|
adamc@904
|
564
|
adamc@904
|
565 | (CName s1, CName s2) => if s1 = s2 then () else raise Unify
|
adamc@904
|
566
|
adamc@904
|
567 | (CRecord (k1, xcs1), CRecord (k2, xcs2)) =>
|
adamc@904
|
568 (unifyKinds (k1, k2);
|
adam@1575
|
569 if length xcs1 <> length xcs2 then
|
adam@1575
|
570 raise Unify
|
adam@1575
|
571 else
|
adam@1575
|
572 List.app (fn (x1, c1) =>
|
adam@1575
|
573 if List.exists (fn (x2, c2) => (eqCons (x1, x2); eqCons (c1, c2); true) handle Unify => false) xcs2 then
|
adam@1575
|
574 ()
|
adam@1575
|
575 else
|
adam@1575
|
576 raise Unify) xcs1)
|
adamc@904
|
577 | (CConcat (f1, x1), CConcat (f2, x2)) => (eqCons (f1, f2); eqCons (x1, x2))
|
adamc@904
|
578 | (CMap (d1, r1), CMap (d2, r2)) => (unifyKinds (d1, d2); unifyKinds (r1, r2))
|
adamc@904
|
579
|
adamc@904
|
580 | (CUnit, CUnit) => ()
|
adamc@904
|
581
|
adamc@904
|
582 | (CTuple cs1, CTuple cs2) => (ListPair.appEq (eqCons) (cs1, cs2)
|
adamc@904
|
583 handle ListPair.UnequalLengths => raise Unify)
|
adamc@904
|
584 | (CProj (c1, n1), CProj (c2, n2)) => (eqCons (c1, c2);
|
adamc@904
|
585 if n1 = n2 then () else raise Unify)
|
adamc@904
|
586
|
adamc@904
|
587 | _ => raise Unify
|
adamc@904
|
588
|
adam@1325
|
589 fun unifyCons (hnorm : con -> con) rs =
|
adamc@674
|
590 let
|
adamc@711
|
591 fun unify d (c1, c2) =
|
adam@1325
|
592 case (#1 (hnorm c1), #1 (hnorm c2)) of
|
adam@1639
|
593 (CUnif (nl, _, _, _, ref (Known c1)), _) => unify d (mliftConInCon nl c1, c2)
|
adam@1639
|
594 | (_, CUnif (nl, _, _, _, ref (Known c2))) => unify d (c1, mliftConInCon nl c2)
|
adamc@711
|
595
|
adamc@750
|
596 | (CUnif _, _) => ()
|
adamc@750
|
597
|
adamc@711
|
598 | (c1', CRel n2) =>
|
adamc@711
|
599 if n2 < d then
|
adamc@711
|
600 case c1' of
|
adamc@711
|
601 CRel n1 => if n1 = n2 then () else raise Unify
|
adamc@711
|
602 | _ => raise Unify
|
adamc@711
|
603 else if n2 - d >= length rs then
|
adamc@711
|
604 case c1' of
|
adamc@711
|
605 CRel n1 => if n1 = n2 - length rs then () else raise Unify
|
adamc@711
|
606 | _ => raise Unify
|
adamc@711
|
607 else
|
adamc@711
|
608 let
|
adamc@711
|
609 val r = List.nth (rs, n2 - d)
|
adamc@711
|
610 in
|
adamc@711
|
611 case !r of
|
adamc@711
|
612 NONE => r := SOME c1
|
adamc@904
|
613 | SOME c2 => eqCons (c1, c2)
|
adamc@711
|
614 end
|
adamc@711
|
615
|
adamc@711
|
616 | (TFun (d1, r1), TFun (d2, r2)) => (unify d (d1, d2); unify d (r1, r2))
|
adamc@711
|
617 | (TCFun (_, _, k1, r1), TCFun (_, _, k2, r2)) => (unifyKinds (k1, k2); unify (d + 1) (r1, r2))
|
adamc@711
|
618 | (TRecord c1, TRecord c2) => unify d (c1, c2)
|
adamc@711
|
619 | (TDisjoint (a1, b1, c1), TDisjoint (a2, b2, c2)) =>
|
adamc@711
|
620 (unify d (a1, a2); unify d (b1, b2); unify d (c1, c2))
|
adamc@711
|
621
|
adamc@711
|
622 | (CNamed n1, CNamed n2) => if n1 = n2 then () else raise Unify
|
adamc@711
|
623 | (CModProj (n1, ms1, x1), CModProj (n2, ms2, x2)) =>
|
adamc@711
|
624 if n1 = n2 andalso ms1 = ms2 andalso x1 = x2 then () else raise Unify
|
adamc@711
|
625 | (CApp (f1, x1), CApp (f2, x2)) => (unify d (f1, f2); unify d (x1, x2))
|
adamc@711
|
626 | (CAbs (_, k1, b1), CAbs (_, k2, b2)) => (unifyKinds (k1, k2); unify (d + 1) (b1, b2))
|
adamc@711
|
627
|
adamc@711
|
628 | (CKAbs (_, b1), CKAbs (_, b2)) => unify d (b1, b2)
|
adamc@711
|
629 | (CKApp (c1, k1), CKApp (c2, k2)) => (unify d (c1, c2); unifyKinds (k1, k2))
|
adamc@711
|
630 | (TKFun (_, c1), TKFun (_, c2)) => unify d (c1, c2)
|
adamc@711
|
631
|
adamc@711
|
632 | (CName s1, CName s2) => if s1 = s2 then () else raise Unify
|
adamc@711
|
633
|
adamc@711
|
634 | (CRecord (k1, xcs1), CRecord (k2, xcs2)) =>
|
adamc@711
|
635 (unifyKinds (k1, k2);
|
adam@1575
|
636 if length xcs1 <> length xcs2 then
|
adam@1575
|
637 raise Unify
|
adam@1575
|
638 else
|
adam@1575
|
639 app (fn (x1, c1) =>
|
adam@1575
|
640 if List.exists (fn (x2, c2) => (unify d (x1, x2); unify d (c1, c2); true) handle Unify => false) xcs2 then
|
adam@1575
|
641 ()
|
adam@1575
|
642 else
|
adam@1575
|
643 raise Unify) xcs1)
|
adamc@711
|
644 | (CConcat (f1, x1), CConcat (f2, x2)) => (unify d (f1, f2); unify d (x1, x2))
|
adamc@711
|
645 | (CMap (d1, r1), CMap (d2, r2)) => (unifyKinds (d1, d2); unifyKinds (r1, r2))
|
adamc@711
|
646
|
adamc@711
|
647 | (CUnit, CUnit) => ()
|
adamc@711
|
648
|
adamc@711
|
649 | (CTuple cs1, CTuple cs2) => (ListPair.appEq (unify d) (cs1, cs2)
|
adamc@711
|
650 handle ListPair.UnequalLengths => raise Unify)
|
adamc@711
|
651 | (CProj (c1, n1), CProj (c2, n2)) => (unify d (c1, c2);
|
adamc@711
|
652 if n1 = n2 then () else raise Unify)
|
adamc@711
|
653
|
adamc@711
|
654 | _ => raise Unify
|
adamc@674
|
655 in
|
adamc@711
|
656 unify
|
adamc@674
|
657 end
|
adamc@674
|
658
|
adam@1325
|
659 fun tryUnify hnorm nRs (c1, c2) =
|
adamc@674
|
660 let
|
adamc@711
|
661 val rs = List.tabulate (nRs, fn _ => ref NONE)
|
adamc@674
|
662 in
|
adam@1325
|
663 (unifyCons hnorm rs 0 (c1, c2);
|
adamc@711
|
664 SOME (map (fn r => case !r of
|
adamc@711
|
665 NONE => raise Unify
|
adamc@711
|
666 | SOME c => c) rs))
|
adamc@711
|
667 handle Unify => NONE
|
adamc@674
|
668 end
|
adamc@674
|
669
|
adamc@711
|
670 fun unifySubst (rs : con list) =
|
adamc@711
|
671 U.Con.mapB {kind = fn _ => fn k => k,
|
adamc@711
|
672 con = fn d => fn c =>
|
adamc@711
|
673 case c of
|
adamc@711
|
674 CRel n =>
|
adamc@711
|
675 if n < d then
|
adamc@711
|
676 c
|
adam@1795
|
677 else if n - d >= length rs then
|
adam@1795
|
678 CRel (n - d)
|
adamc@711
|
679 else
|
adamc@711
|
680 #1 (List.nth (rs, n - d))
|
adamc@711
|
681 | _ => c,
|
adamc@711
|
682 bind = fn (d, U.Con.RelC _) => d + 1
|
adamc@711
|
683 | (d, _) => d}
|
adamc@711
|
684 0
|
adamc@711
|
685
|
adamc@753
|
686 exception Bad of con * con
|
adamc@750
|
687
|
adamc@754
|
688 val hasUnif = U.Con.exists {kind = fn _ => false,
|
adam@1639
|
689 con = fn CUnif (_, _, _, _, ref (Unknown _)) => true
|
adamc@754
|
690 | _ => false}
|
adamc@754
|
691
|
adamc@754
|
692 fun startsWithUnif c =
|
adamc@754
|
693 let
|
adamc@754
|
694 fun firstArg (c, acc) =
|
adamc@754
|
695 case #1 c of
|
adamc@754
|
696 CApp (f, x) => firstArg (f, SOME x)
|
adamc@754
|
697 | _ => acc
|
adamc@754
|
698 in
|
adamc@754
|
699 case firstArg (c, NONE) of
|
adamc@754
|
700 NONE => false
|
adamc@754
|
701 | SOME x => hasUnif x
|
adamc@754
|
702 end
|
adamc@754
|
703
|
adam@1742
|
704 val cause = ref (NONE : con option)
|
adam@1742
|
705 fun resolveFailureCause () = !cause
|
adam@1742
|
706
|
adamc@753
|
707 fun resolveClass (hnorm : con -> con) (consEq : con * con -> bool) (env : env) =
|
adamc@674
|
708 let
|
adam@1742
|
709 fun resolve firstLevel c =
|
adamc@711
|
710 let
|
adam@1742
|
711 fun notFound () = (if firstLevel then () else cause := SOME c; NONE)
|
adam@1742
|
712
|
adamc@711
|
713 fun doHead f =
|
adamc@711
|
714 case CM.find (#classes env, f) of
|
adam@1742
|
715 NONE => notFound ()
|
adamc@711
|
716 | SOME class =>
|
adamc@711
|
717 let
|
adamc@711
|
718 val loc = #2 c
|
adamc@675
|
719
|
adamc@753
|
720 fun generalize (c as (_, loc)) =
|
adamc@753
|
721 case #1 c of
|
adamc@753
|
722 CApp (f, x) =>
|
adamc@753
|
723 let
|
adamc@753
|
724 val (f, equate) = generalize f
|
adamc@753
|
725
|
adamc@753
|
726 fun isRecord () =
|
adamc@753
|
727 let
|
adam@1639
|
728 val rk = ref (KUnknown (fn _ => true))
|
adamc@753
|
729 val k = (KUnif (loc, "k", rk), loc)
|
adam@1639
|
730 val r = ref (Unknown (fn _ => true))
|
adam@1303
|
731 val rc = (CUnif (0, loc, k, "x", r), loc)
|
adamc@753
|
732 in
|
adamc@753
|
733 ((CApp (f, rc), loc),
|
adamc@753
|
734 fn () => (if consEq (rc, x) then
|
adamc@753
|
735 true
|
adamc@753
|
736 else
|
adamc@753
|
737 (raise Bad (rc, x);
|
adamc@753
|
738 false))
|
adamc@753
|
739 andalso equate ())
|
adamc@753
|
740 end
|
adamc@753
|
741 in
|
adamc@753
|
742 case #1 x of
|
adamc@753
|
743 CConcat _ => isRecord ()
|
adamc@753
|
744 | CRecord _ => isRecord ()
|
adamc@753
|
745 | _ => ((CApp (f, x), loc), equate)
|
adamc@753
|
746 end
|
adamc@753
|
747 | _ => (c, fn () => true)
|
adamc@753
|
748
|
adamc@753
|
749 val (c, equate) = generalize c
|
adamc@753
|
750
|
adamc@711
|
751 fun tryRules rules =
|
adamc@711
|
752 case rules of
|
adam@1742
|
753 [] => notFound ()
|
adamc@711
|
754 | (nRs, cs, c', e) :: rules' =>
|
adam@1795
|
755 case tryUnify hnorm nRs (c, c') of
|
adamc@711
|
756 NONE => tryRules rules'
|
adamc@711
|
757 | SOME rs =>
|
adamc@675
|
758 let
|
adam@1742
|
759 val eos = map (resolve false o unifySubst rs) cs
|
adamc@675
|
760 in
|
adamc@750
|
761 if List.exists (not o Option.isSome) eos
|
adamc@753
|
762 orelse not (equate ())
|
adamc@753
|
763 orelse not (consEq (c, unifySubst rs c')) then
|
adamc@711
|
764 tryRules rules'
|
adamc@711
|
765 else
|
adamc@711
|
766 let
|
adamc@711
|
767 val es = List.mapPartial (fn x => x) eos
|
adamc@711
|
768
|
adamc@711
|
769 val e = foldr (fn (c, e) => (ECApp (e, c), loc)) e rs
|
adamc@711
|
770 val e = foldl (fn (e', e) => (EApp (e, e'), loc)) e es
|
adamc@711
|
771 in
|
adamc@711
|
772 SOME e
|
adamc@711
|
773 end
|
adamc@675
|
774 end
|
adamc@675
|
775 in
|
adam@1795
|
776 tryRules (#openRules class @ #closedRules class)
|
adamc@675
|
777 end
|
adamc@711
|
778 in
|
adamc@754
|
779 if startsWithUnif c then
|
adam@1742
|
780 notFound ()
|
adamc@754
|
781 else
|
adamc@754
|
782 case #1 c of
|
adamc@754
|
783 TRecord c =>
|
adamc@754
|
784 (case #1 (hnorm c) of
|
adamc@754
|
785 CRecord (_, xts) =>
|
adamc@754
|
786 let
|
adamc@754
|
787 fun resolver (xts, acc) =
|
adamc@754
|
788 case xts of
|
adamc@754
|
789 [] => SOME (ERecord acc, #2 c)
|
adamc@754
|
790 | (x, t) :: xts =>
|
adamc@754
|
791 let
|
adamc@754
|
792 val t = hnorm t
|
adamc@750
|
793
|
adamc@754
|
794 val t = case t of
|
adamc@754
|
795 (CApp (f, x), loc) => (CApp (hnorm f, hnorm x), loc)
|
adamc@754
|
796 | _ => t
|
adamc@754
|
797 in
|
adam@1742
|
798 case resolve false t of
|
adam@1742
|
799 NONE => notFound ()
|
adamc@754
|
800 | SOME e => resolver (xts, (x, e, t) :: acc)
|
adamc@754
|
801 end
|
adamc@754
|
802 in
|
adamc@754
|
803 resolver (xts, [])
|
adamc@754
|
804 end
|
adam@1742
|
805 | _ => notFound ())
|
adamc@754
|
806 | _ =>
|
adamc@754
|
807 case class_head_in c of
|
adamc@754
|
808 SOME f => doHead f
|
adam@1742
|
809 | _ => notFound ()
|
adamc@711
|
810 end
|
adamc@674
|
811 in
|
adam@1742
|
812 cause := NONE;
|
adam@1742
|
813 resolve true
|
adamc@674
|
814 end
|
adamc@211
|
815
|
adam@1795
|
816 fun rule_in c =
|
adam@1795
|
817 let
|
adam@1795
|
818 fun quantifiers (c, nvars) =
|
adam@1795
|
819 case #1 c of
|
adam@1795
|
820 CUnif (_, _, _, _, ref (Known c)) => quantifiers (c, nvars)
|
adam@1795
|
821 | TCFun (_, _, _, c) => quantifiers (c, nvars + 1)
|
adam@1795
|
822 | _ =>
|
adam@1795
|
823 let
|
adam@1795
|
824 fun clauses (c, hyps) =
|
adam@1795
|
825 case #1 c of
|
adam@1795
|
826 TFun (hyp, c) =>
|
adam@1795
|
827 (case class_head_in hyp of
|
adam@1795
|
828 SOME _ => clauses (c, hyp :: hyps)
|
adam@1795
|
829 | NONE => NONE)
|
adam@1795
|
830 | _ =>
|
adam@1795
|
831 case class_head_in c of
|
adam@1795
|
832 NONE => NONE
|
adam@1795
|
833 | SOME f => SOME (f, nvars, rev hyps, c)
|
adam@1795
|
834 in
|
adam@1795
|
835 clauses (c, [])
|
adam@1795
|
836 end
|
adam@1795
|
837 in
|
adam@1795
|
838 quantifiers (c, 0)
|
adam@1795
|
839 end
|
adam@1795
|
840
|
adamc@9
|
841 fun pushERel (env : env) x t =
|
adamc@9
|
842 let
|
adamc@9
|
843 val renameE = SM.map (fn Rel' (n, t) => Rel' (n+1, t)
|
adamc@9
|
844 | x => x) (#renameE env)
|
adamc@211
|
845
|
adamc@675
|
846 val classes = CM.map (fn class =>
|
adam@1795
|
847 {openRules = map (fn (nvs, cs, c, e) => (nvs, cs, c, liftExp e)) (#openRules class),
|
adam@1795
|
848 closedRules = #closedRules class}) (#classes env)
|
adam@1795
|
849 val classes = case rule_in t of
|
adamc@211
|
850 NONE => classes
|
adam@1795
|
851 | SOME (f, nvs, cs, c) =>
|
adamc@403
|
852 case CM.find (classes, f) of
|
adamc@403
|
853 NONE => classes
|
adamc@403
|
854 | SOME class =>
|
adamc@403
|
855 let
|
adam@1795
|
856 val rule = (nvs, cs, c, (ERel 0, #2 t))
|
adam@1795
|
857
|
adam@1795
|
858 val class =
|
adam@1795
|
859 if openCon t then
|
adam@1795
|
860 {openRules = rule :: #openRules class,
|
adam@1795
|
861 closedRules = #closedRules class}
|
adam@1795
|
862 else
|
adam@1795
|
863 {closedRules = rule :: #closedRules class,
|
adam@1795
|
864 openRules = #openRules class}
|
adamc@403
|
865 in
|
adamc@403
|
866 CM.insert (classes, f, class)
|
adamc@403
|
867 end
|
adamc@9
|
868 in
|
adamc@623
|
869 {renameK = #renameK env,
|
adamc@623
|
870 relK = #relK env,
|
adamc@623
|
871
|
adamc@623
|
872 renameC = #renameC env,
|
adamc@9
|
873 relC = #relC env,
|
adamc@9
|
874 namedC = #namedC env,
|
adamc@9
|
875
|
adamc@157
|
876 datatypes = #datatypes env,
|
adamc@171
|
877 constructors = #constructors env,
|
adamc@157
|
878
|
adamc@211
|
879 classes = classes,
|
adamc@211
|
880
|
adamc@9
|
881 renameE = SM.insert (renameE, x, Rel' (0, t)),
|
adamc@9
|
882 relE = (x, t) :: #relE env,
|
adamc@31
|
883 namedE = #namedE env,
|
adamc@31
|
884
|
adamc@31
|
885 renameSgn = #renameSgn env,
|
adamc@31
|
886 sgn = #sgn env,
|
adamc@31
|
887
|
adamc@31
|
888 renameStr = #renameStr env,
|
adamc@31
|
889 str = #str env}
|
adamc@9
|
890 end
|
adamc@9
|
891
|
adamc@9
|
892 fun lookupERel (env : env) n =
|
adamc@9
|
893 (List.nth (#relE env, n))
|
adamc@9
|
894 handle Subscript => raise UnboundRel n
|
adamc@9
|
895
|
adamc@9
|
896 fun pushENamedAs (env : env) x n t =
|
adamc@211
|
897 let
|
adamc@211
|
898 val classes = #classes env
|
adamc@674
|
899 val classes = case rule_in t of
|
adamc@211
|
900 NONE => classes
|
adamc@711
|
901 | SOME (f, nvs, cs, c) =>
|
adamc@403
|
902 case CM.find (classes, f) of
|
adamc@403
|
903 NONE => classes
|
adamc@403
|
904 | SOME class =>
|
adamc@403
|
905 let
|
adamc@675
|
906 val e = (ENamed n, #2 t)
|
adamc@675
|
907
|
adamc@675
|
908 val class =
|
adam@1795
|
909 {openRules = #openRules class,
|
adam@1795
|
910 closedRules = (nvs, cs, c, e) :: #closedRules class}
|
adamc@403
|
911 in
|
adamc@403
|
912 CM.insert (classes, f, class)
|
adamc@403
|
913 end
|
adamc@211
|
914 in
|
adamc@623
|
915 {renameK = #renameK env,
|
adamc@623
|
916 relK = #relK env,
|
adamc@623
|
917
|
adamc@623
|
918 renameC = #renameC env,
|
adamc@211
|
919 relC = #relC env,
|
adamc@211
|
920 namedC = #namedC env,
|
adamc@9
|
921
|
adamc@211
|
922 datatypes = #datatypes env,
|
adamc@211
|
923 constructors = #constructors env,
|
adamc@157
|
924
|
adamc@211
|
925 classes = classes,
|
adamc@31
|
926
|
adamc@211
|
927 renameE = SM.insert (#renameE env, x, Named' (n, t)),
|
adamc@211
|
928 relE = #relE env,
|
adamc@211
|
929 namedE = IM.insert (#namedE env, n, (x, t)),
|
adamc@211
|
930
|
adamc@211
|
931 renameSgn = #renameSgn env,
|
adamc@211
|
932 sgn = #sgn env,
|
adamc@211
|
933
|
adamc@211
|
934 renameStr = #renameStr env,
|
adamc@211
|
935 str = #str env}
|
adamc@211
|
936 end
|
adamc@9
|
937
|
adamc@9
|
938 fun pushENamed env x t =
|
adamc@9
|
939 let
|
adamc@9
|
940 val n = !namedCounter
|
adamc@9
|
941 in
|
adamc@9
|
942 namedCounter := n + 1;
|
adamc@9
|
943 (pushENamedAs env x n t, n)
|
adamc@9
|
944 end
|
adamc@9
|
945
|
adamc@9
|
946 fun lookupENamed (env : env) n =
|
adamc@9
|
947 case IM.find (#namedE env, n) of
|
adamc@9
|
948 NONE => raise UnboundNamed n
|
adamc@9
|
949 | SOME x => x
|
adamc@9
|
950
|
adamc@471
|
951 fun checkENamed (env : env) n =
|
adamc@471
|
952 Option.isSome (IM.find (#namedE env, n))
|
adamc@471
|
953
|
adamc@9
|
954 fun lookupE (env : env) x =
|
adamc@9
|
955 case SM.find (#renameE env, x) of
|
adamc@9
|
956 NONE => NotBound
|
adamc@9
|
957 | SOME (Rel' x) => Rel x
|
adamc@9
|
958 | SOME (Named' x) => Named x
|
adamc@2
|
959
|
adamc@31
|
960 fun pushSgnNamedAs (env : env) x n sgis =
|
adamc@623
|
961 {renameK = #renameK env,
|
adamc@623
|
962 relK = #relK env,
|
adamc@623
|
963
|
adamc@623
|
964 renameC = #renameC env,
|
adamc@31
|
965 relC = #relC env,
|
adamc@31
|
966 namedC = #namedC env,
|
adamc@31
|
967
|
adamc@157
|
968 datatypes = #datatypes env,
|
adamc@171
|
969 constructors = #constructors env,
|
adamc@157
|
970
|
adamc@211
|
971 classes = #classes env,
|
adamc@211
|
972
|
adamc@31
|
973 renameE = #renameE env,
|
adamc@31
|
974 relE = #relE env,
|
adamc@31
|
975 namedE = #namedE env,
|
adamc@31
|
976
|
adamc@31
|
977 renameSgn = SM.insert (#renameSgn env, x, (n, sgis)),
|
adamc@31
|
978 sgn = IM.insert (#sgn env, n, (x, sgis)),
|
adamc@31
|
979
|
adamc@31
|
980 renameStr = #renameStr env,
|
adamc@31
|
981 str = #str env}
|
adamc@31
|
982
|
adamc@31
|
983 fun pushSgnNamed env x sgis =
|
adamc@31
|
984 let
|
adamc@31
|
985 val n = !namedCounter
|
adamc@31
|
986 in
|
adamc@31
|
987 namedCounter := n + 1;
|
adamc@31
|
988 (pushSgnNamedAs env x n sgis, n)
|
adamc@31
|
989 end
|
adamc@31
|
990
|
adamc@31
|
991 fun lookupSgnNamed (env : env) n =
|
adamc@31
|
992 case IM.find (#sgn env, n) of
|
adamc@31
|
993 NONE => raise UnboundNamed n
|
adamc@31
|
994 | SOME x => x
|
adamc@31
|
995
|
adamc@31
|
996 fun lookupSgn (env : env) x = SM.find (#renameSgn env, x)
|
adamc@31
|
997
|
adamc@31
|
998 fun lookupStrNamed (env : env) n =
|
adamc@31
|
999 case IM.find (#str env, n) of
|
adamc@31
|
1000 NONE => raise UnboundNamed n
|
adamc@31
|
1001 | SOME x => x
|
adamc@31
|
1002
|
adamc@31
|
1003 fun lookupStr (env : env) x = SM.find (#renameStr env, x)
|
adamc@31
|
1004
|
adamc@203
|
1005
|
adamc@216
|
1006 fun sgiSeek (sgi, (sgns, strs, cons)) =
|
adamc@216
|
1007 case sgi of
|
adamc@216
|
1008 SgiConAbs (x, n, _) => (sgns, strs, IM.insert (cons, n, x))
|
adamc@216
|
1009 | SgiCon (x, n, _, _) => (sgns, strs, IM.insert (cons, n, x))
|
adamc@805
|
1010 | SgiDatatype dts => (sgns, strs, foldl (fn ((x, n, _, _), cons) => IM.insert (cons, n, x)) cons dts)
|
adamc@216
|
1011 | SgiDatatypeImp (x, n, _, _, _, _, _) => (sgns, strs, IM.insert (cons, n, x))
|
adamc@216
|
1012 | SgiVal _ => (sgns, strs, cons)
|
adamc@216
|
1013 | SgiSgn (x, n, _) => (IM.insert (sgns, n, x), strs, cons)
|
adamc@216
|
1014 | SgiStr (x, n, _) => (sgns, IM.insert (strs, n, x), cons)
|
adamc@216
|
1015 | SgiConstraint _ => (sgns, strs, cons)
|
adamc@563
|
1016 | SgiClassAbs (x, n, _) => (sgns, strs, IM.insert (cons, n, x))
|
adamc@563
|
1017 | SgiClass (x, n, _, _) => (sgns, strs, IM.insert (cons, n, x))
|
adamc@216
|
1018
|
adamc@34
|
1019 fun sgnSeek f sgis =
|
adamc@34
|
1020 let
|
adamc@59
|
1021 fun seek (sgis, sgns, strs, cons) =
|
adamc@34
|
1022 case sgis of
|
adamc@34
|
1023 [] => NONE
|
adamc@34
|
1024 | (sgi, _) :: sgis =>
|
adamc@34
|
1025 case f sgi of
|
adamc@158
|
1026 SOME v =>
|
adamc@158
|
1027 let
|
adamc@158
|
1028 val cons =
|
adamc@158
|
1029 case sgi of
|
adamc@805
|
1030 SgiDatatype dts => foldl (fn ((x, n, _, _), cons) => IM.insert (cons, n, x)) cons dts
|
adamc@191
|
1031 | SgiDatatypeImp (x, n, _, _, _, _, _) => IM.insert (cons, n, x)
|
adamc@158
|
1032 | _ => cons
|
adamc@158
|
1033 in
|
adamc@158
|
1034 SOME (v, (sgns, strs, cons))
|
adamc@158
|
1035 end
|
adamc@88
|
1036 | NONE =>
|
adamc@216
|
1037 let
|
adamc@216
|
1038 val (sgns, strs, cons) = sgiSeek (sgi, (sgns, strs, cons))
|
adamc@216
|
1039 in
|
adamc@216
|
1040 seek (sgis, sgns, strs, cons)
|
adamc@216
|
1041 end
|
adamc@34
|
1042 in
|
adamc@59
|
1043 seek (sgis, IM.empty, IM.empty, IM.empty)
|
adamc@34
|
1044 end
|
adamc@34
|
1045
|
adamc@34
|
1046 fun id x = x
|
adamc@34
|
1047
|
adamc@34
|
1048 fun unravelStr (str, _) =
|
adamc@34
|
1049 case str of
|
adamc@34
|
1050 StrVar x => (x, [])
|
adamc@34
|
1051 | StrProj (str, m) =>
|
adamc@34
|
1052 let
|
adamc@34
|
1053 val (x, ms) = unravelStr str
|
adamc@34
|
1054 in
|
adamc@34
|
1055 (x, ms @ [m])
|
adamc@34
|
1056 end
|
adamc@34
|
1057 | _ => raise Fail "unravelStr"
|
adamc@34
|
1058
|
adamc@59
|
1059 fun sgnS_con (str, (sgns, strs, cons)) c =
|
adamc@34
|
1060 case c of
|
adamc@34
|
1061 CModProj (m1, ms, x) =>
|
adamc@34
|
1062 (case IM.find (strs, m1) of
|
adamc@34
|
1063 NONE => c
|
adamc@34
|
1064 | SOME m1x =>
|
adamc@34
|
1065 let
|
adamc@34
|
1066 val (m1, ms') = unravelStr str
|
adamc@34
|
1067 in
|
adamc@34
|
1068 CModProj (m1, ms' @ m1x :: ms, x)
|
adamc@34
|
1069 end)
|
adamc@34
|
1070 | CNamed n =>
|
adamc@34
|
1071 (case IM.find (cons, n) of
|
adamc@34
|
1072 NONE => c
|
adamc@34
|
1073 | SOME nx =>
|
adamc@34
|
1074 let
|
adamc@34
|
1075 val (m1, ms) = unravelStr str
|
adamc@34
|
1076 in
|
adamc@34
|
1077 CModProj (m1, ms, nx)
|
adamc@34
|
1078 end)
|
adamc@34
|
1079 | _ => c
|
adamc@34
|
1080
|
adamc@721
|
1081 fun sgnS_con' (m1, ms', (sgns, strs, cons)) =
|
adamc@721
|
1082 U.Con.map {kind = fn x => x,
|
adamc@721
|
1083 con = fn c =>
|
adamc@721
|
1084 case c of
|
kkallio@1454
|
1085 CModProj (m1', ms, x) =>
|
kkallio@1454
|
1086 (case IM.find (strs, m1') of
|
adamc@721
|
1087 NONE => c
|
adamc@721
|
1088 | SOME m1x => CModProj (m1, ms' @ m1x :: ms, x))
|
adamc@721
|
1089 | CNamed n =>
|
adamc@721
|
1090 (case IM.find (cons, n) of
|
adamc@721
|
1091 NONE => c
|
adamc@721
|
1092 | SOME nx => CModProj (m1, ms', nx))
|
adamc@721
|
1093 | _ => c}
|
adamc@216
|
1094
|
adamc@59
|
1095 fun sgnS_sgn (str, (sgns, strs, cons)) sgn =
|
adamc@59
|
1096 case sgn of
|
adamc@59
|
1097 SgnProj (m1, ms, x) =>
|
adamc@59
|
1098 (case IM.find (strs, m1) of
|
adamc@59
|
1099 NONE => sgn
|
adamc@59
|
1100 | SOME m1x =>
|
adamc@59
|
1101 let
|
adamc@59
|
1102 val (m1, ms') = unravelStr str
|
adamc@59
|
1103 in
|
adamc@59
|
1104 SgnProj (m1, ms' @ m1x :: ms, x)
|
adamc@59
|
1105 end)
|
adamc@59
|
1106 | SgnVar n =>
|
adamc@59
|
1107 (case IM.find (sgns, n) of
|
adamc@59
|
1108 NONE => sgn
|
adamc@59
|
1109 | SOME nx =>
|
adamc@59
|
1110 let
|
adamc@59
|
1111 val (m1, ms) = unravelStr str
|
adamc@59
|
1112 in
|
adamc@59
|
1113 SgnProj (m1, ms, nx)
|
adamc@59
|
1114 end)
|
adamc@59
|
1115 | _ => sgn
|
adamc@59
|
1116
|
adamc@59
|
1117 fun sgnSubSgn x =
|
adamc@34
|
1118 ElabUtil.Sgn.map {kind = id,
|
adamc@59
|
1119 con = sgnS_con x,
|
adamc@34
|
1120 sgn_item = id,
|
adamc@59
|
1121 sgn = sgnS_sgn x}
|
adamc@34
|
1122
|
adamc@211
|
1123
|
adamc@211
|
1124
|
adamc@211
|
1125 and projectSgn env {sgn, str, field} =
|
adamc@211
|
1126 case #1 (hnormSgn env sgn) of
|
adamc@211
|
1127 SgnConst sgis =>
|
adamc@211
|
1128 (case sgnSeek (fn SgiSgn (x, _, sgn) => if x = field then SOME sgn else NONE | _ => NONE) sgis of
|
adamc@211
|
1129 NONE => NONE
|
adamc@211
|
1130 | SOME (sgn, subs) => SOME (sgnSubSgn (str, subs) sgn))
|
adamc@211
|
1131 | SgnError => SOME (SgnError, ErrorMsg.dummySpan)
|
adamc@211
|
1132 | _ => NONE
|
adamc@211
|
1133
|
adamc@211
|
1134 and hnormSgn env (all as (sgn, loc)) =
|
adamc@34
|
1135 case sgn of
|
adamc@42
|
1136 SgnError => all
|
adamc@42
|
1137 | SgnVar n => hnormSgn env (#2 (lookupSgnNamed env n))
|
adamc@42
|
1138 | SgnConst _ => all
|
adamc@42
|
1139 | SgnFun _ => all
|
adamc@59
|
1140 | SgnProj (m, ms, x) =>
|
adamc@59
|
1141 let
|
adamc@59
|
1142 val (_, sgn) = lookupStrNamed env m
|
adamc@59
|
1143 in
|
adamc@59
|
1144 case projectSgn env {str = foldl (fn (m, str) => (StrProj (str, m), loc)) (StrVar m, loc) ms,
|
adamc@59
|
1145 sgn = sgn,
|
adamc@59
|
1146 field = x} of
|
adamc@59
|
1147 NONE => raise Fail "ElabEnv.hnormSgn: projectSgn failed"
|
adamc@1058
|
1148 | SOME sgn => hnormSgn env sgn
|
adamc@59
|
1149 end
|
adamc@42
|
1150 | SgnWhere (sgn, x, c) =>
|
adamc@42
|
1151 case #1 (hnormSgn env sgn) of
|
adamc@42
|
1152 SgnError => (SgnError, loc)
|
adamc@42
|
1153 | SgnConst sgis =>
|
adamc@42
|
1154 let
|
adamc@42
|
1155 fun traverse (pre, post) =
|
adamc@42
|
1156 case post of
|
adamc@42
|
1157 [] => raise Fail "ElabEnv.hnormSgn: Can't reduce 'where' [1]"
|
adamc@42
|
1158 | (sgi as (SgiConAbs (x', n, k), loc)) :: rest =>
|
adamc@42
|
1159 if x = x' then
|
adamc@42
|
1160 List.revAppend (pre, (SgiCon (x', n, k, c), loc) :: rest)
|
adamc@42
|
1161 else
|
adamc@42
|
1162 traverse (sgi :: pre, rest)
|
adamc@42
|
1163 | sgi :: rest => traverse (sgi :: pre, rest)
|
adamc@42
|
1164
|
adamc@42
|
1165 val sgis = traverse ([], sgis)
|
adamc@42
|
1166 in
|
adamc@42
|
1167 (SgnConst sgis, loc)
|
adamc@42
|
1168 end
|
adamc@42
|
1169 | _ => raise Fail "ElabEnv.hnormSgn: Can't reduce 'where' [2]"
|
adamc@42
|
1170
|
adamc@849
|
1171 fun manifest (m, ms, loc) =
|
adamc@849
|
1172 foldl (fn (m, str) => (StrProj (str, m), loc)) (StrVar m, loc) ms
|
adamc@849
|
1173
|
adamc@211
|
1174 fun enrichClasses env classes (m1, ms) sgn =
|
adamc@59
|
1175 case #1 (hnormSgn env sgn) of
|
adamc@59
|
1176 SgnConst sgis =>
|
adamc@211
|
1177 let
|
adamc@218
|
1178 val (classes, _, _, _) =
|
adamc@218
|
1179 foldl (fn (sgi, (classes, newClasses, fmap, env)) =>
|
adamc@211
|
1180 let
|
adamc@211
|
1181 fun found (x, n) =
|
adamc@211
|
1182 (CM.insert (classes,
|
adamc@211
|
1183 ClProj (m1, ms, x),
|
adamc@211
|
1184 empty_class),
|
adamc@216
|
1185 IM.insert (newClasses, n, x),
|
adamc@218
|
1186 sgiSeek (#1 sgi, fmap),
|
adamc@218
|
1187 env)
|
adamc@216
|
1188
|
adamc@218
|
1189 fun default () = (classes, newClasses, sgiSeek (#1 sgi, fmap), env)
|
adamc@211
|
1190 in
|
adamc@211
|
1191 case #1 sgi of
|
adamc@217
|
1192 SgiStr (x, _, sgn) =>
|
adamc@849
|
1193 let
|
adamc@849
|
1194 val str = manifest (m1, ms, #2 sgi)
|
adamc@849
|
1195 val sgn' = sgnSubSgn (str, fmap) sgn
|
adamc@849
|
1196 in
|
adamc@849
|
1197 (enrichClasses env classes (m1, ms @ [x]) sgn',
|
adamc@849
|
1198 newClasses,
|
adamc@849
|
1199 sgiSeek (#1 sgi, fmap),
|
adamc@849
|
1200 env)
|
adamc@849
|
1201 end
|
adamc@218
|
1202 | SgiSgn (x, n, sgn) =>
|
adamc@218
|
1203 (classes,
|
adamc@218
|
1204 newClasses,
|
adamc@218
|
1205 fmap,
|
adamc@218
|
1206 pushSgnNamedAs env x n sgn)
|
adamc@218
|
1207
|
adamc@563
|
1208 | SgiClassAbs (x, n, _) => found (x, n)
|
adamc@563
|
1209 | SgiClass (x, n, _, _) => found (x, n)
|
adamc@674
|
1210 | SgiVal (x, n, c) =>
|
adamc@674
|
1211 (case rule_in c of
|
adamc@674
|
1212 NONE => default ()
|
adamc@711
|
1213 | SOME (cn, nvs, cs, c) =>
|
adamc@674
|
1214 let
|
adamc@711
|
1215 val loc = #2 c
|
adamc@721
|
1216 val globalize = sgnS_con' (m1, ms, fmap)
|
adamc@674
|
1217
|
adamc@674
|
1218 val nc =
|
adamc@674
|
1219 case cn of
|
adamc@674
|
1220 ClNamed f => IM.find (newClasses, f)
|
adamc@674
|
1221 | _ => NONE
|
adamc@674
|
1222 in
|
adamc@674
|
1223 case nc of
|
adamc@674
|
1224 NONE =>
|
adamc@419
|
1225 let
|
adamc@419
|
1226 val classes =
|
adamc@419
|
1227 case CM.find (classes, cn) of
|
adamc@419
|
1228 NONE => classes
|
adamc@419
|
1229 | SOME class =>
|
adamc@419
|
1230 let
|
adamc@711
|
1231 val e = (EModProj (m1, ms, x), #2 sgn)
|
adamc@675
|
1232
|
adamc@675
|
1233 val class =
|
adam@1795
|
1234 {openRules = #openRules class,
|
adam@1795
|
1235 closedRules = (nvs,
|
adam@1795
|
1236 map globalize cs,
|
adam@1795
|
1237 globalize c,
|
adam@1795
|
1238 e) :: #closedRules class}
|
adamc@419
|
1239 in
|
adamc@419
|
1240 CM.insert (classes, cn, class)
|
adamc@419
|
1241 end
|
adamc@419
|
1242 in
|
adamc@419
|
1243 (classes,
|
adamc@419
|
1244 newClasses,
|
adamc@419
|
1245 fmap,
|
adamc@419
|
1246 env)
|
adamc@419
|
1247 end
|
adamc@674
|
1248 | SOME fx =>
|
adamc@674
|
1249 let
|
adamc@674
|
1250 val cn = ClProj (m1, ms, fx)
|
adamc@419
|
1251
|
adamc@674
|
1252 val classes =
|
adamc@674
|
1253 case CM.find (classes, cn) of
|
adamc@674
|
1254 NONE => classes
|
adamc@674
|
1255 | SOME class =>
|
adamc@674
|
1256 let
|
adamc@675
|
1257 val e = (EModProj (m1, ms, x), #2 sgn)
|
adamc@675
|
1258
|
adamc@675
|
1259 val class =
|
adam@1795
|
1260 {openRules = #openRules class,
|
adam@1795
|
1261 closedRules = (nvs,
|
adam@1795
|
1262 map globalize cs,
|
adam@1795
|
1263 globalize c,
|
adam@1795
|
1264 e) :: #closedRules class}
|
adamc@674
|
1265 in
|
adamc@674
|
1266 CM.insert (classes, cn, class)
|
adamc@674
|
1267 end
|
adamc@674
|
1268 in
|
adamc@674
|
1269 (classes,
|
adamc@674
|
1270 newClasses,
|
adamc@674
|
1271 fmap,
|
adamc@674
|
1272 env)
|
adamc@674
|
1273 end
|
adamc@674
|
1274 end)
|
adamc@216
|
1275 | _ => default ()
|
adamc@211
|
1276 end)
|
adamc@218
|
1277 (classes, IM.empty, (IM.empty, IM.empty, IM.empty), env) sgis
|
adamc@211
|
1278 in
|
adamc@211
|
1279 classes
|
adamc@211
|
1280 end
|
adamc@211
|
1281 | _ => classes
|
adamc@211
|
1282
|
adamc@211
|
1283 fun pushStrNamedAs (env : env) x n sgn =
|
adamc@623
|
1284 {renameK = #renameK env,
|
adamc@623
|
1285 relK = #relK env,
|
adamc@623
|
1286
|
adamc@623
|
1287 renameC = #renameC env,
|
adamc@211
|
1288 relC = #relC env,
|
adamc@211
|
1289 namedC = #namedC env,
|
adamc@211
|
1290
|
adamc@211
|
1291 datatypes = #datatypes env,
|
adamc@211
|
1292 constructors = #constructors env,
|
adamc@211
|
1293
|
adamc@211
|
1294 classes = enrichClasses env (#classes env) (n, []) sgn,
|
adamc@211
|
1295
|
adamc@211
|
1296 renameE = #renameE env,
|
adamc@211
|
1297 relE = #relE env,
|
adamc@211
|
1298 namedE = #namedE env,
|
adamc@211
|
1299
|
adamc@211
|
1300 renameSgn = #renameSgn env,
|
adamc@211
|
1301 sgn = #sgn env,
|
adamc@211
|
1302
|
adamc@211
|
1303 renameStr = SM.insert (#renameStr env, x, (n, sgn)),
|
adamc@211
|
1304 str = IM.insert (#str env, n, (x, sgn))}
|
adamc@211
|
1305
|
adamc@211
|
1306 fun pushStrNamed env x sgn =
|
adamc@211
|
1307 let
|
adamc@211
|
1308 val n = !namedCounter
|
adamc@211
|
1309 in
|
adamc@211
|
1310 namedCounter := n + 1;
|
adamc@211
|
1311 (pushStrNamedAs env x n sgn, n)
|
adamc@211
|
1312 end
|
adamc@211
|
1313
|
adamc@211
|
1314 fun sgiBinds env (sgi, loc) =
|
adamc@211
|
1315 case sgi of
|
adamc@211
|
1316 SgiConAbs (x, n, k) => pushCNamedAs env x n k NONE
|
adamc@211
|
1317 | SgiCon (x, n, k, c) => pushCNamedAs env x n k (SOME c)
|
adamc@805
|
1318 | SgiDatatype dts =>
|
adamc@211
|
1319 let
|
adamc@805
|
1320 fun doOne ((x, n, xs, xncs), env) =
|
adamc@805
|
1321 let
|
adamc@805
|
1322 val k = (KType, loc)
|
adamc@805
|
1323 val k' = foldr (fn (_, k') => (KArrow (k, k'), loc)) k xs
|
adamc@341
|
1324
|
adamc@805
|
1325 val env = pushCNamedAs env x n k' NONE
|
adamc@805
|
1326 in
|
adamc@805
|
1327 foldl (fn ((x', n', to), env) =>
|
adamc@805
|
1328 let
|
adamc@805
|
1329 val t =
|
adamc@805
|
1330 case to of
|
adamc@805
|
1331 NONE => (CNamed n, loc)
|
adamc@805
|
1332 | SOME t => (TFun (t, (CNamed n, loc)), loc)
|
adamc@805
|
1333
|
adamc@805
|
1334 val k = (KType, loc)
|
adamc@805
|
1335 val t = foldr (fn (x, t) => (TCFun (Explicit, x, k, t), loc)) t xs
|
adamc@805
|
1336 in
|
adamc@805
|
1337 pushENamedAs env x' n' t
|
adamc@805
|
1338 end)
|
adamc@805
|
1339 env xncs
|
adamc@805
|
1340 end
|
adamc@211
|
1341 in
|
adamc@805
|
1342 foldl doOne env dts
|
adamc@211
|
1343 end
|
adamc@211
|
1344 | SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
|
adamc@211
|
1345 let
|
adamc@341
|
1346 val k = (KType, loc)
|
adamc@341
|
1347 val k' = foldr (fn (_, k') => (KArrow (k, k'), loc)) k xs
|
adamc@341
|
1348
|
adamc@341
|
1349 val env = pushCNamedAs env x n k' (SOME (CModProj (m1, ms, x'), loc))
|
adamc@211
|
1350 in
|
adamc@211
|
1351 foldl (fn ((x', n', to), env) =>
|
adamc@211
|
1352 let
|
adamc@211
|
1353 val t =
|
adamc@211
|
1354 case to of
|
adamc@211
|
1355 NONE => (CNamed n, loc)
|
adamc@211
|
1356 | SOME t => (TFun (t, (CNamed n, loc)), loc)
|
adamc@211
|
1357
|
adamc@211
|
1358 val k = (KType, loc)
|
adamc@211
|
1359 val t = foldr (fn (x, t) => (TCFun (Explicit, x, k, t), loc)) t xs
|
adamc@211
|
1360 in
|
adamc@211
|
1361 pushENamedAs env x' n' t
|
adamc@211
|
1362 end)
|
adamc@211
|
1363 env xncs
|
adamc@211
|
1364 end
|
adamc@211
|
1365 | SgiVal (x, n, t) => pushENamedAs env x n t
|
adamc@211
|
1366 | SgiStr (x, n, sgn) => pushStrNamedAs env x n sgn
|
adamc@211
|
1367 | SgiSgn (x, n, sgn) => pushSgnNamedAs env x n sgn
|
adamc@211
|
1368 | SgiConstraint _ => env
|
adamc@211
|
1369
|
adamc@711
|
1370 | SgiClassAbs (x, n, k) => pushCNamedAs env x n k NONE
|
adamc@711
|
1371 | SgiClass (x, n, k, c) => pushCNamedAs env x n k (SOME c)
|
adamc@459
|
1372
|
adamc@211
|
1373 fun sgnSubCon x =
|
adamc@211
|
1374 ElabUtil.Con.map {kind = id,
|
adamc@211
|
1375 con = sgnS_con x}
|
adamc@59
|
1376
|
adamc@59
|
1377 fun projectStr env {sgn, str, field} =
|
adamc@59
|
1378 case #1 (hnormSgn env sgn) of
|
adamc@59
|
1379 SgnConst sgis =>
|
adamc@59
|
1380 (case sgnSeek (fn SgiStr (x, _, sgn) => if x = field then SOME sgn else NONE | _ => NONE) sgis of
|
adamc@59
|
1381 NONE => NONE
|
adamc@59
|
1382 | SOME (sgn, subs) => SOME (sgnSubSgn (str, subs) sgn))
|
adamc@59
|
1383 | SgnError => SOME (SgnError, ErrorMsg.dummySpan)
|
adamc@59
|
1384 | _ => NONE
|
adamc@59
|
1385
|
adamc@158
|
1386 fun chaseMpath env (n, ms) =
|
adamc@158
|
1387 let
|
adamc@158
|
1388 val (_, sgn) = lookupStrNamed env n
|
adamc@158
|
1389 in
|
adamc@158
|
1390 foldl (fn (m, (str, sgn)) =>
|
adamc@158
|
1391 case projectStr env {sgn = sgn, str = str, field = m} of
|
adamc@158
|
1392 NONE => raise Fail "kindof: Unknown substructure"
|
adamc@158
|
1393 | SOME sgn => ((StrProj (str, m), #2 sgn), sgn))
|
adamc@158
|
1394 ((StrVar n, #2 sgn), sgn) ms
|
adamc@158
|
1395 end
|
adamc@158
|
1396
|
adamc@42
|
1397 fun projectCon env {sgn, str, field} =
|
adamc@42
|
1398 case #1 (hnormSgn env sgn) of
|
adamc@34
|
1399 SgnConst sgis =>
|
adamc@34
|
1400 (case sgnSeek (fn SgiConAbs (x, _, k) => if x = field then SOME (k, NONE) else NONE
|
adamc@34
|
1401 | SgiCon (x, _, k, c) => if x = field then SOME (k, SOME c) else NONE
|
adamc@805
|
1402 | SgiDatatype dts =>
|
adamc@805
|
1403 (case List.find (fn (x, _, xs, _) => x = field) dts of
|
adamc@805
|
1404 SOME (_, _, xs, _) =>
|
adamc@805
|
1405 let
|
adamc@805
|
1406 val k = (KType, #2 sgn)
|
adamc@805
|
1407 val k' = foldl (fn (_, k') => (KArrow (k, k'), #2 sgn)) k xs
|
adamc@805
|
1408 in
|
adamc@805
|
1409 SOME (k', NONE)
|
adamc@805
|
1410 end
|
adamc@805
|
1411 | NONE => NONE)
|
adamc@341
|
1412 | SgiDatatypeImp (x, _, m1, ms, x', xs, _) =>
|
adamc@341
|
1413 if x = field then
|
adamc@341
|
1414 let
|
adamc@341
|
1415 val k = (KType, #2 sgn)
|
adamc@341
|
1416 val k' = foldl (fn (_, k') => (KArrow (k, k'), #2 sgn)) k xs
|
adamc@341
|
1417 in
|
adamc@341
|
1418 SOME (k', SOME (CModProj (m1, ms, x'), #2 sgn))
|
adamc@341
|
1419 end
|
adamc@158
|
1420 else
|
adamc@158
|
1421 NONE
|
adamc@563
|
1422 | SgiClassAbs (x, _, k) => if x = field then
|
kkallio@1453
|
1423 SOME (k, NONE)
|
adamc@563
|
1424 else
|
adamc@563
|
1425 NONE
|
adamc@563
|
1426 | SgiClass (x, _, k, c) => if x = field then
|
kkallio@1453
|
1427 SOME (k, SOME c)
|
adamc@563
|
1428 else
|
adamc@563
|
1429 NONE
|
adamc@34
|
1430 | _ => NONE) sgis of
|
adamc@34
|
1431 NONE => NONE
|
adamc@34
|
1432 | SOME ((k, co), subs) => SOME (k, Option.map (sgnSubCon (str, subs)) co))
|
adamc@34
|
1433 | SgnError => SOME ((KError, ErrorMsg.dummySpan), SOME (CError, ErrorMsg.dummySpan))
|
adamc@42
|
1434 | _ => NONE
|
adamc@34
|
1435
|
adamc@157
|
1436 fun projectDatatype env {sgn, str, field} =
|
adamc@157
|
1437 case #1 (hnormSgn env sgn) of
|
adamc@157
|
1438 SgnConst sgis =>
|
adamc@805
|
1439 (case sgnSeek (fn SgiDatatype dts =>
|
adamc@805
|
1440 (case List.find (fn (x, _, _, _) => x = field) dts of
|
adamc@805
|
1441 SOME (_, _, xs, xncs) => SOME (xs, xncs)
|
adamc@805
|
1442 | NONE => NONE)
|
adamc@191
|
1443 | SgiDatatypeImp (x, _, _, _, _, xs, xncs) => if x = field then SOME (xs, xncs) else NONE
|
adamc@157
|
1444 | _ => NONE) sgis of
|
adamc@157
|
1445 NONE => NONE
|
adamc@191
|
1446 | SOME ((xs, xncs), subs) => SOME (xs,
|
adamc@191
|
1447 map (fn (x, n, to) => (x, n, Option.map (sgnSubCon (str, subs)) to)) xncs))
|
adamc@157
|
1448 | _ => NONE
|
adamc@157
|
1449
|
adamc@174
|
1450 fun projectConstructor env {sgn, str, field} =
|
adamc@174
|
1451 case #1 (hnormSgn env sgn) of
|
adamc@174
|
1452 SgnConst sgis =>
|
adamc@174
|
1453 let
|
adamc@191
|
1454 fun consider (n, xs, xncs) =
|
adamc@174
|
1455 ListUtil.search (fn (x, n', to) =>
|
adamc@174
|
1456 if x <> field then
|
adamc@174
|
1457 NONE
|
adamc@174
|
1458 else
|
adamc@191
|
1459 SOME (U.classifyDatatype xncs, n', xs, to, (CNamed n, #2 str))) xncs
|
adamc@174
|
1460 in
|
adamc@805
|
1461 case sgnSeek (fn SgiDatatype dts =>
|
adamc@805
|
1462 let
|
adamc@805
|
1463 fun search dts =
|
adamc@805
|
1464 case dts of
|
adamc@805
|
1465 [] => NONE
|
adamc@805
|
1466 | (_, n, xs, xncs) :: dts =>
|
adamc@805
|
1467 case consider (n, xs, xncs) of
|
adamc@805
|
1468 NONE => search dts
|
adamc@805
|
1469 | v => v
|
adamc@805
|
1470 in
|
adamc@805
|
1471 search dts
|
adamc@805
|
1472 end
|
adamc@191
|
1473 | SgiDatatypeImp (_, n, _, _, _, xs, xncs) => consider (n, xs, xncs)
|
adamc@174
|
1474 | _ => NONE) sgis of
|
adamc@174
|
1475 NONE => NONE
|
adamc@191
|
1476 | SOME ((dk, n, xs, to, t), subs) => SOME (dk, n, xs, Option.map (sgnSubCon (str, subs)) to,
|
adamc@191
|
1477 sgnSubCon (str, subs) t)
|
adamc@174
|
1478 end
|
adamc@174
|
1479 | _ => NONE
|
adamc@174
|
1480
|
adamc@42
|
1481 fun projectVal env {sgn, str, field} =
|
adamc@42
|
1482 case #1 (hnormSgn env sgn) of
|
adamc@34
|
1483 SgnConst sgis =>
|
adamc@162
|
1484 let
|
adamc@191
|
1485 fun seek (n, xs, xncs) =
|
adamc@162
|
1486 ListUtil.search (fn (x, _, to) =>
|
adamc@162
|
1487 if x = field then
|
adamc@191
|
1488 SOME (let
|
adamc@467
|
1489 val base = (CNamed n, #2 sgn)
|
adamc@467
|
1490 val nxs = length xs
|
adamc@467
|
1491 val base = ListUtil.foldli (fn (i, _, base) =>
|
adamc@467
|
1492 (CApp (base,
|
adamc@467
|
1493 (CRel (nxs - i - 1), #2 sgn)),
|
adamc@467
|
1494 #2 sgn))
|
adamc@467
|
1495 base xs
|
adamc@467
|
1496
|
adamc@191
|
1497 val t =
|
adamc@191
|
1498 case to of
|
adamc@467
|
1499 NONE => base
|
adamc@467
|
1500 | SOME t => (TFun (t, base), #2 sgn)
|
adamc@191
|
1501 val k = (KType, #2 sgn)
|
adamc@191
|
1502 in
|
adamc@467
|
1503 foldr (fn (x, t) => (TCFun (Implicit, x, k, t), #2 sgn))
|
adamc@191
|
1504 t xs
|
adamc@191
|
1505 end)
|
adamc@162
|
1506 else
|
adamc@162
|
1507 NONE) xncs
|
adamc@162
|
1508 in
|
adamc@162
|
1509 case sgnSeek (fn SgiVal (x, _, c) => if x = field then SOME c else NONE
|
adamc@805
|
1510 | SgiDatatype dts =>
|
adamc@805
|
1511 let
|
adamc@805
|
1512 fun search dts =
|
adamc@805
|
1513 case dts of
|
adamc@805
|
1514 [] => NONE
|
adamc@805
|
1515 | (_, n, xs, xncs) :: dts =>
|
adamc@805
|
1516 case seek (n, xs, xncs) of
|
adamc@805
|
1517 NONE => search dts
|
adamc@805
|
1518 | v => v
|
adamc@805
|
1519 in
|
adamc@805
|
1520 search dts
|
adamc@805
|
1521 end
|
adamc@191
|
1522 | SgiDatatypeImp (_, n, _, _, _, xs, xncs) => seek (n, xs, xncs)
|
adamc@162
|
1523 | _ => NONE) sgis of
|
adamc@162
|
1524 NONE => NONE
|
adamc@162
|
1525 | SOME (c, subs) => SOME (sgnSubCon (str, subs) c)
|
adamc@162
|
1526 end
|
adamc@34
|
1527 | SgnError => SOME (CError, ErrorMsg.dummySpan)
|
adamc@42
|
1528 | _ => NONE
|
adamc@34
|
1529
|
adamc@88
|
1530 fun sgnSeekConstraints (str, sgis) =
|
adamc@88
|
1531 let
|
adamc@88
|
1532 fun seek (sgis, sgns, strs, cons, acc) =
|
adamc@88
|
1533 case sgis of
|
adamc@88
|
1534 [] => acc
|
adamc@88
|
1535 | (sgi, _) :: sgis =>
|
adamc@88
|
1536 case sgi of
|
adamc@88
|
1537 SgiConstraint (c1, c2) =>
|
adamc@88
|
1538 let
|
adamc@88
|
1539 val sub = sgnSubCon (str, (sgns, strs, cons))
|
adamc@88
|
1540 in
|
adamc@88
|
1541 seek (sgis, sgns, strs, cons, (sub c1, sub c2) :: acc)
|
adamc@88
|
1542 end
|
adamc@88
|
1543 | SgiConAbs (x, n, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
|
adamc@88
|
1544 | SgiCon (x, n, _, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
|
adamc@805
|
1545 | SgiDatatype dts => seek (sgis, sgns, strs,
|
adamc@805
|
1546 foldl (fn ((x, n, _, _), cons) => IM.insert (cons, n, x)) cons dts, acc)
|
adamc@191
|
1547 | SgiDatatypeImp (x, n, _, _, _, _, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
|
adamc@88
|
1548 | SgiVal _ => seek (sgis, sgns, strs, cons, acc)
|
adamc@88
|
1549 | SgiSgn (x, n, _) => seek (sgis, IM.insert (sgns, n, x), strs, cons, acc)
|
adamc@88
|
1550 | SgiStr (x, n, _) => seek (sgis, sgns, IM.insert (strs, n, x), cons, acc)
|
adamc@563
|
1551 | SgiClassAbs (x, n, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
|
adamc@563
|
1552 | SgiClass (x, n, _, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
|
adamc@88
|
1553 in
|
adamc@88
|
1554 seek (sgis, IM.empty, IM.empty, IM.empty, [])
|
adamc@88
|
1555 end
|
adamc@88
|
1556
|
adamc@88
|
1557 fun projectConstraints env {sgn, str} =
|
adamc@88
|
1558 case #1 (hnormSgn env sgn) of
|
adamc@88
|
1559 SgnConst sgis => SOME (sgnSeekConstraints (str, sgis))
|
adamc@88
|
1560 | SgnError => SOME []
|
adamc@88
|
1561 | _ => NONE
|
adamc@34
|
1562
|
adamc@825
|
1563 fun patBinds env (p, loc) =
|
adamc@825
|
1564 case p of
|
adamc@825
|
1565 PWild => env
|
adamc@825
|
1566 | PVar (x, t) => pushERel env x t
|
adamc@825
|
1567 | PPrim _ => env
|
adamc@825
|
1568 | PCon (_, _, _, NONE) => env
|
adamc@825
|
1569 | PCon (_, _, _, SOME p) => patBinds env p
|
adamc@825
|
1570 | PRecord xps => foldl (fn ((_, p, _), env) => patBinds env p) env xps
|
adamc@825
|
1571
|
adamc@1272
|
1572 fun patBindsN (p, _) =
|
adamc@1272
|
1573 case p of
|
adamc@1272
|
1574 PWild => 0
|
adamc@1272
|
1575 | PVar _ => 1
|
adamc@1272
|
1576 | PPrim _ => 0
|
adamc@1272
|
1577 | PCon (_, _, _, NONE) => 0
|
adamc@1272
|
1578 | PCon (_, _, _, SOME p) => patBindsN p
|
adamc@1272
|
1579 | PRecord xps => foldl (fn ((_, p, _), n) => patBindsN p + n) 0 xps
|
adamc@1272
|
1580
|
adamc@447
|
1581 fun edeclBinds env (d, loc) =
|
adamc@447
|
1582 case d of
|
adamc@825
|
1583 EDVal (p, _, _) => patBinds env p
|
adamc@447
|
1584 | EDValRec vis => foldl (fn ((x, t, _), env) => pushERel env x t) env vis
|
adamc@447
|
1585
|
adamc@157
|
1586 fun declBinds env (d, loc) =
|
adamc@157
|
1587 case d of
|
adamc@157
|
1588 DCon (x, n, k, c) => pushCNamedAs env x n k (SOME c)
|
adamc@805
|
1589 | DDatatype dts =>
|
adamc@157
|
1590 let
|
adamc@805
|
1591 fun doOne ((x, n, xs, xncs), env) =
|
adamc@805
|
1592 let
|
adamc@805
|
1593 val k = (KType, loc)
|
adamc@805
|
1594 val nxs = length xs
|
adamc@805
|
1595 val (tb, kb) = ListUtil.foldli (fn (i, x', (tb, kb)) =>
|
adamc@805
|
1596 ((CApp (tb, (CRel (nxs - i - 1), loc)), loc),
|
adamc@805
|
1597 (KArrow (k, kb), loc)))
|
adamc@805
|
1598 ((CNamed n, loc), k) xs
|
adamc@805
|
1599
|
adamc@805
|
1600 val env = pushCNamedAs env x n kb NONE
|
adamc@805
|
1601 val env = pushDatatype env n xs xncs
|
adamc@805
|
1602 in
|
adamc@805
|
1603 foldl (fn ((x', n', to), env) =>
|
adamc@805
|
1604 let
|
adamc@805
|
1605 val t =
|
adamc@805
|
1606 case to of
|
adamc@805
|
1607 NONE => tb
|
adamc@805
|
1608 | SOME t => (TFun (t, tb), loc)
|
adamc@805
|
1609 val t = foldr (fn (x, t) => (TCFun (Implicit, x, k, t), loc)) t xs
|
adamc@805
|
1610 in
|
adamc@805
|
1611 pushENamedAs env x' n' t
|
adamc@805
|
1612 end)
|
adamc@805
|
1613 env xncs
|
adamc@805
|
1614 end
|
adamc@157
|
1615 in
|
adamc@805
|
1616 foldl doOne env dts
|
adamc@157
|
1617 end
|
adamc@191
|
1618 | DDatatypeImp (x, n, m, ms, x', xs, xncs) =>
|
adamc@157
|
1619 let
|
adamc@157
|
1620 val t = (CModProj (m, ms, x'), loc)
|
adamc@297
|
1621 val k = (KType, loc)
|
adamc@297
|
1622 val nxs = length xs
|
adamc@297
|
1623 val (tb, kb) = ListUtil.foldli (fn (i, x', (tb, kb)) =>
|
adamc@297
|
1624 ((CApp (tb, (CRel (nxs - i - 1), loc)), loc),
|
adamc@297
|
1625 (KArrow (k, kb), loc)))
|
adamc@297
|
1626 ((CNamed n, loc), k) xs
|
adamc@297
|
1627
|
adamc@341
|
1628 val env = pushCNamedAs env x n kb (SOME t)
|
adamc@191
|
1629 val env = pushDatatype env n xs xncs
|
adamc@157
|
1630 in
|
adamc@191
|
1631 foldl (fn ((x', n', to), env) =>
|
adamc@191
|
1632 let
|
adamc@191
|
1633 val t =
|
adamc@191
|
1634 case to of
|
adamc@297
|
1635 NONE => tb
|
adamc@297
|
1636 | SOME t => (TFun (t, tb), loc)
|
adamc@297
|
1637 val t = foldr (fn (x, t) => (TCFun (Implicit, x, k, t), loc)) t xs
|
adamc@191
|
1638 in
|
adamc@191
|
1639 pushENamedAs env x' n' t
|
adamc@191
|
1640 end)
|
adamc@191
|
1641 env xncs
|
adamc@157
|
1642 end
|
adamc@157
|
1643 | DVal (x, n, t, _) => pushENamedAs env x n t
|
adamc@157
|
1644 | DValRec vis => foldl (fn ((x, n, t, _), env) => pushENamedAs env x n t) env vis
|
adamc@157
|
1645 | DSgn (x, n, sgn) => pushSgnNamedAs env x n sgn
|
adamc@157
|
1646 | DStr (x, n, sgn, _) => pushStrNamedAs env x n sgn
|
adamc@157
|
1647 | DFfiStr (x, n, sgn) => pushStrNamedAs env x n sgn
|
adamc@157
|
1648 | DConstraint _ => env
|
adamc@157
|
1649 | DExport _ => env
|
adamc@707
|
1650 | DTable (tn, x, n, c, _, pc, _, cc) =>
|
adamc@205
|
1651 let
|
adamc@705
|
1652 val ct = (CModProj (tn, [], "sql_table"), loc)
|
adamc@705
|
1653 val ct = (CApp (ct, c), loc)
|
adamc@707
|
1654 val ct = (CApp (ct, (CConcat (pc, cc), loc)), loc)
|
adamc@338
|
1655 in
|
adamc@705
|
1656 pushENamedAs env x n ct
|
adamc@338
|
1657 end
|
adamc@338
|
1658 | DSequence (tn, x, n) =>
|
adamc@338
|
1659 let
|
adamc@338
|
1660 val t = (CModProj (tn, [], "sql_sequence"), loc)
|
adamc@205
|
1661 in
|
adamc@205
|
1662 pushENamedAs env x n t
|
adamc@205
|
1663 end
|
adamc@754
|
1664 | DView (tn, x, n, _, c) =>
|
adamc@754
|
1665 let
|
adamc@754
|
1666 val ct = (CModProj (tn, [], "sql_view"), loc)
|
adamc@754
|
1667 val ct = (CApp (ct, c), loc)
|
adamc@754
|
1668 in
|
adamc@754
|
1669 pushENamedAs env x n ct
|
adamc@754
|
1670 end
|
adamc@563
|
1671 | DClass (x, n, k, c) =>
|
adamc@213
|
1672 let
|
adamc@563
|
1673 val k = (KArrow (k, (KType, loc)), loc)
|
adamc@213
|
1674 val env = pushCNamedAs env x n k (SOME c)
|
adamc@213
|
1675 in
|
adamc@213
|
1676 pushClass env n
|
adamc@213
|
1677 end
|
adamc@271
|
1678 | DDatabase _ => env
|
adamc@459
|
1679 | DCookie (tn, x, n, c) =>
|
adamc@459
|
1680 let
|
adamc@459
|
1681 val t = (CApp ((CModProj (tn, [], "cookie"), loc), c), loc)
|
adamc@459
|
1682 in
|
adamc@459
|
1683 pushENamedAs env x n t
|
adamc@459
|
1684 end
|
adamc@720
|
1685 | DStyle (tn, x, n) =>
|
adamc@718
|
1686 let
|
adamc@720
|
1687 val t = (CModProj (tn, [], "css_class"), loc)
|
adamc@718
|
1688 in
|
adamc@718
|
1689 pushENamedAs env x n t
|
adamc@718
|
1690 end
|
adamc@1075
|
1691 | DTask _ => env
|
adamc@1199
|
1692 | DPolicy _ => env
|
adam@1294
|
1693 | DOnError _ => env
|
adamc@157
|
1694
|
adamc@2
|
1695 end
|