Mercurial > urweb

annotate src/elab_util.sml @ 82:b4f2a258e52c

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Initial disjointness prover
author Adam Chlipala <adamc@hcoop.net>
date Tue, 01 Jul 2008 10:55:38 -0400
parents 522f4bd3955e
children e86370850c30
rev   line source
adamc@2 1 (* Copyright (c) 2008, Adam Chlipala
adamc@2 2 * All rights reserved.
adamc@2 3 *
adamc@2 4 * Redistribution and use in source and binary forms, with or without
adamc@2 5 * modification, are permitted provided that the following conditions are met:
adamc@2 6 *
adamc@2 7 * - Redistributions of source code must retain the above copyright notice,
adamc@2 8 * this list of conditions and the following disclaimer.
adamc@2 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@2 10 * this list of conditions and the following disclaimer in the documentation
adamc@2 11 * and/or other materials provided with the distribution.
adamc@2 12 * - The names of contributors may not be used to endorse or promote products
adamc@2 13 * derived from this software without specific prior written permission.
adamc@2 14 *
adamc@2 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@2 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@2 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@2 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@2 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@2 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@2 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@2 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@2 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@2 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@2 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@2 26 *)
adamc@2 27
adamc@2 28 structure ElabUtil :> ELAB_UTIL = struct
adamc@2 29
adamc@2 30 open Elab
adamc@2 31
adamc@2 32 structure S = Search
adamc@2 33
adamc@2 34 structure Kind = struct
adamc@2 35
adamc@6 36 fun mapfold f =
adamc@2 37 let
adamc@2 38 fun mfk k acc =
adamc@2 39 S.bindP (mfk' k acc, f)
adamc@2 40
adamc@2 41 and mfk' (kAll as (k, loc)) =
adamc@2 42 case k of
adamc@2 43 KType => S.return2 kAll
adamc@2 44
adamc@2 45 | KArrow (k1, k2) =>
adamc@2 46 S.bind2 (mfk k1,
adamc@2 47 fn k1' =>
adamc@2 48 S.map2 (mfk k2,
adamc@2 49 fn k2' =>
adamc@2 50 (KArrow (k1', k2'), loc)))
adamc@2 51
adamc@2 52 | KName => S.return2 kAll
adamc@2 53
adamc@2 54 | KRecord k =>
adamc@2 55 S.map2 (mfk k,
adamc@2 56 fn k' =>
adamc@2 57 (KRecord k', loc))
adamc@2 58
adamc@82 59 | KUnit => S.return2 kAll
adamc@82 60
adamc@2 61 | KError => S.return2 kAll
adamc@2 62
adamc@76 63 | KUnif (_, _, ref (SOME k)) => mfk' k
adamc@2 64 | KUnif _ => S.return2 kAll
adamc@2 65 in
adamc@2 66 mfk
adamc@2 67 end
adamc@2 68
adamc@2 69 fun exists f k =
adamc@6 70 case mapfold (fn k => fn () =>
adamc@6 71 if f k then
adamc@6 72 S.Return ()
adamc@6 73 else
adamc@6 74 S.Continue (k, ())) k () of
adamc@6 75 S.Return _ => true
adamc@6 76 | S.Continue _ => false
adamc@6 77
adamc@6 78 end
adamc@6 79
adamc@6 80 structure Con = struct
adamc@6 81
adamc@11 82 datatype binder =
adamc@11 83 Rel of string * Elab.kind
adamc@11 84 | Named of string * Elab.kind
adamc@11 85
adamc@11 86 fun mapfoldB {kind = fk, con = fc, bind} =
adamc@6 87 let
adamc@6 88 val mfk = Kind.mapfold fk
adamc@6 89
adamc@11 90 fun mfc ctx c acc =
adamc@11 91 S.bindP (mfc' ctx c acc, fc ctx)
adamc@6 92
adamc@11 93 and mfc' ctx (cAll as (c, loc)) =
adamc@6 94 case c of
adamc@6 95 TFun (c1, c2) =>
adamc@11 96 S.bind2 (mfc ctx c1,
adamc@6 97 fn c1' =>
adamc@11 98 S.map2 (mfc ctx c2,
adamc@6 99 fn c2' =>
adamc@6 100 (TFun (c1', c2'), loc)))
adamc@6 101 | TCFun (e, x, k, c) =>
adamc@6 102 S.bind2 (mfk k,
adamc@6 103 fn k' =>
adamc@11 104 S.map2 (mfc (bind (ctx, Rel (x, k))) c,
adamc@6 105 fn c' =>
adamc@6 106 (TCFun (e, x, k', c'), loc)))
adamc@6 107 | TRecord c =>
adamc@11 108 S.map2 (mfc ctx c,
adamc@6 109 fn c' =>
adamc@6 110 (TRecord c', loc))
adamc@6 111
adamc@6 112 | CRel _ => S.return2 cAll
adamc@6 113 | CNamed _ => S.return2 cAll
adamc@34 114 | CModProj _ => S.return2 cAll
adamc@6 115 | CApp (c1, c2) =>
adamc@11 116 S.bind2 (mfc ctx c1,
adamc@6 117 fn c1' =>
adamc@11 118 S.map2 (mfc ctx c2,
adamc@6 119 fn c2' =>
adamc@6 120 (CApp (c1', c2'), loc)))
adamc@8 121 | CAbs (x, k, c) =>
adamc@6 122 S.bind2 (mfk k,
adamc@6 123 fn k' =>
adamc@11 124 S.map2 (mfc (bind (ctx, Rel (x, k))) c,
adamc@6 125 fn c' =>
adamc@8 126 (CAbs (x, k', c'), loc)))
adamc@6 127
adamc@6 128 | CName _ => S.return2 cAll
adamc@6 129
adamc@6 130 | CRecord (k, xcs) =>
adamc@6 131 S.bind2 (mfk k,
adamc@6 132 fn k' =>
adamc@6 133 S.map2 (ListUtil.mapfold (fn (x, c) =>
adamc@11 134 S.bind2 (mfc ctx x,
adamc@6 135 fn x' =>
adamc@11 136 S.map2 (mfc ctx c,
adamc@6 137 fn c' =>
adamc@6 138 (x', c'))))
adamc@6 139 xcs,
adamc@6 140 fn xcs' =>
adamc@6 141 (CRecord (k', xcs'), loc)))
adamc@6 142 | CConcat (c1, c2) =>
adamc@11 143 S.bind2 (mfc ctx c1,
adamc@6 144 fn c1' =>
adamc@11 145 S.map2 (mfc ctx c2,
adamc@6 146 fn c2' =>
adamc@6 147 (CConcat (c1', c2'), loc)))
adamc@67 148 | CFold (k1, k2) =>
adamc@67 149 S.bind2 (mfk k1,
adamc@67 150 fn k1' =>
adamc@67 151 S.map2 (mfk k2,
adamc@67 152 fn k2' =>
adamc@67 153 (CFold (k1', k2'), loc)))
adamc@6 154
adamc@82 155 | CUnit => S.return2 cAll
adamc@82 156
adamc@6 157 | CError => S.return2 cAll
adamc@76 158 | CUnif (_, _, _, ref (SOME c)) => mfc' ctx c
adamc@6 159 | CUnif _ => S.return2 cAll
adamc@6 160 in
adamc@6 161 mfc
adamc@6 162 end
adamc@6 163
adamc@11 164 fun mapfold {kind = fk, con = fc} =
adamc@11 165 mapfoldB {kind = fk,
adamc@11 166 con = fn () => fc,
adamc@11 167 bind = fn ((), _) => ()} ()
adamc@11 168
adamc@11 169 fun mapB {kind, con, bind} ctx c =
adamc@11 170 case mapfoldB {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@11 171 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@11 172 bind = bind} ctx c () of
adamc@11 173 S.Continue (c, ()) => c
adamc@34 174 | S.Return _ => raise Fail "ElabUtil.Con.mapB: Impossible"
adamc@34 175
adamc@34 176 fun map {kind, con} s =
adamc@34 177 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@34 178 con = fn c => fn () => S.Continue (con c, ())} s () of
adamc@34 179 S.Return () => raise Fail "ElabUtil.Con.map: Impossible"
adamc@34 180 | S.Continue (s, ()) => s
adamc@11 181
adamc@6 182 fun exists {kind, con} k =
adamc@6 183 case mapfold {kind = fn k => fn () =>
adamc@6 184 if kind k then
adamc@6 185 S.Return ()
adamc@6 186 else
adamc@6 187 S.Continue (k, ()),
adamc@6 188 con = fn c => fn () =>
adamc@6 189 if con c then
adamc@6 190 S.Return ()
adamc@6 191 else
adamc@6 192 S.Continue (c, ())} k () of
adamc@2 193 S.Return _ => true
adamc@2 194 | S.Continue _ => false
adamc@2 195
adamc@2 196 end
adamc@2 197
adamc@10 198 structure Exp = struct
adamc@10 199
adamc@11 200 datatype binder =
adamc@11 201 RelC of string * Elab.kind
adamc@11 202 | NamedC of string * Elab.kind
adamc@11 203 | RelE of string * Elab.con
adamc@11 204 | NamedE of string * Elab.con
adamc@11 205
adamc@11 206 fun mapfoldB {kind = fk, con = fc, exp = fe, bind} =
adamc@10 207 let
adamc@10 208 val mfk = Kind.mapfold fk
adamc@10 209
adamc@11 210 fun bind' (ctx, b) =
adamc@11 211 let
adamc@11 212 val b' = case b of
adamc@11 213 Con.Rel x => RelC x
adamc@11 214 | Con.Named x => NamedC x
adamc@11 215 in
adamc@11 216 bind (ctx, b')
adamc@11 217 end
adamc@11 218 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@10 219
adamc@11 220 fun mfe ctx e acc =
adamc@11 221 S.bindP (mfe' ctx e acc, fe ctx)
adamc@11 222
adamc@11 223 and mfe' ctx (eAll as (e, loc)) =
adamc@10 224 case e of
adamc@14 225 EPrim _ => S.return2 eAll
adamc@14 226 | ERel _ => S.return2 eAll
adamc@10 227 | ENamed _ => S.return2 eAll
adamc@34 228 | EModProj _ => S.return2 eAll
adamc@10 229 | EApp (e1, e2) =>
adamc@11 230 S.bind2 (mfe ctx e1,
adamc@10 231 fn e1' =>
adamc@11 232 S.map2 (mfe ctx e2,
adamc@10 233 fn e2' =>
adamc@10 234 (EApp (e1', e2'), loc)))
adamc@26 235 | EAbs (x, dom, ran, e) =>
adamc@26 236 S.bind2 (mfc ctx dom,
adamc@26 237 fn dom' =>
adamc@26 238 S.bind2 (mfc ctx ran,
adamc@26 239 fn ran' =>
adamc@26 240 S.map2 (mfe (bind (ctx, RelE (x, dom'))) e,
adamc@26 241 fn e' =>
adamc@26 242 (EAbs (x, dom', ran', e'), loc))))
adamc@26 243
adamc@10 244 | ECApp (e, c) =>
adamc@11 245 S.bind2 (mfe ctx e,
adamc@10 246 fn e' =>
adamc@11 247 S.map2 (mfc ctx c,
adamc@10 248 fn c' =>
adamc@10 249 (ECApp (e', c'), loc)))
adamc@10 250 | ECAbs (expl, x, k, e) =>
adamc@10 251 S.bind2 (mfk k,
adamc@10 252 fn k' =>
adamc@11 253 S.map2 (mfe (bind (ctx, RelC (x, k))) e,
adamc@10 254 fn e' =>
adamc@10 255 (ECAbs (expl, x, k', e'), loc)))
adamc@10 256
adamc@12 257 | ERecord xes =>
adamc@29 258 S.map2 (ListUtil.mapfold (fn (x, e, t) =>
adamc@12 259 S.bind2 (mfc ctx x,
adamc@12 260 fn x' =>
adamc@29 261 S.bind2 (mfe ctx e,
adamc@12 262 fn e' =>
adamc@29 263 S.map2 (mfc ctx t,
adamc@29 264 fn t' =>
adamc@29 265 (x', e', t')))))
adamc@12 266 xes,
adamc@12 267 fn xes' =>
adamc@12 268 (ERecord xes', loc))
adamc@12 269 | EField (e, c, {field, rest}) =>
adamc@12 270 S.bind2 (mfe ctx e,
adamc@12 271 fn e' =>
adamc@12 272 S.bind2 (mfc ctx c,
adamc@12 273 fn c' =>
adamc@12 274 S.bind2 (mfc ctx field,
adamc@12 275 fn field' =>
adamc@12 276 S.map2 (mfc ctx rest,
adamc@12 277 fn rest' =>
adamc@12 278 (EField (e', c', {field = field', rest = rest'}), loc)))))
adamc@12 279
adamc@71 280 | EFold k =>
adamc@71 281 S.map2 (mfk k,
adamc@71 282 fn k' =>
adamc@71 283 (EFold k', loc))
adamc@71 284
adamc@10 285 | EError => S.return2 eAll
adamc@10 286 in
adamc@10 287 mfe
adamc@10 288 end
adamc@10 289
adamc@11 290 fun mapfold {kind = fk, con = fc, exp = fe} =
adamc@11 291 mapfoldB {kind = fk,
adamc@11 292 con = fn () => fc,
adamc@11 293 exp = fn () => fe,
adamc@11 294 bind = fn ((), _) => ()} ()
adamc@11 295
adamc@10 296 fun exists {kind, con, exp} k =
adamc@10 297 case mapfold {kind = fn k => fn () =>
adamc@10 298 if kind k then
adamc@10 299 S.Return ()
adamc@10 300 else
adamc@10 301 S.Continue (k, ()),
adamc@10 302 con = fn c => fn () =>
adamc@10 303 if con c then
adamc@10 304 S.Return ()
adamc@10 305 else
adamc@10 306 S.Continue (c, ()),
adamc@10 307 exp = fn e => fn () =>
adamc@10 308 if exp e then
adamc@10 309 S.Return ()
adamc@10 310 else
adamc@10 311 S.Continue (e, ())} k () of
adamc@10 312 S.Return _ => true
adamc@10 313 | S.Continue _ => false
adamc@10 314
adamc@10 315 end
adamc@10 316
adamc@34 317 structure Sgn = struct
adamc@34 318
adamc@34 319 datatype binder =
adamc@34 320 RelC of string * Elab.kind
adamc@34 321 | NamedC of string * Elab.kind
adamc@34 322 | Str of string * Elab.sgn
adamc@59 323 | Sgn of string * Elab.sgn
adamc@34 324
adamc@34 325 fun mapfoldB {kind, con, sgn_item, sgn, bind} =
adamc@34 326 let
adamc@34 327 fun bind' (ctx, b) =
adamc@34 328 let
adamc@34 329 val b' = case b of
adamc@34 330 Con.Rel x => RelC x
adamc@34 331 | Con.Named x => NamedC x
adamc@34 332 in
adamc@34 333 bind (ctx, b')
adamc@34 334 end
adamc@34 335 val con = Con.mapfoldB {kind = kind, con = con, bind = bind'}
adamc@34 336
adamc@34 337 val kind = Kind.mapfold kind
adamc@34 338
adamc@34 339 fun sgi ctx si acc =
adamc@34 340 S.bindP (sgi' ctx si acc, sgn_item ctx)
adamc@34 341
adamc@34 342 and sgi' ctx (si, loc) =
adamc@34 343 case si of
adamc@34 344 SgiConAbs (x, n, k) =>
adamc@34 345 S.map2 (kind k,
adamc@34 346 fn k' =>
adamc@34 347 (SgiConAbs (x, n, k'), loc))
adamc@34 348 | SgiCon (x, n, k, c) =>
adamc@34 349 S.bind2 (kind k,
adamc@34 350 fn k' =>
adamc@34 351 S.map2 (con ctx c,
adamc@34 352 fn c' =>
adamc@34 353 (SgiCon (x, n, k', c'), loc)))
adamc@34 354 | SgiVal (x, n, c) =>
adamc@34 355 S.map2 (con ctx c,
adamc@34 356 fn c' =>
adamc@34 357 (SgiVal (x, n, c'), loc))
adamc@34 358 | SgiStr (x, n, s) =>
adamc@34 359 S.map2 (sg ctx s,
adamc@34 360 fn s' =>
adamc@34 361 (SgiStr (x, n, s'), loc))
adamc@59 362 | SgiSgn (x, n, s) =>
adamc@59 363 S.map2 (sg ctx s,
adamc@59 364 fn s' =>
adamc@59 365 (SgiSgn (x, n, s'), loc))
adamc@34 366
adamc@34 367 and sg ctx s acc =
adamc@34 368 S.bindP (sg' ctx s acc, sgn ctx)
adamc@34 369
adamc@34 370 and sg' ctx (sAll as (s, loc)) =
adamc@34 371 case s of
adamc@34 372 SgnConst sgis =>
adamc@34 373 S.map2 (ListUtil.mapfoldB (fn (ctx, si) =>
adamc@34 374 (case #1 si of
adamc@34 375 SgiConAbs (x, _, k) =>
adamc@34 376 bind (ctx, NamedC (x, k))
adamc@34 377 | SgiCon (x, _, k, _) =>
adamc@34 378 bind (ctx, NamedC (x, k))
adamc@34 379 | SgiVal _ => ctx
adamc@34 380 | SgiStr (x, _, sgn) =>
adamc@59 381 bind (ctx, Str (x, sgn))
adamc@59 382 | SgiSgn (x, _, sgn) =>
adamc@59 383 bind (ctx, Sgn (x, sgn)),
adamc@34 384 sgi ctx si)) ctx sgis,
adamc@34 385 fn sgis' =>
adamc@34 386 (SgnConst sgis', loc))
adamc@34 387
adamc@34 388 | SgnVar _ => S.return2 sAll
adamc@41 389 | SgnFun (m, n, s1, s2) =>
adamc@41 390 S.bind2 (sg ctx s1,
adamc@41 391 fn s1' =>
adamc@41 392 S.map2 (sg (bind (ctx, Str (m, s1'))) s2,
adamc@41 393 fn s2' =>
adamc@41 394 (SgnFun (m, n, s1', s2'), loc)))
adamc@59 395 | SgnProj _ => S.return2 sAll
adamc@42 396 | SgnWhere (sgn, x, c) =>
adamc@42 397 S.bind2 (sg ctx sgn,
adamc@42 398 fn sgn' =>
adamc@42 399 S.map2 (con ctx c,
adamc@42 400 fn c' =>
adamc@42 401 (SgnWhere (sgn', x, c'), loc)))
adamc@34 402 | SgnError => S.return2 sAll
adamc@34 403 in
adamc@34 404 sg
adamc@34 405 end
adamc@34 406
adamc@34 407 fun mapfold {kind, con, sgn_item, sgn} =
adamc@34 408 mapfoldB {kind = kind,
adamc@34 409 con = fn () => con,
adamc@34 410 sgn_item = fn () => sgn_item,
adamc@34 411 sgn = fn () => sgn,
adamc@34 412 bind = fn ((), _) => ()} ()
adamc@34 413
adamc@34 414 fun map {kind, con, sgn_item, sgn} s =
adamc@34 415 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@34 416 con = fn c => fn () => S.Continue (con c, ()),
adamc@34 417 sgn_item = fn si => fn () => S.Continue (sgn_item si, ()),
adamc@34 418 sgn = fn s => fn () => S.Continue (sgn s, ())} s () of
adamc@34 419 S.Return () => raise Fail "Elab_util.Sgn.map"
adamc@34 420 | S.Continue (s, ()) => s
adamc@34 421
adamc@2 422 end
adamc@34 423
adamc@76 424 structure Decl = struct
adamc@76 425
adamc@76 426 datatype binder =
adamc@76 427 RelC of string * Elab.kind
adamc@76 428 | NamedC of string * Elab.kind
adamc@76 429 | RelE of string * Elab.con
adamc@76 430 | NamedE of string * Elab.con
adamc@76 431 | Str of string * Elab.sgn
adamc@76 432 | Sgn of string * Elab.sgn
adamc@76 433
adamc@76 434 fun mapfoldB {kind = fk, con = fc, exp = fe, sgn_item = fsgi, sgn = fsg, str = fst, decl = fd, bind} =
adamc@76 435 let
adamc@76 436 val mfk = Kind.mapfold fk
adamc@76 437
adamc@76 438 fun bind' (ctx, b) =
adamc@76 439 let
adamc@76 440 val b' = case b of
adamc@76 441 Con.Rel x => RelC x
adamc@76 442 | Con.Named x => NamedC x
adamc@76 443 in
adamc@76 444 bind (ctx, b')
adamc@76 445 end
adamc@76 446 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@76 447
adamc@76 448 fun bind' (ctx, b) =
adamc@76 449 let
adamc@76 450 val b' = case b of
adamc@76 451 Exp.RelC x => RelC x
adamc@76 452 | Exp.NamedC x => NamedC x
adamc@76 453 | Exp.RelE x => RelE x
adamc@76 454 | Exp.NamedE x => NamedE x
adamc@76 455 in
adamc@76 456 bind (ctx, b')
adamc@76 457 end
adamc@76 458 val mfe = Exp.mapfoldB {kind = fk, con = fc, exp = fe, bind = bind'}
adamc@76 459
adamc@76 460 fun bind' (ctx, b) =
adamc@76 461 let
adamc@76 462 val b' = case b of
adamc@76 463 Sgn.RelC x => RelC x
adamc@76 464 | Sgn.NamedC x => NamedC x
adamc@76 465 | Sgn.Sgn x => Sgn x
adamc@76 466 | Sgn.Str x => Str x
adamc@76 467 in
adamc@76 468 bind (ctx, b')
adamc@76 469 end
adamc@76 470 val mfsg = Sgn.mapfoldB {kind = fk, con = fc, sgn_item = fsgi, sgn = fsg, bind = bind'}
adamc@76 471
adamc@76 472 fun mfst ctx str acc =
adamc@76 473 S.bindP (mfst' ctx str acc, fst ctx)
adamc@76 474
adamc@76 475 and mfst' ctx (strAll as (str, loc)) =
adamc@76 476 case str of
adamc@76 477 StrConst ds =>
adamc@76 478 S.map2 (ListUtil.mapfoldB (fn (ctx, d) =>
adamc@76 479 (case #1 d of
adamc@76 480 DCon (x, _, k, _) =>
adamc@76 481 bind (ctx, NamedC (x, k))
adamc@76 482 | DVal (x, _, c, _) =>
adamc@76 483 bind (ctx, NamedE (x, c))
adamc@76 484 | DSgn (x, _, sgn) =>
adamc@76 485 bind (ctx, Sgn (x, sgn))
adamc@76 486 | DStr (x, _, sgn, _) =>
adamc@76 487 bind (ctx, Str (x, sgn))
adamc@76 488 | DFfiStr (x, _, sgn) =>
adamc@76 489 bind (ctx, Str (x, sgn)),
adamc@76 490 mfd ctx d)) ctx ds,
adamc@76 491 fn ds' => (StrConst ds', loc))
adamc@76 492 | StrVar _ => S.return2 strAll
adamc@76 493 | StrProj (str, x) =>
adamc@76 494 S.map2 (mfst ctx str,
adamc@76 495 fn str' =>
adamc@76 496 (StrProj (str', x), loc))
adamc@76 497 | StrFun (x, n, sgn1, sgn2, str) =>
adamc@76 498 S.bind2 (mfsg ctx sgn1,
adamc@76 499 fn sgn1' =>
adamc@76 500 S.bind2 (mfsg ctx sgn2,
adamc@76 501 fn sgn2' =>
adamc@76 502 S.map2 (mfst ctx str,
adamc@76 503 fn str' =>
adamc@76 504 (StrFun (x, n, sgn1', sgn2', str'), loc))))
adamc@76 505 | StrApp (str1, str2) =>
adamc@76 506 S.bind2 (mfst ctx str1,
adamc@76 507 fn str1' =>
adamc@76 508 S.map2 (mfst ctx str2,
adamc@76 509 fn str2' =>
adamc@76 510 (StrApp (str1', str2'), loc)))
adamc@76 511 | StrError => S.return2 strAll
adamc@76 512
adamc@76 513 and mfd ctx d acc =
adamc@76 514 S.bindP (mfd' ctx d acc, fd ctx)
adamc@76 515
adamc@76 516 and mfd' ctx (dAll as (d, loc)) =
adamc@76 517 case d of
adamc@76 518 DCon (x, n, k, c) =>
adamc@76 519 S.bind2 (mfk k,
adamc@76 520 fn k' =>
adamc@76 521 S.map2 (mfc ctx c,
adamc@76 522 fn c' =>
adamc@76 523 (DCon (x, n, k', c'), loc)))
adamc@76 524 | DVal (x, n, c, e) =>
adamc@76 525 S.bind2 (mfc ctx c,
adamc@76 526 fn c' =>
adamc@76 527 S.map2 (mfe ctx e,
adamc@76 528 fn e' =>
adamc@76 529 (DVal (x, n, c', e'), loc)))
adamc@76 530 | DSgn (x, n, sgn) =>
adamc@76 531 S.map2 (mfsg ctx sgn,
adamc@76 532 fn sgn' =>
adamc@76 533 (DSgn (x, n, sgn'), loc))
adamc@76 534 | DStr (x, n, sgn, str) =>
adamc@76 535 S.bind2 (mfsg ctx sgn,
adamc@76 536 fn sgn' =>
adamc@76 537 S.map2 (mfst ctx str,
adamc@76 538 fn str' =>
adamc@76 539 (DStr (x, n, sgn', str'), loc)))
adamc@76 540 | DFfiStr (x, n, sgn) =>
adamc@76 541 S.map2 (mfsg ctx sgn,
adamc@76 542 fn sgn' =>
adamc@76 543 (DFfiStr (x, n, sgn'), loc))
adamc@76 544 in
adamc@76 545 mfd
adamc@76 546 end
adamc@76 547
adamc@76 548 fun mapfold {kind, con, exp, sgn_item, sgn, str, decl} =
adamc@76 549 mapfoldB {kind = kind,
adamc@76 550 con = fn () => con,
adamc@76 551 exp = fn () => exp,
adamc@76 552 sgn_item = fn () => sgn_item,
adamc@76 553 sgn = fn () => sgn,
adamc@76 554 str = fn () => str,
adamc@76 555 decl = fn () => decl,
adamc@76 556 bind = fn ((), _) => ()} ()
adamc@76 557
adamc@76 558 fun exists {kind, con, exp, sgn_item, sgn, str, decl} k =
adamc@76 559 case mapfold {kind = fn k => fn () =>
adamc@76 560 if kind k then
adamc@76 561 S.Return ()
adamc@76 562 else
adamc@76 563 S.Continue (k, ()),
adamc@76 564 con = fn c => fn () =>
adamc@76 565 if con c then
adamc@76 566 S.Return ()
adamc@76 567 else
adamc@76 568 S.Continue (c, ()),
adamc@76 569 exp = fn e => fn () =>
adamc@76 570 if exp e then
adamc@76 571 S.Return ()
adamc@76 572 else
adamc@76 573 S.Continue (e, ()),
adamc@76 574 sgn_item = fn sgi => fn () =>
adamc@76 575 if sgn_item sgi then
adamc@76 576 S.Return ()
adamc@76 577 else
adamc@76 578 S.Continue (sgi, ()),
adamc@76 579 sgn = fn x => fn () =>
adamc@76 580 if sgn x then
adamc@76 581 S.Return ()
adamc@76 582 else
adamc@76 583 S.Continue (x, ()),
adamc@76 584 str = fn x => fn () =>
adamc@76 585 if str x then
adamc@76 586 S.Return ()
adamc@76 587 else
adamc@76 588 S.Continue (x, ()),
adamc@76 589 decl = fn x => fn () =>
adamc@76 590 if decl x then
adamc@76 591 S.Return ()
adamc@76 592 else
adamc@76 593 S.Continue (x, ())} k () of
adamc@76 594 S.Return _ => true
adamc@76 595 | S.Continue _ => false
adamc@76 596
adamc@76 597 fun search {kind, con, exp, sgn_item, sgn, str, decl} k =
adamc@76 598 case mapfold {kind = fn x => fn () =>
adamc@76 599 case kind x of
adamc@76 600 NONE => S.Continue (x, ())
adamc@76 601 | SOME v => S.Return v,
adamc@76 602
adamc@76 603 con = fn x => fn () =>
adamc@76 604 case con x of
adamc@76 605 NONE => S.Continue (x, ())
adamc@76 606 | SOME v => S.Return v,
adamc@76 607
adamc@76 608 exp = fn x => fn () =>
adamc@76 609 case exp x of
adamc@76 610 NONE => S.Continue (x, ())
adamc@76 611 | SOME v => S.Return v,
adamc@76 612
adamc@76 613 sgn_item = fn x => fn () =>
adamc@76 614 case sgn_item x of
adamc@76 615 NONE => S.Continue (x, ())
adamc@76 616 | SOME v => S.Return v,
adamc@76 617
adamc@76 618 sgn = fn x => fn () =>
adamc@76 619 case sgn x of
adamc@76 620 NONE => S.Continue (x, ())
adamc@76 621 | SOME v => S.Return v,
adamc@76 622
adamc@76 623 str = fn x => fn () =>
adamc@76 624 case str x of
adamc@76 625 NONE => S.Continue (x, ())
adamc@76 626 | SOME v => S.Return v,
adamc@76 627
adamc@76 628 decl = fn x => fn () =>
adamc@76 629 case decl x of
adamc@76 630 NONE => S.Continue (x, ())
adamc@76 631 | SOME v => S.Return v
adamc@76 632
adamc@76 633 } k () of
adamc@76 634 S.Return x => SOME x
adamc@76 635 | S.Continue _ => NONE
adamc@76 636
adamc@34 637 end
adamc@76 638
adamc@76 639 end