Mercurial > urweb

annotate src/core_util.sml @ 23:bfa2e9ae4df8

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Tree-shaking
author Adam Chlipala <adamc@hcoop.net>
date Sun, 08 Jun 2008 17:15:09 -0400
parents 067029c748e9
children 4ab19c19665f
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 CoreUtil :> CORE_UTIL = struct
adamc@16 29
adamc@16 30 open Core
adamc@16 31
adamc@16 32 structure S = Search
adamc@16 33
adamc@16 34 structure Kind = struct
adamc@16 35
adamc@16 36 fun mapfold f =
adamc@16 37 let
adamc@16 38 fun mfk k acc =
adamc@16 39 S.bindP (mfk' k acc, f)
adamc@16 40
adamc@16 41 and mfk' (kAll as (k, loc)) =
adamc@16 42 case k of
adamc@16 43 KType => S.return2 kAll
adamc@16 44
adamc@16 45 | KArrow (k1, k2) =>
adamc@16 46 S.bind2 (mfk k1,
adamc@16 47 fn k1' =>
adamc@16 48 S.map2 (mfk k2,
adamc@16 49 fn k2' =>
adamc@16 50 (KArrow (k1', k2'), loc)))
adamc@16 51
adamc@16 52 | KName => S.return2 kAll
adamc@16 53
adamc@16 54 | KRecord k =>
adamc@16 55 S.map2 (mfk k,
adamc@16 56 fn k' =>
adamc@16 57 (KRecord k', loc))
adamc@16 58 in
adamc@16 59 mfk
adamc@16 60 end
adamc@16 61
adamc@16 62 fun map f k =
adamc@16 63 case mapfold (fn k => fn () => S.Continue (f k, ())) k () of
adamc@16 64 S.Return () => raise Fail "Core_util.Kind.map"
adamc@16 65 | S.Continue (k, ()) => k
adamc@16 66
adamc@16 67 fun exists f k =
adamc@16 68 case mapfold (fn k => fn () =>
adamc@16 69 if f k then
adamc@16 70 S.Return ()
adamc@16 71 else
adamc@16 72 S.Continue (k, ())) k () of
adamc@16 73 S.Return _ => true
adamc@16 74 | S.Continue _ => false
adamc@16 75
adamc@16 76 end
adamc@16 77
adamc@16 78 structure Con = struct
adamc@16 79
adamc@16 80 datatype binder =
adamc@16 81 Rel of string * kind
adamc@20 82 | Named of string * int * kind * con option
adamc@16 83
adamc@16 84 fun mapfoldB {kind = fk, con = fc, bind} =
adamc@16 85 let
adamc@16 86 val mfk = Kind.mapfold fk
adamc@16 87
adamc@16 88 fun mfc ctx c acc =
adamc@16 89 S.bindP (mfc' ctx c acc, fc ctx)
adamc@16 90
adamc@16 91 and mfc' ctx (cAll as (c, loc)) =
adamc@16 92 case c of
adamc@16 93 TFun (c1, c2) =>
adamc@16 94 S.bind2 (mfc ctx c1,
adamc@16 95 fn c1' =>
adamc@16 96 S.map2 (mfc ctx c2,
adamc@16 97 fn c2' =>
adamc@16 98 (TFun (c1', c2'), loc)))
adamc@16 99 | TCFun (x, k, c) =>
adamc@16 100 S.bind2 (mfk k,
adamc@16 101 fn k' =>
adamc@16 102 S.map2 (mfc (bind (ctx, Rel (x, k))) c,
adamc@16 103 fn c' =>
adamc@16 104 (TCFun (x, k', c'), loc)))
adamc@16 105 | TRecord c =>
adamc@16 106 S.map2 (mfc ctx c,
adamc@16 107 fn c' =>
adamc@16 108 (TRecord c', loc))
adamc@16 109
adamc@16 110 | CRel _ => S.return2 cAll
adamc@16 111 | CNamed _ => S.return2 cAll
adamc@16 112 | CApp (c1, c2) =>
adamc@16 113 S.bind2 (mfc ctx c1,
adamc@16 114 fn c1' =>
adamc@16 115 S.map2 (mfc ctx c2,
adamc@16 116 fn c2' =>
adamc@16 117 (CApp (c1', c2'), loc)))
adamc@16 118 | CAbs (x, k, c) =>
adamc@16 119 S.bind2 (mfk k,
adamc@16 120 fn k' =>
adamc@16 121 S.map2 (mfc (bind (ctx, Rel (x, k))) c,
adamc@16 122 fn c' =>
adamc@16 123 (CAbs (x, k', c'), loc)))
adamc@16 124
adamc@16 125 | CName _ => S.return2 cAll
adamc@16 126
adamc@16 127 | CRecord (k, xcs) =>
adamc@16 128 S.bind2 (mfk k,
adamc@16 129 fn k' =>
adamc@16 130 S.map2 (ListUtil.mapfold (fn (x, c) =>
adamc@16 131 S.bind2 (mfc ctx x,
adamc@16 132 fn x' =>
adamc@16 133 S.map2 (mfc ctx c,
adamc@16 134 fn c' =>
adamc@16 135 (x', c'))))
adamc@16 136 xcs,
adamc@16 137 fn xcs' =>
adamc@16 138 (CRecord (k', xcs'), loc)))
adamc@16 139 | CConcat (c1, c2) =>
adamc@16 140 S.bind2 (mfc ctx c1,
adamc@16 141 fn c1' =>
adamc@16 142 S.map2 (mfc ctx c2,
adamc@16 143 fn c2' =>
adamc@16 144 (CConcat (c1', c2'), loc)))
adamc@16 145 in
adamc@16 146 mfc
adamc@16 147 end
adamc@16 148
adamc@16 149 fun mapfold {kind = fk, con = fc} =
adamc@16 150 mapfoldB {kind = fk,
adamc@16 151 con = fn () => fc,
adamc@16 152 bind = fn ((), _) => ()} ()
adamc@16 153
adamc@16 154 fun map {kind, con} c =
adamc@16 155 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@16 156 con = fn c => fn () => S.Continue (con c, ())} c () of
adamc@16 157 S.Return () => raise Fail "Core_util.Con.map"
adamc@16 158 | S.Continue (c, ()) => c
adamc@16 159
adamc@16 160 fun mapB {kind, con, bind} ctx c =
adamc@16 161 case mapfoldB {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@16 162 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@16 163 bind = bind} ctx c () of
adamc@16 164 S.Continue (c, ()) => c
adamc@20 165 | S.Return _ => raise Fail "CoreUtil.Con.mapB: Impossible"
adamc@16 166
adamc@23 167 fun fold {kind, con} s c =
adamc@23 168 case mapfold {kind = fn k => fn s => S.Continue (k, kind (k, s)),
adamc@23 169 con = fn c => fn s => S.Continue (c, con (c, s))} c s of
adamc@23 170 S.Continue (_, s) => s
adamc@23 171 | S.Return _ => raise Fail "CoreUtil.Con.fold: Impossible"
adamc@23 172
adamc@16 173 fun exists {kind, con} k =
adamc@16 174 case mapfold {kind = fn k => fn () =>
adamc@16 175 if kind k then
adamc@16 176 S.Return ()
adamc@16 177 else
adamc@16 178 S.Continue (k, ()),
adamc@16 179 con = fn c => fn () =>
adamc@16 180 if con c then
adamc@16 181 S.Return ()
adamc@16 182 else
adamc@16 183 S.Continue (c, ())} k () of
adamc@16 184 S.Return _ => true
adamc@16 185 | S.Continue _ => false
adamc@16 186
adamc@16 187 end
adamc@16 188
adamc@16 189 structure Exp = struct
adamc@16 190
adamc@16 191 datatype binder =
adamc@16 192 RelC of string * kind
adamc@20 193 | NamedC of string * int * kind * con option
adamc@16 194 | RelE of string * con
adamc@20 195 | NamedE of string * int * con * exp option
adamc@16 196
adamc@16 197 fun mapfoldB {kind = fk, con = fc, exp = fe, bind} =
adamc@16 198 let
adamc@16 199 val mfk = Kind.mapfold fk
adamc@16 200
adamc@16 201 fun bind' (ctx, b) =
adamc@16 202 let
adamc@16 203 val b' = case b of
adamc@16 204 Con.Rel x => RelC x
adamc@16 205 | Con.Named x => NamedC x
adamc@16 206 in
adamc@16 207 bind (ctx, b')
adamc@16 208 end
adamc@16 209 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@16 210
adamc@16 211 fun mfe ctx e acc =
adamc@16 212 S.bindP (mfe' ctx e acc, fe ctx)
adamc@16 213
adamc@16 214 and mfe' ctx (eAll as (e, loc)) =
adamc@16 215 case e of
adamc@16 216 EPrim _ => S.return2 eAll
adamc@16 217 | ERel _ => S.return2 eAll
adamc@16 218 | ENamed _ => S.return2 eAll
adamc@16 219 | EApp (e1, e2) =>
adamc@16 220 S.bind2 (mfe ctx e1,
adamc@16 221 fn e1' =>
adamc@16 222 S.map2 (mfe ctx e2,
adamc@16 223 fn e2' =>
adamc@16 224 (EApp (e1', e2'), loc)))
adamc@16 225 | EAbs (x, t, e) =>
adamc@16 226 S.bind2 (mfc ctx t,
adamc@16 227 fn t' =>
adamc@16 228 S.map2 (mfe (bind (ctx, RelE (x, t))) e,
adamc@16 229 fn e' =>
adamc@16 230 (EAbs (x, t', e'), loc)))
adamc@16 231
adamc@16 232 | ECApp (e, c) =>
adamc@16 233 S.bind2 (mfe ctx e,
adamc@16 234 fn e' =>
adamc@16 235 S.map2 (mfc ctx c,
adamc@16 236 fn c' =>
adamc@16 237 (ECApp (e', c'), loc)))
adamc@16 238 | ECAbs (x, k, e) =>
adamc@16 239 S.bind2 (mfk k,
adamc@16 240 fn k' =>
adamc@16 241 S.map2 (mfe (bind (ctx, RelC (x, k))) e,
adamc@16 242 fn e' =>
adamc@16 243 (ECAbs (x, k', e'), loc)))
adamc@16 244
adamc@16 245 | ERecord xes =>
adamc@16 246 S.map2 (ListUtil.mapfold (fn (x, e) =>
adamc@16 247 S.bind2 (mfc ctx x,
adamc@16 248 fn x' =>
adamc@16 249 S.map2 (mfe ctx e,
adamc@16 250 fn e' =>
adamc@16 251 (x', e'))))
adamc@16 252 xes,
adamc@16 253 fn xes' =>
adamc@16 254 (ERecord xes', loc))
adamc@16 255 | EField (e, c, {field, rest}) =>
adamc@16 256 S.bind2 (mfe ctx e,
adamc@16 257 fn e' =>
adamc@16 258 S.bind2 (mfc ctx c,
adamc@16 259 fn c' =>
adamc@16 260 S.bind2 (mfc ctx field,
adamc@16 261 fn field' =>
adamc@16 262 S.map2 (mfc ctx rest,
adamc@16 263 fn rest' =>
adamc@16 264 (EField (e', c', {field = field', rest = rest'}), loc)))))
adamc@16 265 in
adamc@16 266 mfe
adamc@16 267 end
adamc@16 268
adamc@16 269 fun mapfold {kind = fk, con = fc, exp = fe} =
adamc@16 270 mapfoldB {kind = fk,
adamc@16 271 con = fn () => fc,
adamc@16 272 exp = fn () => fe,
adamc@16 273 bind = fn ((), _) => ()} ()
adamc@16 274
adamc@21 275 fun mapB {kind, con, exp, bind} ctx e =
adamc@21 276 case mapfoldB {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@21 277 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@21 278 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@21 279 bind = bind} ctx e () of
adamc@21 280 S.Continue (e, ()) => e
adamc@21 281 | S.Return _ => raise Fail "CoreUtil.Exp.mapB: Impossible"
adamc@21 282
adamc@16 283 fun map {kind, con, exp} e =
adamc@16 284 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@16 285 con = fn c => fn () => S.Continue (con c, ()),
adamc@16 286 exp = fn e => fn () => S.Continue (exp e, ())} e () of
adamc@16 287 S.Return () => raise Fail "Core_util.Exp.map"
adamc@16 288 | S.Continue (e, ()) => e
adamc@16 289
adamc@23 290 fun fold {kind, con, exp} s e =
adamc@23 291 case mapfold {kind = fn k => fn s => S.Continue (k, kind (k, s)),
adamc@23 292 con = fn c => fn s => S.Continue (c, con (c, s)),
adamc@23 293 exp = fn e => fn s => S.Continue (e, exp (e, s))} e s of
adamc@23 294 S.Continue (_, s) => s
adamc@23 295 | S.Return _ => raise Fail "CoreUtil.Exp.fold: Impossible"
adamc@23 296
adamc@16 297 fun exists {kind, con, exp} k =
adamc@16 298 case mapfold {kind = fn k => fn () =>
adamc@16 299 if kind k then
adamc@16 300 S.Return ()
adamc@16 301 else
adamc@16 302 S.Continue (k, ()),
adamc@16 303 con = fn c => fn () =>
adamc@16 304 if con c then
adamc@16 305 S.Return ()
adamc@16 306 else
adamc@16 307 S.Continue (c, ()),
adamc@16 308 exp = fn e => fn () =>
adamc@16 309 if exp e then
adamc@16 310 S.Return ()
adamc@16 311 else
adamc@16 312 S.Continue (e, ())} k () of
adamc@16 313 S.Return _ => true
adamc@16 314 | S.Continue _ => false
adamc@16 315
adamc@16 316 end
adamc@16 317
adamc@20 318 structure Decl = struct
adamc@20 319
adamc@20 320 datatype binder = datatype Exp.binder
adamc@20 321
adamc@20 322 fun mapfoldB {kind = fk, con = fc, exp = fe, decl = fd, bind} =
adamc@20 323 let
adamc@20 324 val mfk = Kind.mapfold fk
adamc@20 325
adamc@20 326 fun bind' (ctx, b) =
adamc@20 327 let
adamc@20 328 val b' = case b of
adamc@20 329 Con.Rel x => RelC x
adamc@20 330 | Con.Named x => NamedC x
adamc@20 331 in
adamc@20 332 bind (ctx, b')
adamc@20 333 end
adamc@20 334 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@20 335
adamc@20 336 val mfe = Exp.mapfoldB {kind = fk, con = fc, exp = fe, bind = bind}
adamc@20 337
adamc@20 338 fun mfd ctx d acc =
adamc@20 339 S.bindP (mfd' ctx d acc, fd ctx)
adamc@20 340
adamc@20 341 and mfd' ctx (dAll as (d, loc)) =
adamc@20 342 case d of
adamc@20 343 DCon (x, n, k, c) =>
adamc@20 344 S.bind2 (mfk k,
adamc@20 345 fn k' =>
adamc@20 346 S.map2 (mfc ctx c,
adamc@20 347 fn c' =>
adamc@20 348 (DCon (x, n, k', c'), loc)))
adamc@20 349 | DVal (x, n, t, e) =>
adamc@20 350 S.bind2 (mfc ctx t,
adamc@20 351 fn t' =>
adamc@20 352 S.map2 (mfe ctx e,
adamc@20 353 fn e' =>
adamc@20 354 (DVal (x, n, t', e'), loc)))
adamc@20 355 in
adamc@20 356 mfd
adamc@20 357 end
adamc@20 358
adamc@23 359 fun mapfold {kind = fk, con = fc, exp = fe, decl = fd} =
adamc@23 360 mapfoldB {kind = fk,
adamc@23 361 con = fn () => fc,
adamc@23 362 exp = fn () => fe,
adamc@23 363 decl = fn () => fd,
adamc@23 364 bind = fn ((), _) => ()} ()
adamc@23 365
adamc@23 366 fun fold {kind, con, exp, decl} s d =
adamc@23 367 case mapfold {kind = fn k => fn s => S.Continue (k, kind (k, s)),
adamc@23 368 con = fn c => fn s => S.Continue (c, con (c, s)),
adamc@23 369 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@23 370 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@23 371 S.Continue (_, s) => s
adamc@23 372 | S.Return _ => raise Fail "CoreUtil.Decl.fold: Impossible"
adamc@23 373
adamc@16 374 end
adamc@20 375
adamc@20 376 structure File = struct
adamc@20 377
adamc@20 378 datatype binder = datatype Exp.binder
adamc@20 379
adamc@20 380 fun mapfoldB (all as {bind, ...}) =
adamc@20 381 let
adamc@20 382 val mfd = Decl.mapfoldB all
adamc@20 383
adamc@20 384 fun mff ctx ds =
adamc@20 385 case ds of
adamc@20 386 nil => S.return2 nil
adamc@20 387 | d :: ds' =>
adamc@20 388 S.bind2 (mfd ctx d,
adamc@20 389 fn d' =>
adamc@20 390 let
adamc@20 391 val b =
adamc@20 392 case #1 d' of
adamc@20 393 DCon (x, n, k, c) => NamedC (x, n, k, SOME c)
adamc@20 394 | DVal (x, n, t, e) => NamedE (x, n, t, SOME e)
adamc@20 395 val ctx' = bind (ctx, b)
adamc@20 396 in
adamc@20 397 S.map2 (mff ctx' ds',
adamc@20 398 fn ds' =>
adamc@20 399 d' :: ds')
adamc@20 400 end)
adamc@20 401 in
adamc@20 402 mff
adamc@20 403 end
adamc@20 404
adamc@23 405 fun mapfold {kind = fk, con = fc, exp = fe, decl = fd} =
adamc@23 406 mapfoldB {kind = fk,
adamc@23 407 con = fn () => fc,
adamc@23 408 exp = fn () => fe,
adamc@23 409 decl = fn () => fd,
adamc@23 410 bind = fn ((), _) => ()} ()
adamc@23 411
adamc@20 412 fun mapB {kind, con, exp, decl, bind} ctx ds =
adamc@20 413 case mapfoldB {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@20 414 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@20 415 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@20 416 decl = fn ctx => fn d => fn () => S.Continue (decl ctx d, ()),
adamc@20 417 bind = bind} ctx ds () of
adamc@20 418 S.Continue (ds, ()) => ds
adamc@20 419 | S.Return _ => raise Fail "CoreUtil.File.mapB: Impossible"
adamc@20 420
adamc@23 421 fun fold {kind, con, exp, decl} s d =
adamc@23 422 case mapfold {kind = fn k => fn s => S.Continue (k, kind (k, s)),
adamc@23 423 con = fn c => fn s => S.Continue (c, con (c, s)),
adamc@23 424 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@23 425 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@23 426 S.Continue (_, s) => s
adamc@23 427 | S.Return _ => raise Fail "CoreUtil.File.fold: Impossible"
adamc@23 428
adamc@20 429 end
adamc@20 430
adamc@20 431 end