Mercurial > urweb

annotate src/elab_env.sml @ 379:2b604ae76611

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Link demo
author Adam Chlipala <adamc@hcoop.net>
date Sun, 19 Oct 2008 12:50:49 -0400
parents 389399d65331
children 8084fa9216de
rev   line source
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 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@13 46 exception SynUnif
adamc@13 47
adamc@13 48 val liftConInCon =
adamc@13 49 U.Con.mapB {kind = fn k => k,
adamc@13 50 con = fn bound => fn c =>
adamc@13 51 case c of
adamc@16 52 CRel xn =>
adamc@13 53 if xn < bound then
adamc@13 54 c
adamc@13 55 else
adamc@16 56 CRel (xn + 1)
adamc@17 57 (*| CUnif _ => raise SynUnif*)
adamc@13 58 | _ => c,
adamc@13 59 bind = fn (bound, U.Con.Rel _) => bound + 1
adamc@13 60 | (bound, _) => bound}
adamc@13 61
adamc@13 62 val lift = liftConInCon 0
adamc@13 63
adamc@211 64 val liftExpInExp =
adamc@211 65 U.Exp.mapB {kind = fn k => k,
adamc@211 66 con = fn _ => fn c => c,
adamc@211 67 exp = fn bound => fn e =>
adamc@211 68 case e of
adamc@211 69 ERel xn =>
adamc@211 70 if xn < bound then
adamc@211 71 e
adamc@211 72 else
adamc@211 73 ERel (xn + 1)
adamc@211 74 | _ => e,
adamc@211 75 bind = fn (bound, U.Exp.RelE _) => bound + 1
adamc@211 76 | (bound, _) => bound}
adamc@211 77
adamc@211 78
adamc@211 79 val liftExp = liftExpInExp 0
adamc@13 80
adamc@13 81 (* Back to environments *)
adamc@13 82
adamc@9 83 datatype 'a var' =
adamc@9 84 Rel' of int * 'a
adamc@9 85 | Named' of int * 'a
adamc@2 86
adamc@9 87 datatype 'a var =
adamc@9 88 NotBound
adamc@9 89 | Rel of int * 'a
adamc@9 90 | Named of int * 'a
adamc@2 91
adamc@191 92 type datatyp = string list * (string * con option) IM.map
adamc@157 93
adamc@211 94 datatype class_name =
adamc@211 95 ClNamed of int
adamc@211 96 | ClProj of int * string list * string
adamc@211 97
adamc@216 98 fun cn2s cn =
adamc@216 99 case cn of
adamc@216 100 ClNamed n => "Named(" ^ Int.toString n ^ ")"
adamc@216 101 | ClProj (m, ms, x) => "Proj(" ^ Int.toString m ^ "," ^ String.concatWith "," ms ^ "," ^ x ^ ")"
adamc@216 102
adamc@211 103 structure CK = struct
adamc@211 104 type ord_key = class_name
adamc@211 105 open Order
adamc@211 106 fun compare x =
adamc@211 107 case x of
adamc@211 108 (ClNamed n1, ClNamed n2) => Int.compare (n1, n2)
adamc@211 109 | (ClNamed _, _) => LESS
adamc@211 110 | (_, ClNamed _) => GREATER
adamc@211 111
adamc@211 112 | (ClProj (m1, ms1, x1), ClProj (m2, ms2, x2)) =>
adamc@211 113 join (Int.compare (m1, m2),
adamc@211 114 fn () => join (joinL String.compare (ms1, ms2),
adamc@211 115 fn () => String.compare (x1, x2)))
adamc@211 116 end
adamc@211 117
adamc@211 118 structure CM = BinaryMapFn(CK)
adamc@211 119
adamc@211 120 datatype class_key =
adamc@211 121 CkNamed of int
adamc@211 122 | CkRel of int
adamc@211 123 | CkProj of int * string list * string
adamc@211 124
adamc@216 125 fun ck2s ck =
adamc@216 126 case ck of
adamc@216 127 CkNamed n => "Named(" ^ Int.toString n ^ ")"
adamc@216 128 | CkRel n => "Rel(" ^ Int.toString n ^ ")"
adamc@216 129 | CkProj (m, ms, x) => "Proj(" ^ Int.toString m ^ "," ^ String.concatWith "," ms ^ "," ^ x ^ ")"
adamc@216 130
adamc@216 131 fun cp2s (cn, ck) = "(" ^ cn2s cn ^ "," ^ ck2s ck ^ ")"
adamc@216 132
adamc@211 133 structure KK = struct
adamc@211 134 type ord_key = class_key
adamc@211 135 open Order
adamc@211 136 fun compare x =
adamc@211 137 case x of
adamc@211 138 (CkNamed n1, CkNamed n2) => Int.compare (n1, n2)
adamc@211 139 | (CkNamed _, _) => LESS
adamc@211 140 | (_, CkNamed _) => GREATER
adamc@211 141
adamc@211 142 | (CkRel n1, CkRel n2) => Int.compare (n1, n2)
adamc@211 143 | (CkRel _, _) => LESS
adamc@211 144 | (_, CkRel _) => GREATER
adamc@211 145
adamc@211 146 | (CkProj (m1, ms1, x1), CkProj (m2, ms2, x2)) =>
adamc@211 147 join (Int.compare (m1, m2),
adamc@211 148 fn () => join (joinL String.compare (ms1, ms2),
adamc@211 149 fn () => String.compare (x1, x2)))
adamc@211 150 end
adamc@211 151
adamc@211 152 structure KM = BinaryMapFn(KK)
adamc@211 153
adamc@211 154 type class = {
adamc@211 155 ground : exp KM.map
adamc@211 156 }
adamc@211 157
adamc@211 158 val empty_class = {
adamc@211 159 ground = KM.empty
adamc@211 160 }
adamc@211 161
adamc@216 162 fun printClasses cs = CM.appi (fn (cn, {ground = km}) =>
adamc@216 163 (print (cn2s cn ^ ":");
adamc@216 164 KM.appi (fn (ck, _) => print (" " ^ ck2s ck)) km;
adamc@216 165 print "\n")) cs
adamc@216 166
adamc@2 167 type env = {
adamc@9 168 renameC : kind var' SM.map,
adamc@2 169 relC : (string * kind) list,
adamc@11 170 namedC : (string * kind * con option) IM.map,
adamc@9 171
adamc@157 172 datatypes : datatyp IM.map,
adamc@191 173 constructors : (datatype_kind * int * string list * con option * int) SM.map,
adamc@157 174
adamc@211 175 classes : class CM.map,
adamc@211 176
adamc@9 177 renameE : con var' SM.map,
adamc@9 178 relE : (string * con) list,
adamc@31 179 namedE : (string * con) IM.map,
adamc@31 180
adamc@31 181 renameSgn : (int * sgn) SM.map,
adamc@31 182 sgn : (string * sgn) IM.map,
adamc@31 183
adamc@31 184 renameStr : (int * sgn) SM.map,
adamc@31 185 str : (string * sgn) IM.map
adamc@2 186 }
adamc@2 187
adamc@2 188 val namedCounter = ref 0
adamc@2 189
adamc@109 190 fun newNamed () =
adamc@109 191 let
adamc@109 192 val r = !namedCounter
adamc@109 193 in
adamc@109 194 namedCounter := r + 1;
adamc@109 195 r
adamc@109 196 end
adamc@109 197
adamc@2 198 val empty = {
adamc@2 199 renameC = SM.empty,
adamc@2 200 relC = [],
adamc@9 201 namedC = IM.empty,
adamc@9 202
adamc@157 203 datatypes = IM.empty,
adamc@171 204 constructors = SM.empty,
adamc@157 205
adamc@211 206 classes = CM.empty,
adamc@211 207
adamc@9 208 renameE = SM.empty,
adamc@9 209 relE = [],
adamc@31 210 namedE = IM.empty,
adamc@31 211
adamc@31 212 renameSgn = SM.empty,
adamc@31 213 sgn = IM.empty,
adamc@31 214
adamc@31 215 renameStr = SM.empty,
adamc@31 216 str = IM.empty
adamc@2 217 }
adamc@2 218
adamc@211 219 fun liftClassKey ck =
adamc@211 220 case ck of
adamc@211 221 CkNamed _ => ck
adamc@211 222 | CkRel n => CkRel (n + 1)
adamc@211 223 | CkProj _ => ck
adamc@211 224
adamc@2 225 fun pushCRel (env : env) x k =
adamc@2 226 let
adamc@9 227 val renameC = SM.map (fn Rel' (n, k) => Rel' (n+1, k)
adamc@2 228 | x => x) (#renameC env)
adamc@2 229 in
adamc@9 230 {renameC = SM.insert (renameC, x, Rel' (0, k)),
adamc@2 231 relC = (x, k) :: #relC env,
adamc@13 232 namedC = IM.map (fn (x, k, co) => (x, k, Option.map lift co)) (#namedC env),
adamc@9 233
adamc@157 234 datatypes = #datatypes env,
adamc@171 235 constructors = #constructors env,
adamc@157 236
adamc@211 237 classes = CM.map (fn class => {
adamc@211 238 ground = KM.foldli (fn (ck, e, km) =>
adamc@211 239 KM.insert (km, liftClassKey ck, e))
adamc@211 240 KM.empty (#ground class)
adamc@211 241 })
adamc@211 242 (#classes env),
adamc@211 243
adamc@328 244 renameE = SM.map (fn Rel' (n, c) => Rel' (n, lift c)
adamc@328 245 | Named' (n, c) => Named' (n, lift c)) (#renameE env),
adamc@13 246 relE = map (fn (x, c) => (x, lift c)) (#relE env),
adamc@31 247 namedE = IM.map (fn (x, c) => (x, lift c)) (#namedE env),
adamc@31 248
adamc@31 249 renameSgn = #renameSgn env,
adamc@31 250 sgn = #sgn env,
adamc@31 251
adamc@31 252 renameStr = #renameStr env,
adamc@31 253 str = #str env
adamc@31 254 }
adamc@2 255 end
adamc@2 256
adamc@2 257 fun lookupCRel (env : env) n =
adamc@2 258 (List.nth (#relC env, n))
adamc@2 259 handle Subscript => raise UnboundRel n
adamc@2 260
adamc@11 261 fun pushCNamedAs (env : env) x n k co =
adamc@9 262 {renameC = SM.insert (#renameC env, x, Named' (n, k)),
adamc@5 263 relC = #relC env,
adamc@11 264 namedC = IM.insert (#namedC env, n, (x, k, co)),
adamc@9 265
adamc@157 266 datatypes = #datatypes env,
adamc@171 267 constructors = #constructors env,
adamc@157 268
adamc@211 269 classes = #classes env,
adamc@211 270
adamc@9 271 renameE = #renameE env,
adamc@9 272 relE = #relE env,
adamc@31 273 namedE = #namedE env,
adamc@31 274
adamc@31 275 renameSgn = #renameSgn env,
adamc@31 276 sgn = #sgn env,
adamc@31 277
adamc@31 278 renameStr = #renameStr env,
adamc@31 279 str = #str env}
adamc@5 280
adamc@11 281 fun pushCNamed env x k co =
adamc@2 282 let
adamc@2 283 val n = !namedCounter
adamc@2 284 in
adamc@2 285 namedCounter := n + 1;
adamc@11 286 (pushCNamedAs env x n k co, n)
adamc@2 287 end
adamc@2 288
adamc@2 289 fun lookupCNamed (env : env) n =
adamc@2 290 case IM.find (#namedC env, n) of
adamc@2 291 NONE => raise UnboundNamed n
adamc@2 292 | SOME x => x
adamc@2 293
adamc@2 294 fun lookupC (env : env) x =
adamc@2 295 case SM.find (#renameC env, x) of
adamc@9 296 NONE => NotBound
adamc@9 297 | SOME (Rel' x) => Rel x
adamc@9 298 | SOME (Named' x) => Named x
adamc@9 299
adamc@191 300 fun pushDatatype (env : env) n xs xncs =
adamc@188 301 let
adamc@188 302 val dk = U.classifyDatatype xncs
adamc@188 303 in
adamc@188 304 {renameC = #renameC env,
adamc@188 305 relC = #relC env,
adamc@188 306 namedC = #namedC env,
adamc@157 307
adamc@188 308 datatypes = IM.insert (#datatypes env, n,
adamc@191 309 (xs, foldl (fn ((x, n, to), cons) =>
adamc@191 310 IM.insert (cons, n, (x, to))) IM.empty xncs)),
adamc@188 311 constructors = foldl (fn ((x, n', to), cmap) =>
adamc@191 312 SM.insert (cmap, x, (dk, n', xs, to, n)))
adamc@188 313 (#constructors env) xncs,
adamc@157 314
adamc@211 315 classes = #classes env,
adamc@211 316
adamc@188 317 renameE = #renameE env,
adamc@188 318 relE = #relE env,
adamc@188 319 namedE = #namedE env,
adamc@157 320
adamc@188 321 renameSgn = #renameSgn env,
adamc@188 322 sgn = #sgn env,
adamc@157 323
adamc@188 324 renameStr = #renameStr env,
adamc@188 325 str = #str env}
adamc@188 326 end
adamc@157 327
adamc@157 328 fun lookupDatatype (env : env) n =
adamc@157 329 case IM.find (#datatypes env, n) of
adamc@157 330 NONE => raise UnboundNamed n
adamc@157 331 | SOME x => x
adamc@157 332
adamc@191 333 fun lookupDatatypeConstructor (_, dt) n =
adamc@157 334 case IM.find (dt, n) of
adamc@157 335 NONE => raise UnboundNamed n
adamc@157 336 | SOME x => x
adamc@157 337
adamc@171 338 fun lookupConstructor (env : env) s = SM.find (#constructors env, s)
adamc@171 339
adamc@191 340 fun datatypeArgs (xs, _) = xs
adamc@191 341 fun constructors (_, dt) = IM.foldri (fn (n, (x, to), ls) => (x, n, to) :: ls) [] dt
adamc@157 342
adamc@211 343 fun pushClass (env : env) n =
adamc@211 344 {renameC = #renameC env,
adamc@211 345 relC = #relC env,
adamc@211 346 namedC = #namedC env,
adamc@211 347
adamc@211 348 datatypes = #datatypes env,
adamc@211 349 constructors = #constructors env,
adamc@211 350
adamc@211 351 classes = CM.insert (#classes env, ClNamed n, {ground = KM.empty}),
adamc@211 352
adamc@211 353 renameE = #renameE env,
adamc@211 354 relE = #relE env,
adamc@211 355 namedE = #namedE env,
adamc@211 356
adamc@211 357 renameSgn = #renameSgn env,
adamc@211 358 sgn = #sgn env,
adamc@211 359
adamc@211 360 renameStr = #renameStr env,
adamc@211 361 str = #str env}
adamc@211 362
adamc@211 363 fun class_name_in (c, _) =
adamc@211 364 case c of
adamc@211 365 CNamed n => SOME (ClNamed n)
adamc@211 366 | CModProj x => SOME (ClProj x)
adamc@228 367 | CUnif (_, _, _, ref (SOME c)) => class_name_in c
adamc@211 368 | _ => NONE
adamc@211 369
adamc@211 370 fun class_key_in (c, _) =
adamc@211 371 case c of
adamc@211 372 CRel n => SOME (CkRel n)
adamc@211 373 | CNamed n => SOME (CkNamed n)
adamc@211 374 | CModProj x => SOME (CkProj x)
adamc@228 375 | CUnif (_, _, _, ref (SOME c)) => class_key_in c
adamc@211 376 | _ => NONE
adamc@211 377
adamc@211 378 fun class_pair_in (c, _) =
adamc@211 379 case c of
adamc@211 380 CApp (f, x) =>
adamc@211 381 (case (class_name_in f, class_key_in x) of
adamc@211 382 (SOME f, SOME x) => SOME (f, x)
adamc@211 383 | _ => NONE)
adamc@211 384 | _ => NONE
adamc@211 385
adamc@211 386 fun resolveClass (env : env) c =
adamc@211 387 case class_pair_in c of
adamc@211 388 SOME (f, x) =>
adamc@211 389 (case CM.find (#classes env, f) of
adamc@211 390 NONE => NONE
adamc@211 391 | SOME class =>
adamc@211 392 case KM.find (#ground class, x) of
adamc@211 393 NONE => NONE
adamc@211 394 | SOME e => SOME e)
adamc@211 395 | _ => NONE
adamc@211 396
adamc@9 397 fun pushERel (env : env) x t =
adamc@9 398 let
adamc@9 399 val renameE = SM.map (fn Rel' (n, t) => Rel' (n+1, t)
adamc@9 400 | x => x) (#renameE env)
adamc@211 401
adamc@211 402 val classes = CM.map (fn class => {
adamc@211 403 ground = KM.map liftExp (#ground class)
adamc@211 404 }) (#classes env)
adamc@211 405 val classes = case class_pair_in t of
adamc@211 406 NONE => classes
adamc@211 407 | SOME (f, x) =>
adamc@211 408 let
adamc@211 409 val class = Option.getOpt (CM.find (classes, f), empty_class)
adamc@211 410 val class = {
adamc@211 411 ground = KM.insert (#ground class, x, (ERel 0, #2 t))
adamc@211 412 }
adamc@211 413 in
adamc@211 414 CM.insert (classes, f, class)
adamc@211 415 end
adamc@9 416 in
adamc@9 417 {renameC = #renameC env,
adamc@9 418 relC = #relC env,
adamc@9 419 namedC = #namedC env,
adamc@9 420
adamc@157 421 datatypes = #datatypes env,
adamc@171 422 constructors = #constructors env,
adamc@157 423
adamc@211 424 classes = classes,
adamc@211 425
adamc@9 426 renameE = SM.insert (renameE, x, Rel' (0, t)),
adamc@9 427 relE = (x, t) :: #relE env,
adamc@31 428 namedE = #namedE env,
adamc@31 429
adamc@31 430 renameSgn = #renameSgn env,
adamc@31 431 sgn = #sgn env,
adamc@31 432
adamc@31 433 renameStr = #renameStr env,
adamc@31 434 str = #str env}
adamc@9 435 end
adamc@9 436
adamc@9 437 fun lookupERel (env : env) n =
adamc@9 438 (List.nth (#relE env, n))
adamc@9 439 handle Subscript => raise UnboundRel n
adamc@9 440
adamc@9 441 fun pushENamedAs (env : env) x n t =
adamc@211 442 let
adamc@211 443 val classes = #classes env
adamc@211 444 val classes = case class_pair_in t of
adamc@211 445 NONE => classes
adamc@211 446 | SOME (f, x) =>
adamc@211 447 let
adamc@211 448 val class = Option.getOpt (CM.find (classes, f), empty_class)
adamc@211 449 val class = {
adamc@211 450 ground = KM.insert (#ground class, x, (ENamed n, #2 t))
adamc@211 451 }
adamc@211 452 in
adamc@211 453 CM.insert (classes, f, class)
adamc@211 454 end
adamc@211 455 in
adamc@211 456 {renameC = #renameC env,
adamc@211 457 relC = #relC env,
adamc@211 458 namedC = #namedC env,
adamc@9 459
adamc@211 460 datatypes = #datatypes env,
adamc@211 461 constructors = #constructors env,
adamc@157 462
adamc@211 463 classes = classes,
adamc@31 464
adamc@211 465 renameE = SM.insert (#renameE env, x, Named' (n, t)),
adamc@211 466 relE = #relE env,
adamc@211 467 namedE = IM.insert (#namedE env, n, (x, t)),
adamc@211 468
adamc@211 469 renameSgn = #renameSgn env,
adamc@211 470 sgn = #sgn env,
adamc@211 471
adamc@211 472 renameStr = #renameStr env,
adamc@211 473 str = #str env}
adamc@211 474 end
adamc@9 475
adamc@9 476 fun pushENamed env x t =
adamc@9 477 let
adamc@9 478 val n = !namedCounter
adamc@9 479 in
adamc@9 480 namedCounter := n + 1;
adamc@9 481 (pushENamedAs env x n t, n)
adamc@9 482 end
adamc@9 483
adamc@9 484 fun lookupENamed (env : env) n =
adamc@9 485 case IM.find (#namedE env, n) of
adamc@9 486 NONE => raise UnboundNamed n
adamc@9 487 | SOME x => x
adamc@9 488
adamc@9 489 fun lookupE (env : env) x =
adamc@9 490 case SM.find (#renameE env, x) of
adamc@9 491 NONE => NotBound
adamc@9 492 | SOME (Rel' x) => Rel x
adamc@9 493 | SOME (Named' x) => Named x
adamc@2 494
adamc@31 495 fun pushSgnNamedAs (env : env) x n sgis =
adamc@31 496 {renameC = #renameC env,
adamc@31 497 relC = #relC env,
adamc@31 498 namedC = #namedC env,
adamc@31 499
adamc@157 500 datatypes = #datatypes env,
adamc@171 501 constructors = #constructors env,
adamc@157 502
adamc@211 503 classes = #classes env,
adamc@211 504
adamc@31 505 renameE = #renameE env,
adamc@31 506 relE = #relE env,
adamc@31 507 namedE = #namedE env,
adamc@31 508
adamc@31 509 renameSgn = SM.insert (#renameSgn env, x, (n, sgis)),
adamc@31 510 sgn = IM.insert (#sgn env, n, (x, sgis)),
adamc@31 511
adamc@31 512 renameStr = #renameStr env,
adamc@31 513 str = #str env}
adamc@31 514
adamc@31 515 fun pushSgnNamed env x sgis =
adamc@31 516 let
adamc@31 517 val n = !namedCounter
adamc@31 518 in
adamc@31 519 namedCounter := n + 1;
adamc@31 520 (pushSgnNamedAs env x n sgis, n)
adamc@31 521 end
adamc@31 522
adamc@31 523 fun lookupSgnNamed (env : env) n =
adamc@31 524 case IM.find (#sgn env, n) of
adamc@31 525 NONE => raise UnboundNamed n
adamc@31 526 | SOME x => x
adamc@31 527
adamc@31 528 fun lookupSgn (env : env) x = SM.find (#renameSgn env, x)
adamc@31 529
adamc@31 530 fun lookupStrNamed (env : env) n =
adamc@31 531 case IM.find (#str env, n) of
adamc@31 532 NONE => raise UnboundNamed n
adamc@31 533 | SOME x => x
adamc@31 534
adamc@31 535 fun lookupStr (env : env) x = SM.find (#renameStr env, x)
adamc@31 536
adamc@203 537
adamc@216 538 fun sgiSeek (sgi, (sgns, strs, cons)) =
adamc@216 539 case sgi of
adamc@216 540 SgiConAbs (x, n, _) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 541 | SgiCon (x, n, _, _) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 542 | SgiDatatype (x, n, _, _) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 543 | SgiDatatypeImp (x, n, _, _, _, _, _) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 544 | SgiVal _ => (sgns, strs, cons)
adamc@216 545 | SgiSgn (x, n, _) => (IM.insert (sgns, n, x), strs, cons)
adamc@216 546 | SgiStr (x, n, _) => (sgns, IM.insert (strs, n, x), cons)
adamc@216 547 | SgiConstraint _ => (sgns, strs, cons)
adamc@216 548 | SgiTable _ => (sgns, strs, cons)
adamc@338 549 | SgiSequence _ => (sgns, strs, cons)
adamc@216 550 | SgiClassAbs (x, n) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 551 | SgiClass (x, n, _) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 552
adamc@34 553 fun sgnSeek f sgis =
adamc@34 554 let
adamc@59 555 fun seek (sgis, sgns, strs, cons) =
adamc@34 556 case sgis of
adamc@34 557 [] => NONE
adamc@34 558 | (sgi, _) :: sgis =>
adamc@34 559 case f sgi of
adamc@158 560 SOME v =>
adamc@158 561 let
adamc@158 562 val cons =
adamc@158 563 case sgi of
adamc@191 564 SgiDatatype (x, n, _, _) => IM.insert (cons, n, x)
adamc@191 565 | SgiDatatypeImp (x, n, _, _, _, _, _) => IM.insert (cons, n, x)
adamc@158 566 | _ => cons
adamc@158 567 in
adamc@158 568 SOME (v, (sgns, strs, cons))
adamc@158 569 end
adamc@88 570 | NONE =>
adamc@216 571 let
adamc@216 572 val (sgns, strs, cons) = sgiSeek (sgi, (sgns, strs, cons))
adamc@216 573 in
adamc@216 574 seek (sgis, sgns, strs, cons)
adamc@216 575 end
adamc@34 576 in
adamc@59 577 seek (sgis, IM.empty, IM.empty, IM.empty)
adamc@34 578 end
adamc@34 579
adamc@34 580 fun id x = x
adamc@34 581
adamc@34 582 fun unravelStr (str, _) =
adamc@34 583 case str of
adamc@34 584 StrVar x => (x, [])
adamc@34 585 | StrProj (str, m) =>
adamc@34 586 let
adamc@34 587 val (x, ms) = unravelStr str
adamc@34 588 in
adamc@34 589 (x, ms @ [m])
adamc@34 590 end
adamc@34 591 | _ => raise Fail "unravelStr"
adamc@34 592
adamc@59 593 fun sgnS_con (str, (sgns, strs, cons)) c =
adamc@34 594 case c of
adamc@34 595 CModProj (m1, ms, x) =>
adamc@34 596 (case IM.find (strs, m1) of
adamc@34 597 NONE => c
adamc@34 598 | SOME m1x =>
adamc@34 599 let
adamc@34 600 val (m1, ms') = unravelStr str
adamc@34 601 in
adamc@34 602 CModProj (m1, ms' @ m1x :: ms, x)
adamc@34 603 end)
adamc@34 604 | CNamed n =>
adamc@34 605 (case IM.find (cons, n) of
adamc@34 606 NONE => c
adamc@34 607 | SOME nx =>
adamc@34 608 let
adamc@34 609 val (m1, ms) = unravelStr str
adamc@34 610 in
adamc@34 611 CModProj (m1, ms, nx)
adamc@34 612 end)
adamc@34 613 | _ => c
adamc@34 614
adamc@216 615 fun sgnS_con' (m1, ms', (sgns, strs, cons)) c =
adamc@216 616 case c of
adamc@216 617 CModProj (m1, ms, x) =>
adamc@216 618 (case IM.find (strs, m1) of
adamc@216 619 NONE => c
adamc@216 620 | SOME m1x => CModProj (m1, ms' @ m1x :: ms, x))
adamc@216 621 | CNamed n =>
adamc@216 622 (case IM.find (cons, n) of
adamc@216 623 NONE => c
adamc@216 624 | SOME nx => CModProj (m1, ms', nx))
adamc@216 625 | _ => c
adamc@216 626
adamc@59 627 fun sgnS_sgn (str, (sgns, strs, cons)) sgn =
adamc@59 628 case sgn of
adamc@59 629 SgnProj (m1, ms, x) =>
adamc@59 630 (case IM.find (strs, m1) of
adamc@59 631 NONE => sgn
adamc@59 632 | SOME m1x =>
adamc@59 633 let
adamc@59 634 val (m1, ms') = unravelStr str
adamc@59 635 in
adamc@59 636 SgnProj (m1, ms' @ m1x :: ms, x)
adamc@59 637 end)
adamc@59 638 | SgnVar n =>
adamc@59 639 (case IM.find (sgns, n) of
adamc@59 640 NONE => sgn
adamc@59 641 | SOME nx =>
adamc@59 642 let
adamc@59 643 val (m1, ms) = unravelStr str
adamc@59 644 in
adamc@59 645 SgnProj (m1, ms, nx)
adamc@59 646 end)
adamc@59 647 | _ => sgn
adamc@59 648
adamc@59 649 fun sgnSubSgn x =
adamc@34 650 ElabUtil.Sgn.map {kind = id,
adamc@59 651 con = sgnS_con x,
adamc@34 652 sgn_item = id,
adamc@59 653 sgn = sgnS_sgn x}
adamc@34 654
adamc@211 655
adamc@211 656
adamc@211 657 and projectSgn env {sgn, str, field} =
adamc@211 658 case #1 (hnormSgn env sgn) of
adamc@211 659 SgnConst sgis =>
adamc@211 660 (case sgnSeek (fn SgiSgn (x, _, sgn) => if x = field then SOME sgn else NONE | _ => NONE) sgis of
adamc@211 661 NONE => NONE
adamc@211 662 | SOME (sgn, subs) => SOME (sgnSubSgn (str, subs) sgn))
adamc@211 663 | SgnError => SOME (SgnError, ErrorMsg.dummySpan)
adamc@211 664 | _ => NONE
adamc@211 665
adamc@211 666 and hnormSgn env (all as (sgn, loc)) =
adamc@34 667 case sgn of
adamc@42 668 SgnError => all
adamc@42 669 | SgnVar n => hnormSgn env (#2 (lookupSgnNamed env n))
adamc@42 670 | SgnConst _ => all
adamc@42 671 | SgnFun _ => all
adamc@59 672 | SgnProj (m, ms, x) =>
adamc@59 673 let
adamc@59 674 val (_, sgn) = lookupStrNamed env m
adamc@59 675 in
adamc@59 676 case projectSgn env {str = foldl (fn (m, str) => (StrProj (str, m), loc)) (StrVar m, loc) ms,
adamc@59 677 sgn = sgn,
adamc@59 678 field = x} of
adamc@59 679 NONE => raise Fail "ElabEnv.hnormSgn: projectSgn failed"
adamc@59 680 | SOME sgn => sgn
adamc@59 681 end
adamc@42 682 | SgnWhere (sgn, x, c) =>
adamc@42 683 case #1 (hnormSgn env sgn) of
adamc@42 684 SgnError => (SgnError, loc)
adamc@42 685 | SgnConst sgis =>
adamc@42 686 let
adamc@42 687 fun traverse (pre, post) =
adamc@42 688 case post of
adamc@42 689 [] => raise Fail "ElabEnv.hnormSgn: Can't reduce 'where' [1]"
adamc@42 690 | (sgi as (SgiConAbs (x', n, k), loc)) :: rest =>
adamc@42 691 if x = x' then
adamc@42 692 List.revAppend (pre, (SgiCon (x', n, k, c), loc) :: rest)
adamc@42 693 else
adamc@42 694 traverse (sgi :: pre, rest)
adamc@42 695 | sgi :: rest => traverse (sgi :: pre, rest)
adamc@42 696
adamc@42 697 val sgis = traverse ([], sgis)
adamc@42 698 in
adamc@42 699 (SgnConst sgis, loc)
adamc@42 700 end
adamc@42 701 | _ => raise Fail "ElabEnv.hnormSgn: Can't reduce 'where' [2]"
adamc@42 702
adamc@211 703 fun enrichClasses env classes (m1, ms) sgn =
adamc@59 704 case #1 (hnormSgn env sgn) of
adamc@59 705 SgnConst sgis =>
adamc@211 706 let
adamc@218 707 val (classes, _, _, _) =
adamc@218 708 foldl (fn (sgi, (classes, newClasses, fmap, env)) =>
adamc@211 709 let
adamc@211 710 fun found (x, n) =
adamc@211 711 (CM.insert (classes,
adamc@211 712 ClProj (m1, ms, x),
adamc@211 713 empty_class),
adamc@216 714 IM.insert (newClasses, n, x),
adamc@218 715 sgiSeek (#1 sgi, fmap),
adamc@218 716 env)
adamc@216 717
adamc@218 718 fun default () = (classes, newClasses, sgiSeek (#1 sgi, fmap), env)
adamc@211 719 in
adamc@211 720 case #1 sgi of
adamc@217 721 SgiStr (x, _, sgn) =>
adamc@217 722 (enrichClasses env classes (m1, ms @ [x]) sgn,
adamc@217 723 newClasses,
adamc@218 724 sgiSeek (#1 sgi, fmap),
adamc@218 725 env)
adamc@218 726 | SgiSgn (x, n, sgn) =>
adamc@218 727 (classes,
adamc@218 728 newClasses,
adamc@218 729 fmap,
adamc@218 730 pushSgnNamedAs env x n sgn)
adamc@218 731
adamc@217 732 | SgiClassAbs xn => found xn
adamc@211 733 | SgiClass (x, n, _) => found (x, n)
adamc@216 734 | SgiVal (x, n, (CApp ((CNamed f, _), a), _)) =>
adamc@216 735 (case IM.find (newClasses, f) of
adamc@216 736 NONE => default ()
adamc@216 737 | SOME fx =>
adamc@216 738 case class_key_in (sgnS_con' (m1, ms, fmap) (#1 a), #2 a) of
adamc@216 739 NONE => default ()
adamc@216 740 | SOME ck =>
adamc@216 741 let
adamc@216 742 val cn = ClProj (m1, ms, fx)
adamc@216 743 val class = Option.getOpt (CM.find (classes, cn), empty_class)
adamc@216 744 val class = {
adamc@216 745 ground = KM.insert (#ground class, ck,
adamc@216 746 (EModProj (m1, ms, x), #2 sgn))
adamc@216 747 }
adamc@216 748
adamc@216 749 in
adamc@216 750 (CM.insert (classes, cn, class),
adamc@216 751 newClasses,
adamc@218 752 fmap,
adamc@218 753 env)
adamc@216 754 end)
adamc@217 755 | SgiVal _ => default ()
adamc@216 756 | _ => default ()
adamc@211 757 end)
adamc@218 758 (classes, IM.empty, (IM.empty, IM.empty, IM.empty), env) sgis
adamc@211 759 in
adamc@211 760 classes
adamc@211 761 end
adamc@211 762 | _ => classes
adamc@211 763
adamc@211 764 fun pushStrNamedAs (env : env) x n sgn =
adamc@211 765 {renameC = #renameC env,
adamc@211 766 relC = #relC env,
adamc@211 767 namedC = #namedC env,
adamc@211 768
adamc@211 769 datatypes = #datatypes env,
adamc@211 770 constructors = #constructors env,
adamc@211 771
adamc@211 772 classes = enrichClasses env (#classes env) (n, []) sgn,
adamc@211 773
adamc@211 774 renameE = #renameE env,
adamc@211 775 relE = #relE env,
adamc@211 776 namedE = #namedE env,
adamc@211 777
adamc@211 778 renameSgn = #renameSgn env,
adamc@211 779 sgn = #sgn env,
adamc@211 780
adamc@211 781 renameStr = SM.insert (#renameStr env, x, (n, sgn)),
adamc@211 782 str = IM.insert (#str env, n, (x, sgn))}
adamc@211 783
adamc@211 784 fun pushStrNamed env x sgn =
adamc@211 785 let
adamc@211 786 val n = !namedCounter
adamc@211 787 in
adamc@211 788 namedCounter := n + 1;
adamc@211 789 (pushStrNamedAs env x n sgn, n)
adamc@211 790 end
adamc@211 791
adamc@211 792 fun sgiBinds env (sgi, loc) =
adamc@211 793 case sgi of
adamc@211 794 SgiConAbs (x, n, k) => pushCNamedAs env x n k NONE
adamc@211 795 | SgiCon (x, n, k, c) => pushCNamedAs env x n k (SOME c)
adamc@211 796 | SgiDatatype (x, n, xs, xncs) =>
adamc@211 797 let
adamc@341 798 val k = (KType, loc)
adamc@341 799 val k' = foldr (fn (_, k') => (KArrow (k, k'), loc)) k xs
adamc@341 800
adamc@341 801 val env = pushCNamedAs env x n k' NONE
adamc@211 802 in
adamc@211 803 foldl (fn ((x', n', to), env) =>
adamc@211 804 let
adamc@211 805 val t =
adamc@211 806 case to of
adamc@211 807 NONE => (CNamed n, loc)
adamc@211 808 | SOME t => (TFun (t, (CNamed n, loc)), loc)
adamc@211 809
adamc@211 810 val k = (KType, loc)
adamc@211 811 val t = foldr (fn (x, t) => (TCFun (Explicit, x, k, t), loc)) t xs
adamc@211 812 in
adamc@211 813 pushENamedAs env x' n' t
adamc@211 814 end)
adamc@211 815 env xncs
adamc@211 816 end
adamc@211 817 | SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
adamc@211 818 let
adamc@341 819 val k = (KType, loc)
adamc@341 820 val k' = foldr (fn (_, k') => (KArrow (k, k'), loc)) k xs
adamc@341 821
adamc@341 822 val env = pushCNamedAs env x n k' (SOME (CModProj (m1, ms, x'), loc))
adamc@211 823 in
adamc@211 824 foldl (fn ((x', n', to), env) =>
adamc@211 825 let
adamc@211 826 val t =
adamc@211 827 case to of
adamc@211 828 NONE => (CNamed n, loc)
adamc@211 829 | SOME t => (TFun (t, (CNamed n, loc)), loc)
adamc@211 830
adamc@211 831 val k = (KType, loc)
adamc@211 832 val t = foldr (fn (x, t) => (TCFun (Explicit, x, k, t), loc)) t xs
adamc@211 833 in
adamc@211 834 pushENamedAs env x' n' t
adamc@211 835 end)
adamc@211 836 env xncs
adamc@211 837 end
adamc@211 838 | SgiVal (x, n, t) => pushENamedAs env x n t
adamc@211 839 | SgiStr (x, n, sgn) => pushStrNamedAs env x n sgn
adamc@211 840 | SgiSgn (x, n, sgn) => pushSgnNamedAs env x n sgn
adamc@211 841 | SgiConstraint _ => env
adamc@211 842
adamc@211 843 | SgiTable (tn, x, n, c) =>
adamc@211 844 let
adamc@338 845 val t = (CApp ((CModProj (tn, [], "sql_table"), loc), c), loc)
adamc@338 846 in
adamc@338 847 pushENamedAs env x n t
adamc@338 848 end
adamc@338 849 | SgiSequence (tn, x, n) =>
adamc@338 850 let
adamc@338 851 val t = (CModProj (tn, [], "sql_sequence"), loc)
adamc@211 852 in
adamc@211 853 pushENamedAs env x n t
adamc@211 854 end
adamc@211 855
adamc@211 856 | SgiClassAbs (x, n) => pushCNamedAs env x n (KArrow ((KType, loc), (KType, loc)), loc) NONE
adamc@211 857 | SgiClass (x, n, c) => pushCNamedAs env x n (KArrow ((KType, loc), (KType, loc)), loc) (SOME c)
adamc@211 858
adamc@211 859
adamc@211 860 fun sgnSubCon x =
adamc@211 861 ElabUtil.Con.map {kind = id,
adamc@211 862 con = sgnS_con x}
adamc@59 863
adamc@59 864 fun projectStr env {sgn, str, field} =
adamc@59 865 case #1 (hnormSgn env sgn) of
adamc@59 866 SgnConst sgis =>
adamc@59 867 (case sgnSeek (fn SgiStr (x, _, sgn) => if x = field then SOME sgn else NONE | _ => NONE) sgis of
adamc@59 868 NONE => NONE
adamc@59 869 | SOME (sgn, subs) => SOME (sgnSubSgn (str, subs) sgn))
adamc@59 870 | SgnError => SOME (SgnError, ErrorMsg.dummySpan)
adamc@59 871 | _ => NONE
adamc@59 872
adamc@158 873 fun chaseMpath env (n, ms) =
adamc@158 874 let
adamc@158 875 val (_, sgn) = lookupStrNamed env n
adamc@158 876 in
adamc@158 877 foldl (fn (m, (str, sgn)) =>
adamc@158 878 case projectStr env {sgn = sgn, str = str, field = m} of
adamc@158 879 NONE => raise Fail "kindof: Unknown substructure"
adamc@158 880 | SOME sgn => ((StrProj (str, m), #2 sgn), sgn))
adamc@158 881 ((StrVar n, #2 sgn), sgn) ms
adamc@158 882 end
adamc@158 883
adamc@42 884 fun projectCon env {sgn, str, field} =
adamc@42 885 case #1 (hnormSgn env sgn) of
adamc@34 886 SgnConst sgis =>
adamc@34 887 (case sgnSeek (fn SgiConAbs (x, _, k) => if x = field then SOME (k, NONE) else NONE
adamc@34 888 | SgiCon (x, _, k, c) => if x = field then SOME (k, SOME c) else NONE
adamc@341 889 | SgiDatatype (x, _, xs, _) =>
adamc@158 890 if x = field then
adamc@341 891 let
adamc@341 892 val k = (KType, #2 sgn)
adamc@341 893 val k' = foldl (fn (_, k') => (KArrow (k, k'), #2 sgn)) k xs
adamc@341 894 in
adamc@341 895 SOME (k', NONE)
adamc@341 896 end
adamc@341 897 else
adamc@341 898 NONE
adamc@341 899 | SgiDatatypeImp (x, _, m1, ms, x', xs, _) =>
adamc@341 900 if x = field then
adamc@341 901 let
adamc@341 902 val k = (KType, #2 sgn)
adamc@341 903 val k' = foldl (fn (_, k') => (KArrow (k, k'), #2 sgn)) k xs
adamc@341 904 in
adamc@341 905 SOME (k', SOME (CModProj (m1, ms, x'), #2 sgn))
adamc@341 906 end
adamc@158 907 else
adamc@158 908 NONE
adamc@216 909 | SgiClassAbs (x, _) => if x = field then
adamc@216 910 SOME ((KArrow ((KType, #2 sgn), (KType, #2 sgn)), #2 sgn), NONE)
adamc@216 911 else
adamc@216 912 NONE
adamc@216 913 | SgiClass (x, _, c) => if x = field then
adamc@216 914 SOME ((KArrow ((KType, #2 sgn), (KType, #2 sgn)), #2 sgn), SOME c)
adamc@216 915 else
adamc@216 916 NONE
adamc@34 917 | _ => NONE) sgis of
adamc@34 918 NONE => NONE
adamc@34 919 | SOME ((k, co), subs) => SOME (k, Option.map (sgnSubCon (str, subs)) co))
adamc@34 920 | SgnError => SOME ((KError, ErrorMsg.dummySpan), SOME (CError, ErrorMsg.dummySpan))
adamc@42 921 | _ => NONE
adamc@34 922
adamc@157 923 fun projectDatatype env {sgn, str, field} =
adamc@157 924 case #1 (hnormSgn env sgn) of
adamc@157 925 SgnConst sgis =>
adamc@191 926 (case sgnSeek (fn SgiDatatype (x, _, xs, xncs) => if x = field then SOME (xs, xncs) else NONE
adamc@191 927 | SgiDatatypeImp (x, _, _, _, _, xs, xncs) => if x = field then SOME (xs, xncs) else NONE
adamc@157 928 | _ => NONE) sgis of
adamc@157 929 NONE => NONE
adamc@191 930 | SOME ((xs, xncs), subs) => SOME (xs,
adamc@191 931 map (fn (x, n, to) => (x, n, Option.map (sgnSubCon (str, subs)) to)) xncs))
adamc@157 932 | _ => NONE
adamc@157 933
adamc@174 934 fun projectConstructor env {sgn, str, field} =
adamc@174 935 case #1 (hnormSgn env sgn) of
adamc@174 936 SgnConst sgis =>
adamc@174 937 let
adamc@191 938 fun consider (n, xs, xncs) =
adamc@174 939 ListUtil.search (fn (x, n', to) =>
adamc@174 940 if x <> field then
adamc@174 941 NONE
adamc@174 942 else
adamc@191 943 SOME (U.classifyDatatype xncs, n', xs, to, (CNamed n, #2 str))) xncs
adamc@174 944 in
adamc@191 945 case sgnSeek (fn SgiDatatype (_, n, xs, xncs) => consider (n, xs, xncs)
adamc@191 946 | SgiDatatypeImp (_, n, _, _, _, xs, xncs) => consider (n, xs, xncs)
adamc@174 947 | _ => NONE) sgis of
adamc@174 948 NONE => NONE
adamc@191 949 | SOME ((dk, n, xs, to, t), subs) => SOME (dk, n, xs, Option.map (sgnSubCon (str, subs)) to,
adamc@191 950 sgnSubCon (str, subs) t)
adamc@174 951 end
adamc@174 952 | _ => NONE
adamc@174 953
adamc@42 954 fun projectVal env {sgn, str, field} =
adamc@42 955 case #1 (hnormSgn env sgn) of
adamc@34 956 SgnConst sgis =>
adamc@162 957 let
adamc@191 958 fun seek (n, xs, xncs) =
adamc@162 959 ListUtil.search (fn (x, _, to) =>
adamc@162 960 if x = field then
adamc@191 961 SOME (let
adamc@191 962 val t =
adamc@191 963 case to of
adamc@191 964 NONE => (CNamed n, #2 sgn)
adamc@191 965 | SOME t => (TFun (t, (CNamed n, #2 sgn)), #2 sgn)
adamc@191 966 val k = (KType, #2 sgn)
adamc@191 967 in
adamc@191 968 foldr (fn (x, t) => (TCFun (Explicit, x, k, t), #2 sgn))
adamc@191 969 t xs
adamc@191 970 end)
adamc@162 971 else
adamc@162 972 NONE) xncs
adamc@162 973 in
adamc@162 974 case sgnSeek (fn SgiVal (x, _, c) => if x = field then SOME c else NONE
adamc@191 975 | SgiDatatype (_, n, xs, xncs) => seek (n, xs, xncs)
adamc@191 976 | SgiDatatypeImp (_, n, _, _, _, xs, xncs) => seek (n, xs, xncs)
adamc@162 977 | _ => NONE) sgis of
adamc@162 978 NONE => NONE
adamc@162 979 | SOME (c, subs) => SOME (sgnSubCon (str, subs) c)
adamc@162 980 end
adamc@34 981 | SgnError => SOME (CError, ErrorMsg.dummySpan)
adamc@42 982 | _ => NONE
adamc@34 983
adamc@88 984 fun sgnSeekConstraints (str, sgis) =
adamc@88 985 let
adamc@88 986 fun seek (sgis, sgns, strs, cons, acc) =
adamc@88 987 case sgis of
adamc@88 988 [] => acc
adamc@88 989 | (sgi, _) :: sgis =>
adamc@88 990 case sgi of
adamc@88 991 SgiConstraint (c1, c2) =>
adamc@88 992 let
adamc@88 993 val sub = sgnSubCon (str, (sgns, strs, cons))
adamc@88 994 in
adamc@88 995 seek (sgis, sgns, strs, cons, (sub c1, sub c2) :: acc)
adamc@88 996 end
adamc@88 997 | SgiConAbs (x, n, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@88 998 | SgiCon (x, n, _, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@191 999 | SgiDatatype (x, n, _, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@191 1000 | SgiDatatypeImp (x, n, _, _, _, _, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@88 1001 | SgiVal _ => seek (sgis, sgns, strs, cons, acc)
adamc@88 1002 | SgiSgn (x, n, _) => seek (sgis, IM.insert (sgns, n, x), strs, cons, acc)
adamc@88 1003 | SgiStr (x, n, _) => seek (sgis, sgns, IM.insert (strs, n, x), cons, acc)
adamc@203 1004 | SgiTable _ => seek (sgis, sgns, strs, cons, acc)
adamc@338 1005 | SgiSequence _ => seek (sgis, sgns, strs, cons, acc)
adamc@211 1006 | SgiClassAbs (x, n) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@211 1007 | SgiClass (x, n, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@88 1008 in
adamc@88 1009 seek (sgis, IM.empty, IM.empty, IM.empty, [])
adamc@88 1010 end
adamc@88 1011
adamc@88 1012 fun projectConstraints env {sgn, str} =
adamc@88 1013 case #1 (hnormSgn env sgn) of
adamc@88 1014 SgnConst sgis => SOME (sgnSeekConstraints (str, sgis))
adamc@88 1015 | SgnError => SOME []
adamc@88 1016 | _ => NONE
adamc@34 1017
adamc@157 1018 fun declBinds env (d, loc) =
adamc@157 1019 case d of
adamc@157 1020 DCon (x, n, k, c) => pushCNamedAs env x n k (SOME c)
adamc@191 1021 | DDatatype (x, n, xs, xncs) =>
adamc@157 1022 let
adamc@297 1023 val k = (KType, loc)
adamc@297 1024 val nxs = length xs
adamc@297 1025 val (tb, kb) = ListUtil.foldli (fn (i, x', (tb, kb)) =>
adamc@297 1026 ((CApp (tb, (CRel (nxs - i - 1), loc)), loc),
adamc@297 1027 (KArrow (k, kb), loc)))
adamc@297 1028 ((CNamed n, loc), k) xs
adamc@297 1029
adamc@297 1030 val env = pushCNamedAs env x n kb NONE
adamc@191 1031 val env = pushDatatype env n xs xncs
adamc@157 1032 in
adamc@191 1033 foldl (fn ((x', n', to), env) =>
adamc@191 1034 let
adamc@191 1035 val t =
adamc@191 1036 case to of
adamc@297 1037 NONE => tb
adamc@297 1038 | SOME t => (TFun (t, tb), loc)
adamc@297 1039 val t = foldr (fn (x, t) => (TCFun (Implicit, x, k, t), loc)) t xs
adamc@191 1040 in
adamc@191 1041 pushENamedAs env x' n' t
adamc@191 1042 end)
adamc@191 1043 env xncs
adamc@157 1044 end
adamc@191 1045 | DDatatypeImp (x, n, m, ms, x', xs, xncs) =>
adamc@157 1046 let
adamc@157 1047 val t = (CModProj (m, ms, x'), loc)
adamc@297 1048 val k = (KType, loc)
adamc@297 1049 val nxs = length xs
adamc@297 1050 val (tb, kb) = ListUtil.foldli (fn (i, x', (tb, kb)) =>
adamc@297 1051 ((CApp (tb, (CRel (nxs - i - 1), loc)), loc),
adamc@297 1052 (KArrow (k, kb), loc)))
adamc@297 1053 ((CNamed n, loc), k) xs
adamc@297 1054
adamc@341 1055 val env = pushCNamedAs env x n kb (SOME t)
adamc@191 1056 val env = pushDatatype env n xs xncs
adamc@157 1057 in
adamc@191 1058 foldl (fn ((x', n', to), env) =>
adamc@191 1059 let
adamc@191 1060 val t =
adamc@191 1061 case to of
adamc@297 1062 NONE => tb
adamc@297 1063 | SOME t => (TFun (t, tb), loc)
adamc@297 1064 val t = foldr (fn (x, t) => (TCFun (Implicit, x, k, t), loc)) t xs
adamc@191 1065 in
adamc@191 1066 pushENamedAs env x' n' t
adamc@191 1067 end)
adamc@191 1068 env xncs
adamc@157 1069 end
adamc@157 1070 | DVal (x, n, t, _) => pushENamedAs env x n t
adamc@157 1071 | DValRec vis => foldl (fn ((x, n, t, _), env) => pushENamedAs env x n t) env vis
adamc@157 1072 | DSgn (x, n, sgn) => pushSgnNamedAs env x n sgn
adamc@157 1073 | DStr (x, n, sgn, _) => pushStrNamedAs env x n sgn
adamc@157 1074 | DFfiStr (x, n, sgn) => pushStrNamedAs env x n sgn
adamc@157 1075 | DConstraint _ => env
adamc@157 1076 | DExport _ => env
adamc@205 1077 | DTable (tn, x, n, c) =>
adamc@205 1078 let
adamc@338 1079 val t = (CApp ((CModProj (tn, [], "sql_table"), loc), c), loc)
adamc@338 1080 in
adamc@338 1081 pushENamedAs env x n t
adamc@338 1082 end
adamc@338 1083 | DSequence (tn, x, n) =>
adamc@338 1084 let
adamc@338 1085 val t = (CModProj (tn, [], "sql_sequence"), loc)
adamc@205 1086 in
adamc@205 1087 pushENamedAs env x n t
adamc@205 1088 end
adamc@213 1089 | DClass (x, n, c) =>
adamc@213 1090 let
adamc@213 1091 val k = (KArrow ((KType, loc), (KType, loc)), loc)
adamc@213 1092 val env = pushCNamedAs env x n k (SOME c)
adamc@213 1093 in
adamc@213 1094 pushClass env n
adamc@213 1095 end
adamc@271 1096 | DDatabase _ => env
adamc@157 1097
adamc@243 1098 fun patBinds env (p, loc) =
adamc@243 1099 case p of
adamc@243 1100 PWild => env
adamc@243 1101 | PVar (x, t) => pushERel env x t
adamc@243 1102 | PPrim _ => env
adamc@243 1103 | PCon (_, _, _, NONE) => env
adamc@243 1104 | PCon (_, _, _, SOME p) => patBinds env p
adamc@243 1105 | PRecord xps => foldl (fn ((_, p, _), env) => patBinds env p) env xps
adamc@243 1106
adamc@2 1107 end