Mercurial > urweb

annotate src/elab_env.sml @ 217:56db662ebcfd

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Fun with type classes and modules
author Adam Chlipala <adamc@hcoop.net>
date Sat, 16 Aug 2008 16:30:07 -0400
parents 38b299373676
children a3413288cce1
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@9 244 renameE = #renameE env,
adamc@13 245 relE = map (fn (x, c) => (x, lift c)) (#relE env),
adamc@31 246 namedE = IM.map (fn (x, c) => (x, lift c)) (#namedE env),
adamc@31 247
adamc@31 248 renameSgn = #renameSgn env,
adamc@31 249 sgn = #sgn env,
adamc@31 250
adamc@31 251 renameStr = #renameStr env,
adamc@31 252 str = #str env
adamc@31 253 }
adamc@2 254 end
adamc@2 255
adamc@2 256 fun lookupCRel (env : env) n =
adamc@2 257 (List.nth (#relC env, n))
adamc@2 258 handle Subscript => raise UnboundRel n
adamc@2 259
adamc@11 260 fun pushCNamedAs (env : env) x n k co =
adamc@9 261 {renameC = SM.insert (#renameC env, x, Named' (n, k)),
adamc@5 262 relC = #relC env,
adamc@11 263 namedC = IM.insert (#namedC env, n, (x, k, co)),
adamc@9 264
adamc@157 265 datatypes = #datatypes env,
adamc@171 266 constructors = #constructors env,
adamc@157 267
adamc@211 268 classes = #classes env,
adamc@211 269
adamc@9 270 renameE = #renameE env,
adamc@9 271 relE = #relE env,
adamc@31 272 namedE = #namedE env,
adamc@31 273
adamc@31 274 renameSgn = #renameSgn env,
adamc@31 275 sgn = #sgn env,
adamc@31 276
adamc@31 277 renameStr = #renameStr env,
adamc@31 278 str = #str env}
adamc@5 279
adamc@11 280 fun pushCNamed env x k co =
adamc@2 281 let
adamc@2 282 val n = !namedCounter
adamc@2 283 in
adamc@2 284 namedCounter := n + 1;
adamc@11 285 (pushCNamedAs env x n k co, n)
adamc@2 286 end
adamc@2 287
adamc@2 288 fun lookupCNamed (env : env) n =
adamc@2 289 case IM.find (#namedC env, n) of
adamc@2 290 NONE => raise UnboundNamed n
adamc@2 291 | SOME x => x
adamc@2 292
adamc@2 293 fun lookupC (env : env) x =
adamc@2 294 case SM.find (#renameC env, x) of
adamc@9 295 NONE => NotBound
adamc@9 296 | SOME (Rel' x) => Rel x
adamc@9 297 | SOME (Named' x) => Named x
adamc@9 298
adamc@191 299 fun pushDatatype (env : env) n xs xncs =
adamc@188 300 let
adamc@188 301 val dk = U.classifyDatatype xncs
adamc@188 302 in
adamc@188 303 {renameC = #renameC env,
adamc@188 304 relC = #relC env,
adamc@188 305 namedC = #namedC env,
adamc@157 306
adamc@188 307 datatypes = IM.insert (#datatypes env, n,
adamc@191 308 (xs, foldl (fn ((x, n, to), cons) =>
adamc@191 309 IM.insert (cons, n, (x, to))) IM.empty xncs)),
adamc@188 310 constructors = foldl (fn ((x, n', to), cmap) =>
adamc@191 311 SM.insert (cmap, x, (dk, n', xs, to, n)))
adamc@188 312 (#constructors env) xncs,
adamc@157 313
adamc@211 314 classes = #classes env,
adamc@211 315
adamc@188 316 renameE = #renameE env,
adamc@188 317 relE = #relE env,
adamc@188 318 namedE = #namedE env,
adamc@157 319
adamc@188 320 renameSgn = #renameSgn env,
adamc@188 321 sgn = #sgn env,
adamc@157 322
adamc@188 323 renameStr = #renameStr env,
adamc@188 324 str = #str env}
adamc@188 325 end
adamc@157 326
adamc@157 327 fun lookupDatatype (env : env) n =
adamc@157 328 case IM.find (#datatypes env, n) of
adamc@157 329 NONE => raise UnboundNamed n
adamc@157 330 | SOME x => x
adamc@157 331
adamc@191 332 fun lookupDatatypeConstructor (_, dt) n =
adamc@157 333 case IM.find (dt, n) of
adamc@157 334 NONE => raise UnboundNamed n
adamc@157 335 | SOME x => x
adamc@157 336
adamc@171 337 fun lookupConstructor (env : env) s = SM.find (#constructors env, s)
adamc@171 338
adamc@191 339 fun datatypeArgs (xs, _) = xs
adamc@191 340 fun constructors (_, dt) = IM.foldri (fn (n, (x, to), ls) => (x, n, to) :: ls) [] dt
adamc@157 341
adamc@211 342 fun pushClass (env : env) n =
adamc@211 343 {renameC = #renameC env,
adamc@211 344 relC = #relC env,
adamc@211 345 namedC = #namedC env,
adamc@211 346
adamc@211 347 datatypes = #datatypes env,
adamc@211 348 constructors = #constructors env,
adamc@211 349
adamc@211 350 classes = CM.insert (#classes env, ClNamed n, {ground = KM.empty}),
adamc@211 351
adamc@211 352 renameE = #renameE env,
adamc@211 353 relE = #relE env,
adamc@211 354 namedE = #namedE env,
adamc@211 355
adamc@211 356 renameSgn = #renameSgn env,
adamc@211 357 sgn = #sgn env,
adamc@211 358
adamc@211 359 renameStr = #renameStr env,
adamc@211 360 str = #str env}
adamc@211 361
adamc@211 362 fun class_name_in (c, _) =
adamc@211 363 case c of
adamc@211 364 CNamed n => SOME (ClNamed n)
adamc@211 365 | CModProj x => SOME (ClProj x)
adamc@211 366 | _ => NONE
adamc@211 367
adamc@211 368 fun class_key_in (c, _) =
adamc@211 369 case c of
adamc@211 370 CRel n => SOME (CkRel n)
adamc@211 371 | CNamed n => SOME (CkNamed n)
adamc@211 372 | CModProj x => SOME (CkProj x)
adamc@211 373 | _ => NONE
adamc@211 374
adamc@211 375 fun class_pair_in (c, _) =
adamc@211 376 case c of
adamc@211 377 CApp (f, x) =>
adamc@211 378 (case (class_name_in f, class_key_in x) of
adamc@211 379 (SOME f, SOME x) => SOME (f, x)
adamc@211 380 | _ => NONE)
adamc@211 381 | _ => NONE
adamc@211 382
adamc@211 383 fun resolveClass (env : env) c =
adamc@211 384 case class_pair_in c of
adamc@211 385 SOME (f, x) =>
adamc@211 386 (case CM.find (#classes env, f) of
adamc@211 387 NONE => NONE
adamc@211 388 | SOME class =>
adamc@211 389 case KM.find (#ground class, x) of
adamc@211 390 NONE => NONE
adamc@211 391 | SOME e => SOME e)
adamc@211 392 | _ => NONE
adamc@211 393
adamc@9 394 fun pushERel (env : env) x t =
adamc@9 395 let
adamc@9 396 val renameE = SM.map (fn Rel' (n, t) => Rel' (n+1, t)
adamc@9 397 | x => x) (#renameE env)
adamc@211 398
adamc@211 399 val classes = CM.map (fn class => {
adamc@211 400 ground = KM.map liftExp (#ground class)
adamc@211 401 }) (#classes env)
adamc@211 402 val classes = case class_pair_in t of
adamc@211 403 NONE => classes
adamc@211 404 | SOME (f, x) =>
adamc@211 405 let
adamc@211 406 val class = Option.getOpt (CM.find (classes, f), empty_class)
adamc@211 407 val class = {
adamc@211 408 ground = KM.insert (#ground class, x, (ERel 0, #2 t))
adamc@211 409 }
adamc@211 410 in
adamc@211 411 CM.insert (classes, f, class)
adamc@211 412 end
adamc@9 413 in
adamc@9 414 {renameC = #renameC env,
adamc@9 415 relC = #relC env,
adamc@9 416 namedC = #namedC env,
adamc@9 417
adamc@157 418 datatypes = #datatypes env,
adamc@171 419 constructors = #constructors env,
adamc@157 420
adamc@211 421 classes = classes,
adamc@211 422
adamc@9 423 renameE = SM.insert (renameE, x, Rel' (0, t)),
adamc@9 424 relE = (x, t) :: #relE env,
adamc@31 425 namedE = #namedE env,
adamc@31 426
adamc@31 427 renameSgn = #renameSgn env,
adamc@31 428 sgn = #sgn env,
adamc@31 429
adamc@31 430 renameStr = #renameStr env,
adamc@31 431 str = #str env}
adamc@9 432 end
adamc@9 433
adamc@9 434 fun lookupERel (env : env) n =
adamc@9 435 (List.nth (#relE env, n))
adamc@9 436 handle Subscript => raise UnboundRel n
adamc@9 437
adamc@9 438 fun pushENamedAs (env : env) x n t =
adamc@211 439 let
adamc@211 440 val classes = #classes env
adamc@211 441 val classes = case class_pair_in t of
adamc@211 442 NONE => classes
adamc@211 443 | SOME (f, x) =>
adamc@211 444 let
adamc@211 445 val class = Option.getOpt (CM.find (classes, f), empty_class)
adamc@211 446 val class = {
adamc@211 447 ground = KM.insert (#ground class, x, (ENamed n, #2 t))
adamc@211 448 }
adamc@211 449 in
adamc@211 450 CM.insert (classes, f, class)
adamc@211 451 end
adamc@211 452 in
adamc@211 453 {renameC = #renameC env,
adamc@211 454 relC = #relC env,
adamc@211 455 namedC = #namedC env,
adamc@9 456
adamc@211 457 datatypes = #datatypes env,
adamc@211 458 constructors = #constructors env,
adamc@157 459
adamc@211 460 classes = classes,
adamc@31 461
adamc@211 462 renameE = SM.insert (#renameE env, x, Named' (n, t)),
adamc@211 463 relE = #relE env,
adamc@211 464 namedE = IM.insert (#namedE env, n, (x, t)),
adamc@211 465
adamc@211 466 renameSgn = #renameSgn env,
adamc@211 467 sgn = #sgn env,
adamc@211 468
adamc@211 469 renameStr = #renameStr env,
adamc@211 470 str = #str env}
adamc@211 471 end
adamc@9 472
adamc@9 473 fun pushENamed env x t =
adamc@9 474 let
adamc@9 475 val n = !namedCounter
adamc@9 476 in
adamc@9 477 namedCounter := n + 1;
adamc@9 478 (pushENamedAs env x n t, n)
adamc@9 479 end
adamc@9 480
adamc@9 481 fun lookupENamed (env : env) n =
adamc@9 482 case IM.find (#namedE env, n) of
adamc@9 483 NONE => raise UnboundNamed n
adamc@9 484 | SOME x => x
adamc@9 485
adamc@9 486 fun lookupE (env : env) x =
adamc@9 487 case SM.find (#renameE env, x) of
adamc@9 488 NONE => NotBound
adamc@9 489 | SOME (Rel' x) => Rel x
adamc@9 490 | SOME (Named' x) => Named x
adamc@2 491
adamc@31 492 fun pushSgnNamedAs (env : env) x n sgis =
adamc@31 493 {renameC = #renameC env,
adamc@31 494 relC = #relC env,
adamc@31 495 namedC = #namedC env,
adamc@31 496
adamc@157 497 datatypes = #datatypes env,
adamc@171 498 constructors = #constructors env,
adamc@157 499
adamc@211 500 classes = #classes env,
adamc@211 501
adamc@31 502 renameE = #renameE env,
adamc@31 503 relE = #relE env,
adamc@31 504 namedE = #namedE env,
adamc@31 505
adamc@31 506 renameSgn = SM.insert (#renameSgn env, x, (n, sgis)),
adamc@31 507 sgn = IM.insert (#sgn env, n, (x, sgis)),
adamc@31 508
adamc@31 509 renameStr = #renameStr env,
adamc@31 510 str = #str env}
adamc@31 511
adamc@31 512 fun pushSgnNamed env x sgis =
adamc@31 513 let
adamc@31 514 val n = !namedCounter
adamc@31 515 in
adamc@31 516 namedCounter := n + 1;
adamc@31 517 (pushSgnNamedAs env x n sgis, n)
adamc@31 518 end
adamc@31 519
adamc@31 520 fun lookupSgnNamed (env : env) n =
adamc@31 521 case IM.find (#sgn env, n) of
adamc@31 522 NONE => raise UnboundNamed n
adamc@31 523 | SOME x => x
adamc@31 524
adamc@31 525 fun lookupSgn (env : env) x = SM.find (#renameSgn env, x)
adamc@31 526
adamc@31 527 fun lookupStrNamed (env : env) n =
adamc@31 528 case IM.find (#str env, n) of
adamc@31 529 NONE => raise UnboundNamed n
adamc@31 530 | SOME x => x
adamc@31 531
adamc@31 532 fun lookupStr (env : env) x = SM.find (#renameStr env, x)
adamc@31 533
adamc@203 534
adamc@216 535 fun sgiSeek (sgi, (sgns, strs, cons)) =
adamc@216 536 case sgi of
adamc@216 537 SgiConAbs (x, n, _) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 538 | SgiCon (x, n, _, _) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 539 | SgiDatatype (x, n, _, _) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 540 | SgiDatatypeImp (x, n, _, _, _, _, _) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 541 | SgiVal _ => (sgns, strs, cons)
adamc@216 542 | SgiSgn (x, n, _) => (IM.insert (sgns, n, x), strs, cons)
adamc@216 543 | SgiStr (x, n, _) => (sgns, IM.insert (strs, n, x), cons)
adamc@216 544 | SgiConstraint _ => (sgns, strs, cons)
adamc@216 545 | SgiTable _ => (sgns, strs, cons)
adamc@216 546 | SgiClassAbs (x, n) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 547 | SgiClass (x, n, _) => (sgns, strs, IM.insert (cons, n, x))
adamc@216 548
adamc@34 549 fun sgnSeek f sgis =
adamc@34 550 let
adamc@59 551 fun seek (sgis, sgns, strs, cons) =
adamc@34 552 case sgis of
adamc@34 553 [] => NONE
adamc@34 554 | (sgi, _) :: sgis =>
adamc@34 555 case f sgi of
adamc@158 556 SOME v =>
adamc@158 557 let
adamc@158 558 val cons =
adamc@158 559 case sgi of
adamc@191 560 SgiDatatype (x, n, _, _) => IM.insert (cons, n, x)
adamc@191 561 | SgiDatatypeImp (x, n, _, _, _, _, _) => IM.insert (cons, n, x)
adamc@158 562 | _ => cons
adamc@158 563 in
adamc@158 564 SOME (v, (sgns, strs, cons))
adamc@158 565 end
adamc@88 566 | NONE =>
adamc@216 567 let
adamc@216 568 val (sgns, strs, cons) = sgiSeek (sgi, (sgns, strs, cons))
adamc@216 569 in
adamc@216 570 seek (sgis, sgns, strs, cons)
adamc@216 571 end
adamc@34 572 in
adamc@59 573 seek (sgis, IM.empty, IM.empty, IM.empty)
adamc@34 574 end
adamc@34 575
adamc@34 576 fun id x = x
adamc@34 577
adamc@34 578 fun unravelStr (str, _) =
adamc@34 579 case str of
adamc@34 580 StrVar x => (x, [])
adamc@34 581 | StrProj (str, m) =>
adamc@34 582 let
adamc@34 583 val (x, ms) = unravelStr str
adamc@34 584 in
adamc@34 585 (x, ms @ [m])
adamc@34 586 end
adamc@34 587 | _ => raise Fail "unravelStr"
adamc@34 588
adamc@59 589 fun sgnS_con (str, (sgns, strs, cons)) c =
adamc@34 590 case c of
adamc@34 591 CModProj (m1, ms, x) =>
adamc@34 592 (case IM.find (strs, m1) of
adamc@34 593 NONE => c
adamc@34 594 | SOME m1x =>
adamc@34 595 let
adamc@34 596 val (m1, ms') = unravelStr str
adamc@34 597 in
adamc@34 598 CModProj (m1, ms' @ m1x :: ms, x)
adamc@34 599 end)
adamc@34 600 | CNamed n =>
adamc@34 601 (case IM.find (cons, n) of
adamc@34 602 NONE => c
adamc@34 603 | SOME nx =>
adamc@34 604 let
adamc@34 605 val (m1, ms) = unravelStr str
adamc@34 606 in
adamc@34 607 CModProj (m1, ms, nx)
adamc@34 608 end)
adamc@34 609 | _ => c
adamc@34 610
adamc@216 611 fun sgnS_con' (m1, ms', (sgns, strs, cons)) c =
adamc@216 612 case c of
adamc@216 613 CModProj (m1, ms, x) =>
adamc@216 614 (case IM.find (strs, m1) of
adamc@216 615 NONE => c
adamc@216 616 | SOME m1x => CModProj (m1, ms' @ m1x :: ms, x))
adamc@216 617 | CNamed n =>
adamc@216 618 (case IM.find (cons, n) of
adamc@216 619 NONE => c
adamc@216 620 | SOME nx => CModProj (m1, ms', nx))
adamc@216 621 | _ => c
adamc@216 622
adamc@59 623 fun sgnS_sgn (str, (sgns, strs, cons)) sgn =
adamc@59 624 case sgn of
adamc@59 625 SgnProj (m1, ms, x) =>
adamc@59 626 (case IM.find (strs, m1) of
adamc@59 627 NONE => sgn
adamc@59 628 | SOME m1x =>
adamc@59 629 let
adamc@59 630 val (m1, ms') = unravelStr str
adamc@59 631 in
adamc@59 632 SgnProj (m1, ms' @ m1x :: ms, x)
adamc@59 633 end)
adamc@59 634 | SgnVar n =>
adamc@59 635 (case IM.find (sgns, n) of
adamc@59 636 NONE => sgn
adamc@59 637 | SOME nx =>
adamc@59 638 let
adamc@59 639 val (m1, ms) = unravelStr str
adamc@59 640 in
adamc@59 641 SgnProj (m1, ms, nx)
adamc@59 642 end)
adamc@59 643 | _ => sgn
adamc@59 644
adamc@59 645 fun sgnSubSgn x =
adamc@34 646 ElabUtil.Sgn.map {kind = id,
adamc@59 647 con = sgnS_con x,
adamc@34 648 sgn_item = id,
adamc@59 649 sgn = sgnS_sgn x}
adamc@34 650
adamc@211 651
adamc@211 652
adamc@211 653 and projectSgn env {sgn, str, field} =
adamc@211 654 case #1 (hnormSgn env sgn) of
adamc@211 655 SgnConst sgis =>
adamc@211 656 (case sgnSeek (fn SgiSgn (x, _, sgn) => if x = field then SOME sgn else NONE | _ => NONE) sgis of
adamc@211 657 NONE => NONE
adamc@211 658 | SOME (sgn, subs) => SOME (sgnSubSgn (str, subs) sgn))
adamc@211 659 | SgnError => SOME (SgnError, ErrorMsg.dummySpan)
adamc@211 660 | _ => NONE
adamc@211 661
adamc@211 662 and hnormSgn env (all as (sgn, loc)) =
adamc@34 663 case sgn of
adamc@42 664 SgnError => all
adamc@42 665 | SgnVar n => hnormSgn env (#2 (lookupSgnNamed env n))
adamc@42 666 | SgnConst _ => all
adamc@42 667 | SgnFun _ => all
adamc@59 668 | SgnProj (m, ms, x) =>
adamc@59 669 let
adamc@59 670 val (_, sgn) = lookupStrNamed env m
adamc@59 671 in
adamc@59 672 case projectSgn env {str = foldl (fn (m, str) => (StrProj (str, m), loc)) (StrVar m, loc) ms,
adamc@59 673 sgn = sgn,
adamc@59 674 field = x} of
adamc@59 675 NONE => raise Fail "ElabEnv.hnormSgn: projectSgn failed"
adamc@59 676 | SOME sgn => sgn
adamc@59 677 end
adamc@42 678 | SgnWhere (sgn, x, c) =>
adamc@42 679 case #1 (hnormSgn env sgn) of
adamc@42 680 SgnError => (SgnError, loc)
adamc@42 681 | SgnConst sgis =>
adamc@42 682 let
adamc@42 683 fun traverse (pre, post) =
adamc@42 684 case post of
adamc@42 685 [] => raise Fail "ElabEnv.hnormSgn: Can't reduce 'where' [1]"
adamc@42 686 | (sgi as (SgiConAbs (x', n, k), loc)) :: rest =>
adamc@42 687 if x = x' then
adamc@42 688 List.revAppend (pre, (SgiCon (x', n, k, c), loc) :: rest)
adamc@42 689 else
adamc@42 690 traverse (sgi :: pre, rest)
adamc@42 691 | sgi :: rest => traverse (sgi :: pre, rest)
adamc@42 692
adamc@42 693 val sgis = traverse ([], sgis)
adamc@42 694 in
adamc@42 695 (SgnConst sgis, loc)
adamc@42 696 end
adamc@42 697 | _ => raise Fail "ElabEnv.hnormSgn: Can't reduce 'where' [2]"
adamc@42 698
adamc@211 699 fun enrichClasses env classes (m1, ms) sgn =
adamc@59 700 case #1 (hnormSgn env sgn) of
adamc@59 701 SgnConst sgis =>
adamc@211 702 let
adamc@216 703 val (classes, _, _) =
adamc@216 704 foldl (fn (sgi, (classes, newClasses, fmap)) =>
adamc@211 705 let
adamc@211 706 fun found (x, n) =
adamc@211 707 (CM.insert (classes,
adamc@211 708 ClProj (m1, ms, x),
adamc@211 709 empty_class),
adamc@216 710 IM.insert (newClasses, n, x),
adamc@216 711 sgiSeek (#1 sgi, fmap))
adamc@216 712
adamc@216 713 fun default () = (classes, newClasses, sgiSeek (#1 sgi, fmap))
adamc@211 714 in
adamc@211 715 case #1 sgi of
adamc@217 716 SgiStr (x, _, sgn) =>
adamc@217 717 (enrichClasses env classes (m1, ms @ [x]) sgn,
adamc@217 718 newClasses,
adamc@217 719 sgiSeek (#1 sgi, fmap))
adamc@217 720 | SgiClassAbs xn => found xn
adamc@211 721 | SgiClass (x, n, _) => found (x, n)
adamc@216 722 | SgiVal (x, n, (CApp ((CNamed f, _), a), _)) =>
adamc@216 723 (case IM.find (newClasses, f) of
adamc@216 724 NONE => default ()
adamc@216 725 | SOME fx =>
adamc@216 726 case class_key_in (sgnS_con' (m1, ms, fmap) (#1 a), #2 a) of
adamc@216 727 NONE => default ()
adamc@216 728 | SOME ck =>
adamc@216 729 let
adamc@216 730 val cn = ClProj (m1, ms, fx)
adamc@216 731 val class = Option.getOpt (CM.find (classes, cn), empty_class)
adamc@216 732 val class = {
adamc@216 733 ground = KM.insert (#ground class, ck,
adamc@216 734 (EModProj (m1, ms, x), #2 sgn))
adamc@216 735 }
adamc@216 736
adamc@216 737 in
adamc@216 738 (CM.insert (classes, cn, class),
adamc@216 739 newClasses,
adamc@216 740 fmap)
adamc@216 741 end)
adamc@217 742 | SgiVal _ => default ()
adamc@216 743 | _ => default ()
adamc@211 744 end)
adamc@216 745 (classes, IM.empty, (IM.empty, IM.empty, IM.empty)) sgis
adamc@211 746 in
adamc@211 747 classes
adamc@211 748 end
adamc@211 749 | _ => classes
adamc@211 750
adamc@211 751 fun pushStrNamedAs (env : env) x n sgn =
adamc@211 752 {renameC = #renameC env,
adamc@211 753 relC = #relC env,
adamc@211 754 namedC = #namedC env,
adamc@211 755
adamc@211 756 datatypes = #datatypes env,
adamc@211 757 constructors = #constructors env,
adamc@211 758
adamc@211 759 classes = enrichClasses env (#classes env) (n, []) sgn,
adamc@211 760
adamc@211 761 renameE = #renameE env,
adamc@211 762 relE = #relE env,
adamc@211 763 namedE = #namedE env,
adamc@211 764
adamc@211 765 renameSgn = #renameSgn env,
adamc@211 766 sgn = #sgn env,
adamc@211 767
adamc@211 768 renameStr = SM.insert (#renameStr env, x, (n, sgn)),
adamc@211 769 str = IM.insert (#str env, n, (x, sgn))}
adamc@211 770
adamc@211 771 fun pushStrNamed env x sgn =
adamc@211 772 let
adamc@211 773 val n = !namedCounter
adamc@211 774 in
adamc@211 775 namedCounter := n + 1;
adamc@211 776 (pushStrNamedAs env x n sgn, n)
adamc@211 777 end
adamc@211 778
adamc@211 779 fun sgiBinds env (sgi, loc) =
adamc@211 780 case sgi of
adamc@211 781 SgiConAbs (x, n, k) => pushCNamedAs env x n k NONE
adamc@211 782 | SgiCon (x, n, k, c) => pushCNamedAs env x n k (SOME c)
adamc@211 783 | SgiDatatype (x, n, xs, xncs) =>
adamc@211 784 let
adamc@211 785 val env = pushCNamedAs env x n (KType, loc) NONE
adamc@211 786 in
adamc@211 787 foldl (fn ((x', n', to), env) =>
adamc@211 788 let
adamc@211 789 val t =
adamc@211 790 case to of
adamc@211 791 NONE => (CNamed n, loc)
adamc@211 792 | SOME t => (TFun (t, (CNamed n, loc)), loc)
adamc@211 793
adamc@211 794 val k = (KType, loc)
adamc@211 795 val t = foldr (fn (x, t) => (TCFun (Explicit, x, k, t), loc)) t xs
adamc@211 796 in
adamc@211 797 pushENamedAs env x' n' t
adamc@211 798 end)
adamc@211 799 env xncs
adamc@211 800 end
adamc@211 801 | SgiDatatypeImp (x, n, m1, ms, x', xs, xncs) =>
adamc@211 802 let
adamc@211 803 val env = pushCNamedAs env x n (KType, loc) (SOME (CModProj (m1, ms, x'), loc))
adamc@211 804 in
adamc@211 805 foldl (fn ((x', n', to), env) =>
adamc@211 806 let
adamc@211 807 val t =
adamc@211 808 case to of
adamc@211 809 NONE => (CNamed n, loc)
adamc@211 810 | SOME t => (TFun (t, (CNamed n, loc)), loc)
adamc@211 811
adamc@211 812 val k = (KType, loc)
adamc@211 813 val t = foldr (fn (x, t) => (TCFun (Explicit, x, k, t), loc)) t xs
adamc@211 814 in
adamc@211 815 pushENamedAs env x' n' t
adamc@211 816 end)
adamc@211 817 env xncs
adamc@211 818 end
adamc@211 819 | SgiVal (x, n, t) => pushENamedAs env x n t
adamc@211 820 | SgiStr (x, n, sgn) => pushStrNamedAs env x n sgn
adamc@211 821 | SgiSgn (x, n, sgn) => pushSgnNamedAs env x n sgn
adamc@211 822 | SgiConstraint _ => env
adamc@211 823
adamc@211 824 | SgiTable (tn, x, n, c) =>
adamc@211 825 let
adamc@211 826 val t = (CApp ((CModProj (tn, [], "table"), loc), c), loc)
adamc@211 827 in
adamc@211 828 pushENamedAs env x n t
adamc@211 829 end
adamc@211 830
adamc@211 831 | SgiClassAbs (x, n) => pushCNamedAs env x n (KArrow ((KType, loc), (KType, loc)), loc) NONE
adamc@211 832 | SgiClass (x, n, c) => pushCNamedAs env x n (KArrow ((KType, loc), (KType, loc)), loc) (SOME c)
adamc@211 833
adamc@211 834
adamc@211 835 fun sgnSubCon x =
adamc@211 836 ElabUtil.Con.map {kind = id,
adamc@211 837 con = sgnS_con x}
adamc@59 838
adamc@59 839 fun projectStr env {sgn, str, field} =
adamc@59 840 case #1 (hnormSgn env sgn) of
adamc@59 841 SgnConst sgis =>
adamc@59 842 (case sgnSeek (fn SgiStr (x, _, sgn) => if x = field then SOME sgn else NONE | _ => NONE) sgis of
adamc@59 843 NONE => NONE
adamc@59 844 | SOME (sgn, subs) => SOME (sgnSubSgn (str, subs) sgn))
adamc@59 845 | SgnError => SOME (SgnError, ErrorMsg.dummySpan)
adamc@59 846 | _ => NONE
adamc@59 847
adamc@158 848 fun chaseMpath env (n, ms) =
adamc@158 849 let
adamc@158 850 val (_, sgn) = lookupStrNamed env n
adamc@158 851 in
adamc@158 852 foldl (fn (m, (str, sgn)) =>
adamc@158 853 case projectStr env {sgn = sgn, str = str, field = m} of
adamc@158 854 NONE => raise Fail "kindof: Unknown substructure"
adamc@158 855 | SOME sgn => ((StrProj (str, m), #2 sgn), sgn))
adamc@158 856 ((StrVar n, #2 sgn), sgn) ms
adamc@158 857 end
adamc@158 858
adamc@42 859 fun projectCon env {sgn, str, field} =
adamc@42 860 case #1 (hnormSgn env sgn) of
adamc@34 861 SgnConst sgis =>
adamc@34 862 (case sgnSeek (fn SgiConAbs (x, _, k) => if x = field then SOME (k, NONE) else NONE
adamc@34 863 | SgiCon (x, _, k, c) => if x = field then SOME (k, SOME c) else NONE
adamc@191 864 | SgiDatatype (x, _, _, _) => if x = field then SOME ((KType, #2 sgn), NONE) else NONE
adamc@191 865 | SgiDatatypeImp (x, _, m1, ms, x', _, _) =>
adamc@158 866 if x = field then
adamc@158 867 SOME ((KType, #2 sgn), SOME (CModProj (m1, ms, x'), #2 sgn))
adamc@158 868 else
adamc@158 869 NONE
adamc@216 870 | SgiClassAbs (x, _) => if x = field then
adamc@216 871 SOME ((KArrow ((KType, #2 sgn), (KType, #2 sgn)), #2 sgn), NONE)
adamc@216 872 else
adamc@216 873 NONE
adamc@216 874 | SgiClass (x, _, c) => if x = field then
adamc@216 875 SOME ((KArrow ((KType, #2 sgn), (KType, #2 sgn)), #2 sgn), SOME c)
adamc@216 876 else
adamc@216 877 NONE
adamc@34 878 | _ => NONE) sgis of
adamc@34 879 NONE => NONE
adamc@34 880 | SOME ((k, co), subs) => SOME (k, Option.map (sgnSubCon (str, subs)) co))
adamc@34 881 | SgnError => SOME ((KError, ErrorMsg.dummySpan), SOME (CError, ErrorMsg.dummySpan))
adamc@42 882 | _ => NONE
adamc@34 883
adamc@157 884 fun projectDatatype env {sgn, str, field} =
adamc@157 885 case #1 (hnormSgn env sgn) of
adamc@157 886 SgnConst sgis =>
adamc@191 887 (case sgnSeek (fn SgiDatatype (x, _, xs, xncs) => if x = field then SOME (xs, xncs) else NONE
adamc@191 888 | SgiDatatypeImp (x, _, _, _, _, xs, xncs) => if x = field then SOME (xs, xncs) else NONE
adamc@157 889 | _ => NONE) sgis of
adamc@157 890 NONE => NONE
adamc@191 891 | SOME ((xs, xncs), subs) => SOME (xs,
adamc@191 892 map (fn (x, n, to) => (x, n, Option.map (sgnSubCon (str, subs)) to)) xncs))
adamc@157 893 | _ => NONE
adamc@157 894
adamc@174 895 fun projectConstructor env {sgn, str, field} =
adamc@174 896 case #1 (hnormSgn env sgn) of
adamc@174 897 SgnConst sgis =>
adamc@174 898 let
adamc@191 899 fun consider (n, xs, xncs) =
adamc@174 900 ListUtil.search (fn (x, n', to) =>
adamc@174 901 if x <> field then
adamc@174 902 NONE
adamc@174 903 else
adamc@191 904 SOME (U.classifyDatatype xncs, n', xs, to, (CNamed n, #2 str))) xncs
adamc@174 905 in
adamc@191 906 case sgnSeek (fn SgiDatatype (_, n, xs, xncs) => consider (n, xs, xncs)
adamc@191 907 | SgiDatatypeImp (_, n, _, _, _, xs, xncs) => consider (n, xs, xncs)
adamc@174 908 | _ => NONE) sgis of
adamc@174 909 NONE => NONE
adamc@191 910 | SOME ((dk, n, xs, to, t), subs) => SOME (dk, n, xs, Option.map (sgnSubCon (str, subs)) to,
adamc@191 911 sgnSubCon (str, subs) t)
adamc@174 912 end
adamc@174 913 | _ => NONE
adamc@174 914
adamc@42 915 fun projectVal env {sgn, str, field} =
adamc@42 916 case #1 (hnormSgn env sgn) of
adamc@34 917 SgnConst sgis =>
adamc@162 918 let
adamc@191 919 fun seek (n, xs, xncs) =
adamc@162 920 ListUtil.search (fn (x, _, to) =>
adamc@162 921 if x = field then
adamc@191 922 SOME (let
adamc@191 923 val t =
adamc@191 924 case to of
adamc@191 925 NONE => (CNamed n, #2 sgn)
adamc@191 926 | SOME t => (TFun (t, (CNamed n, #2 sgn)), #2 sgn)
adamc@191 927 val k = (KType, #2 sgn)
adamc@191 928 in
adamc@191 929 foldr (fn (x, t) => (TCFun (Explicit, x, k, t), #2 sgn))
adamc@191 930 t xs
adamc@191 931 end)
adamc@162 932 else
adamc@162 933 NONE) xncs
adamc@162 934 in
adamc@162 935 case sgnSeek (fn SgiVal (x, _, c) => if x = field then SOME c else NONE
adamc@191 936 | SgiDatatype (_, n, xs, xncs) => seek (n, xs, xncs)
adamc@191 937 | SgiDatatypeImp (_, n, _, _, _, xs, xncs) => seek (n, xs, xncs)
adamc@162 938 | _ => NONE) sgis of
adamc@162 939 NONE => NONE
adamc@162 940 | SOME (c, subs) => SOME (sgnSubCon (str, subs) c)
adamc@162 941 end
adamc@34 942 | SgnError => SOME (CError, ErrorMsg.dummySpan)
adamc@42 943 | _ => NONE
adamc@34 944
adamc@88 945 fun sgnSeekConstraints (str, sgis) =
adamc@88 946 let
adamc@88 947 fun seek (sgis, sgns, strs, cons, acc) =
adamc@88 948 case sgis of
adamc@88 949 [] => acc
adamc@88 950 | (sgi, _) :: sgis =>
adamc@88 951 case sgi of
adamc@88 952 SgiConstraint (c1, c2) =>
adamc@88 953 let
adamc@88 954 val sub = sgnSubCon (str, (sgns, strs, cons))
adamc@88 955 in
adamc@88 956 seek (sgis, sgns, strs, cons, (sub c1, sub c2) :: acc)
adamc@88 957 end
adamc@88 958 | SgiConAbs (x, n, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@88 959 | SgiCon (x, n, _, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@191 960 | SgiDatatype (x, n, _, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@191 961 | SgiDatatypeImp (x, n, _, _, _, _, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@88 962 | SgiVal _ => seek (sgis, sgns, strs, cons, acc)
adamc@88 963 | SgiSgn (x, n, _) => seek (sgis, IM.insert (sgns, n, x), strs, cons, acc)
adamc@88 964 | SgiStr (x, n, _) => seek (sgis, sgns, IM.insert (strs, n, x), cons, acc)
adamc@203 965 | SgiTable _ => seek (sgis, sgns, strs, cons, acc)
adamc@211 966 | SgiClassAbs (x, n) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@211 967 | SgiClass (x, n, _) => seek (sgis, sgns, strs, IM.insert (cons, n, x), acc)
adamc@88 968 in
adamc@88 969 seek (sgis, IM.empty, IM.empty, IM.empty, [])
adamc@88 970 end
adamc@88 971
adamc@88 972 fun projectConstraints env {sgn, str} =
adamc@88 973 case #1 (hnormSgn env sgn) of
adamc@88 974 SgnConst sgis => SOME (sgnSeekConstraints (str, sgis))
adamc@88 975 | SgnError => SOME []
adamc@88 976 | _ => NONE
adamc@34 977
adamc@157 978 fun declBinds env (d, loc) =
adamc@157 979 case d of
adamc@157 980 DCon (x, n, k, c) => pushCNamedAs env x n k (SOME c)
adamc@191 981 | DDatatype (x, n, xs, xncs) =>
adamc@157 982 let
adamc@157 983 val env = pushCNamedAs env x n (KType, loc) NONE
adamc@191 984 val env = pushDatatype env n xs xncs
adamc@157 985 in
adamc@191 986 foldl (fn ((x', n', to), env) =>
adamc@191 987 let
adamc@191 988 val t =
adamc@191 989 case to of
adamc@191 990 NONE => (CNamed n, loc)
adamc@191 991 | SOME t => (TFun (t, (CNamed n, loc)), loc)
adamc@191 992 val k = (KType, loc)
adamc@191 993 val t = foldr (fn (x, t) => (TCFun (Explicit, x, k, t), loc)) t xs
adamc@191 994 in
adamc@191 995 pushENamedAs env x' n' t
adamc@191 996 end)
adamc@191 997 env xncs
adamc@157 998 end
adamc@191 999 | DDatatypeImp (x, n, m, ms, x', xs, xncs) =>
adamc@157 1000 let
adamc@157 1001 val t = (CModProj (m, ms, x'), loc)
adamc@157 1002 val env = pushCNamedAs env x n (KType, loc) (SOME t)
adamc@191 1003 val env = pushDatatype env n xs xncs
adamc@157 1004
adamc@157 1005 val t = (CNamed n, loc)
adamc@157 1006 in
adamc@191 1007 foldl (fn ((x', n', to), env) =>
adamc@191 1008 let
adamc@191 1009 val t =
adamc@191 1010 case to of
adamc@191 1011 NONE => (CNamed n, loc)
adamc@191 1012 | SOME t => (TFun (t, (CNamed n, loc)), loc)
adamc@191 1013 val k = (KType, loc)
adamc@191 1014 val t = foldr (fn (x, t) => (TCFun (Explicit, x, k, t), loc)) t xs
adamc@191 1015 in
adamc@191 1016 pushENamedAs env x' n' t
adamc@191 1017 end)
adamc@191 1018 env xncs
adamc@157 1019 end
adamc@157 1020 | DVal (x, n, t, _) => pushENamedAs env x n t
adamc@157 1021 | DValRec vis => foldl (fn ((x, n, t, _), env) => pushENamedAs env x n t) env vis
adamc@157 1022 | DSgn (x, n, sgn) => pushSgnNamedAs env x n sgn
adamc@157 1023 | DStr (x, n, sgn, _) => pushStrNamedAs env x n sgn
adamc@157 1024 | DFfiStr (x, n, sgn) => pushStrNamedAs env x n sgn
adamc@157 1025 | DConstraint _ => env
adamc@157 1026 | DExport _ => env
adamc@205 1027 | DTable (tn, x, n, c) =>
adamc@205 1028 let
adamc@205 1029 val t = (CApp ((CModProj (tn, [], "table"), loc), c), loc)
adamc@205 1030 in
adamc@205 1031 pushENamedAs env x n t
adamc@205 1032 end
adamc@213 1033 | DClass (x, n, c) =>
adamc@213 1034 let
adamc@213 1035 val k = (KArrow ((KType, loc), (KType, loc)), loc)
adamc@213 1036 val env = pushCNamedAs env x n k (SOME c)
adamc@213 1037 in
adamc@213 1038 pushClass env n
adamc@213 1039 end
adamc@157 1040
adamc@2 1041 end