Mercurial > urweb

annotate src/corify.sml @ 376:6fd102fa28f9

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Simple generation of persistent paths
author Adam Chlipala <adamc@hcoop.net>
date Sun, 19 Oct 2008 11:11:49 -0400
parents 075b36dbb1a4
children 78358e5df273
rev   line source
adamc@16 1 (* Copyright (c) 2008, Adam Chlipala
adamc@16 2 * All rights reserved.
adamc@16 3 *
adamc@16 4 * Redistribution and use in source and binary forms, with or without
adamc@16 5 * modification, are permitted provided that the following conditions are met:
adamc@16 6 *
adamc@16 7 * - Redistributions of source code must retain the above copyright notice,
adamc@16 8 * this list of conditions and the following disclaimer.
adamc@16 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@16 10 * this list of conditions and the following disclaimer in the documentation
adamc@16 11 * and/or other materials provided with the distribution.
adamc@16 12 * - The names of contributors may not be used to endorse or promote products
adamc@16 13 * derived from this software without specific prior written permission.
adamc@16 14 *
adamc@16 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@16 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@16 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@16 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@16 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@16 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@16 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@16 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@16 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@16 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@16 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@16 26 *)
adamc@16 27
adamc@16 28 structure Corify :> CORIFY = struct
adamc@16 29
adamc@16 30 structure EM = ErrorMsg
adamc@39 31 structure L = Expl
adamc@16 32 structure L' = Core
adamc@16 33
adamc@39 34 structure IM = IntBinaryMap
adamc@39 35 structure SM = BinaryMapFn(struct
adamc@39 36 type ord_key = string
adamc@39 37 val compare = String.compare
adamc@39 38 end)
adamc@39 39
adamc@376 40 val restify = ref (fn s : string => s)
adamc@376 41
adamc@376 42 fun doRestify (mods, s) =
adamc@376 43 let
adamc@376 44 val s = if String.isPrefix "wrap_" s then
adamc@376 45 String.extract (s, 5, NONE)
adamc@376 46 else
adamc@376 47 s
adamc@376 48 in
adamc@376 49 !restify (String.concatWith "/" (rev (s :: mods)))
adamc@376 50 end
adamc@376 51
adamc@39 52 local
adamc@39 53 val count = ref 0
adamc@39 54 in
adamc@39 55
adamc@39 56 fun reset v = count := v
adamc@39 57
adamc@39 58 fun alloc () =
adamc@39 59 let
adamc@39 60 val r = !count
adamc@39 61 in
adamc@39 62 count := r + 1;
adamc@39 63 r
adamc@39 64 end
adamc@39 65
adamc@39 66 end
adamc@39 67
adamc@39 68 structure St : sig
adamc@39 69 type t
adamc@39 70
adamc@39 71 val empty : t
adamc@39 72
adamc@146 73 val debug : t -> unit
adamc@146 74
adamc@376 75 val name : t -> string list
adamc@376 76
adamc@376 77 val enter : t * string list -> t
adamc@39 78 val leave : t -> {outer : t, inner : t}
adamc@192 79 val ffi : string -> L'.con SM.map -> (string * string list * L'.con option * L'.datatype_kind) SM.map -> t
adamc@39 80
adamc@249 81 val basisIs : t * int -> t
adamc@249 82 val lookupBasis : t -> int option
adamc@249 83
adamc@73 84 datatype core_con =
adamc@73 85 CNormal of int
adamc@73 86 | CFfi of string
adamc@73 87 val bindCon : t -> string -> int -> t * int
adamc@73 88 val lookupConById : t -> int -> int option
adamc@73 89 val lookupConByName : t -> string -> core_con
adamc@48 90
adamc@177 91 val bindConstructor : t -> string -> int -> L'.patCon -> t
adamc@186 92 val lookupConstructorByNameOpt : t -> string -> L'.patCon option
adamc@177 93 val lookupConstructorByName : t -> string -> L'.patCon
adamc@177 94 val lookupConstructorById : t -> int -> L'.patCon
adamc@249 95
adamc@249 96 datatype core_val =
adamc@249 97 ENormal of int
adamc@249 98 | EFfi of string * L'.con
adamc@249 99 val bindVal : t -> string -> int -> t * int
adamc@249 100 val bindConstructorVal : t -> string -> int -> t
adamc@249 101 val lookupValById : t -> int -> int option
adamc@249 102 val lookupValByName : t -> string -> core_val
adamc@177 103
adamc@249 104 val bindStr : t -> string -> int -> t -> t
adamc@249 105 val lookupStrById : t -> int -> t
adamc@249 106 val lookupStrByName : string * t -> t
adamc@339 107 val lookupStrByNameOpt : string * t -> t option
adamc@39 108
adamc@249 109 val bindFunctor : t -> string -> int -> string -> int -> L.str -> t
adamc@249 110 val lookupFunctorById : t -> int -> string * int * L.str
adamc@249 111 val lookupFunctorByName : string * t -> string * int * L.str
adamc@249 112 end = struct
adamc@46 113
adamc@249 114 datatype flattening =
adamc@376 115 FNormal of {name : string list,
adamc@376 116 cons : int SM.map,
adamc@249 117 constructors : L'.patCon SM.map,
adamc@249 118 vals : int SM.map,
adamc@249 119 strs : flattening SM.map,
adamc@249 120 funs : (string * int * L.str) SM.map}
adamc@249 121 | FFfi of {mod : string,
adamc@249 122 vals : L'.con SM.map,
adamc@249 123 constructors : (string * string list * L'.con option * L'.datatype_kind) SM.map}
adamc@39 124
adamc@249 125 type t = {
adamc@249 126 basis : int option,
adamc@249 127 cons : int IM.map,
adamc@249 128 constructors : L'.patCon IM.map,
adamc@249 129 vals : int IM.map,
adamc@249 130 strs : flattening IM.map,
adamc@249 131 funs : (string * int * L.str) IM.map,
adamc@249 132 current : flattening,
adamc@249 133 nested : flattening list
adamc@249 134 }
adamc@39 135
adamc@249 136 val empty = {
adamc@249 137 basis = NONE,
adamc@249 138 cons = IM.empty,
adamc@249 139 constructors = IM.empty,
adamc@249 140 vals = IM.empty,
adamc@249 141 strs = IM.empty,
adamc@249 142 funs = IM.empty,
adamc@376 143 current = FNormal { name = [], cons = SM.empty, constructors = SM.empty,
adamc@376 144 vals = SM.empty, strs = SM.empty, funs = SM.empty },
adamc@249 145 nested = []
adamc@249 146 }
adamc@39 147
adamc@376 148 fun debug ({current = FNormal {cons, constructors, vals, strs, funs, ...}, ...} : t) =
adamc@249 149 print ("cons: " ^ Int.toString (SM.numItems cons) ^ "; "
adamc@249 150 ^ "constructors: " ^ Int.toString (SM.numItems constructors) ^ "; "
adamc@249 151 ^ "vals: " ^ Int.toString (SM.numItems vals) ^ "; "
adamc@249 152 ^ "strs: " ^ Int.toString (SM.numItems strs) ^ "; "
adamc@249 153 ^ "funs: " ^ Int.toString (SM.numItems funs) ^ "\n")
adamc@249 154 | debug _ = print "Not normal!\n"
adamc@146 155
adamc@376 156 fun name ({current = FNormal {name, ...}, ...} : t) = name
adamc@376 157 | name {current = FFfi {mod = name, ...}, ...} = [name]
adamc@376 158
adamc@249 159 fun basisIs ({cons, constructors, vals, strs, funs, current, nested, ...} : t, basis) =
adamc@249 160 {basis = SOME basis,
adamc@249 161 cons = cons,
adamc@249 162 constructors = constructors,
adamc@249 163 vals = vals,
adamc@249 164 strs = strs,
adamc@249 165 funs = funs,
adamc@249 166 current = current,
adamc@249 167 nested = nested}
adamc@48 168
adamc@249 169 fun lookupBasis ({basis, ...} : t) = basis
adamc@73 170
adamc@249 171 datatype core_con =
adamc@249 172 CNormal of int
adamc@249 173 | CFfi of string
adamc@39 174
adamc@249 175 datatype core_val =
adamc@249 176 ENormal of int
adamc@249 177 | EFfi of string * L'.con
adamc@188 178
adamc@249 179 fun bindCon {basis, cons, constructors, vals, strs, funs, current, nested} s n =
adamc@249 180 let
adamc@249 181 val n' = alloc ()
adamc@188 182
adamc@249 183 val current =
adamc@249 184 case current of
adamc@249 185 FFfi _ => raise Fail "Binding inside FFfi"
adamc@376 186 | FNormal {name, cons, constructors, vals, strs, funs} =>
adamc@376 187 FNormal {name = name,
adamc@376 188 cons = SM.insert (cons, s, n'),
adamc@249 189 constructors = constructors,
adamc@249 190 vals = vals,
adamc@249 191 strs = strs,
adamc@249 192 funs = funs}
adamc@249 193 in
adamc@249 194 ({basis = basis,
adamc@249 195 cons = IM.insert (cons, n, n'),
adamc@177 196 constructors = constructors,
adamc@73 197 vals = vals,
adamc@39 198 strs = strs,
adamc@46 199 funs = funs,
adamc@39 200 current = current,
adamc@249 201 nested = nested},
adamc@249 202 n')
adamc@249 203 end
adamc@39 204
adamc@249 205 fun lookupConById ({cons, ...} : t) n = IM.find (cons, n)
adamc@39 206
adamc@249 207 fun lookupConByName ({current, ...} : t) x =
adamc@249 208 case current of
adamc@249 209 FFfi {mod = m, ...} => CFfi m
adamc@249 210 | FNormal {cons, ...} =>
adamc@249 211 case SM.find (cons, x) of
adamc@249 212 NONE => raise Fail "Corify.St.lookupConByName"
adamc@249 213 | SOME n => CNormal n
adamc@249 214
adamc@249 215 fun bindVal {basis, cons, constructors, vals, strs, funs, current, nested} s n =
adamc@249 216 let
adamc@249 217 val n' = alloc ()
adamc@249 218
adamc@249 219 val current =
adamc@249 220 case current of
adamc@249 221 FFfi _ => raise Fail "Binding inside FFfi"
adamc@376 222 | FNormal {name, cons, constructors, vals, strs, funs} =>
adamc@376 223 FNormal {name = name,
adamc@376 224 cons = cons,
adamc@249 225 constructors = constructors,
adamc@249 226 vals = SM.insert (vals, s, n'),
adamc@249 227 strs = strs,
adamc@249 228 funs = funs}
adamc@249 229 in
adamc@249 230 ({basis = basis,
adamc@249 231 cons = cons,
adamc@249 232 constructors = constructors,
adamc@249 233 vals = IM.insert (vals, n, n'),
adamc@249 234 strs = strs,
adamc@249 235 funs = funs,
adamc@249 236 current = current,
adamc@249 237 nested = nested},
adamc@249 238 n')
adamc@249 239 end
adamc@249 240
adamc@249 241 fun bindConstructorVal {basis, cons, constructors, vals, strs, funs, current, nested} s n =
adamc@249 242 let
adamc@249 243 val current =
adamc@249 244 case current of
adamc@249 245 FFfi _ => raise Fail "Binding inside FFfi"
adamc@376 246 | FNormal {name, cons, constructors, vals, strs, funs} =>
adamc@376 247 FNormal {name = name,
adamc@376 248 cons = cons,
adamc@249 249 constructors = constructors,
adamc@249 250 vals = SM.insert (vals, s, n),
adamc@249 251 strs = strs,
adamc@249 252 funs = funs}
adamc@249 253 in
adamc@249 254 {basis = basis,
adamc@249 255 cons = cons,
adamc@249 256 constructors = constructors,
adamc@249 257 vals = IM.insert (vals, n, n),
adamc@249 258 strs = strs,
adamc@249 259 funs = funs,
adamc@249 260 current = current,
adamc@249 261 nested = nested}
adamc@249 262 end
adamc@249 263
adamc@249 264
adamc@249 265 fun lookupValById ({vals, ...} : t) n = IM.find (vals, n)
adamc@249 266
adamc@249 267 fun lookupValByName ({current, ...} : t) x =
adamc@249 268 case current of
adamc@249 269 FFfi {mod = m, vals, ...} =>
adamc@249 270 (case SM.find (vals, x) of
adamc@249 271 NONE => raise Fail "Corify.St.lookupValByName: no type for FFI val"
adamc@249 272 | SOME t => EFfi (m, t))
adamc@249 273 | FNormal {vals, ...} =>
adamc@249 274 case SM.find (vals, x) of
adamc@249 275 NONE => raise Fail "Corify.St.lookupValByName"
adamc@249 276 | SOME n => ENormal n
adamc@249 277
adamc@249 278 fun bindConstructor {basis, cons, constructors, vals, strs, funs, current, nested} s n n' =
adamc@249 279 let
adamc@249 280 val current =
adamc@249 281 case current of
adamc@249 282 FFfi _ => raise Fail "Binding inside FFfi"
adamc@376 283 | FNormal {name, cons, constructors, vals, strs, funs} =>
adamc@376 284 FNormal {name = name,
adamc@376 285 cons = cons,
adamc@249 286 constructors = SM.insert (constructors, s, n'),
adamc@249 287 vals = vals,
adamc@249 288 strs = strs,
adamc@249 289 funs = funs}
adamc@249 290 in
adamc@249 291 {basis = basis,
adamc@249 292 cons = cons,
adamc@249 293 constructors = IM.insert (constructors, n, n'),
adamc@249 294 vals = vals,
adamc@249 295 strs = strs,
adamc@249 296 funs = funs,
adamc@249 297 current = current,
adamc@249 298 nested = nested}
adamc@249 299 end
adamc@249 300
adamc@249 301 fun lookupConstructorById ({constructors, ...} : t) n =
adamc@249 302 case IM.find (constructors, n) of
adamc@249 303 NONE => raise Fail "Corify.St.lookupConstructorById"
adamc@249 304 | SOME x => x
adamc@249 305
adamc@249 306 fun lookupConstructorByNameOpt ({current, ...} : t) x =
adamc@249 307 case current of
adamc@249 308 FFfi {mod = m, constructors, ...} =>
adamc@249 309 (case SM.find (constructors, x) of
adamc@188 310 NONE => NONE
adamc@249 311 | SOME (n, xs, to, dk) => SOME (L'.PConFfi {mod = m, datatyp = n, params = xs, con = x, arg = to, kind = dk}))
adamc@249 312 | FNormal {constructors, ...} =>
adamc@249 313 case SM.find (constructors, x) of
adamc@249 314 NONE => NONE
adamc@249 315 | SOME n => SOME n
adamc@39 316
adamc@249 317 fun lookupConstructorByName ({current, ...} : t) x =
adamc@249 318 case current of
adamc@249 319 FFfi {mod = m, constructors, ...} =>
adamc@249 320 (case SM.find (constructors, x) of
adamc@249 321 NONE => raise Fail "Corify.St.lookupConstructorByName [1]"
adamc@249 322 | SOME (n, xs, to, dk) => L'.PConFfi {mod = m, datatyp = n, params = xs, con = x, arg = to, kind = dk})
adamc@249 323 | FNormal {constructors, ...} =>
adamc@249 324 case SM.find (constructors, x) of
adamc@249 325 NONE => raise Fail "Corify.St.lookupConstructorByName [2]"
adamc@249 326 | SOME n => n
adamc@73 327
adamc@376 328 fun enter ({basis, cons, constructors, vals, strs, funs, current, nested}, name) =
adamc@249 329 {basis = basis,
adamc@249 330 cons = cons,
adamc@249 331 constructors = constructors,
adamc@249 332 vals = vals,
adamc@249 333 strs = strs,
adamc@249 334 funs = funs,
adamc@376 335 current = FNormal {name = name,
adamc@376 336 cons = SM.empty,
adamc@249 337 constructors = SM.empty,
adamc@249 338 vals = SM.empty,
adamc@249 339 strs = SM.empty,
adamc@249 340 funs = SM.empty},
adamc@249 341 nested = current :: nested}
adamc@73 342
adamc@249 343 fun dummy (b, f) = {basis = b,
adamc@249 344 cons = IM.empty,
adamc@249 345 constructors = IM.empty,
adamc@249 346 vals = IM.empty,
adamc@249 347 strs = IM.empty,
adamc@249 348 funs = IM.empty,
adamc@249 349 current = f,
adamc@249 350 nested = []}
adamc@163 351
adamc@249 352 fun leave {basis, cons, constructors, vals, strs, funs, current, nested = m1 :: rest} =
adamc@249 353 {outer = {basis = basis,
adamc@249 354 cons = cons,
adamc@249 355 constructors = constructors,
adamc@249 356 vals = vals,
adamc@249 357 strs = strs,
adamc@249 358 funs = funs,
adamc@249 359 current = m1,
adamc@249 360 nested = rest},
adamc@249 361 inner = dummy (basis, current)}
adamc@249 362 | leave _ = raise Fail "Corify.St.leave"
adamc@177 363
adamc@249 364 fun ffi m vals constructors = dummy (NONE, FFfi {mod = m, vals = vals, constructors = constructors})
adamc@73 365
adamc@249 366 fun bindStr ({basis, cons, constructors, vals, strs, funs,
adamc@376 367 current = FNormal {name, cons = mcons, constructors = mconstructors,
adamc@249 368 vals = mvals, strs = mstrs, funs = mfuns}, nested} : t)
adamc@249 369 x n ({current = f, ...} : t) =
adamc@249 370 {basis = basis,
adamc@249 371 cons = cons,
adamc@249 372 constructors = constructors,
adamc@249 373 vals = vals,
adamc@249 374 strs = IM.insert (strs, n, f),
adamc@249 375 funs = funs,
adamc@376 376 current = FNormal {name = name,
adamc@376 377 cons = mcons,
adamc@249 378 constructors = mconstructors,
adamc@249 379 vals = mvals,
adamc@249 380 strs = SM.insert (mstrs, x, f),
adamc@249 381 funs = mfuns},
adamc@249 382 nested = nested}
adamc@249 383 | bindStr _ _ _ _ = raise Fail "Corify.St.bindStr"
adamc@73 384
adamc@249 385 fun lookupStrById ({basis, strs, ...} : t) n =
adamc@249 386 case IM.find (strs, n) of
adamc@249 387 NONE => raise Fail "Corify.St.lookupStrById"
adamc@249 388 | SOME f => dummy (basis, f)
adamc@177 389
adamc@249 390 fun lookupStrByName (m, {basis, current = FNormal {strs, ...}, ...} : t) =
adamc@249 391 (case SM.find (strs, m) of
adamc@339 392 NONE => raise Fail "Corify.St.lookupStrByName [1]"
adamc@249 393 | SOME f => dummy (basis, f))
adamc@339 394 | lookupStrByName _ = raise Fail "Corify.St.lookupStrByName [2]"
adamc@339 395
adamc@339 396 fun lookupStrByNameOpt (m, {basis, current = FNormal {strs, ...}, ...} : t) =
adamc@339 397 (case SM.find (strs, m) of
adamc@339 398 NONE => NONE
adamc@339 399 | SOME f => SOME (dummy (basis, f)))
adamc@339 400 | lookupStrByNameOpt _ = NONE
adamc@177 401
adamc@249 402 fun bindFunctor ({basis, cons, constructors, vals, strs, funs,
adamc@376 403 current = FNormal {name, cons = mcons, constructors = mconstructors,
adamc@249 404 vals = mvals, strs = mstrs, funs = mfuns}, nested} : t)
adamc@249 405 x n xa na str =
adamc@249 406 {basis = basis,
adamc@249 407 cons = cons,
adamc@249 408 constructors = constructors,
adamc@249 409 vals = vals,
adamc@249 410 strs = strs,
adamc@249 411 funs = IM.insert (funs, n, (xa, na, str)),
adamc@376 412 current = FNormal {name = name,
adamc@376 413 cons = mcons,
adamc@249 414 constructors = mconstructors,
adamc@249 415 vals = mvals,
adamc@249 416 strs = mstrs,
adamc@249 417 funs = SM.insert (mfuns, x, (xa, na, str))},
adamc@249 418 nested = nested}
adamc@249 419 | bindFunctor _ _ _ _ _ _ = raise Fail "Corify.St.bindFunctor"
adamc@186 420
adamc@249 421 fun lookupFunctorById ({funs, ...} : t) n =
adamc@249 422 case IM.find (funs, n) of
adamc@249 423 NONE => raise Fail "Corify.St.lookupFunctorById"
adamc@249 424 | SOME v => v
adamc@177 425
adamc@249 426 fun lookupFunctorByName (m, {current = FNormal {funs, ...}, ...} : t) =
adamc@249 427 (case SM.find (funs, m) of
adamc@339 428 NONE => raise Fail "Corify.St.lookupFunctorByName [1]"
adamc@249 429 | SOME v => v)
adamc@339 430 | lookupFunctorByName _ = raise Fail "Corify.St.lookupFunctorByName [2]"
adamc@39 431
adamc@249 432 end
adamc@39 433
adamc@39 434
adamc@249 435 fun corifyKind (k, loc) =
adamc@249 436 case k of
adamc@249 437 L.KType => (L'.KType, loc)
adamc@249 438 | L.KArrow (k1, k2) => (L'.KArrow (corifyKind k1, corifyKind k2), loc)
adamc@249 439 | L.KName => (L'.KName, loc)
adamc@249 440 | L.KRecord k => (L'.KRecord (corifyKind k), loc)
adamc@249 441 | L.KUnit => (L'.KUnit, loc)
adamc@249 442 | L.KTuple ks => (L'.KTuple (map corifyKind ks), loc)
adamc@48 443
adamc@249 444 fun corifyCon st (c, loc) =
adamc@249 445 case c of
adamc@249 446 L.TFun (t1, t2) => (L'.TFun (corifyCon st t1, corifyCon st t2), loc)
adamc@249 447 | L.TCFun (x, k, t) => (L'.TCFun (x, corifyKind k, corifyCon st t), loc)
adamc@249 448 | L.TRecord c => (L'.TRecord (corifyCon st c), loc)
adamc@39 449
adamc@249 450 | L.CRel n => (L'.CRel n, loc)
adamc@249 451 | L.CNamed n =>
adamc@249 452 (case St.lookupConById st n of
adamc@249 453 NONE => (L'.CNamed n, loc)
adamc@249 454 | SOME n => (L'.CNamed n, loc))
adamc@249 455 | L.CModProj (m, ms, x) =>
adamc@249 456 let
adamc@249 457 val st = St.lookupStrById st m
adamc@249 458 val st = foldl St.lookupStrByName st ms
adamc@249 459 in
adamc@249 460 case St.lookupConByName st x of
adamc@249 461 St.CNormal n => (L'.CNamed n, loc)
adamc@249 462 | St.CFfi m => (L'.CFfi (m, x), loc)
adamc@249 463 end
adamc@39 464
adamc@249 465 | L.CApp (c1, c2) => (L'.CApp (corifyCon st c1, corifyCon st c2), loc)
adamc@249 466 | L.CAbs (x, k, c) => (L'.CAbs (x, corifyKind k, corifyCon st c), loc)
adamc@39 467
adamc@249 468 | L.CName s => (L'.CName s, loc)
adamc@46 469
adamc@249 470 | L.CRecord (k, xcs) =>
adamc@249 471 (L'.CRecord (corifyKind k, map (fn (c1, c2) => (corifyCon st c1, corifyCon st c2)) xcs), loc)
adamc@249 472 | L.CConcat (c1, c2) => (L'.CConcat (corifyCon st c1, corifyCon st c2), loc)
adamc@249 473 | L.CFold (k1, k2) => (L'.CFold (corifyKind k1, corifyKind k2), loc)
adamc@249 474 | L.CUnit => (L'.CUnit, loc)
adamc@46 475
adamc@249 476 | L.CTuple cs => (L'.CTuple (map (corifyCon st) cs), loc)
adamc@249 477 | L.CProj (c, n) => (L'.CProj (corifyCon st c, n), loc)
adamc@213 478
adamc@249 479 fun corifyPatCon st pc =
adamc@249 480 case pc of
adamc@249 481 L.PConVar n => St.lookupConstructorById st n
adamc@249 482 | L.PConProj (m1, ms, x) =>
adamc@249 483 let
adamc@249 484 val st = St.lookupStrById st m1
adamc@249 485 val st = foldl St.lookupStrByName st ms
adamc@249 486 in
adamc@249 487 St.lookupConstructorByName st x
adamc@249 488 end
adamc@46 489
adamc@249 490 fun corifyPat st (p, loc) =
adamc@249 491 case p of
adamc@249 492 L.PWild => (L'.PWild, loc)
adamc@249 493 | L.PVar (x, t) => (L'.PVar (x, corifyCon st t), loc)
adamc@249 494 | L.PPrim p => (L'.PPrim p, loc)
adamc@249 495 | L.PCon (dk, pc, ts, po) => (L'.PCon (dk, corifyPatCon st pc, map (corifyCon st) ts,
adamc@249 496 Option.map (corifyPat st) po), loc)
adamc@249 497 | L.PRecord xps => (L'.PRecord (map (fn (x, p, t) => (x, corifyPat st p, corifyCon st t)) xps), loc)
adamc@39 498
adamc@249 499 fun corifyExp st (e, loc) =
adamc@249 500 case e of
adamc@249 501 L.EPrim p => (L'.EPrim p, loc)
adamc@249 502 | L.ERel n => (L'.ERel n, loc)
adamc@249 503 | L.ENamed n =>
adamc@249 504 (case St.lookupValById st n of
adamc@249 505 NONE => (L'.ENamed n, loc)
adamc@249 506 | SOME n => (L'.ENamed n, loc))
adamc@249 507 | L.EModProj (m, ms, x) =>
adamc@249 508 let
adamc@249 509 val st = St.lookupStrById st m
adamc@249 510 val st = foldl St.lookupStrByName st ms
adamc@249 511 in
adamc@249 512 case St.lookupConstructorByNameOpt st x of
adamc@249 513 SOME (pc as L'.PConFfi {mod = m, datatyp, params, arg, kind, ...}) =>
adamc@249 514 let
adamc@249 515 val args = ListUtil.mapi (fn (i, _) => (L'.CRel i, loc)) params
adamc@249 516 val e = case arg of
adamc@249 517 NONE => (L'.ECon (kind, pc, args, NONE), loc)
adamc@249 518 | SOME dom => (L'.EAbs ("x", dom, (L'.CFfi (m, datatyp), loc),
adamc@249 519 (L'.ECon (kind, pc, args, SOME (L'.ERel 0, loc)), loc)), loc)
adamc@192 520
adamc@249 521 val k = (L'.KType, loc)
adamc@249 522 in
adamc@249 523 foldr (fn (x, e) => (L'.ECAbs (x, k, e), loc)) e params
adamc@249 524 end
adamc@249 525 | _ =>
adamc@249 526 case St.lookupValByName st x of
adamc@249 527 St.ENormal n => (L'.ENamed n, loc)
adamc@249 528 | St.EFfi (m, t) =>
adamc@249 529 case t of
adamc@249 530 (L'.TFun (dom as (L'.TRecord (L'.CRecord (_, []), _), _), ran), _) =>
adamc@249 531 (L'.EAbs ("arg", dom, ran, (L'.EFfiApp (m, x, []), loc)), loc)
adamc@249 532 | t as (L'.TFun _, _) =>
adamc@249 533 let
adamc@249 534 fun getArgs (all as (t, _), args) =
adamc@249 535 case t of
adamc@249 536 L'.TFun (dom, ran) => getArgs (ran, dom :: args)
adamc@249 537 | _ => (all, rev args)
adamc@39 538
adamc@249 539 val (result, args) = getArgs (t, [])
adamc@16 540
adamc@249 541 val (actuals, _) = foldr (fn (_, (actuals, n)) =>
adamc@249 542 ((L'.ERel n, loc) :: actuals,
adamc@249 543 n + 1)) ([], 0) args
adamc@249 544 val app = (L'.EFfiApp (m, x, actuals), loc)
adamc@249 545 val (abs, _, _) = foldr (fn (t, (abs, ran, n)) =>
adamc@249 546 ((L'.EAbs ("arg" ^ Int.toString n,
adamc@249 547 t,
adamc@249 548 ran,
adamc@249 549 abs), loc),
adamc@249 550 (L'.TFun (t, ran), loc),
adamc@249 551 n - 1)) (app, result, length args - 1) args
adamc@249 552 in
adamc@249 553 abs
adamc@249 554 end
adamc@249 555 | _ => (L'.EFfi (m, x), loc)
adamc@249 556 end
adamc@249 557 | L.EApp (e1, e2) => (L'.EApp (corifyExp st e1, corifyExp st e2), loc)
adamc@249 558 | L.EAbs (x, dom, ran, e1) => (L'.EAbs (x, corifyCon st dom, corifyCon st ran, corifyExp st e1), loc)
adamc@249 559 | L.ECApp (e1, c) => (L'.ECApp (corifyExp st e1, corifyCon st c), loc)
adamc@249 560 | L.ECAbs (x, k, e1) => (L'.ECAbs (x, corifyKind k, corifyExp st e1), loc)
adamc@16 561
adamc@249 562 | L.ERecord xes => (L'.ERecord (map (fn (c, e, t) =>
adamc@249 563 (corifyCon st c, corifyExp st e, corifyCon st t)) xes), loc)
adamc@249 564 | L.EField (e1, c, {field, rest}) => (L'.EField (corifyExp st e1, corifyCon st c,
adamc@249 565 {field = corifyCon st field, rest = corifyCon st rest}), loc)
adamc@339 566 | L.EWith (e1, c, e2, {field, rest}) => (L'.EWith (corifyExp st e1, corifyCon st c, corifyExp st e2,
adamc@339 567 {field = corifyCon st field, rest = corifyCon st rest}), loc)
adamc@249 568 | L.ECut (e1, c, {field, rest}) => (L'.ECut (corifyExp st e1, corifyCon st c,
adamc@249 569 {field = corifyCon st field, rest = corifyCon st rest}), loc)
adamc@249 570 | L.EFold k => (L'.EFold (corifyKind k), loc)
adamc@34 571
adamc@249 572 | L.ECase (e, pes, {disc, result}) =>
adamc@249 573 (L'.ECase (corifyExp st e,
adamc@249 574 map (fn (p, e) => (corifyPat st p, corifyExp st e)) pes,
adamc@249 575 {disc = corifyCon st disc, result = corifyCon st result}),
adamc@249 576 loc)
adamc@16 577
adamc@249 578 | L.EWrite e => (L'.EWrite (corifyExp st e), loc)
adamc@16 579
adamc@376 580 fun corifyDecl mods ((d, loc : EM.span), st) =
adamc@249 581 case d of
adamc@249 582 L.DCon (x, n, k, c) =>
adamc@249 583 let
adamc@249 584 val (st, n) = St.bindCon st x n
adamc@249 585 in
adamc@249 586 ([(L'.DCon (x, n, corifyKind k, corifyCon st c), loc)], st)
adamc@249 587 end
adamc@249 588 | L.DDatatype (x, n, xs, xncs) =>
adamc@249 589 let
adamc@249 590 val (st, n) = St.bindCon st x n
adamc@249 591 val (xncs, st) = ListUtil.foldlMap (fn ((x, n, co), st) =>
adamc@249 592 let
adamc@249 593 val st = St.bindConstructor st x n (L'.PConVar n)
adamc@249 594 val st = St.bindConstructorVal st x n
adamc@249 595 val co = Option.map (corifyCon st) co
adamc@249 596 in
adamc@249 597 ((x, n, co), st)
adamc@249 598 end) st xncs
adamc@16 599
adamc@249 600 val dk = ElabUtil.classifyDatatype xncs
adamc@249 601 val t = (L'.CNamed n, loc)
adamc@249 602 val nxs = length xs - 1
adamc@249 603 val t = ListUtil.foldli (fn (i, _, t) => (L'.CApp (t, (L'.CRel (nxs - i), loc)), loc)) t xs
adamc@249 604 val k = (L'.KType, loc)
adamc@249 605 val dcons = map (fn (x, n, to) =>
adamc@249 606 let
adamc@249 607 val args = ListUtil.mapi (fn (i, _) => (L'.CRel (nxs - i), loc)) xs
adamc@249 608 val (e, t) =
adamc@249 609 case to of
adamc@249 610 NONE => ((L'.ECon (dk, L'.PConVar n, args, NONE), loc), t)
adamc@249 611 | SOME t' => ((L'.EAbs ("x", t', t,
adamc@249 612 (L'.ECon (dk, L'.PConVar n, args,
adamc@249 613 SOME (L'.ERel 0, loc)),
adamc@249 614 loc)),
adamc@249 615 loc),
adamc@249 616 (L'.TFun (t', t), loc))
adamc@192 617
adamc@249 618 val t = foldr (fn (x, t) => (L'.TCFun (x, k, t), loc)) t xs
adamc@249 619 val e = foldr (fn (x, e) => (L'.ECAbs (x, k, e), loc)) e xs
adamc@249 620 in
adamc@249 621 (L'.DVal (x, n, t, e, ""), loc)
adamc@249 622 end) xncs
adamc@249 623 in
adamc@249 624 ((L'.DDatatype (x, n, xs, xncs), loc) :: dcons, st)
adamc@249 625 end
adamc@249 626 | L.DDatatypeImp (x, n, m1, ms, s, xs, xncs) =>
adamc@249 627 let
adamc@249 628 val (st, n) = St.bindCon st x n
adamc@249 629 val c = corifyCon st (L.CModProj (m1, ms, s), loc)
adamc@177 630
adamc@249 631 val m = foldl (fn (x, m) => (L.StrProj (m, x), loc)) (L.StrVar m1, loc) ms
adamc@376 632 val (_, {inner, ...}) = corifyStr mods (m, st)
adamc@177 633
adamc@249 634 val (xncs, st) = ListUtil.foldlMap (fn ((x, n, co), st) =>
adamc@249 635 let
adamc@249 636 val n' = St.lookupConstructorByName inner x
adamc@249 637 val st = St.bindConstructor st x n n'
adamc@249 638 val (st, n) = St.bindVal st x n
adamc@249 639 val co = Option.map (corifyCon st) co
adamc@249 640 in
adamc@249 641 ((x, n, co), st)
adamc@249 642 end) st xncs
adamc@49 643
adamc@249 644 val nxs = length xs - 1
adamc@288 645 val cBase = c
adamc@249 646 val c = ListUtil.foldli (fn (i, _, c) => (L'.CApp (c, (L'.CRel (nxs - i), loc)), loc)) c xs
adamc@249 647 val k = (L'.KType, loc)
adamc@249 648 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@192 649
adamc@249 650 val cds = map (fn (x, n, co) =>
adamc@249 651 let
adamc@249 652 val t = case co of
adamc@249 653 NONE => c
adamc@249 654 | SOME t' => (L'.TFun (t', c), loc)
adamc@249 655 val e = corifyExp st (L.EModProj (m1, ms, x), loc)
adamc@192 656
adamc@249 657 val t = foldr (fn (x, t) => (L'.TCFun (x, k, t), loc)) t xs
adamc@249 658 in
adamc@249 659 (L'.DVal (x, n, t, e, x), loc)
adamc@249 660 end) xncs
adamc@249 661 in
adamc@288 662 ((L'.DCon (x, n, k', cBase), loc) :: cds, st)
adamc@249 663 end
adamc@249 664 | L.DVal (x, n, t, e) =>
adamc@249 665 let
adamc@249 666 val (st, n) = St.bindVal st x n
adamc@376 667 val s = doRestify (mods, x)
adamc@249 668 in
adamc@249 669 ([(L'.DVal (x, n, corifyCon st t, corifyExp st e, s), loc)], st)
adamc@249 670 end
adamc@249 671 | L.DValRec vis =>
adamc@249 672 let
adamc@249 673 val (vis, st) = ListUtil.foldlMap
adamc@249 674 (fn ((x, n, t, e), st) =>
adamc@249 675 let
adamc@249 676 val (st, n) = St.bindVal st x n
adamc@249 677 in
adamc@249 678 ((x, n, t, e), st)
adamc@249 679 end)
adamc@249 680 st vis
adamc@16 681
adamc@249 682 val vis = map
adamc@249 683 (fn (x, n, t, e) =>
adamc@249 684 let
adamc@376 685 val s = doRestify (mods, x)
adamc@249 686 in
adamc@249 687 (x, n, corifyCon st t, corifyExp st e, s)
adamc@249 688 end)
adamc@249 689 vis
adamc@249 690 in
adamc@249 691 ([(L'.DValRec vis, loc)], st)
adamc@249 692 end
adamc@249 693 | L.DSgn _ => ([], st)
adamc@177 694
adamc@249 695 | L.DStr (x, n, _, (L.StrFun (xa, na, _, _, str), _)) =>
adamc@249 696 ([], St.bindFunctor st x n xa na str)
adamc@177 697
adamc@339 698 | L.DStr (x, n, _, (L.StrProj (str, x'), _)) =>
adamc@339 699 let
adamc@376 700 val (ds, {inner, outer}) = corifyStr mods (str, st)
adamc@339 701
adamc@339 702 val st = case St.lookupStrByNameOpt (x', inner) of
adamc@339 703 SOME st' => St.bindStr st x n st'
adamc@339 704 | NONE =>
adamc@339 705 let
adamc@339 706 val (x', n', str') = St.lookupFunctorByName (x', inner)
adamc@339 707 in
adamc@339 708 St.bindFunctor st x n x' n' str'
adamc@339 709 end
adamc@339 710 in
adamc@339 711 ([], st)
adamc@339 712 end
adamc@339 713
adamc@249 714 | L.DStr (x, n, _, str) =>
adamc@249 715 let
adamc@376 716 val (ds, {inner, outer}) = corifyStr (x :: mods) (str, st)
adamc@249 717 val st = St.bindStr outer x n inner
adamc@249 718 in
adamc@249 719 (ds, st)
adamc@249 720 end
adamc@16 721
adamc@249 722 | L.DFfiStr (m, n, (sgn, _)) =>
adamc@249 723 (case sgn of
adamc@249 724 L.SgnConst sgis =>
adamc@249 725 let
adamc@249 726 val (ds, cmap, conmap, st) =
adamc@249 727 foldl (fn ((sgi, _), (ds, cmap, conmap, st)) =>
adamc@249 728 case sgi of
adamc@249 729 L.SgiConAbs (x, n, k) =>
adamc@249 730 let
adamc@249 731 val (st, n') = St.bindCon st x n
adamc@249 732 in
adamc@249 733 ((L'.DCon (x, n', corifyKind k, (L'.CFfi (m, x), loc)), loc) :: ds,
adamc@249 734 cmap,
adamc@249 735 conmap,
adamc@249 736 st)
adamc@249 737 end
adamc@249 738 | L.SgiCon (x, n, k, _) =>
adamc@249 739 let
adamc@249 740 val (st, n') = St.bindCon st x n
adamc@249 741 in
adamc@249 742 ((L'.DCon (x, n', corifyKind k, (L'.CFfi (m, x), loc)), loc) :: ds,
adamc@249 743 cmap,
adamc@249 744 conmap,
adamc@249 745 st)
adamc@249 746 end
adamc@177 747
adamc@249 748 | L.SgiDatatype (x, n, xs, xnts) =>
adamc@249 749 let
adamc@249 750 val k = (L'.KType, loc)
adamc@249 751 val dk = ElabUtil.classifyDatatype xnts
adamc@249 752 val (st, n') = St.bindCon st x n
adamc@249 753 val (xnts, (ds', st, cmap, conmap)) =
adamc@249 754 ListUtil.foldlMap
adamc@249 755 (fn ((x', n, to), (ds', st, cmap, conmap)) =>
adamc@249 756 let
adamc@249 757 val dt = (L'.CNamed n', loc)
adamc@249 758 val args = ListUtil.mapi (fn (i, _) => (L'.CRel i, loc)) xs
adamc@163 759
adamc@249 760 val to = Option.map (corifyCon st) to
adamc@177 761
adamc@249 762 val pc = L'.PConFfi {mod = m,
adamc@249 763 datatyp = x,
adamc@249 764 params = xs,
adamc@249 765 con = x',
adamc@249 766 arg = to,
adamc@249 767 kind = dk}
adamc@130 768
adamc@249 769 fun wrapT t =
adamc@249 770 foldr (fn (x, t) => (L'.TCFun (x, k, t), loc)) t xs
adamc@249 771 fun wrapE e =
adamc@249 772 foldr (fn (x, e) => (L'.ECAbs (x, k, e), loc)) e xs
adamc@192 773
adamc@249 774 val (cmap, d) =
adamc@249 775 case to of
adamc@249 776 NONE => (SM.insert (cmap, x', wrapT dt),
adamc@249 777 (L'.DVal (x', n, wrapT dt,
adamc@249 778 wrapE
adamc@249 779 (L'.ECon (dk, pc, args, NONE),
adamc@249 780 loc),
adamc@249 781 ""), loc))
adamc@249 782 | SOME t =>
adamc@249 783 let
adamc@249 784 val tf = (L'.TFun (t, dt), loc)
adamc@249 785 val e = wrapE (L'.EAbs ("x", t, tf,
adamc@249 786 (L'.ECon (dk, pc, args,
adamc@249 787 SOME (L'.ERel 0,
adamc@249 788 loc)),
adamc@249 789 loc)), loc)
adamc@249 790 val d = (L'.DVal (x', n, wrapT tf,
adamc@249 791 e, ""), loc)
adamc@185 792 in
adamc@192 793 (SM.insert (cmap, x', wrapT tf), d)
adamc@185 794 end
adamc@185 795
adamc@186 796 val st = St.bindConstructor st x' n pc
adamc@186 797
adamc@192 798 val conmap = SM.insert (conmap, x', (x, xs, to, dk))
adamc@185 799 in
adamc@185 800 ((x', n, to),
adamc@186 801 (d :: ds', st, cmap, conmap))
adamc@186 802 end) ([], st, cmap, conmap) xnts
adamc@185 803 in
adamc@192 804 (ds' @ (L'.DDatatype (x, n', xs, xnts), loc) :: ds,
adamc@185 805 cmap,
adamc@185 806 conmap,
adamc@49 807 st)
adamc@192 808 end
adamc@49 809
adamc@49 810 | L.SgiVal (x, _, c) =>
adamc@49 811 (ds,
adamc@49 812 SM.insert (cmap, x, corifyCon st c),
adamc@185 813 conmap,
adamc@49 814 st)
adamc@185 815 | _ => (ds, cmap, conmap, st)) ([], SM.empty, SM.empty, st) sgis
adamc@49 816
adamc@185 817 val st = St.bindStr st m n (St.ffi m cmap conmap)
adamc@49 818 in
adamc@249 819 (rev ds, St.basisIs (st, n))
adamc@49 820 end
adamc@49 821 | _ => raise Fail "Non-const signature for FFI structure")
adamc@48 822
adamc@109 823 | L.DExport (en, sgn, str) =>
adamc@109 824 (case #1 sgn of
adamc@109 825 L.SgnConst sgis =>
adamc@109 826 let
adamc@109 827 fun pathify (str, _) =
adamc@109 828 case str of
adamc@109 829 L.StrVar m => SOME (m, [])
adamc@109 830 | L.StrProj (str, s) =>
adamc@109 831 Option.map (fn (m, ms) => (m, ms @ [s])) (pathify str)
adamc@109 832 | _ => NONE
adamc@109 833 in
adamc@109 834 case pathify str of
adamc@109 835 NONE => (ErrorMsg.errorAt loc "Structure is too fancy to export";
adamc@109 836 ([], st))
adamc@109 837 | SOME (m, ms) =>
adamc@109 838 let
adamc@249 839 val basis_n = case St.lookupBasis st of
adamc@249 840 NONE => raise Fail "Corify: Don't know number of Basis"
adamc@249 841 | SOME n => n
adamc@249 842
adamc@109 843 fun wrapSgi ((sgi, _), (wds, eds)) =
adamc@109 844 case sgi of
adamc@109 845 L.SgiVal (s, _, t as (L.TFun (dom, ran), _)) =>
adamc@109 846 (case (#1 dom, #1 ran) of
adamc@249 847 (L.TRecord _,
adamc@249 848 L.CApp ((L.CModProj (basis, [], "transaction"), _),
adamc@249 849 ran' as
adamc@249 850 (L.CApp
adamc@249 851 ((L.CApp
adamc@249 852 ((L.CApp ((L.CModProj (basis', [], "xml"), _),
adamc@249 853 (L.CRecord (_, [((L.CName "Html", _),
adamc@249 854 _)]), _)), _), _),
adamc@249 855 _), _), _))) =>
adamc@109 856 let
adamc@109 857 val ran = (L.TRecord (L.CRecord ((L.KType, loc), []), loc), loc)
adamc@249 858 val ranT = (L.CApp ((L.CModProj (basis, [], "transaction"), loc),
adamc@249 859 ran), loc)
adamc@109 860 val e = (L.EModProj (m, ms, s), loc)
adamc@249 861
adamc@249 862 val ef = (L.EModProj (basis, [], "bind"), loc)
adamc@249 863 val ef = (L.ECApp (ef, ran'), loc)
adamc@251 864 val ef = (L.ECApp (ef, ran), loc)
adamc@249 865 val ef = (L.EApp (ef, (L.EApp (e, (L.ERel 0, loc)), loc)), loc)
adamc@249 866
adamc@249 867 val eat = (L.CApp ((L.CModProj (basis, [], "transaction"), loc),
adamc@249 868 ran), loc)
adamc@249 869 val ea = (L.EAbs ("p", ran', eat,
adamc@249 870 (L.EWrite (L.ERel 0, loc), loc)), loc)
adamc@249 871
adamc@249 872 val e = (L.EApp (ef, ea), loc)
adamc@249 873 val e = (L.EAbs ("vs", dom, ran, e), loc)
adamc@109 874 in
adamc@249 875 if basis = basis_n andalso basis' = basis_n then
adamc@249 876 ((L.DVal ("wrap_" ^ s, 0,
adamc@249 877 (L.TFun (dom, ranT), loc),
adamc@249 878 e), loc) :: wds,
adamc@249 879 (fn st =>
adamc@249 880 case #1 (corifyExp st (L.EModProj (en, [], "wrap_" ^ s), loc)) of
adamc@249 881 L'.ENamed n => (L'.DExport (L'.Link, n), loc)
adamc@249 882 | _ => raise Fail "Corify: Value to export didn't corify properly")
adamc@249 883 :: eds)
adamc@249 884 else
adamc@249 885 (wds, eds)
adamc@109 886 end
adamc@109 887 | _ => (wds, eds))
adamc@109 888 | _ => (wds, eds)
adamc@102 889
adamc@109 890 val (wds, eds) = foldl wrapSgi ([], []) sgis
adamc@109 891 val wrapper = (L.StrConst wds, loc)
adamc@376 892 val mst = St.lookupStrById st m
adamc@376 893 val (ds, {inner, outer}) = corifyStr (St.name mst) (wrapper, st)
adamc@109 894 val st = St.bindStr outer "wrapper" en inner
adamc@249 895
adamc@109 896 val ds = ds @ map (fn f => f st) eds
adamc@109 897 in
adamc@109 898 (ds, st)
adamc@109 899 end
adamc@109 900 end
adamc@109 901 | _ => raise Fail "Non-const signature for 'export'")
adamc@48 902
adamc@249 903 | L.DTable (_, x, n, c) =>
adamc@249 904 let
adamc@249 905 val (st, n) = St.bindVal st x n
adamc@376 906 val s = doRestify (mods, x)
adamc@249 907 in
adamc@249 908 ([(L'.DTable (x, n, corifyCon st c, s), loc)], st)
adamc@249 909 end
adamc@338 910 | L.DSequence (_, x, n) =>
adamc@338 911 let
adamc@338 912 val (st, n) = St.bindVal st x n
adamc@376 913 val s = doRestify (mods, x)
adamc@338 914 in
adamc@338 915 ([(L'.DSequence (x, n, s), loc)], st)
adamc@338 916 end
adamc@246 917
adamc@271 918 | L.DDatabase s => ([(L'.DDatabase s, loc)], st)
adamc@271 919
adamc@376 920 and corifyStr mods ((str, _), st) =
adamc@39 921 case str of
adamc@39 922 L.StrConst ds =>
adamc@39 923 let
adamc@376 924 val st = St.enter (st, mods)
adamc@376 925 val (ds, st) = ListUtil.foldlMapConcat (corifyDecl mods) st ds
adamc@39 926 in
adamc@39 927 (ds, St.leave st)
adamc@39 928 end
adamc@39 929 | L.StrVar n => ([], {inner = St.lookupStrById st n, outer = st})
adamc@39 930 | L.StrProj (str, x) =>
adamc@39 931 let
adamc@376 932 val (ds, {inner, outer}) = corifyStr mods (str, st)
adamc@39 933 in
adamc@39 934 (ds, {inner = St.lookupStrByName (x, inner), outer = outer})
adamc@39 935 end
adamc@46 936 | L.StrFun _ => raise Fail "Corify of nested functor definition"
adamc@46 937 | L.StrApp (str1, str2) =>
adamc@46 938 let
adamc@46 939 fun unwind' (str, _) =
adamc@46 940 case str of
adamc@46 941 L.StrVar n => St.lookupStrById st n
adamc@46 942 | L.StrProj (str, x) => St.lookupStrByName (x, unwind' str)
adamc@46 943 | _ => raise Fail "Corify of fancy functor application [1]"
adamc@46 944
adamc@46 945 fun unwind (str, _) =
adamc@46 946 case str of
adamc@46 947 L.StrVar n => St.lookupFunctorById st n
adamc@46 948 | L.StrProj (str, x) => St.lookupFunctorByName (x, unwind' str)
adamc@46 949 | _ => raise Fail "Corify of fancy functor application [2]"
adamc@46 950
adamc@146 951 val (xa, na, body) = unwind str1
adamc@46 952
adamc@376 953 val (ds1, {inner = inner', outer}) = corifyStr mods (str2, st)
adamc@376 954
adamc@376 955 val mods' = mods
adamc@376 956
adamc@376 957 val (ds2, {inner, outer}) = corifyStr mods' (body, St.bindStr outer xa na inner')
adamc@46 958 in
adamc@146 959 (ds1 @ ds2, {inner = St.bindStr inner xa na inner', outer = outer})
adamc@46 960 end
adamc@31 961
adamc@39 962 fun maxName ds = foldl (fn ((d, _), n) =>
adamc@39 963 case d of
adamc@39 964 L.DCon (_, n', _, _) => Int.max (n, n')
adamc@191 965 | L.DDatatype (_, n', _, _) => Int.max (n, n')
adamc@191 966 | L.DDatatypeImp (_, n', _, _, _, _, _) => Int.max (n, n')
adamc@124 967 | L.DVal (_, n', _, _) => Int.max (n, n')
adamc@124 968 | L.DValRec vis => foldl (fn ((_, n', _, _), n) => Int.max (n, n)) n vis
adamc@39 969 | L.DSgn (_, n', _) => Int.max (n, n')
adamc@48 970 | L.DStr (_, n', _, str) => Int.max (n, Int.max (n', maxNameStr str))
adamc@100 971 | L.DFfiStr (_, n', _) => Int.max (n, n')
adamc@246 972 | L.DExport _ => n
adamc@271 973 | L.DTable (_, _, n', _) => Int.max (n, n')
adamc@338 974 | L.DSequence (_, _, n') => Int.max (n, n')
adamc@271 975 | L.DDatabase _ => n)
adamc@249 976 0 ds
adamc@39 977
adamc@39 978 and maxNameStr (str, _) =
adamc@39 979 case str of
adamc@39 980 L.StrConst ds => maxName ds
adamc@39 981 | L.StrVar n => n
adamc@39 982 | L.StrProj (str, _) => maxNameStr str
adamc@45 983 | L.StrFun (_, _, _, _, str) => maxNameStr str
adamc@45 984 | L.StrApp (str1, str2) => Int.max (maxNameStr str1, maxNameStr str2)
adamc@39 985
adamc@39 986 fun corify ds =
adamc@39 987 let
adamc@39 988 val () = reset (maxName ds + 1)
adamc@146 989
adamc@376 990 val (ds, _) = ListUtil.foldlMapConcat (corifyDecl []) St.empty ds
adamc@39 991 in
adamc@39 992 ds
adamc@39 993 end
adamc@16 994
adamc@16 995 end