Mercurial > urweb

annotate src/mono_util.sml @ 529:4df69124e9c5

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Shorthands
author Adam Chlipala <adamc@hcoop.net>
date Thu, 27 Nov 2008 16:55:30 -0500
parents 65d8541c130b
children a152905c3c3b
rev   line source
adamc@26 1 (* Copyright (c) 2008, Adam Chlipala
adamc@26 2 * All rights reserved.
adamc@26 3 *
adamc@26 4 * Redistribution and use in source and binary forms, with or without
adamc@26 5 * modification, are permitted provided that the following conditions are met:
adamc@26 6 *
adamc@26 7 * - Redistributions of source code must retain the above copyright notice,
adamc@26 8 * this list of conditions and the following disclaimer.
adamc@26 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@26 10 * this list of conditions and the following disclaimer in the documentation
adamc@26 11 * and/or other materials provided with the distribution.
adamc@26 12 * - The names of contributors may not be used to endorse or promote products
adamc@26 13 * derived from this software without specific prior written permission.
adamc@26 14 *
adamc@26 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@26 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@26 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@26 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@26 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@26 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@26 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@26 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@26 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@26 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@26 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@26 26 *)
adamc@26 27
adamc@26 28 structure MonoUtil :> MONO_UTIL = struct
adamc@26 29
adamc@26 30 open Mono
adamc@26 31
adamc@26 32 structure S = Search
adamc@26 33
adamc@267 34 val dummyt = (TRecord [], ErrorMsg.dummySpan)
adamc@267 35
adamc@26 36 structure Typ = struct
adamc@26 37
adamc@193 38 open Order
adamc@109 39
adamc@109 40 fun compare ((t1, _), (t2, _)) =
adamc@109 41 case (t1, t2) of
adamc@109 42 (TFun (d1, r1), TFun (d2, r2)) =>
adamc@109 43 join (compare (d1, d2), fn () => compare (r1, r2))
adamc@109 44 | (TRecord xts1, TRecord xts2) =>
adamc@109 45 let
adamc@109 46 val xts1 = sortFields xts1
adamc@109 47 val xts2 = sortFields xts2
adamc@109 48 in
adamc@109 49 joinL compareFields (xts1, xts2)
adamc@109 50 end
adamc@196 51 | (TDatatype (n1, _), TDatatype (n2, _)) => Int.compare (n1, n2)
adamc@109 52 | (TFfi (m1, x1), TFfi (m2, x2)) => join (String.compare (m1, m2), fn () => String.compare (x1, x2))
adamc@288 53 | (TOption t1, TOption t2) => compare (t1, t2)
adamc@109 54
adamc@109 55 | (TFun _, _) => LESS
adamc@109 56 | (_, TFun _) => GREATER
adamc@109 57
adamc@109 58 | (TRecord _, _) => LESS
adamc@109 59 | (_, TRecord _) => GREATER
adamc@109 60
adamc@168 61 | (TDatatype _, _) => LESS
adamc@168 62 | (_, TDatatype _) => GREATER
adamc@109 63
adamc@288 64 | (TFfi _, _) => LESS
adamc@288 65 | (_, TFfi _) => GREATER
adamc@288 66
adamc@109 67 and compareFields ((x1, t1), (x2, t2)) =
adamc@109 68 join (String.compare (x1, x2),
adamc@109 69 fn () => compare (t1, t2))
adamc@109 70
adamc@109 71 and sortFields xts = ListMergeSort.sort (fn (x, y) => compareFields (x, y) = GREATER) xts
adamc@109 72
adamc@26 73 fun mapfold fc =
adamc@26 74 let
adamc@26 75 fun mft c acc =
adamc@26 76 S.bindP (mft' c acc, fc)
adamc@26 77
adamc@26 78 and mft' (cAll as (c, loc)) =
adamc@26 79 case c of
adamc@26 80 TFun (t1, t2) =>
adamc@26 81 S.bind2 (mft t1,
adamc@26 82 fn t1' =>
adamc@26 83 S.map2 (mft t2,
adamc@26 84 fn t2' =>
adamc@26 85 (TFun (t1', t2'), loc)))
adamc@26 86 | TRecord xts =>
adamc@26 87 S.map2 (ListUtil.mapfold (fn (x, t) =>
adamc@26 88 S.map2 (mft t,
adamc@26 89 fn t' =>
adamc@26 90 (x, t')))
adamc@26 91 xts,
adamc@26 92 fn xts' => (TRecord xts', loc))
adamc@168 93 | TDatatype _ => S.return2 cAll
adamc@51 94 | TFfi _ => S.return2 cAll
adamc@288 95 | TOption t =>
adamc@288 96 S.map2 (mft t,
adamc@288 97 fn t' =>
adamc@288 98 (TOption t, loc))
adamc@26 99 in
adamc@26 100 mft
adamc@26 101 end
adamc@26 102
adamc@26 103 fun map typ c =
adamc@26 104 case mapfold (fn c => fn () => S.Continue (typ c, ())) c () of
adamc@26 105 S.Return () => raise Fail "Mono_util.Typ.map"
adamc@26 106 | S.Continue (c, ()) => c
adamc@26 107
adamc@26 108 fun fold typ s c =
adamc@26 109 case mapfold (fn c => fn s => S.Continue (c, typ (c, s))) c s of
adamc@26 110 S.Continue (_, s) => s
adamc@26 111 | S.Return _ => raise Fail "MonoUtil.Typ.fold: Impossible"
adamc@26 112
adamc@26 113 fun exists typ k =
adamc@26 114 case mapfold (fn c => fn () =>
adamc@26 115 if typ c then
adamc@26 116 S.Return ()
adamc@26 117 else
adamc@26 118 S.Continue (c, ())) k () of
adamc@26 119 S.Return _ => true
adamc@26 120 | S.Continue _ => false
adamc@26 121
adamc@26 122 end
adamc@26 123
adamc@26 124 structure Exp = struct
adamc@26 125
adamc@26 126 datatype binder =
adamc@168 127 Datatype of string * int * (string * int * typ option) list
adamc@26 128 | RelE of string * typ
adamc@109 129 | NamedE of string * int * typ * exp option * string
adamc@26 130
adamc@26 131 fun mapfoldB {typ = fc, exp = fe, bind} =
adamc@26 132 let
adamc@26 133 val mft = Typ.mapfold fc
adamc@26 134
adamc@26 135 fun mfe ctx e acc =
adamc@26 136 S.bindP (mfe' ctx e acc, fe ctx)
adamc@26 137
adamc@26 138 and mfe' ctx (eAll as (e, loc)) =
adamc@26 139 case e of
adamc@26 140 EPrim _ => S.return2 eAll
adamc@26 141 | ERel _ => S.return2 eAll
adamc@26 142 | ENamed _ => S.return2 eAll
adamc@188 143 | ECon (_, _, NONE) => S.return2 eAll
adamc@188 144 | ECon (dk, n, SOME e) =>
adamc@178 145 S.map2 (mfe ctx e,
adamc@178 146 fn e' =>
adamc@188 147 (ECon (dk, n, SOME e'), loc))
adamc@297 148 | ENone t =>
adamc@297 149 S.map2 (mft t,
adamc@297 150 fn t' =>
adamc@297 151 (ENone t', loc))
adamc@290 152 | ESome (t, e) =>
adamc@290 153 S.bind2 (mft t,
adamc@290 154 fn t' =>
adamc@290 155 S.map2 (mfe ctx e,
adamc@290 156 fn e' =>
adamc@290 157 (ESome (t', e'), loc)))
adamc@51 158 | EFfi _ => S.return2 eAll
adamc@51 159 | EFfiApp (m, x, es) =>
adamc@51 160 S.map2 (ListUtil.mapfold (fn e => mfe ctx e) es,
adamc@51 161 fn es' =>
adamc@51 162 (EFfiApp (m, x, es'), loc))
adamc@26 163 | EApp (e1, e2) =>
adamc@26 164 S.bind2 (mfe ctx e1,
adamc@26 165 fn e1' =>
adamc@26 166 S.map2 (mfe ctx e2,
adamc@26 167 fn e2' =>
adamc@26 168 (EApp (e1', e2'), loc)))
adamc@26 169 | EAbs (x, dom, ran, e) =>
adamc@26 170 S.bind2 (mft dom,
adamc@26 171 fn dom' =>
adamc@26 172 S.bind2 (mft ran,
adamc@26 173 fn ran' =>
adamc@26 174 S.map2 (mfe (bind (ctx, RelE (x, dom'))) e,
adamc@26 175 fn e' =>
adamc@26 176 (EAbs (x, dom', ran', e'), loc))))
adamc@26 177
adamc@387 178 | EUnop (s, e) =>
adamc@387 179 S.map2 (mfe ctx e,
adamc@387 180 fn e' =>
adamc@387 181 (EUnop (s, e'), loc))
adamc@387 182 | EBinop (s, e1, e2) =>
adamc@387 183 S.bind2 (mfe ctx e1,
adamc@387 184 fn e1' =>
adamc@387 185 S.map2 (mfe ctx e2,
adamc@387 186 fn e2' =>
adamc@387 187 (EBinop (s, e1', e2'), loc)))
adamc@387 188
adamc@26 189 | ERecord xes =>
adamc@29 190 S.map2 (ListUtil.mapfold (fn (x, e, t) =>
adamc@29 191 S.bind2 (mfe ctx e,
adamc@26 192 fn e' =>
adamc@29 193 S.map2 (mft t,
adamc@29 194 fn t' =>
adamc@29 195 (x, e', t'))))
adamc@26 196 xes,
adamc@26 197 fn xes' =>
adamc@26 198 (ERecord xes', loc))
adamc@26 199 | EField (e, x) =>
adamc@26 200 S.map2 (mfe ctx e,
adamc@26 201 fn e' =>
adamc@26 202 (EField (e', x), loc))
adamc@94 203
adamc@182 204 | ECase (e, pes, {disc, result}) =>
adamc@178 205 S.bind2 (mfe ctx e,
adamc@178 206 fn e' =>
adamc@178 207 S.bind2 (ListUtil.mapfold (fn (p, e) =>
adamc@179 208 let
adamc@179 209 fun pb ((p, _), ctx) =
adamc@179 210 case p of
adamc@179 211 PWild => ctx
adamc@182 212 | PVar (x, t) => bind (ctx, RelE (x, t))
adamc@179 213 | PPrim _ => ctx
adamc@188 214 | PCon (_, _, NONE) => ctx
adamc@188 215 | PCon (_, _, SOME p) => pb (p, ctx)
adamc@182 216 | PRecord xps => foldl (fn ((_, p, _), ctx) =>
adamc@179 217 pb (p, ctx)) ctx xps
adamc@288 218 | PNone _ => ctx
adamc@288 219 | PSome (_, p) => pb (p, ctx)
adamc@179 220 in
adamc@179 221 S.map2 (mfe (pb (p, ctx)) e,
adamc@179 222 fn e' => (p, e'))
adamc@179 223 end) pes,
adamc@178 224 fn pes' =>
adamc@182 225 S.bind2 (mft disc,
adamc@182 226 fn disc' =>
adamc@182 227 S.map2 (mft result,
adamc@182 228 fn result' =>
adamc@182 229 (ECase (e', pes', {disc = disc', result = result'}), loc)))))
adamc@178 230
adamc@283 231 | EError (e, t) =>
adamc@283 232 S.bind2 (mfe ctx e,
adamc@283 233 fn e' =>
adamc@283 234 S.map2 (mft t,
adamc@283 235 fn t' =>
adamc@283 236 (EError (e', t'), loc)))
adamc@283 237
adamc@94 238 | EStrcat (e1, e2) =>
adamc@94 239 S.bind2 (mfe ctx e1,
adamc@94 240 fn e1' =>
adamc@94 241 S.map2 (mfe ctx e2,
adamc@94 242 fn e2' =>
adamc@94 243 (EStrcat (e1', e2'), loc)))
adamc@102 244
adamc@102 245 | EWrite e =>
adamc@102 246 S.map2 (mfe ctx e,
adamc@102 247 fn e' =>
adamc@102 248 (EWrite e', loc))
adamc@106 249
adamc@106 250 | ESeq (e1, e2) =>
adamc@106 251 S.bind2 (mfe ctx e1,
adamc@106 252 fn e1' =>
adamc@106 253 S.map2 (mfe ctx e2,
adamc@106 254 fn e2' =>
adamc@106 255 (ESeq (e1', e2'), loc)))
adamc@251 256 | ELet (x, t, e1, e2) =>
adamc@251 257 S.bind2 (mft t,
adamc@251 258 fn t' =>
adamc@251 259 S.bind2 (mfe ctx e1,
adamc@251 260 fn e1' =>
adamc@252 261 S.map2 (mfe (bind (ctx, RelE (x, t'))) e2,
adamc@251 262 fn e2' =>
adamc@251 263 (ELet (x, t', e1', e2'), loc))))
adamc@111 264
adamc@111 265 | EClosure (n, es) =>
adamc@111 266 S.map2 (ListUtil.mapfold (mfe ctx) es,
adamc@111 267 fn es' =>
adamc@111 268 (EClosure (n, es'), loc))
adamc@252 269
adamc@252 270 | EQuery {exps, tables, state, query, body, initial} =>
adamc@252 271 S.bind2 (ListUtil.mapfold (fn (x, t) =>
adamc@252 272 S.map2 (mft t,
adamc@252 273 fn t' => (x, t'))) exps,
adamc@252 274 fn exps' =>
adamc@252 275 S.bind2 (ListUtil.mapfold (fn (x, xts) =>
adamc@252 276 S.map2 (ListUtil.mapfold
adamc@252 277 (fn (x, t) =>
adamc@252 278 S.map2 (mft t,
adamc@252 279 fn t' => (x, t'))) xts,
adamc@252 280 fn xts' => (x, xts'))) tables,
adamc@252 281 fn tables' =>
adamc@252 282 S.bind2 (mft state,
adamc@252 283 fn state' =>
adamc@252 284 S.bind2 (mfe ctx query,
adamc@252 285 fn query' =>
adamc@267 286 S.bind2 (mfe (bind (bind (ctx, RelE ("r", dummyt)),
adamc@267 287 RelE ("acc", dummyt)))
adamc@267 288 body,
adamc@267 289 fn body' =>
adamc@267 290 S.map2 (mfe ctx initial,
adamc@267 291 fn initial' =>
adamc@267 292 (EQuery {exps = exps',
adamc@267 293 tables = tables',
adamc@267 294 state = state',
adamc@267 295 query = query',
adamc@267 296 body = body',
adamc@267 297 initial = initial'},
adamc@267 298 loc)))))))
adamc@307 299
adamc@307 300 | EDml e =>
adamc@307 301 S.map2 (mfe ctx e,
adamc@307 302 fn e' =>
adamc@307 303 (EDml e', loc))
adamc@338 304 | ENextval e =>
adamc@338 305 S.map2 (mfe ctx e,
adamc@338 306 fn e' =>
adamc@338 307 (ENextval e', loc))
adamc@463 308 | EUnurlify (e, t) =>
adamc@463 309 S.bind2 (mfe ctx e,
adamc@463 310 fn e' =>
adamc@463 311 S.map2 (mft t,
adamc@463 312 fn t' =>
adamc@463 313 (EUnurlify (e', t'), loc)))
adamc@26 314 in
adamc@26 315 mfe
adamc@26 316 end
adamc@26 317
adamc@26 318 fun mapfold {typ = fc, exp = fe} =
adamc@26 319 mapfoldB {typ = fc,
adamc@26 320 exp = fn () => fe,
adamc@26 321 bind = fn ((), _) => ()} ()
adamc@26 322
adamc@26 323 fun mapB {typ, exp, bind} ctx e =
adamc@26 324 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 325 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 326 bind = bind} ctx e () of
adamc@26 327 S.Continue (e, ()) => e
adamc@26 328 | S.Return _ => raise Fail "MonoUtil.Exp.mapB: Impossible"
adamc@26 329
adamc@26 330 fun map {typ, exp} e =
adamc@26 331 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 332 exp = fn e => fn () => S.Continue (exp e, ())} e () of
adamc@26 333 S.Return () => raise Fail "Mono_util.Exp.map"
adamc@26 334 | S.Continue (e, ()) => e
adamc@26 335
adamc@26 336 fun fold {typ, exp} s e =
adamc@26 337 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 338 exp = fn e => fn s => S.Continue (e, exp (e, s))} e s of
adamc@26 339 S.Continue (_, s) => s
adamc@26 340 | S.Return _ => raise Fail "MonoUtil.Exp.fold: Impossible"
adamc@26 341
adamc@26 342 fun exists {typ, exp} k =
adamc@26 343 case mapfold {typ = fn c => fn () =>
adamc@26 344 if typ c then
adamc@26 345 S.Return ()
adamc@26 346 else
adamc@26 347 S.Continue (c, ()),
adamc@26 348 exp = fn e => fn () =>
adamc@26 349 if exp e then
adamc@26 350 S.Return ()
adamc@26 351 else
adamc@26 352 S.Continue (e, ())} k () of
adamc@26 353 S.Return _ => true
adamc@26 354 | S.Continue _ => false
adamc@26 355
adamc@26 356 end
adamc@26 357
adamc@26 358 structure Decl = struct
adamc@26 359
adamc@26 360 datatype binder = datatype Exp.binder
adamc@26 361
adamc@26 362 fun mapfoldB {typ = fc, exp = fe, decl = fd, bind} =
adamc@26 363 let
adamc@26 364 val mft = Typ.mapfold fc
adamc@26 365
adamc@26 366 val mfe = Exp.mapfoldB {typ = fc, exp = fe, bind = bind}
adamc@26 367
adamc@26 368 fun mfd ctx d acc =
adamc@26 369 S.bindP (mfd' ctx d acc, fd ctx)
adamc@26 370
adamc@26 371 and mfd' ctx (dAll as (d, loc)) =
adamc@26 372 case d of
adamc@164 373 DDatatype (x, n, xncs) =>
adamc@164 374 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@164 375 case c of
adamc@164 376 NONE => S.return2 (x, n, c)
adamc@164 377 | SOME c =>
adamc@164 378 S.map2 (mft c,
adamc@164 379 fn c' => (x, n, SOME c'))) xncs,
adamc@164 380 fn xncs' =>
adamc@164 381 (DDatatype (x, n, xncs'), loc))
adamc@164 382 | DVal vi =>
adamc@126 383 S.map2 (mfvi ctx vi,
adamc@126 384 fn vi' =>
adamc@126 385 (DVal vi', loc))
adamc@126 386 | DValRec vis =>
adamc@196 387 let
adamc@196 388 val ctx' = foldl (fn ((x, n, t, _, s), ctx') => bind (ctx', NamedE (x, n, t, NONE, s))) ctx vis
adamc@196 389 in
adamc@196 390 S.map2 (ListUtil.mapfold (mfvi ctx') vis,
adamc@196 391 fn vis' =>
adamc@196 392 (DValRec vis', loc))
adamc@196 393 end
adamc@144 394 | DExport (ek, s, n, ts) =>
adamc@120 395 S.map2 (ListUtil.mapfold mft ts,
adamc@120 396 fn ts' =>
adamc@144 397 (DExport (ek, s, n, ts'), loc))
adamc@273 398 | DTable _ => S.return2 dAll
adamc@338 399 | DSequence _ => S.return2 dAll
adamc@271 400 | DDatabase _ => S.return2 dAll
adamc@126 401
adamc@126 402 and mfvi ctx (x, n, t, e, s) =
adamc@126 403 S.bind2 (mft t,
adamc@126 404 fn t' =>
adamc@126 405 S.map2 (mfe ctx e,
adamc@126 406 fn e' =>
adamc@126 407 (x, n, t', e', s)))
adamc@26 408 in
adamc@26 409 mfd
adamc@26 410 end
adamc@26 411
adamc@26 412 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 413 mapfoldB {typ = fc,
adamc@26 414 exp = fn () => fe,
adamc@26 415 decl = fn () => fd,
adamc@26 416 bind = fn ((), _) => ()} ()
adamc@26 417
adamc@26 418 fun fold {typ, exp, decl} s d =
adamc@26 419 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 420 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 421 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 422 S.Continue (_, s) => s
adamc@26 423 | S.Return _ => raise Fail "MonoUtil.Decl.fold: Impossible"
adamc@26 424
adamc@506 425 fun map {typ, exp, decl} e =
adamc@506 426 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@506 427 exp = fn e => fn () => S.Continue (exp e, ()),
adamc@506 428 decl = fn d => fn () => S.Continue (decl d, ())} e () of
adamc@506 429 S.Return () => raise Fail "MonoUtil.Decl.map: Impossible"
adamc@506 430 | S.Continue (e, ()) => e
adamc@506 431
adamc@26 432 end
adamc@26 433
adamc@26 434 structure File = struct
adamc@26 435
adamc@26 436 datatype binder = datatype Exp.binder
adamc@26 437
adamc@26 438 fun mapfoldB (all as {bind, ...}) =
adamc@26 439 let
adamc@26 440 val mfd = Decl.mapfoldB all
adamc@26 441
adamc@26 442 fun mff ctx ds =
adamc@26 443 case ds of
adamc@26 444 nil => S.return2 nil
adamc@26 445 | d :: ds' =>
adamc@26 446 S.bind2 (mfd ctx d,
adamc@26 447 fn d' =>
adamc@26 448 let
adamc@100 449 val ctx' =
adamc@26 450 case #1 d' of
adamc@164 451 DDatatype (x, n, xncs) =>
adamc@164 452 let
adamc@168 453 val ctx = bind (ctx, Datatype (x, n, xncs))
adamc@198 454 val t = (TDatatype (n, ref (ElabUtil.classifyDatatype xncs, xncs)), #2 d')
adamc@164 455 in
adamc@164 456 foldl (fn ((x, n, to), ctx) =>
adamc@164 457 let
adamc@164 458 val t = case to of
adamc@164 459 NONE => t
adamc@164 460 | SOME t' => (TFun (t', t), #2 d')
adamc@164 461 in
adamc@164 462 bind (ctx, NamedE (x, n, t, NONE, ""))
adamc@164 463 end)
adamc@164 464 ctx xncs
adamc@164 465 end
adamc@164 466 | DVal (x, n, t, e, s) => bind (ctx, NamedE (x, n, t, SOME e, s))
adamc@126 467 | DValRec vis => foldl (fn ((x, n, t, e, s), ctx) =>
adamc@196 468 bind (ctx, NamedE (x, n, t, NONE, s))) ctx vis
adamc@109 469 | DExport _ => ctx
adamc@273 470 | DTable _ => ctx
adamc@338 471 | DSequence _ => ctx
adamc@271 472 | DDatabase _ => ctx
adamc@26 473 in
adamc@26 474 S.map2 (mff ctx' ds',
adamc@26 475 fn ds' =>
adamc@26 476 d' :: ds')
adamc@26 477 end)
adamc@26 478 in
adamc@26 479 mff
adamc@26 480 end
adamc@26 481
adamc@26 482 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 483 mapfoldB {typ = fc,
adamc@26 484 exp = fn () => fe,
adamc@26 485 decl = fn () => fd,
adamc@26 486 bind = fn ((), _) => ()} ()
adamc@26 487
adamc@26 488 fun mapB {typ, exp, decl, bind} ctx ds =
adamc@26 489 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 490 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 491 decl = fn ctx => fn d => fn () => S.Continue (decl ctx d, ()),
adamc@26 492 bind = bind} ctx ds () of
adamc@26 493 S.Continue (ds, ()) => ds
adamc@26 494 | S.Return _ => raise Fail "MonoUtil.File.mapB: Impossible"
adamc@26 495
adamc@96 496 fun map {typ, exp, decl} e =
adamc@96 497 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@96 498 exp = fn e => fn () => S.Continue (exp e, ()),
adamc@96 499 decl = fn d => fn () => S.Continue (decl d, ())} e () of
adamc@506 500 S.Return () => raise Fail "MonoUtil.File.map: Impossible"
adamc@96 501 | S.Continue (e, ()) => e
adamc@96 502
adamc@26 503 fun fold {typ, exp, decl} s d =
adamc@26 504 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 505 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 506 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 507 S.Continue (_, s) => s
adamc@26 508 | S.Return _ => raise Fail "MonoUtil.File.fold: Impossible"
adamc@26 509
adamc@506 510 val maxName = foldl (fn ((d, _) : decl, count) =>
adamc@506 511 case d of
adamc@506 512 DDatatype (_, n, ns) =>
adamc@506 513 foldl (fn ((_, n', _), m) => Int.max (n', m))
adamc@506 514 (Int.max (n, count)) ns
adamc@506 515 | DVal (_, n, _, _, _) => Int.max (n, count)
adamc@506 516 | DValRec vis => foldl (fn ((_, n, _, _, _), count) => Int.max (n, count)) count vis
adamc@506 517 | DExport _ => count
adamc@506 518 | DTable _ => count
adamc@506 519 | DSequence _ => count
adamc@506 520 | DDatabase _ => count) 0
adamc@506 521
adamc@26 522 end
adamc@26 523
adamc@26 524 end