Mercurial > urweb

annotate src/corify.sml @ 1989:210fb3dfc483

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Some more nested functor bug-fixing, including generating fresh internal names at applications; still need to debug issues with datatype constructors
author Adam Chlipala <adam@chlipala.net>
date Thu, 20 Feb 2014 10:27:15 -0500
parents 6745eafff617
children 7bd2ecf96bb0
rev   line source
adam@1704 1 (* Copyright (c) 2008-2012, 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@768 40 fun doRestify k (mods, s) =
adamc@376 41 let
adamc@376 42 val s = if String.isPrefix "wrap_" s then
adamc@376 43 String.extract (s, 5, NONE)
adamc@376 44 else
adamc@376 45 s
adamc@1023 46 val s = String.concatWith "/" (rev (s :: mods))
adamc@1023 47 val s = String.implode (List.filter (fn ch => ch <> #"$") (String.explode s))
adamc@376 48 in
adamc@1023 49 Settings.rewrite k s
adamc@376 50 end
adamc@376 51
adamc@377 52 val relify = CharVector.map (fn #"/" => #"_"
adamc@377 53 | ch => ch)
adamc@377 54
adamc@39 55 local
adamc@39 56 val count = ref 0
adamc@39 57 in
adamc@39 58
adamc@39 59 fun reset v = count := v
adamc@39 60
adamc@39 61 fun alloc () =
adamc@39 62 let
adamc@39 63 val r = !count
adamc@39 64 in
adamc@39 65 count := r + 1;
adamc@39 66 r
adam@1989 67 end
adam@1989 68
adam@1989 69 fun getCounter () = !count
adam@1989 70 fun setCounter n = count := n
adamc@39 71
adamc@39 72 end
adamc@39 73
adamc@39 74 structure St : sig
adamc@39 75 type t
adamc@39 76
adamc@39 77 val empty : t
adamc@39 78
adamc@146 79 val debug : t -> unit
adamc@146 80
adamc@376 81 val name : t -> string list
adamc@376 82
adamc@376 83 val enter : t * string list -> t
adamc@39 84 val leave : t -> {outer : t, inner : t}
adamc@192 85 val ffi : string -> L'.con SM.map -> (string * string list * L'.con option * L'.datatype_kind) SM.map -> t
adamc@39 86
adamc@249 87 val basisIs : t * int -> t
adamc@249 88 val lookupBasis : t -> int option
adamc@249 89
adamc@73 90 datatype core_con =
adamc@73 91 CNormal of int
adamc@73 92 | CFfi of string
adamc@73 93 val bindCon : t -> string -> int -> t * int
adamc@73 94 val lookupConById : t -> int -> int option
adamc@73 95 val lookupConByName : t -> string -> core_con
adamc@48 96
adam@1704 97 val bindConstructor : t -> string -> int -> t * int
adam@1704 98 val bindConstructorAs : t -> string -> int -> L'.patCon -> t
adamc@186 99 val lookupConstructorByNameOpt : t -> string -> L'.patCon option
adamc@177 100 val lookupConstructorByName : t -> string -> L'.patCon
adamc@177 101 val lookupConstructorById : t -> int -> L'.patCon
adamc@249 102
adamc@249 103 datatype core_val =
adamc@249 104 ENormal of int
adamc@249 105 | EFfi of string * L'.con
adamc@249 106 val bindVal : t -> string -> int -> t * int
adam@1704 107 val bindConstructorVal : t -> string -> int -> int -> t
adamc@249 108 val lookupValById : t -> int -> int option
adamc@249 109 val lookupValByName : t -> string -> core_val
adamc@177 110
adamc@249 111 val bindStr : t -> string -> int -> t -> t
adamc@249 112 val lookupStrById : t -> int -> t
adam@1989 113 val lookupStrByIdOpt : t -> int -> t option
adamc@249 114 val lookupStrByName : string * t -> t
adamc@339 115 val lookupStrByNameOpt : string * t -> t option
adamc@39 116
adamc@423 117 val bindFunctor : t -> string -> int -> string -> int -> L.str -> t
adamc@423 118 val lookupFunctorById : t -> int -> string * int * L.str
adam@1989 119 val lookupFunctorByIdOpt : t -> int -> (string * int * L.str) option
adamc@423 120 val lookupFunctorByName : string * t -> string * int * L.str
adamc@249 121 end = struct
adamc@46 122
adamc@249 123 datatype flattening =
adamc@376 124 FNormal of {name : string list,
adamc@376 125 cons : int SM.map,
adamc@249 126 constructors : L'.patCon SM.map,
adamc@249 127 vals : int SM.map,
adamc@249 128 strs : flattening SM.map,
adamc@423 129 funs : (string * int * L.str) SM.map}
adamc@249 130 | FFfi of {mod : string,
adamc@249 131 vals : L'.con SM.map,
adamc@249 132 constructors : (string * string list * L'.con option * L'.datatype_kind) SM.map}
adamc@39 133
adamc@249 134 type t = {
adamc@249 135 basis : int option,
adamc@249 136 cons : int IM.map,
adamc@249 137 constructors : L'.patCon IM.map,
adamc@249 138 vals : int IM.map,
adamc@249 139 strs : flattening IM.map,
adamc@423 140 funs : (string * int * L.str) IM.map,
adamc@249 141 current : flattening,
adamc@249 142 nested : flattening list
adamc@249 143 }
adamc@39 144
adamc@249 145 val empty = {
adamc@249 146 basis = NONE,
adamc@249 147 cons = IM.empty,
adamc@249 148 constructors = IM.empty,
adamc@249 149 vals = IM.empty,
adamc@249 150 strs = IM.empty,
adamc@249 151 funs = IM.empty,
adamc@376 152 current = FNormal { name = [], cons = SM.empty, constructors = SM.empty,
adamc@376 153 vals = SM.empty, strs = SM.empty, funs = SM.empty },
adamc@249 154 nested = []
adamc@249 155 }
adamc@39 156
adamc@376 157 fun debug ({current = FNormal {cons, constructors, vals, strs, funs, ...}, ...} : t) =
adamc@249 158 print ("cons: " ^ Int.toString (SM.numItems cons) ^ "; "
adamc@249 159 ^ "constructors: " ^ Int.toString (SM.numItems constructors) ^ "; "
adamc@249 160 ^ "vals: " ^ Int.toString (SM.numItems vals) ^ "; "
adamc@249 161 ^ "strs: " ^ Int.toString (SM.numItems strs) ^ "; "
adamc@249 162 ^ "funs: " ^ Int.toString (SM.numItems funs) ^ "\n")
adamc@249 163 | debug _ = print "Not normal!\n"
adamc@146 164
adamc@376 165 fun name ({current = FNormal {name, ...}, ...} : t) = name
adamc@376 166 | name {current = FFfi {mod = name, ...}, ...} = [name]
adamc@376 167
adamc@249 168 fun basisIs ({cons, constructors, vals, strs, funs, current, nested, ...} : t, basis) =
adamc@249 169 {basis = SOME basis,
adamc@249 170 cons = cons,
adamc@249 171 constructors = constructors,
adamc@249 172 vals = vals,
adamc@249 173 strs = strs,
adamc@249 174 funs = funs,
adamc@249 175 current = current,
adamc@249 176 nested = nested}
adamc@48 177
adamc@249 178 fun lookupBasis ({basis, ...} : t) = basis
adamc@73 179
adamc@249 180 datatype core_con =
adamc@249 181 CNormal of int
adamc@249 182 | CFfi of string
adamc@39 183
adamc@249 184 datatype core_val =
adamc@249 185 ENormal of int
adamc@249 186 | EFfi of string * L'.con
adamc@188 187
adamc@249 188 fun bindCon {basis, cons, constructors, vals, strs, funs, current, nested} s n =
adamc@249 189 let
adamc@249 190 val n' = alloc ()
adamc@188 191
adamc@249 192 val current =
adamc@249 193 case current of
adamc@249 194 FFfi _ => raise Fail "Binding inside FFfi"
adamc@376 195 | FNormal {name, cons, constructors, vals, strs, funs} =>
adamc@376 196 FNormal {name = name,
adamc@376 197 cons = SM.insert (cons, s, n'),
adamc@249 198 constructors = constructors,
adamc@249 199 vals = vals,
adamc@249 200 strs = strs,
adamc@249 201 funs = funs}
adamc@249 202 in
adamc@249 203 ({basis = basis,
adamc@249 204 cons = IM.insert (cons, n, n'),
adamc@177 205 constructors = constructors,
adamc@73 206 vals = vals,
adamc@39 207 strs = strs,
adamc@46 208 funs = funs,
adamc@39 209 current = current,
adamc@249 210 nested = nested},
adamc@249 211 n')
adamc@249 212 end
adamc@39 213
adamc@249 214 fun lookupConById ({cons, ...} : t) n = IM.find (cons, n)
adamc@39 215
adamc@249 216 fun lookupConByName ({current, ...} : t) x =
adamc@249 217 case current of
adamc@249 218 FFfi {mod = m, ...} => CFfi m
adamc@249 219 | FNormal {cons, ...} =>
adamc@249 220 case SM.find (cons, x) of
adam@1527 221 NONE => raise Fail ("Corify.St.lookupConByName " ^ x)
adamc@249 222 | SOME n => CNormal n
adamc@249 223
adamc@249 224 fun bindVal {basis, cons, constructors, vals, strs, funs, current, nested} s n =
adamc@249 225 let
adamc@249 226 val n' = alloc ()
adamc@249 227
adamc@249 228 val current =
adamc@249 229 case current of
adamc@249 230 FFfi _ => raise Fail "Binding inside FFfi"
adamc@376 231 | FNormal {name, cons, constructors, vals, strs, funs} =>
adamc@376 232 FNormal {name = name,
adamc@376 233 cons = cons,
adamc@249 234 constructors = constructors,
adamc@249 235 vals = SM.insert (vals, s, n'),
adamc@249 236 strs = strs,
adamc@249 237 funs = funs}
adamc@249 238 in
adamc@249 239 ({basis = basis,
adamc@249 240 cons = cons,
adamc@249 241 constructors = constructors,
adamc@249 242 vals = IM.insert (vals, n, n'),
adamc@249 243 strs = strs,
adamc@249 244 funs = funs,
adamc@249 245 current = current,
adamc@249 246 nested = nested},
adamc@249 247 n')
adamc@249 248 end
adamc@249 249
adam@1704 250 fun bindConstructorVal {basis, cons, constructors, vals, strs, funs, current, nested} s n n' =
adamc@249 251 let
adamc@249 252 val current =
adamc@249 253 case current of
adamc@249 254 FFfi _ => raise Fail "Binding inside FFfi"
adamc@376 255 | FNormal {name, cons, constructors, vals, strs, funs} =>
adamc@376 256 FNormal {name = name,
adamc@376 257 cons = cons,
adamc@249 258 constructors = constructors,
adam@1704 259 vals = SM.insert (vals, s, n'),
adamc@249 260 strs = strs,
adamc@249 261 funs = funs}
adamc@249 262 in
adamc@249 263 {basis = basis,
adamc@249 264 cons = cons,
adamc@249 265 constructors = constructors,
adam@1704 266 vals = IM.insert (vals, n, n'),
adamc@249 267 strs = strs,
adamc@249 268 funs = funs,
adamc@249 269 current = current,
adamc@249 270 nested = nested}
adamc@249 271 end
adamc@249 272
adamc@249 273
adamc@249 274 fun lookupValById ({vals, ...} : t) n = IM.find (vals, n)
adamc@249 275
adamc@249 276 fun lookupValByName ({current, ...} : t) x =
adamc@249 277 case current of
adamc@249 278 FFfi {mod = m, vals, ...} =>
adamc@249 279 (case SM.find (vals, x) of
adam@1314 280 NONE => raise Fail ("Corify.St.lookupValByName: no type for FFI val " ^ x)
adamc@249 281 | SOME t => EFfi (m, t))
adam@1314 282 | FNormal {name, vals, ...} =>
adamc@249 283 case SM.find (vals, x) of
adam@1527 284 NONE => raise Fail ("Corify.St.lookupValByName " ^ String.concatWith "." (rev name) ^ "." ^ x)
adamc@249 285 | SOME n => ENormal n
adamc@249 286
adam@1704 287 fun bindConstructorAs {basis, cons, constructors, vals, strs, funs, current, nested} s n c' =
adamc@249 288 let
adamc@249 289 val current =
adamc@249 290 case current of
adamc@249 291 FFfi _ => raise Fail "Binding inside FFfi"
adamc@376 292 | FNormal {name, cons, constructors, vals, strs, funs} =>
adamc@376 293 FNormal {name = name,
adamc@376 294 cons = cons,
adam@1704 295 constructors = SM.insert (constructors, s, c'),
adamc@249 296 vals = vals,
adamc@249 297 strs = strs,
adamc@249 298 funs = funs}
adamc@249 299 in
adamc@249 300 {basis = basis,
adamc@249 301 cons = cons,
adam@1704 302 constructors = IM.insert (constructors, n, c'),
adamc@249 303 vals = vals,
adamc@249 304 strs = strs,
adamc@249 305 funs = funs,
adamc@249 306 current = current,
adamc@249 307 nested = nested}
adamc@249 308 end
adamc@249 309
adam@1704 310 fun bindConstructor st s n =
adam@1704 311 let
adam@1704 312 val n' = alloc ()
adam@1704 313 val c' = L'.PConVar n'
adam@1704 314 in
adam@1704 315 (bindConstructorAs st s n c', n')
adam@1704 316 end
adam@1704 317
adamc@249 318 fun lookupConstructorById ({constructors, ...} : t) n =
adamc@249 319 case IM.find (constructors, n) of
adamc@249 320 NONE => raise Fail "Corify.St.lookupConstructorById"
adamc@249 321 | SOME x => x
adamc@249 322
adamc@249 323 fun lookupConstructorByNameOpt ({current, ...} : t) x =
adamc@249 324 case current of
adamc@249 325 FFfi {mod = m, constructors, ...} =>
adamc@249 326 (case SM.find (constructors, x) of
adamc@188 327 NONE => NONE
adamc@249 328 | SOME (n, xs, to, dk) => SOME (L'.PConFfi {mod = m, datatyp = n, params = xs, con = x, arg = to, kind = dk}))
adamc@249 329 | FNormal {constructors, ...} =>
adamc@249 330 case SM.find (constructors, x) of
adamc@249 331 NONE => NONE
adamc@249 332 | SOME n => SOME n
adamc@39 333
adamc@249 334 fun lookupConstructorByName ({current, ...} : t) x =
adamc@249 335 case current of
adamc@249 336 FFfi {mod = m, constructors, ...} =>
adamc@249 337 (case SM.find (constructors, x) of
adamc@249 338 NONE => raise Fail "Corify.St.lookupConstructorByName [1]"
adamc@249 339 | SOME (n, xs, to, dk) => L'.PConFfi {mod = m, datatyp = n, params = xs, con = x, arg = to, kind = dk})
adamc@249 340 | FNormal {constructors, ...} =>
adamc@249 341 case SM.find (constructors, x) of
adamc@249 342 NONE => raise Fail "Corify.St.lookupConstructorByName [2]"
adamc@249 343 | SOME n => n
adamc@73 344
adamc@376 345 fun enter ({basis, cons, constructors, vals, strs, funs, current, nested}, name) =
adamc@249 346 {basis = basis,
adamc@249 347 cons = cons,
adamc@249 348 constructors = constructors,
adamc@249 349 vals = vals,
adamc@249 350 strs = strs,
adamc@249 351 funs = funs,
adamc@376 352 current = FNormal {name = name,
adamc@376 353 cons = SM.empty,
adamc@249 354 constructors = SM.empty,
adamc@249 355 vals = SM.empty,
adamc@249 356 strs = SM.empty,
adamc@249 357 funs = SM.empty},
adamc@249 358 nested = current :: nested}
adamc@73 359
adamc@249 360 fun dummy (b, f) = {basis = b,
adamc@249 361 cons = IM.empty,
adamc@249 362 constructors = IM.empty,
adamc@249 363 vals = IM.empty,
adamc@249 364 strs = IM.empty,
adamc@249 365 funs = IM.empty,
adamc@249 366 current = f,
adamc@249 367 nested = []}
adamc@163 368
adamc@249 369 fun leave {basis, cons, constructors, vals, strs, funs, current, nested = m1 :: rest} =
adamc@249 370 {outer = {basis = basis,
adamc@249 371 cons = cons,
adamc@249 372 constructors = constructors,
adamc@249 373 vals = vals,
adamc@249 374 strs = strs,
adamc@249 375 funs = funs,
adamc@249 376 current = m1,
adamc@249 377 nested = rest},
adamc@249 378 inner = dummy (basis, current)}
adamc@249 379 | leave _ = raise Fail "Corify.St.leave"
adamc@177 380
adamc@249 381 fun ffi m vals constructors = dummy (NONE, FFfi {mod = m, vals = vals, constructors = constructors})
adamc@73 382
adamc@249 383 fun bindStr ({basis, cons, constructors, vals, strs, funs,
adamc@376 384 current = FNormal {name, cons = mcons, constructors = mconstructors,
adamc@249 385 vals = mvals, strs = mstrs, funs = mfuns}, nested} : t)
adamc@249 386 x n ({current = f, ...} : t) =
adamc@249 387 {basis = basis,
adamc@249 388 cons = cons,
adamc@249 389 constructors = constructors,
adamc@249 390 vals = vals,
adamc@249 391 strs = IM.insert (strs, n, f),
adamc@249 392 funs = funs,
adamc@376 393 current = FNormal {name = name,
adamc@376 394 cons = mcons,
adamc@249 395 constructors = mconstructors,
adamc@249 396 vals = mvals,
adamc@249 397 strs = SM.insert (mstrs, x, f),
adamc@249 398 funs = mfuns},
adamc@249 399 nested = nested}
adamc@249 400 | bindStr _ _ _ _ = raise Fail "Corify.St.bindStr"
adamc@73 401
adamc@249 402 fun lookupStrById ({basis, strs, ...} : t) n =
adamc@249 403 case IM.find (strs, n) of
adamc@480 404 NONE => raise Fail ("Corify.St.lookupStrById(" ^ Int.toString n ^ ")")
adamc@249 405 | SOME f => dummy (basis, f)
adamc@177 406
adam@1989 407 fun lookupStrByIdOpt ({basis, strs, ...} : t) n =
adam@1989 408 case IM.find (strs, n) of
adam@1989 409 NONE => NONE
adam@1989 410 | SOME f => SOME (dummy (basis, f))
adam@1989 411
adamc@249 412 fun lookupStrByName (m, {basis, current = FNormal {strs, ...}, ...} : t) =
adamc@249 413 (case SM.find (strs, m) of
adamc@339 414 NONE => raise Fail "Corify.St.lookupStrByName [1]"
adamc@249 415 | SOME f => dummy (basis, f))
adamc@339 416 | lookupStrByName _ = raise Fail "Corify.St.lookupStrByName [2]"
adamc@339 417
adamc@339 418 fun lookupStrByNameOpt (m, {basis, current = FNormal {strs, ...}, ...} : t) =
adamc@339 419 (case SM.find (strs, m) of
adamc@339 420 NONE => NONE
adamc@339 421 | SOME f => SOME (dummy (basis, f)))
adamc@339 422 | lookupStrByNameOpt _ = NONE
adamc@177 423
adamc@249 424 fun bindFunctor ({basis, cons, constructors, vals, strs, funs,
adamc@376 425 current = FNormal {name, cons = mcons, constructors = mconstructors,
adamc@249 426 vals = mvals, strs = mstrs, funs = mfuns}, nested} : t)
adamc@423 427 x n xa na str =
adamc@249 428 {basis = basis,
adamc@249 429 cons = cons,
adamc@249 430 constructors = constructors,
adamc@249 431 vals = vals,
adamc@249 432 strs = strs,
adamc@423 433 funs = IM.insert (funs, n, (xa, na, str)),
adamc@376 434 current = FNormal {name = name,
adamc@376 435 cons = mcons,
adamc@249 436 constructors = mconstructors,
adamc@249 437 vals = mvals,
adamc@249 438 strs = mstrs,
adamc@423 439 funs = SM.insert (mfuns, x, (xa, na, str))},
adamc@249 440 nested = nested}
adamc@423 441 | bindFunctor _ _ _ _ _ _ = raise Fail "Corify.St.bindFunctor"
adamc@186 442
adamc@249 443 fun lookupFunctorById ({funs, ...} : t) n =
adamc@249 444 case IM.find (funs, n) of
adamc@249 445 NONE => raise Fail "Corify.St.lookupFunctorById"
adamc@249 446 | SOME v => v
adamc@177 447
adam@1989 448 fun lookupFunctorByIdOpt ({funs, ...} : t) n =
adam@1989 449 IM.find (funs, n)
adam@1989 450
adamc@249 451 fun lookupFunctorByName (m, {current = FNormal {funs, ...}, ...} : t) =
adamc@249 452 (case SM.find (funs, m) of
adamc@1146 453 NONE => raise Fail ("Corify.St.lookupFunctorByName " ^ m ^ "[1]")
adamc@249 454 | SOME v => v)
adamc@339 455 | lookupFunctorByName _ = raise Fail "Corify.St.lookupFunctorByName [2]"
adamc@39 456
adamc@249 457 end
adamc@39 458
adamc@39 459
adamc@249 460 fun corifyKind (k, loc) =
adamc@249 461 case k of
adamc@249 462 L.KType => (L'.KType, loc)
adamc@249 463 | L.KArrow (k1, k2) => (L'.KArrow (corifyKind k1, corifyKind k2), loc)
adamc@249 464 | L.KName => (L'.KName, loc)
adamc@249 465 | L.KRecord k => (L'.KRecord (corifyKind k), loc)
adamc@249 466 | L.KUnit => (L'.KUnit, loc)
adamc@249 467 | L.KTuple ks => (L'.KTuple (map corifyKind ks), loc)
adamc@48 468
adamc@626 469 | L.KRel n => (L'.KRel n, loc)
adamc@626 470 | L.KFun (x, k) => (L'.KFun (x, corifyKind k), loc)
adamc@626 471
adamc@249 472 fun corifyCon st (c, loc) =
adamc@249 473 case c of
adamc@249 474 L.TFun (t1, t2) => (L'.TFun (corifyCon st t1, corifyCon st t2), loc)
adamc@249 475 | L.TCFun (x, k, t) => (L'.TCFun (x, corifyKind k, corifyCon st t), loc)
adamc@626 476 | L.TKFun (x, t) => (L'.TKFun (x, corifyCon st t), loc)
adamc@249 477 | L.TRecord c => (L'.TRecord (corifyCon st c), loc)
adamc@39 478
adamc@249 479 | L.CRel n => (L'.CRel n, loc)
adamc@249 480 | L.CNamed n =>
adamc@249 481 (case St.lookupConById st n of
adamc@249 482 NONE => (L'.CNamed n, loc)
adamc@249 483 | SOME n => (L'.CNamed n, loc))
adamc@249 484 | L.CModProj (m, ms, x) =>
adamc@249 485 let
adamc@249 486 val st = St.lookupStrById st m
adamc@249 487 val st = foldl St.lookupStrByName st ms
adamc@249 488 in
adamc@249 489 case St.lookupConByName st x of
adamc@249 490 St.CNormal n => (L'.CNamed n, loc)
kkallio@1455 491 | St.CFfi m =>
kkallio@1455 492 if (m, x) = ("Basis", "unit") then
kkallio@1455 493 (L'.TRecord (L'.CRecord ((L'.KType, loc), []), loc), loc)
kkallio@1455 494 else
kkallio@1455 495 (L'.CFfi (m, x), loc)
adamc@249 496 end
adamc@39 497
adamc@249 498 | L.CApp (c1, c2) => (L'.CApp (corifyCon st c1, corifyCon st c2), loc)
adamc@249 499 | L.CAbs (x, k, c) => (L'.CAbs (x, corifyKind k, corifyCon st c), loc)
adamc@39 500
adamc@626 501 | L.CKApp (c1, k) => (L'.CKApp (corifyCon st c1, corifyKind k), loc)
adamc@626 502 | L.CKAbs (x, c) => (L'.CKAbs (x, corifyCon st c), loc)
adamc@626 503
adamc@249 504 | L.CName s => (L'.CName s, loc)
adamc@46 505
adamc@249 506 | L.CRecord (k, xcs) =>
adamc@249 507 (L'.CRecord (corifyKind k, map (fn (c1, c2) => (corifyCon st c1, corifyCon st c2)) xcs), loc)
adamc@249 508 | L.CConcat (c1, c2) => (L'.CConcat (corifyCon st c1, corifyCon st c2), loc)
adamc@621 509 | L.CMap (k1, k2) => (L'.CMap (corifyKind k1, corifyKind k2), loc)
adamc@249 510 | L.CUnit => (L'.CUnit, loc)
adamc@46 511
adamc@249 512 | L.CTuple cs => (L'.CTuple (map (corifyCon st) cs), loc)
adamc@249 513 | L.CProj (c, n) => (L'.CProj (corifyCon st c, n), loc)
adamc@213 514
adamc@249 515 fun corifyPatCon st pc =
adamc@249 516 case pc of
adamc@249 517 L.PConVar n => St.lookupConstructorById st n
adamc@249 518 | L.PConProj (m1, ms, x) =>
adamc@249 519 let
adamc@249 520 val st = St.lookupStrById st m1
adamc@249 521 val st = foldl St.lookupStrByName st ms
adamc@249 522 in
adamc@249 523 St.lookupConstructorByName st x
adamc@249 524 end
adamc@46 525
adamc@249 526 fun corifyPat st (p, loc) =
adamc@249 527 case p of
adamc@249 528 L.PWild => (L'.PWild, loc)
adamc@249 529 | L.PVar (x, t) => (L'.PVar (x, corifyCon st t), loc)
adamc@249 530 | L.PPrim p => (L'.PPrim p, loc)
adamc@249 531 | L.PCon (dk, pc, ts, po) => (L'.PCon (dk, corifyPatCon st pc, map (corifyCon st) ts,
adamc@249 532 Option.map (corifyPat st) po), loc)
adamc@249 533 | L.PRecord xps => (L'.PRecord (map (fn (x, p, t) => (x, corifyPat st p, corifyCon st t)) xps), loc)
adamc@39 534
adamc@249 535 fun corifyExp st (e, loc) =
adamc@249 536 case e of
adamc@249 537 L.EPrim p => (L'.EPrim p, loc)
adamc@249 538 | L.ERel n => (L'.ERel n, loc)
adamc@249 539 | L.ENamed n =>
adamc@249 540 (case St.lookupValById st n of
adamc@249 541 NONE => (L'.ENamed n, loc)
adamc@249 542 | SOME n => (L'.ENamed n, loc))
adamc@249 543 | L.EModProj (m, ms, x) =>
adamc@249 544 let
adamc@249 545 val st = St.lookupStrById st m
adamc@249 546 val st = foldl St.lookupStrByName st ms
adamc@249 547 in
adamc@249 548 case St.lookupConstructorByNameOpt st x of
adamc@249 549 SOME (pc as L'.PConFfi {mod = m, datatyp, params, arg, kind, ...}) =>
adamc@249 550 let
adamc@249 551 val args = ListUtil.mapi (fn (i, _) => (L'.CRel i, loc)) params
adamc@249 552 val e = case arg of
adamc@249 553 NONE => (L'.ECon (kind, pc, args, NONE), loc)
adamc@249 554 | SOME dom => (L'.EAbs ("x", dom, (L'.CFfi (m, datatyp), loc),
adamc@249 555 (L'.ECon (kind, pc, args, SOME (L'.ERel 0, loc)), loc)), loc)
adamc@192 556
adamc@249 557 val k = (L'.KType, loc)
adamc@249 558 in
adamc@249 559 foldr (fn (x, e) => (L'.ECAbs (x, k, e), loc)) e params
adamc@249 560 end
adamc@249 561 | _ =>
adamc@249 562 case St.lookupValByName st x of
adamc@249 563 St.ENormal n => (L'.ENamed n, loc)
adamc@249 564 | St.EFfi (m, t) =>
adamc@249 565 case t of
adam@1701 566 (L'.CApp ((L'.CFfi ("Basis", "transaction"), _), dom), _) =>
adamc@765 567 (L'.EAbs ("arg", dom, (L'.TRecord (L'.CRecord ((L'.KType, loc), []), loc), loc),
adamc@765 568 (L'.EFfiApp (m, x, []), loc)), loc)
adamc@249 569 | t as (L'.TFun _, _) =>
adamc@249 570 let
adamc@249 571 fun getArgs (all as (t, _), args) =
adamc@249 572 case t of
adamc@249 573 L'.TFun (dom, ran) => getArgs (ran, dom :: args)
adamc@249 574 | _ => (all, rev args)
adamc@39 575
adamc@249 576 val (result, args) = getArgs (t, [])
adamc@456 577 val (isTransaction, result) =
adamc@456 578 case result of
adamc@456 579 (L'.CApp ((L'.CFfi ("Basis", "transaction"), _),
adamc@456 580 result), _) => (true, result)
adamc@456 581 | _ => (false, result)
adamc@16 582
adamc@456 583 fun makeApp n =
adamc@456 584 let
adam@1663 585 val (actuals, _) = foldr (fn (t, (actuals, n)) =>
adam@1663 586 (((L'.ERel n, loc), t) :: actuals,
adamc@456 587 n + 1)) ([], n) args
adamc@456 588 in
adamc@456 589 (L'.EFfiApp (m, x, actuals), loc)
adamc@456 590 end
adamc@456 591 val unit = (L'.TRecord (L'.CRecord ((L'.KType, loc), []), loc), loc)
adamc@456 592 val (result, app) =
adamc@456 593 if isTransaction then
adamc@456 594 ((L'.TFun (unit, result), loc),
adamc@456 595 (L'.EAbs ("_",
adamc@456 596 unit,
adamc@456 597 result,
adamc@456 598 makeApp 1), loc))
adamc@456 599 else
adamc@456 600 (result, makeApp 0)
adamc@456 601
adamc@249 602 val (abs, _, _) = foldr (fn (t, (abs, ran, n)) =>
adamc@249 603 ((L'.EAbs ("arg" ^ Int.toString n,
adamc@249 604 t,
adamc@249 605 ran,
adamc@249 606 abs), loc),
adamc@249 607 (L'.TFun (t, ran), loc),
adamc@249 608 n - 1)) (app, result, length args - 1) args
adamc@249 609 in
adamc@249 610 abs
adamc@249 611 end
adamc@249 612 | _ => (L'.EFfi (m, x), loc)
adamc@249 613 end
adamc@249 614 | L.EApp (e1, e2) => (L'.EApp (corifyExp st e1, corifyExp st e2), loc)
adamc@249 615 | L.EAbs (x, dom, ran, e1) => (L'.EAbs (x, corifyCon st dom, corifyCon st ran, corifyExp st e1), loc)
adamc@249 616 | L.ECApp (e1, c) => (L'.ECApp (corifyExp st e1, corifyCon st c), loc)
adamc@249 617 | L.ECAbs (x, k, e1) => (L'.ECAbs (x, corifyKind k, corifyExp st e1), loc)
adamc@626 618 | L.EKApp (e1, k) => (L'.EKApp (corifyExp st e1, corifyKind k), loc)
adamc@626 619 | L.EKAbs (x, e1) => (L'.EKAbs (x, corifyExp st e1), loc)
adamc@16 620
adamc@249 621 | L.ERecord xes => (L'.ERecord (map (fn (c, e, t) =>
adamc@249 622 (corifyCon st c, corifyExp st e, corifyCon st t)) xes), loc)
adamc@249 623 | L.EField (e1, c, {field, rest}) => (L'.EField (corifyExp st e1, corifyCon st c,
adamc@249 624 {field = corifyCon st field, rest = corifyCon st rest}), loc)
adamc@445 625 | L.EConcat (e1, c1, e2, c2) => (L'.EConcat (corifyExp st e1, corifyCon st c1, corifyExp st e2,
adamc@445 626 corifyCon st c2), loc)
adamc@249 627 | L.ECut (e1, c, {field, rest}) => (L'.ECut (corifyExp st e1, corifyCon st c,
adamc@249 628 {field = corifyCon st field, rest = corifyCon st rest}), loc)
adamc@493 629 | L.ECutMulti (e1, c, {rest}) => (L'.ECutMulti (corifyExp st e1, corifyCon st c,
adamc@493 630 {rest = corifyCon st rest}), loc)
adamc@34 631
adamc@249 632 | L.ECase (e, pes, {disc, result}) =>
adamc@249 633 (L'.ECase (corifyExp st e,
adamc@249 634 map (fn (p, e) => (corifyPat st p, corifyExp st e)) pes,
adamc@249 635 {disc = corifyCon st disc, result = corifyCon st result}),
adamc@249 636 loc)
adamc@16 637
adamc@249 638 | L.EWrite e => (L'.EWrite (corifyExp st e), loc)
adamc@16 639
adamc@450 640 | L.ELet (x, t, e1, e2) => (L'.ELet (x, corifyCon st t, corifyExp st e1, corifyExp st e2), loc)
adamc@450 641
adamc@480 642 fun corifyDecl mods (all as (d, loc : EM.span), st) =
adamc@249 643 case d of
adamc@249 644 L.DCon (x, n, k, c) =>
adamc@249 645 let
adamc@249 646 val (st, n) = St.bindCon st x n
adamc@249 647 in
adamc@249 648 ([(L'.DCon (x, n, corifyKind k, corifyCon st c), loc)], st)
adamc@249 649 end
adamc@807 650 | L.DDatatype dts =>
adamc@249 651 let
adamc@807 652 val (dts, st) = ListUtil.foldlMap (fn ((x, n, xs, xncs), st) =>
adamc@807 653 let
adamc@807 654 val (st, n) = St.bindCon st x n
adamc@807 655 in
adamc@807 656 ((x, n, xs, xncs), st)
adamc@807 657 end)
adamc@807 658 st dts
adamc@16 659
adamc@807 660 val (dts, (st, dcons)) =
adamc@807 661 ListUtil.foldlMap
adamc@807 662 (fn ((x, n, xs, xncs), (st, dcons)) =>
adamc@807 663 let
adamc@807 664 val (xncs, st) = ListUtil.foldlMap
adamc@807 665 (fn ((x, n, co), st) =>
adamc@807 666 let
adam@1704 667 val (st, n') = St.bindConstructor st x n
adam@1704 668 val st = St.bindConstructorVal st x n n'
adamc@807 669 val co = Option.map (corifyCon st) co
adamc@807 670 in
adam@1704 671 ((x, n', co), st)
adamc@807 672 end) st xncs
adamc@192 673
adamc@807 674 val dk = ElabUtil.classifyDatatype xncs
adamc@807 675 val t = (L'.CNamed n, loc)
adamc@807 676 val nxs = length xs - 1
adamc@807 677 val t = ListUtil.foldli
adamc@807 678 (fn (i, _, t) => (L'.CApp (t, (L'.CRel (nxs - i), loc)), loc)) t xs
adamc@807 679 val k = (L'.KType, loc)
adamc@807 680 val dcons' = map (fn (x, n, to) =>
adamc@807 681 let
adamc@807 682 val args = ListUtil.mapi
adamc@807 683 (fn (i, _) => (L'.CRel (nxs - i), loc)) xs
adamc@807 684 val (e, t) =
adamc@807 685 case to of
adamc@807 686 NONE => ((L'.ECon (dk, L'.PConVar n, args, NONE),
adamc@807 687 loc), t)
adamc@807 688 | SOME t' => ((L'.EAbs ("x", t', t,
adamc@807 689 (L'.ECon (dk, L'.PConVar n,
adamc@807 690 args,
adamc@807 691 SOME (L'.ERel 0,
adamc@807 692 loc)),
adamc@807 693 loc)),
adamc@807 694 loc),
adamc@807 695 (L'.TFun (t', t), loc))
adamc@807 696
adamc@807 697 val t = foldr (fn (x, t) => (L'.TCFun (x, k, t), loc)) t xs
adamc@807 698 val e = foldr (fn (x, e) => (L'.ECAbs (x, k, e), loc)) e xs
adamc@807 699 in
adamc@807 700 (L'.DVal (x, n, t, e, ""), loc)
adamc@807 701 end) xncs
adamc@807 702 in
adamc@807 703 ((x, n, xs, xncs), (st, dcons' @ dcons))
adamc@807 704 end)
adamc@807 705 (st, []) dts
adamc@249 706 in
adamc@807 707 ((L'.DDatatype dts, loc) :: dcons, st)
adamc@807 708 end
adamc@249 709 | L.DDatatypeImp (x, n, m1, ms, s, xs, xncs) =>
adamc@249 710 let
adamc@249 711 val (st, n) = St.bindCon st x n
adamc@249 712 val c = corifyCon st (L.CModProj (m1, ms, s), loc)
adamc@177 713
adamc@249 714 val m = foldl (fn (x, m) => (L.StrProj (m, x), loc)) (L.StrVar m1, loc) ms
adamc@376 715 val (_, {inner, ...}) = corifyStr mods (m, st)
adamc@177 716
adamc@249 717 val (xncs, st) = ListUtil.foldlMap (fn ((x, n, co), st) =>
adamc@249 718 let
adamc@249 719 val n' = St.lookupConstructorByName inner x
adam@1704 720 val st = St.bindConstructorAs st x n n'
adamc@249 721 val (st, n) = St.bindVal st x n
adamc@249 722 val co = Option.map (corifyCon st) co
adamc@249 723 in
adamc@249 724 ((x, n, co), st)
adamc@249 725 end) st xncs
adamc@49 726
adamc@249 727 val nxs = length xs - 1
adamc@288 728 val cBase = c
adamc@249 729 val c = ListUtil.foldli (fn (i, _, c) => (L'.CApp (c, (L'.CRel (nxs - i), loc)), loc)) c xs
adamc@249 730 val k = (L'.KType, loc)
adamc@249 731 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc)) k xs
adamc@192 732
adamc@249 733 val cds = map (fn (x, n, co) =>
adamc@249 734 let
adamc@249 735 val t = case co of
adamc@249 736 NONE => c
adamc@249 737 | SOME t' => (L'.TFun (t', c), loc)
adamc@249 738 val e = corifyExp st (L.EModProj (m1, ms, x), loc)
adamc@192 739
adamc@249 740 val t = foldr (fn (x, t) => (L'.TCFun (x, k, t), loc)) t xs
adamc@249 741 in
adamc@249 742 (L'.DVal (x, n, t, e, x), loc)
adamc@249 743 end) xncs
adamc@249 744 in
adamc@288 745 ((L'.DCon (x, n, k', cBase), loc) :: cds, st)
adamc@249 746 end
adamc@249 747 | L.DVal (x, n, t, e) =>
adamc@249 748 let
adamc@249 749 val (st, n) = St.bindVal st x n
adamc@768 750 val s = doRestify Settings.Url (mods, x)
adamc@249 751 in
adamc@249 752 ([(L'.DVal (x, n, corifyCon st t, corifyExp st e, s), loc)], st)
adamc@249 753 end
adamc@249 754 | L.DValRec vis =>
adamc@249 755 let
adamc@249 756 val (vis, st) = ListUtil.foldlMap
adamc@249 757 (fn ((x, n, t, e), st) =>
adamc@249 758 let
adamc@249 759 val (st, n) = St.bindVal st x n
adamc@249 760 in
adamc@249 761 ((x, n, t, e), st)
adamc@249 762 end)
adamc@249 763 st vis
adamc@16 764
adamc@249 765 val vis = map
adamc@249 766 (fn (x, n, t, e) =>
adamc@249 767 let
adamc@768 768 val s = doRestify Settings.Url (mods, x)
adamc@249 769 in
adamc@249 770 (x, n, corifyCon st t, corifyExp st e, s)
adamc@249 771 end)
adamc@249 772 vis
adamc@249 773 in
adamc@249 774 ([(L'.DValRec vis, loc)], st)
adamc@249 775 end
adamc@249 776 | L.DSgn _ => ([], st)
adamc@177 777
adamc@249 778 | L.DStr (x, n, _, (L.StrFun (xa, na, _, _, str), _)) =>
adamc@423 779 ([], St.bindFunctor st x n xa na str)
adamc@177 780
adamc@339 781 | L.DStr (x, n, _, (L.StrProj (str, x'), _)) =>
adamc@339 782 let
adamc@376 783 val (ds, {inner, outer}) = corifyStr mods (str, st)
adamc@339 784
adamc@339 785 val st = case St.lookupStrByNameOpt (x', inner) of
adamc@339 786 SOME st' => St.bindStr st x n st'
adamc@339 787 | NONE =>
adamc@339 788 let
adamc@423 789 val (x', n', str') = St.lookupFunctorByName (x', inner)
adamc@339 790 in
adamc@423 791 St.bindFunctor st x n x' n' str'
adamc@339 792 end
adamc@339 793 in
adamc@339 794 ([], st)
adamc@339 795 end
adamc@339 796
adam@1989 797 | L.DStr (x, n, _, (L.StrVar n', _)) =>
adam@1989 798 (case St.lookupFunctorByIdOpt st n' of
adam@1989 799 SOME (arg, dom, body) => ([], St.bindFunctor st x n arg dom body)
adam@1989 800 | NONE => ([], St.bindStr st x n (St.lookupStrById st n')))
adam@1989 801
adamc@249 802 | L.DStr (x, n, _, str) =>
adamc@249 803 let
adamc@377 804 val mods' =
adamc@377 805 if x = "anon" then
adamc@377 806 mods
adamc@377 807 else
adamc@377 808 x :: mods
adamc@377 809
adamc@377 810 val (ds, {inner, outer}) = corifyStr mods' (str, st)
adamc@249 811 val st = St.bindStr outer x n inner
adamc@249 812 in
adamc@249 813 (ds, st)
adamc@249 814 end
adamc@16 815
adamc@249 816 | L.DFfiStr (m, n, (sgn, _)) =>
adam@1879 817 (case sgn of
adamc@249 818 L.SgnConst sgis =>
adamc@249 819 let
adamc@456 820 val (ds, cmap, conmap, st, _) =
adamc@456 821 foldl (fn ((sgi, _), (ds, cmap, conmap, st, trans)) =>
adamc@249 822 case sgi of
adamc@249 823 L.SgiConAbs (x, n, k) =>
adamc@249 824 let
adamc@249 825 val (st, n') = St.bindCon st x n
adamc@456 826
adamc@456 827 val trans =
adamc@456 828 if x = "transaction" then
adamc@456 829 SOME n
adamc@456 830 else
adamc@456 831 trans
adamc@249 832 in
adamc@249 833 ((L'.DCon (x, n', corifyKind k, (L'.CFfi (m, x), loc)), loc) :: ds,
adamc@249 834 cmap,
adamc@249 835 conmap,
adamc@456 836 st,
adamc@456 837 trans)
adamc@249 838 end
adamc@249 839 | L.SgiCon (x, n, k, _) =>
adamc@249 840 let
adamc@249 841 val (st, n') = St.bindCon st x n
adamc@249 842 in
adamc@249 843 ((L'.DCon (x, n', corifyKind k, (L'.CFfi (m, x), loc)), loc) :: ds,
adamc@249 844 cmap,
adamc@249 845 conmap,
adamc@456 846 st,
adamc@456 847 trans)
adamc@249 848 end
adamc@177 849
adamc@807 850 | L.SgiDatatype dts =>
adamc@249 851 let
adamc@249 852 val k = (L'.KType, loc)
adamc@807 853
adamc@807 854 val (dts, (ds', st, cmap, conmap)) =
adamc@249 855 ListUtil.foldlMap
adamc@807 856 (fn ((x, n, xs, xnts), (ds', st, cmap, conmap)) =>
adamc@249 857 let
adamc@813 858 val k' = foldl (fn (_, k') => (L'.KArrow (k, k'), loc))
adamc@813 859 k xs
adamc@813 860
adamc@807 861 val dk = ElabUtil.classifyDatatype xnts
adamc@807 862 val (st, n') = St.bindCon st x n
adamc@807 863 val (xnts, (ds', st, cmap, conmap)) =
adamc@807 864 ListUtil.foldlMap
adamc@807 865 (fn ((x', n, to), (ds', st, cmap, conmap)) =>
adamc@807 866 let
adamc@807 867 val dt = (L'.CNamed n', loc)
adamc@807 868 val args = ListUtil.mapi (fn (i, _) => (L'.CRel i, loc)) xs
adamc@163 869
adamc@807 870 val to = Option.map (corifyCon st) to
adamc@177 871
adamc@807 872 val pc = L'.PConFfi {mod = m,
adamc@807 873 datatyp = x,
adamc@807 874 params = xs,
adamc@807 875 con = x',
adamc@807 876 arg = to,
adamc@807 877 kind = dk}
adamc@130 878
adamc@807 879 fun wrapT t =
adamc@807 880 foldr (fn (x, t) => (L'.TCFun (x, k, t), loc))
adamc@807 881 t xs
adamc@807 882 fun wrapE e =
adamc@807 883 foldr (fn (x, e) => (L'.ECAbs (x, k, e), loc))
adamc@807 884 e xs
adamc@192 885
adamc@807 886 val (cmap, d) =
adamc@807 887 case to of
adamc@807 888 NONE => (SM.insert (cmap, x', wrapT dt),
adamc@807 889 (L'.DVal (x', n, wrapT dt,
adamc@807 890 wrapE
adamc@807 891 (L'.ECon (dk, pc,
adamc@807 892 args,
adamc@807 893 NONE),
adamc@807 894 loc),
adamc@807 895 ""), loc))
adamc@807 896 | SOME t =>
adamc@807 897 let
adamc@807 898 val tf = (L'.TFun (t, dt), loc)
adamc@807 899 val e = wrapE
adamc@807 900 (L'.EAbs ("x", t, tf,
adamc@807 901 (L'.ECon (dk,
adamc@807 902 pc,
adamc@807 903 args,
adamc@807 904 SOME
adamc@807 905 (L'.ERel 0,
adamc@807 906 loc)),
adamc@807 907 loc)), loc)
adamc@807 908 val d = (L'.DVal (x', n, wrapT tf,
adamc@807 909 e, ""), loc)
adamc@807 910 in
adamc@807 911 (SM.insert (cmap, x', wrapT tf), d)
adamc@807 912 end
adamc@185 913
adam@1704 914 val st = St.bindConstructorAs st x' n pc
adamc@807 915
adamc@807 916 val conmap = SM.insert (conmap, x',
adamc@807 917 (x, xs, to, dk))
adamc@807 918 in
adamc@807 919 ((x', n, to),
adamc@807 920 (d :: ds', st, cmap, conmap))
adamc@807 921 end) (ds', st, cmap, conmap) xnts
adamc@813 922
adamc@813 923 val d = (L'.DCon (x, n', k', (L'.CFfi (m, x), loc)), loc)
adamc@185 924 in
adamc@813 925 ((x, n', xs, xnts), (d :: ds', st, cmap, conmap))
adamc@807 926 end)
adamc@807 927 ([], st, cmap, conmap) dts
adamc@185 928 in
adamc@813 929 (List.revAppend (ds', ds),
adamc@185 930 cmap,
adamc@185 931 conmap,
adamc@456 932 st,
adamc@456 933 trans)
adamc@807 934 end
adamc@49 935
adamc@49 936 | L.SgiVal (x, _, c) =>
adamc@456 937 let
adamc@456 938 val c =
adamc@456 939 case trans of
adamc@456 940 NONE => corifyCon st c
adamc@456 941 | SOME trans =>
adamc@456 942 let
adamc@456 943 fun transactify (all as (c, loc)) =
adamc@456 944 case c of
adamc@456 945 L.TFun (dom, ran) =>
adamc@456 946 (L'.TFun (corifyCon st dom, transactify ran), loc)
adamc@456 947 | L.CApp ((L.CNamed trans', _), t) =>
adamc@456 948 if trans' = trans then
adamc@456 949 (L'.CApp ((L'.CFfi (m, "transaction"), loc),
adamc@456 950 corifyCon st t), loc)
adamc@456 951 else
adamc@456 952 corifyCon st all
adamc@456 953 | _ => corifyCon st all
adamc@456 954 in
adamc@456 955 transactify c
adamc@456 956 end
adam@1878 957
adam@1878 958 fun isTransactional (c, _) =
adam@1878 959 case c of
adam@1878 960 L'.TFun (_, c) => isTransactional c
adam@1878 961 | L'.CApp ((L'.CFfi ("Basis", "transaction"), _), _) => true
adam@1878 962 | _ => false
adamc@456 963 in
adam@1878 964 if isTransactional c then
adam@1878 965 let
adam@1878 966 val ffi = (m, x)
adam@1878 967 in
adam@1878 968 if Settings.isBenignEffectful ffi then
adam@1878 969 ()
adam@1878 970 else
adam@1878 971 Settings.addEffectful ffi
adam@1878 972 end
adam@1878 973 else
adam@1878 974 ();
adamc@456 975 (ds,
adamc@456 976 SM.insert (cmap, x, c),
adamc@456 977 conmap,
adamc@456 978 st,
adamc@456 979 trans)
adamc@456 980 end
adamc@456 981 | _ => (ds, cmap, conmap, st, trans))
adamc@456 982 ([], SM.empty, SM.empty, st, NONE) sgis
adamc@49 983
adamc@185 984 val st = St.bindStr st m n (St.ffi m cmap conmap)
adamc@49 985 in
adamc@764 986 (rev ds, if m = "Basis" then St.basisIs (st, n) else st)
adamc@49 987 end
adamc@49 988 | _ => raise Fail "Non-const signature for FFI structure")
adamc@48 989
adamc@109 990 | L.DExport (en, sgn, str) =>
adamc@109 991 (case #1 sgn of
adamc@109 992 L.SgnConst sgis =>
adamc@109 993 let
adamc@109 994 fun pathify (str, _) =
adamc@109 995 case str of
adamc@109 996 L.StrVar m => SOME (m, [])
adamc@109 997 | L.StrProj (str, s) =>
adamc@109 998 Option.map (fn (m, ms) => (m, ms @ [s])) (pathify str)
adamc@109 999 | _ => NONE
adamc@109 1000 in
adamc@109 1001 case pathify str of
adamc@109 1002 NONE => (ErrorMsg.errorAt loc "Structure is too fancy to export";
adamc@109 1003 ([], st))
adamc@109 1004 | SOME (m, ms) =>
adamc@109 1005 let
adamc@249 1006 val basis_n = case St.lookupBasis st of
adamc@249 1007 NONE => raise Fail "Corify: Don't know number of Basis"
adamc@249 1008 | SOME n => n
adamc@249 1009
adamc@109 1010 fun wrapSgi ((sgi, _), (wds, eds)) =
adamc@109 1011 case sgi of
adamc@1125 1012 L.SgiVal (s, _, t) =>
adamc@1125 1013 let
adamc@1125 1014 fun getPage (t, args) =
adamc@1125 1015 case #1 t of
adamc@1125 1016 L.CApp ((L.CModProj (basis, [], "transaction"), _),
adamc@1125 1017 t' as
adamc@1125 1018 (L.CApp
adamc@1125 1019 ((L.CApp
adamc@1125 1020 ((L.CApp ((L.CModProj (basis', [], "xml"), _),
adamc@1125 1021 (L.CRecord (_, [((L.CName "Html", _),
adamc@1125 1022 _)]), _)), _), _),
adamc@1125 1023 _), _), _)) =>
adamc@1125 1024 if basis = basis_n andalso basis' = basis_n then
adamc@1125 1025 SOME (t', rev args)
adamc@1125 1026 else
adamc@1125 1027 NONE
adamc@1125 1028 | L.TFun (dom, ran) => getPage (ran, dom :: args)
adamc@1125 1029 | _ => NONE
adamc@1125 1030 in
adamc@1125 1031 case getPage (t, []) of
adamc@1125 1032 NONE => (wds, eds)
adamc@1125 1033 | SOME (ran', args) =>
adamc@1125 1034 let
adamc@1125 1035 val ran = (L.TRecord (L.CRecord ((L.KType, loc), []), loc), loc)
adamc@1125 1036 val ranT = (L.CApp ((L.CModProj (basis_n, [], "transaction"), loc),
adamc@1125 1037 ran), loc)
adamc@1125 1038 val e = (L.EModProj (m, ms, s), loc)
adamc@249 1039
adamc@1125 1040 val ef = (L.EModProj (basis_n, [], "bind"), loc)
adamc@1125 1041 val ef = (L.ECApp (ef, (L.CModProj (basis_n, [], "transaction"), loc)), loc)
adamc@1125 1042 val ef = (L.ECApp (ef, ran'), loc)
adamc@1125 1043 val ef = (L.ECApp (ef, ran), loc)
adamc@1125 1044 val ef = (L.EApp (ef, (L.EModProj (basis_n, [], "transaction_monad"), loc)),
adamc@1125 1045 loc)
adamc@1125 1046 val ea = ListUtil.foldri (fn (i, _, ea) =>
adamc@1125 1047 (L.EApp (ea, (L.ERel i, loc)), loc)) e args
adamc@1125 1048 val ef = (L.EApp (ef, ea), loc)
adamc@249 1049
adamc@1125 1050 val eat = (L.CApp ((L.CModProj (basis_n, [], "transaction"), loc),
adamc@1125 1051 ran), loc)
adamc@1125 1052 val ea = (L.EAbs ("p", ran', eat,
adamc@1125 1053 (L.EWrite (L.ERel 0, loc), loc)), loc)
adamc@249 1054
adamc@1125 1055 val (e, tf) = ListUtil.foldri (fn (i, t, (e, tf)) =>
adamc@1125 1056 ((L.EAbs ("x" ^ Int.toString i,
adamc@1125 1057 t, tf, e), loc),
adamc@1125 1058 (L.TFun (t, tf), loc)))
adamc@1125 1059 ((L.EApp (ef, ea), loc), ranT) args
adam@1347 1060
adam@1347 1061 val expKind = if List.exists (fn t =>
adam@1347 1062 case corifyCon st t of
adam@1347 1063 (L'.CFfi ("Basis", "postBody"), _) => true
adam@1347 1064 | _ => false) args then
adam@1347 1065 L'.Extern L'.ReadCookieWrite
adam@1347 1066 else
adam@1936 1067 L'.Link L'.ReadCookieWrite
adamc@1125 1068 in
adamc@1125 1069 ((L.DVal ("wrap_" ^ s, 0, tf, e), loc) :: wds,
adamc@1125 1070 (fn st =>
adamc@1125 1071 case #1 (corifyExp st (L.EModProj (en, [], "wrap_" ^ s), loc)) of
adam@1347 1072 L'.ENamed n => (L'.DExport (expKind, n, false), loc)
adamc@1125 1073 | _ => raise Fail "Corify: Value to export didn't corify properly")
adamc@1125 1074 :: eds)
adamc@1125 1075 end
adamc@1125 1076 end
adamc@109 1077 | _ => (wds, eds)
adamc@102 1078
adamc@109 1079 val (wds, eds) = foldl wrapSgi ([], []) sgis
adamc@109 1080 val wrapper = (L.StrConst wds, loc)
adamc@376 1081 val mst = St.lookupStrById st m
adamc@1126 1082 val mst = foldl St.lookupStrByName mst ms
adamc@376 1083 val (ds, {inner, outer}) = corifyStr (St.name mst) (wrapper, st)
adamc@109 1084 val st = St.bindStr outer "wrapper" en inner
adamc@249 1085
adamc@109 1086 val ds = ds @ map (fn f => f st) eds
adamc@109 1087 in
adamc@109 1088 (ds, st)
adamc@109 1089 end
adamc@109 1090 end
adamc@109 1091 | _ => raise Fail "Non-const signature for 'export'")
adamc@48 1092
adamc@707 1093 | L.DTable (_, x, n, c, pe, pc, ce, cc) =>
adamc@249 1094 let
adamc@249 1095 val (st, n) = St.bindVal st x n
adamc@768 1096 val s = relify (doRestify Settings.Table (mods, x))
adamc@249 1097 in
adamc@707 1098 ([(L'.DTable (x, n, corifyCon st c, s,
adamc@707 1099 corifyExp st pe, corifyCon st pc,
adamc@707 1100 corifyExp st ce, corifyCon st cc), loc)], st)
adamc@249 1101 end
adamc@338 1102 | L.DSequence (_, x, n) =>
adamc@338 1103 let
adamc@338 1104 val (st, n) = St.bindVal st x n
adamc@768 1105 val s = relify (doRestify Settings.Sequence (mods, x))
adamc@338 1106 in
adamc@338 1107 ([(L'.DSequence (x, n, s), loc)], st)
adamc@338 1108 end
adamc@754 1109 | L.DView (_, x, n, e, c) =>
adamc@754 1110 let
adamc@754 1111 val (st, n) = St.bindVal st x n
adamc@768 1112 val s = relify (doRestify Settings.View (mods, x))
adamc@754 1113 in
adamc@754 1114 ([(L'.DView (x, n, s, corifyExp st e, corifyCon st c), loc)], st)
adamc@754 1115 end
adamc@246 1116
adamc@271 1117 | L.DDatabase s => ([(L'.DDatabase s, loc)], st)
adamc@271 1118
adamc@461 1119 | L.DCookie (_, x, n, c) =>
adamc@461 1120 let
adamc@461 1121 val (st, n) = St.bindVal st x n
adamc@768 1122 val s = doRestify Settings.Cookie (mods, x)
adamc@461 1123 in
adamc@461 1124 ([(L'.DCookie (x, n, corifyCon st c, s), loc)], st)
adamc@461 1125 end
adamc@720 1126 | L.DStyle (_, x, n) =>
adamc@718 1127 let
adamc@718 1128 val (st, n) = St.bindVal st x n
adamc@768 1129 val s = relify (doRestify Settings.Style (mods, x))
adamc@718 1130 in
adamc@720 1131 ([(L'.DStyle (x, n, s), loc)], st)
adamc@718 1132 end
adamc@461 1133
adamc@1075 1134 | L.DTask (e1, e2) =>
adamc@1075 1135 ([(L'.DTask (corifyExp st e1, corifyExp st e2), loc)], st)
adamc@1073 1136
adamc@1199 1137 | L.DPolicy e1 =>
adamc@1199 1138 ([(L'.DPolicy (corifyExp st e1), loc)], st)
adamc@1199 1139
adam@1294 1140 | L.DOnError (m, ms, x) =>
adam@1294 1141 let
adam@1294 1142 val st = St.lookupStrById st m
adam@1294 1143 val st = foldl St.lookupStrByName st ms
adam@1294 1144 in
adam@1294 1145 case St.lookupValByName st x of
adam@1294 1146 St.ENormal n => ([(L'.DOnError n, loc)], st)
adam@1294 1147 | _ => (ErrorMsg.errorAt loc "Wrong type of identifier for 'onError'";
adam@1294 1148 ([], st))
adam@1294 1149 end
adam@1294 1150
adam@1989 1151 and corifyStr mods ((str, loc), st) =
adamc@39 1152 case str of
adamc@39 1153 L.StrConst ds =>
adamc@39 1154 let
adamc@376 1155 val st = St.enter (st, mods)
adamc@376 1156 val (ds, st) = ListUtil.foldlMapConcat (corifyDecl mods) st ds
adamc@39 1157 in
adamc@39 1158 (ds, St.leave st)
adamc@39 1159 end
adamc@39 1160 | L.StrVar n => ([], {inner = St.lookupStrById st n, outer = st})
adamc@39 1161 | L.StrProj (str, x) =>
adamc@39 1162 let
adamc@376 1163 val (ds, {inner, outer}) = corifyStr mods (str, st)
adamc@39 1164 in
adamc@39 1165 (ds, {inner = St.lookupStrByName (x, inner), outer = outer})
adamc@39 1166 end
adamc@46 1167 | L.StrFun _ => raise Fail "Corify of nested functor definition"
adamc@46 1168 | L.StrApp (str1, str2) =>
adamc@46 1169 let
adamc@46 1170 fun unwind' (str, _) =
adamc@46 1171 case str of
adamc@46 1172 L.StrVar n => St.lookupStrById st n
adamc@46 1173 | L.StrProj (str, x) => St.lookupStrByName (x, unwind' str)
adamc@46 1174 | _ => raise Fail "Corify of fancy functor application [1]"
adamc@46 1175
adamc@46 1176 fun unwind (str, _) =
adamc@46 1177 case str of
adamc@46 1178 L.StrVar n => St.lookupFunctorById st n
adamc@46 1179 | L.StrProj (str, x) => St.lookupFunctorByName (x, unwind' str)
adamc@46 1180 | _ => raise Fail "Corify of fancy functor application [2]"
adamc@46 1181
adamc@423 1182 val (xa, na, body) = unwind str1
adamc@46 1183
adam@1989 1184 (* An important step to make sure that nested functors
adam@1989 1185 * "close under their environments": *)
adam@1989 1186 val (next, body') = ExplRename.rename {NextId = getCounter (),
adam@1989 1187 FormalName = xa,
adam@1989 1188 FormalId = na,
adam@1989 1189 Body = body}
adam@1989 1190
adam@1989 1191 (*val () = Print.prefaces ("RENAME " ^ ErrorMsg.spanToString loc)
adam@1989 1192 [("FROM", ExplPrint.p_str ExplEnv.empty body),
adam@1989 1193 ("TO", ExplPrint.p_str ExplEnv.empty body')]*)
adam@1989 1194 val body = body'
adam@1989 1195
adam@1989 1196 val () = setCounter next
adam@1989 1197
adamc@376 1198 val (ds1, {inner = inner', outer}) = corifyStr mods (str2, st)
adamc@376 1199
adamc@423 1200 val (ds2, {inner, outer}) = corifyStr mods (body, St.bindStr outer xa na inner')
adamc@46 1201 in
adamc@146 1202 (ds1 @ ds2, {inner = St.bindStr inner xa na inner', outer = outer})
adamc@46 1203 end
adamc@31 1204
adamc@39 1205 fun maxName ds = foldl (fn ((d, _), n) =>
adamc@39 1206 case d of
adamc@39 1207 L.DCon (_, n', _, _) => Int.max (n, n')
adamc@806 1208 | L.DDatatype dts => foldl (fn ((_, n', _, _), n) => Int.max (n, n')) n dts
adamc@191 1209 | L.DDatatypeImp (_, n', _, _, _, _, _) => Int.max (n, n')
adamc@124 1210 | L.DVal (_, n', _, _) => Int.max (n, n')
adamc@124 1211 | L.DValRec vis => foldl (fn ((_, n', _, _), n) => Int.max (n, n)) n vis
adamc@39 1212 | L.DSgn (_, n', _) => Int.max (n, n')
adamc@48 1213 | L.DStr (_, n', _, str) => Int.max (n, Int.max (n', maxNameStr str))
adamc@100 1214 | L.DFfiStr (_, n', _) => Int.max (n, n')
adamc@246 1215 | L.DExport _ => n
adamc@707 1216 | L.DTable (_, _, n', _, _, _, _, _) => Int.max (n, n')
adamc@338 1217 | L.DSequence (_, _, n') => Int.max (n, n')
adamc@754 1218 | L.DView (_, _, n', _, _) => Int.max (n, n')
adamc@461 1219 | L.DDatabase _ => n
adamc@718 1220 | L.DCookie (_, _, n', _) => Int.max (n, n')
adamc@1073 1221 | L.DStyle (_, _, n') => Int.max (n, n')
adamc@1199 1222 | L.DTask _ => n
adam@1294 1223 | L.DPolicy _ => n
adam@1294 1224 | L.DOnError _ => n)
adamc@249 1225 0 ds
adamc@39 1226
adamc@39 1227 and maxNameStr (str, _) =
adamc@39 1228 case str of
adamc@39 1229 L.StrConst ds => maxName ds
adamc@39 1230 | L.StrVar n => n
adamc@39 1231 | L.StrProj (str, _) => maxNameStr str
adamc@45 1232 | L.StrFun (_, _, _, _, str) => maxNameStr str
adamc@45 1233 | L.StrApp (str1, str2) => Int.max (maxNameStr str1, maxNameStr str2)
adamc@39 1234
adamc@39 1235 fun corify ds =
adamc@39 1236 let
adamc@39 1237 val () = reset (maxName ds + 1)
adamc@146 1238
adamc@376 1239 val (ds, _) = ListUtil.foldlMapConcat (corifyDecl []) St.empty ds
adamc@39 1240 in
adamc@39 1241 ds
adamc@39 1242 end
adamc@16 1243
adamc@16 1244 end