Mercurial > urweb

annotate src/core_util.sml @ 88:7bab29834cd6

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