Mercurial > urweb

annotate src/mono_util.sml @ 636:de8333ef1a0c

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Coq README
author Adam Chlipala <adamc@hcoop.net>
date Thu, 26 Feb 2009 13:56:54 -0500
parents 5891f47d7cff
children 4a125bbc602d
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@577 54 | (TSource, TSource) => EQUAL
adamc@568 55 | (TSignal t1, TSignal t2) => compare (t1, t2)
adamc@109 56
adamc@109 57 | (TFun _, _) => LESS
adamc@109 58 | (_, TFun _) => GREATER
adamc@109 59
adamc@109 60 | (TRecord _, _) => LESS
adamc@109 61 | (_, TRecord _) => GREATER
adamc@109 62
adamc@168 63 | (TDatatype _, _) => LESS
adamc@168 64 | (_, TDatatype _) => GREATER
adamc@109 65
adamc@288 66 | (TFfi _, _) => LESS
adamc@288 67 | (_, TFfi _) => GREATER
adamc@288 68
adamc@568 69 | (TOption _, _) => LESS
adamc@568 70 | (_, TOption _) => GREATER
adamc@568 71
adamc@577 72 | (TSource, _) => LESS
adamc@577 73 | (_, TSource) => GREATER
adamc@577 74
adamc@109 75 and compareFields ((x1, t1), (x2, t2)) =
adamc@109 76 join (String.compare (x1, x2),
adamc@109 77 fn () => compare (t1, t2))
adamc@109 78
adamc@109 79 and sortFields xts = ListMergeSort.sort (fn (x, y) => compareFields (x, y) = GREATER) xts
adamc@109 80
adamc@26 81 fun mapfold fc =
adamc@26 82 let
adamc@26 83 fun mft c acc =
adamc@26 84 S.bindP (mft' c acc, fc)
adamc@26 85
adamc@26 86 and mft' (cAll as (c, loc)) =
adamc@26 87 case c of
adamc@26 88 TFun (t1, t2) =>
adamc@26 89 S.bind2 (mft t1,
adamc@26 90 fn t1' =>
adamc@26 91 S.map2 (mft t2,
adamc@26 92 fn t2' =>
adamc@26 93 (TFun (t1', t2'), loc)))
adamc@26 94 | TRecord xts =>
adamc@26 95 S.map2 (ListUtil.mapfold (fn (x, t) =>
adamc@26 96 S.map2 (mft t,
adamc@26 97 fn t' =>
adamc@26 98 (x, t')))
adamc@26 99 xts,
adamc@26 100 fn xts' => (TRecord xts', loc))
adamc@168 101 | TDatatype _ => S.return2 cAll
adamc@51 102 | TFfi _ => S.return2 cAll
adamc@288 103 | TOption t =>
adamc@288 104 S.map2 (mft t,
adamc@288 105 fn t' =>
adamc@288 106 (TOption t, loc))
adamc@577 107 | TSource => S.return2 cAll
adamc@568 108 | TSignal t =>
adamc@568 109 S.map2 (mft t,
adamc@568 110 fn t' =>
adamc@568 111 (TSignal t, loc))
adamc@26 112 in
adamc@26 113 mft
adamc@26 114 end
adamc@26 115
adamc@26 116 fun map typ c =
adamc@26 117 case mapfold (fn c => fn () => S.Continue (typ c, ())) c () of
adamc@26 118 S.Return () => raise Fail "Mono_util.Typ.map"
adamc@26 119 | S.Continue (c, ()) => c
adamc@26 120
adamc@26 121 fun fold typ s c =
adamc@26 122 case mapfold (fn c => fn s => S.Continue (c, typ (c, s))) c s of
adamc@26 123 S.Continue (_, s) => s
adamc@26 124 | S.Return _ => raise Fail "MonoUtil.Typ.fold: Impossible"
adamc@26 125
adamc@26 126 fun exists typ k =
adamc@26 127 case mapfold (fn c => fn () =>
adamc@26 128 if typ c then
adamc@26 129 S.Return ()
adamc@26 130 else
adamc@26 131 S.Continue (c, ())) k () of
adamc@26 132 S.Return _ => true
adamc@26 133 | S.Continue _ => false
adamc@26 134
adamc@26 135 end
adamc@26 136
adamc@26 137 structure Exp = struct
adamc@26 138
adamc@26 139 datatype binder =
adamc@168 140 Datatype of string * int * (string * int * typ option) list
adamc@26 141 | RelE of string * typ
adamc@109 142 | NamedE of string * int * typ * exp option * string
adamc@26 143
adamc@26 144 fun mapfoldB {typ = fc, exp = fe, bind} =
adamc@26 145 let
adamc@26 146 val mft = Typ.mapfold fc
adamc@26 147
adamc@26 148 fun mfe ctx e acc =
adamc@26 149 S.bindP (mfe' ctx e acc, fe ctx)
adamc@26 150
adamc@26 151 and mfe' ctx (eAll as (e, loc)) =
adamc@26 152 case e of
adamc@26 153 EPrim _ => S.return2 eAll
adamc@26 154 | ERel _ => S.return2 eAll
adamc@26 155 | ENamed _ => S.return2 eAll
adamc@188 156 | ECon (_, _, NONE) => S.return2 eAll
adamc@188 157 | ECon (dk, n, SOME e) =>
adamc@178 158 S.map2 (mfe ctx e,
adamc@178 159 fn e' =>
adamc@188 160 (ECon (dk, n, SOME e'), loc))
adamc@297 161 | ENone t =>
adamc@297 162 S.map2 (mft t,
adamc@297 163 fn t' =>
adamc@297 164 (ENone t', loc))
adamc@290 165 | ESome (t, e) =>
adamc@290 166 S.bind2 (mft t,
adamc@290 167 fn t' =>
adamc@290 168 S.map2 (mfe ctx e,
adamc@290 169 fn e' =>
adamc@290 170 (ESome (t', e'), loc)))
adamc@51 171 | EFfi _ => S.return2 eAll
adamc@51 172 | EFfiApp (m, x, es) =>
adamc@51 173 S.map2 (ListUtil.mapfold (fn e => mfe ctx e) es,
adamc@51 174 fn es' =>
adamc@51 175 (EFfiApp (m, x, es'), loc))
adamc@26 176 | EApp (e1, e2) =>
adamc@26 177 S.bind2 (mfe ctx e1,
adamc@26 178 fn e1' =>
adamc@26 179 S.map2 (mfe ctx e2,
adamc@26 180 fn e2' =>
adamc@26 181 (EApp (e1', e2'), loc)))
adamc@26 182 | EAbs (x, dom, ran, e) =>
adamc@26 183 S.bind2 (mft dom,
adamc@26 184 fn dom' =>
adamc@26 185 S.bind2 (mft ran,
adamc@26 186 fn ran' =>
adamc@26 187 S.map2 (mfe (bind (ctx, RelE (x, dom'))) e,
adamc@26 188 fn e' =>
adamc@26 189 (EAbs (x, dom', ran', e'), loc))))
adamc@26 190
adamc@387 191 | EUnop (s, e) =>
adamc@387 192 S.map2 (mfe ctx e,
adamc@387 193 fn e' =>
adamc@387 194 (EUnop (s, e'), loc))
adamc@387 195 | EBinop (s, e1, e2) =>
adamc@387 196 S.bind2 (mfe ctx e1,
adamc@387 197 fn e1' =>
adamc@387 198 S.map2 (mfe ctx e2,
adamc@387 199 fn e2' =>
adamc@387 200 (EBinop (s, e1', e2'), loc)))
adamc@387 201
adamc@26 202 | ERecord xes =>
adamc@29 203 S.map2 (ListUtil.mapfold (fn (x, e, t) =>
adamc@29 204 S.bind2 (mfe ctx e,
adamc@26 205 fn e' =>
adamc@29 206 S.map2 (mft t,
adamc@29 207 fn t' =>
adamc@29 208 (x, e', t'))))
adamc@26 209 xes,
adamc@26 210 fn xes' =>
adamc@26 211 (ERecord xes', loc))
adamc@26 212 | EField (e, x) =>
adamc@26 213 S.map2 (mfe ctx e,
adamc@26 214 fn e' =>
adamc@26 215 (EField (e', x), loc))
adamc@94 216
adamc@182 217 | ECase (e, pes, {disc, result}) =>
adamc@178 218 S.bind2 (mfe ctx e,
adamc@178 219 fn e' =>
adamc@178 220 S.bind2 (ListUtil.mapfold (fn (p, e) =>
adamc@179 221 let
adamc@179 222 fun pb ((p, _), ctx) =
adamc@179 223 case p of
adamc@179 224 PWild => ctx
adamc@182 225 | PVar (x, t) => bind (ctx, RelE (x, t))
adamc@179 226 | PPrim _ => ctx
adamc@188 227 | PCon (_, _, NONE) => ctx
adamc@188 228 | PCon (_, _, SOME p) => pb (p, ctx)
adamc@182 229 | PRecord xps => foldl (fn ((_, p, _), ctx) =>
adamc@179 230 pb (p, ctx)) ctx xps
adamc@288 231 | PNone _ => ctx
adamc@288 232 | PSome (_, p) => pb (p, ctx)
adamc@179 233 in
adamc@179 234 S.map2 (mfe (pb (p, ctx)) e,
adamc@179 235 fn e' => (p, e'))
adamc@179 236 end) pes,
adamc@178 237 fn pes' =>
adamc@182 238 S.bind2 (mft disc,
adamc@182 239 fn disc' =>
adamc@182 240 S.map2 (mft result,
adamc@182 241 fn result' =>
adamc@182 242 (ECase (e', pes', {disc = disc', result = result'}), loc)))))
adamc@178 243
adamc@283 244 | EError (e, t) =>
adamc@283 245 S.bind2 (mfe ctx e,
adamc@283 246 fn e' =>
adamc@283 247 S.map2 (mft t,
adamc@283 248 fn t' =>
adamc@283 249 (EError (e', t'), loc)))
adamc@283 250
adamc@94 251 | EStrcat (e1, e2) =>
adamc@94 252 S.bind2 (mfe ctx e1,
adamc@94 253 fn e1' =>
adamc@94 254 S.map2 (mfe ctx e2,
adamc@94 255 fn e2' =>
adamc@94 256 (EStrcat (e1', e2'), loc)))
adamc@102 257
adamc@102 258 | EWrite e =>
adamc@102 259 S.map2 (mfe ctx e,
adamc@102 260 fn e' =>
adamc@102 261 (EWrite e', loc))
adamc@106 262
adamc@106 263 | ESeq (e1, e2) =>
adamc@106 264 S.bind2 (mfe ctx e1,
adamc@106 265 fn e1' =>
adamc@106 266 S.map2 (mfe ctx e2,
adamc@106 267 fn e2' =>
adamc@106 268 (ESeq (e1', e2'), loc)))
adamc@251 269 | ELet (x, t, e1, e2) =>
adamc@251 270 S.bind2 (mft t,
adamc@251 271 fn t' =>
adamc@251 272 S.bind2 (mfe ctx e1,
adamc@251 273 fn e1' =>
adamc@252 274 S.map2 (mfe (bind (ctx, RelE (x, t'))) e2,
adamc@251 275 fn e2' =>
adamc@251 276 (ELet (x, t', e1', e2'), loc))))
adamc@111 277
adamc@111 278 | EClosure (n, es) =>
adamc@111 279 S.map2 (ListUtil.mapfold (mfe ctx) es,
adamc@111 280 fn es' =>
adamc@111 281 (EClosure (n, es'), loc))
adamc@252 282
adamc@252 283 | EQuery {exps, tables, state, query, body, initial} =>
adamc@252 284 S.bind2 (ListUtil.mapfold (fn (x, t) =>
adamc@252 285 S.map2 (mft t,
adamc@252 286 fn t' => (x, t'))) exps,
adamc@252 287 fn exps' =>
adamc@252 288 S.bind2 (ListUtil.mapfold (fn (x, xts) =>
adamc@252 289 S.map2 (ListUtil.mapfold
adamc@252 290 (fn (x, t) =>
adamc@252 291 S.map2 (mft t,
adamc@252 292 fn t' => (x, t'))) xts,
adamc@252 293 fn xts' => (x, xts'))) tables,
adamc@252 294 fn tables' =>
adamc@252 295 S.bind2 (mft state,
adamc@252 296 fn state' =>
adamc@252 297 S.bind2 (mfe ctx query,
adamc@252 298 fn query' =>
adamc@267 299 S.bind2 (mfe (bind (bind (ctx, RelE ("r", dummyt)),
adamc@267 300 RelE ("acc", dummyt)))
adamc@267 301 body,
adamc@267 302 fn body' =>
adamc@267 303 S.map2 (mfe ctx initial,
adamc@267 304 fn initial' =>
adamc@267 305 (EQuery {exps = exps',
adamc@267 306 tables = tables',
adamc@267 307 state = state',
adamc@267 308 query = query',
adamc@267 309 body = body',
adamc@267 310 initial = initial'},
adamc@267 311 loc)))))))
adamc@307 312
adamc@307 313 | EDml e =>
adamc@307 314 S.map2 (mfe ctx e,
adamc@307 315 fn e' =>
adamc@307 316 (EDml e', loc))
adamc@338 317 | ENextval e =>
adamc@338 318 S.map2 (mfe ctx e,
adamc@338 319 fn e' =>
adamc@338 320 (ENextval e', loc))
adamc@463 321 | EUnurlify (e, t) =>
adamc@463 322 S.bind2 (mfe ctx e,
adamc@463 323 fn e' =>
adamc@463 324 S.map2 (mft t,
adamc@463 325 fn t' =>
adamc@463 326 (EUnurlify (e', t'), loc)))
adamc@578 327 | EJavaScript (m, e, NONE) =>
adamc@566 328 S.map2 (mfe ctx e,
adamc@566 329 fn e' =>
adamc@578 330 (EJavaScript (m, e', NONE), loc))
adamc@578 331 | EJavaScript (m, e, SOME e2) =>
adamc@578 332 S.bind2 (mfe ctx e,
adamc@578 333 fn e' =>
adamc@578 334 S.map2 (mfe ctx e2,
adamc@578 335 fn e2' =>
adamc@578 336 (EJavaScript (m, e', SOME e2'), loc)))
adamc@569 337
adamc@568 338 | ESignalReturn e =>
adamc@568 339 S.map2 (mfe ctx e,
adamc@568 340 fn e' =>
adamc@568 341 (ESignalReturn e', loc))
adamc@572 342 | ESignalBind (e1, e2) =>
adamc@572 343 S.bind2 (mfe ctx e1,
adamc@572 344 fn e1' =>
adamc@572 345 S.map2 (mfe ctx e2,
adamc@572 346 fn e2' =>
adamc@572 347 (ESignalBind (e1', e2'), loc)))
adamc@574 348 | ESignalSource e =>
adamc@574 349 S.map2 (mfe ctx e,
adamc@574 350 fn e' =>
adamc@574 351 (ESignalSource e', loc))
adamc@608 352
adamc@614 353 | EServerCall (n, ek, t) =>
adamc@614 354 S.bind2 (mfe ctx ek,
adamc@614 355 fn ek' =>
adamc@614 356 S.map2 (mft t,
adamc@614 357 fn t' =>
adamc@614 358 (EServerCall (n, ek', t'), loc)))
adamc@26 359 in
adamc@26 360 mfe
adamc@26 361 end
adamc@26 362
adamc@26 363 fun mapfold {typ = fc, exp = fe} =
adamc@26 364 mapfoldB {typ = fc,
adamc@26 365 exp = fn () => fe,
adamc@26 366 bind = fn ((), _) => ()} ()
adamc@26 367
adamc@26 368 fun mapB {typ, exp, bind} ctx e =
adamc@26 369 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 370 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 371 bind = bind} ctx e () of
adamc@26 372 S.Continue (e, ()) => e
adamc@26 373 | S.Return _ => raise Fail "MonoUtil.Exp.mapB: Impossible"
adamc@26 374
adamc@26 375 fun map {typ, exp} e =
adamc@26 376 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 377 exp = fn e => fn () => S.Continue (exp e, ())} e () of
adamc@26 378 S.Return () => raise Fail "Mono_util.Exp.map"
adamc@26 379 | S.Continue (e, ()) => e
adamc@26 380
adamc@26 381 fun fold {typ, exp} s e =
adamc@26 382 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 383 exp = fn e => fn s => S.Continue (e, exp (e, s))} e s of
adamc@26 384 S.Continue (_, s) => s
adamc@26 385 | S.Return _ => raise Fail "MonoUtil.Exp.fold: Impossible"
adamc@26 386
adamc@26 387 fun exists {typ, exp} k =
adamc@26 388 case mapfold {typ = fn c => fn () =>
adamc@26 389 if typ c then
adamc@26 390 S.Return ()
adamc@26 391 else
adamc@26 392 S.Continue (c, ()),
adamc@26 393 exp = fn e => fn () =>
adamc@26 394 if exp e then
adamc@26 395 S.Return ()
adamc@26 396 else
adamc@26 397 S.Continue (e, ())} k () of
adamc@26 398 S.Return _ => true
adamc@26 399 | S.Continue _ => false
adamc@26 400
adamc@567 401 fun foldB {typ, exp, bind} ctx s e =
adamc@567 402 case mapfoldB {typ = fn t => fn s => S.Continue (t, typ (t, s)),
adamc@567 403 exp = fn ctx => fn e => fn s => S.Continue (e, exp (ctx, e, s)),
adamc@567 404 bind = bind} ctx e s of
adamc@567 405 S.Continue (_, s) => s
adamc@567 406 | S.Return _ => raise Fail "MonoUtil.Exp.foldB: Impossible"
adamc@567 407
adamc@26 408 end
adamc@26 409
adamc@26 410 structure Decl = struct
adamc@26 411
adamc@26 412 datatype binder = datatype Exp.binder
adamc@26 413
adamc@26 414 fun mapfoldB {typ = fc, exp = fe, decl = fd, bind} =
adamc@26 415 let
adamc@26 416 val mft = Typ.mapfold fc
adamc@26 417
adamc@26 418 val mfe = Exp.mapfoldB {typ = fc, exp = fe, bind = bind}
adamc@26 419
adamc@26 420 fun mfd ctx d acc =
adamc@26 421 S.bindP (mfd' ctx d acc, fd ctx)
adamc@26 422
adamc@26 423 and mfd' ctx (dAll as (d, loc)) =
adamc@26 424 case d of
adamc@164 425 DDatatype (x, n, xncs) =>
adamc@164 426 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@164 427 case c of
adamc@164 428 NONE => S.return2 (x, n, c)
adamc@164 429 | SOME c =>
adamc@164 430 S.map2 (mft c,
adamc@164 431 fn c' => (x, n, SOME c'))) xncs,
adamc@164 432 fn xncs' =>
adamc@164 433 (DDatatype (x, n, xncs'), loc))
adamc@164 434 | DVal vi =>
adamc@126 435 S.map2 (mfvi ctx vi,
adamc@126 436 fn vi' =>
adamc@126 437 (DVal vi', loc))
adamc@126 438 | DValRec vis =>
adamc@196 439 let
adamc@196 440 val ctx' = foldl (fn ((x, n, t, _, s), ctx') => bind (ctx', NamedE (x, n, t, NONE, s))) ctx vis
adamc@196 441 in
adamc@196 442 S.map2 (ListUtil.mapfold (mfvi ctx') vis,
adamc@196 443 fn vis' =>
adamc@196 444 (DValRec vis', loc))
adamc@196 445 end
adamc@609 446 | DExport (ek, s, n, ts, t) =>
adamc@609 447 S.bind2 (ListUtil.mapfold mft ts,
adamc@120 448 fn ts' =>
adamc@609 449 S.map2 (mft t,
adamc@609 450 fn t' =>
adamc@609 451 (DExport (ek, s, n, ts', t'), loc)))
adamc@273 452 | DTable _ => S.return2 dAll
adamc@338 453 | DSequence _ => S.return2 dAll
adamc@271 454 | DDatabase _ => S.return2 dAll
adamc@569 455 | DJavaScript _ => S.return2 dAll
adamc@126 456
adamc@126 457 and mfvi ctx (x, n, t, e, s) =
adamc@126 458 S.bind2 (mft t,
adamc@126 459 fn t' =>
adamc@126 460 S.map2 (mfe ctx e,
adamc@126 461 fn e' =>
adamc@126 462 (x, n, t', e', s)))
adamc@26 463 in
adamc@26 464 mfd
adamc@26 465 end
adamc@26 466
adamc@26 467 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 468 mapfoldB {typ = fc,
adamc@26 469 exp = fn () => fe,
adamc@26 470 decl = fn () => fd,
adamc@26 471 bind = fn ((), _) => ()} ()
adamc@26 472
adamc@26 473 fun fold {typ, exp, decl} s d =
adamc@26 474 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 475 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 476 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 477 S.Continue (_, s) => s
adamc@26 478 | S.Return _ => raise Fail "MonoUtil.Decl.fold: Impossible"
adamc@26 479
adamc@506 480 fun map {typ, exp, decl} e =
adamc@506 481 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@506 482 exp = fn e => fn () => S.Continue (exp e, ()),
adamc@506 483 decl = fn d => fn () => S.Continue (decl d, ())} e () of
adamc@506 484 S.Return () => raise Fail "MonoUtil.Decl.map: Impossible"
adamc@506 485 | S.Continue (e, ()) => e
adamc@506 486
adamc@567 487 fun foldMapB {typ, exp, decl, bind} ctx s d =
adamc@567 488 case mapfoldB {typ = fn c => fn s => S.Continue (typ (c, s)),
adamc@567 489 exp = fn ctx => fn e => fn s => S.Continue (exp (ctx, e, s)),
adamc@567 490 decl = fn ctx => fn d => fn s => S.Continue (decl (ctx, d, s)),
adamc@567 491 bind = bind} ctx d s of
adamc@567 492 S.Continue v => v
adamc@567 493 | S.Return _ => raise Fail "MonoUtil.Decl.foldMapB: Impossible"
adamc@567 494
adamc@26 495 end
adamc@26 496
adamc@26 497 structure File = struct
adamc@26 498
adamc@26 499 datatype binder = datatype Exp.binder
adamc@26 500
adamc@26 501 fun mapfoldB (all as {bind, ...}) =
adamc@26 502 let
adamc@26 503 val mfd = Decl.mapfoldB all
adamc@26 504
adamc@26 505 fun mff ctx ds =
adamc@26 506 case ds of
adamc@26 507 nil => S.return2 nil
adamc@26 508 | d :: ds' =>
adamc@26 509 S.bind2 (mfd ctx d,
adamc@26 510 fn d' =>
adamc@26 511 let
adamc@100 512 val ctx' =
adamc@26 513 case #1 d' of
adamc@164 514 DDatatype (x, n, xncs) =>
adamc@164 515 let
adamc@168 516 val ctx = bind (ctx, Datatype (x, n, xncs))
adamc@198 517 val t = (TDatatype (n, ref (ElabUtil.classifyDatatype xncs, xncs)), #2 d')
adamc@164 518 in
adamc@164 519 foldl (fn ((x, n, to), ctx) =>
adamc@164 520 let
adamc@164 521 val t = case to of
adamc@164 522 NONE => t
adamc@164 523 | SOME t' => (TFun (t', t), #2 d')
adamc@164 524 in
adamc@164 525 bind (ctx, NamedE (x, n, t, NONE, ""))
adamc@164 526 end)
adamc@164 527 ctx xncs
adamc@164 528 end
adamc@164 529 | DVal (x, n, t, e, s) => bind (ctx, NamedE (x, n, t, SOME e, s))
adamc@126 530 | DValRec vis => foldl (fn ((x, n, t, e, s), ctx) =>
adamc@196 531 bind (ctx, NamedE (x, n, t, NONE, s))) ctx vis
adamc@109 532 | DExport _ => ctx
adamc@273 533 | DTable _ => ctx
adamc@338 534 | DSequence _ => ctx
adamc@271 535 | DDatabase _ => ctx
adamc@569 536 | DJavaScript _ => ctx
adamc@26 537 in
adamc@26 538 S.map2 (mff ctx' ds',
adamc@26 539 fn ds' =>
adamc@26 540 d' :: ds')
adamc@26 541 end)
adamc@26 542 in
adamc@26 543 mff
adamc@26 544 end
adamc@26 545
adamc@26 546 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 547 mapfoldB {typ = fc,
adamc@26 548 exp = fn () => fe,
adamc@26 549 decl = fn () => fd,
adamc@26 550 bind = fn ((), _) => ()} ()
adamc@26 551
adamc@26 552 fun mapB {typ, exp, decl, bind} ctx ds =
adamc@26 553 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 554 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 555 decl = fn ctx => fn d => fn () => S.Continue (decl ctx d, ()),
adamc@26 556 bind = bind} ctx ds () of
adamc@26 557 S.Continue (ds, ()) => ds
adamc@26 558 | S.Return _ => raise Fail "MonoUtil.File.mapB: Impossible"
adamc@26 559
adamc@96 560 fun map {typ, exp, decl} e =
adamc@96 561 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@96 562 exp = fn e => fn () => S.Continue (exp e, ()),
adamc@96 563 decl = fn d => fn () => S.Continue (decl d, ())} e () of
adamc@506 564 S.Return () => raise Fail "MonoUtil.File.map: Impossible"
adamc@96 565 | S.Continue (e, ()) => e
adamc@96 566
adamc@26 567 fun fold {typ, exp, decl} s d =
adamc@26 568 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 569 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 570 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 571 S.Continue (_, s) => s
adamc@26 572 | S.Return _ => raise Fail "MonoUtil.File.fold: Impossible"
adamc@26 573
adamc@506 574 val maxName = foldl (fn ((d, _) : decl, count) =>
adamc@506 575 case d of
adamc@506 576 DDatatype (_, n, ns) =>
adamc@506 577 foldl (fn ((_, n', _), m) => Int.max (n', m))
adamc@506 578 (Int.max (n, count)) ns
adamc@506 579 | DVal (_, n, _, _, _) => Int.max (n, count)
adamc@506 580 | DValRec vis => foldl (fn ((_, n, _, _, _), count) => Int.max (n, count)) count vis
adamc@506 581 | DExport _ => count
adamc@506 582 | DTable _ => count
adamc@506 583 | DSequence _ => count
adamc@569 584 | DDatabase _ => count
adamc@569 585 | DJavaScript _ => count) 0
adamc@506 586
adamc@26 587 end
adamc@26 588
adamc@26 589 end