Mercurial > urweb

annotate src/elab_util.sml @ 831:5e1a4b12c83a

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
strcspn and friends
author Adam Chlipala <adamc@hcoop.net>
date Sun, 31 May 2009 12:41:34 -0400
parents 78504d97410b
children b2413e4dd109
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@188 32 fun classifyDatatype xncs =
adamc@198 33 case xncs of
adamc@198 34 [(_, _, NONE), (_, _, SOME _)] => Option
adamc@198 35 | [(_, _, SOME _), (_, _, NONE)] => Option
adamc@198 36 | _ =>
adamc@198 37 if List.all (fn (_, _, NONE) => true | _ => false) xncs then
adamc@198 38 Enum
adamc@198 39 else
adamc@198 40 Default
adamc@188 41
adamc@2 42 structure S = Search
adamc@2 43
adamc@2 44 structure Kind = struct
adamc@2 45
adamc@623 46 fun mapfoldB {kind, bind} =
adamc@2 47 let
adamc@623 48 fun mfk ctx k acc =
adamc@623 49 S.bindP (mfk' ctx k acc, kind ctx)
adamc@2 50
adamc@623 51 and mfk' ctx (kAll as (k, loc)) =
adamc@2 52 case k of
adamc@2 53 KType => S.return2 kAll
adamc@2 54
adamc@2 55 | KArrow (k1, k2) =>
adamc@623 56 S.bind2 (mfk ctx k1,
adamc@2 57 fn k1' =>
adamc@623 58 S.map2 (mfk ctx k2,
adamc@2 59 fn k2' =>
adamc@2 60 (KArrow (k1', k2'), loc)))
adamc@2 61
adamc@2 62 | KName => S.return2 kAll
adamc@2 63
adamc@2 64 | KRecord k =>
adamc@623 65 S.map2 (mfk ctx k,
adamc@2 66 fn k' =>
adamc@2 67 (KRecord k', loc))
adamc@2 68
adamc@82 69 | KUnit => S.return2 kAll
adamc@82 70
adamc@207 71 | KTuple ks =>
adamc@623 72 S.map2 (ListUtil.mapfold (mfk ctx) ks,
adamc@207 73 fn ks' =>
adamc@207 74 (KTuple ks', loc))
adamc@207 75
adamc@2 76 | KError => S.return2 kAll
adamc@2 77
adamc@623 78 | KUnif (_, _, ref (SOME k)) => mfk' ctx k
adamc@2 79 | KUnif _ => S.return2 kAll
adamc@623 80
adamc@623 81 | KRel _ => S.return2 kAll
adamc@623 82 | KFun (x, k) =>
adamc@623 83 S.map2 (mfk (bind (ctx, x)) k,
adamc@623 84 fn k' =>
adamc@623 85 (KFun (x, k'), loc))
adamc@2 86 in
adamc@2 87 mfk
adamc@2 88 end
adamc@2 89
adamc@623 90 fun mapfold fk =
adamc@623 91 mapfoldB {kind = fn () => fk,
adamc@623 92 bind = fn ((), _) => ()} ()
adamc@623 93
adamc@623 94 fun mapB {kind, bind} ctx k =
adamc@623 95 case mapfoldB {kind = fn ctx => fn k => fn () => S.Continue (kind ctx k, ()),
adamc@623 96 bind = bind} ctx k () of
adamc@623 97 S.Continue (k, ()) => k
adamc@623 98 | S.Return _ => raise Fail "ElabUtil.Kind.mapB: Impossible"
adamc@623 99
adamc@2 100 fun exists f k =
adamc@6 101 case mapfold (fn k => fn () =>
adamc@6 102 if f k then
adamc@6 103 S.Return ()
adamc@6 104 else
adamc@6 105 S.Continue (k, ())) k () of
adamc@6 106 S.Return _ => true
adamc@6 107 | S.Continue _ => false
adamc@6 108
adamc@6 109 end
adamc@6 110
adamc@6 111 structure Con = struct
adamc@6 112
adamc@11 113 datatype binder =
adamc@623 114 RelK of string
adamc@623 115 | RelC of string * Elab.kind
adamc@792 116 | NamedC of string * int * Elab.kind * Elab.con option
adamc@11 117
adamc@11 118 fun mapfoldB {kind = fk, con = fc, bind} =
adamc@6 119 let
adamc@623 120 val mfk = Kind.mapfoldB {kind = fk, bind = fn (ctx, s) => bind (ctx, RelK s)}
adamc@6 121
adamc@11 122 fun mfc ctx c acc =
adamc@11 123 S.bindP (mfc' ctx c acc, fc ctx)
adamc@6 124
adamc@11 125 and mfc' ctx (cAll as (c, loc)) =
adamc@6 126 case c of
adamc@6 127 TFun (c1, c2) =>
adamc@11 128 S.bind2 (mfc ctx c1,
adamc@6 129 fn c1' =>
adamc@11 130 S.map2 (mfc ctx c2,
adamc@6 131 fn c2' =>
adamc@6 132 (TFun (c1', c2'), loc)))
adamc@6 133 | TCFun (e, x, k, c) =>
adamc@623 134 S.bind2 (mfk ctx k,
adamc@6 135 fn k' =>
adamc@623 136 S.map2 (mfc (bind (ctx, RelC (x, k))) c,
adamc@6 137 fn c' =>
adamc@6 138 (TCFun (e, x, k', c'), loc)))
adamc@628 139 | TDisjoint (c1, c2, c3) =>
adamc@85 140 S.bind2 (mfc ctx c1,
adamc@85 141 fn c1' =>
adamc@85 142 S.bind2 (mfc ctx c2,
adamc@85 143 fn c2' =>
adamc@85 144 S.map2 (mfc ctx c3,
adamc@85 145 fn c3' =>
adamc@628 146 (TDisjoint (c1', c2', c3'), loc))))
adamc@6 147 | TRecord c =>
adamc@11 148 S.map2 (mfc ctx c,
adamc@6 149 fn c' =>
adamc@6 150 (TRecord c', loc))
adamc@6 151
adamc@6 152 | CRel _ => S.return2 cAll
adamc@6 153 | CNamed _ => S.return2 cAll
adamc@34 154 | CModProj _ => S.return2 cAll
adamc@6 155 | CApp (c1, c2) =>
adamc@11 156 S.bind2 (mfc ctx c1,
adamc@6 157 fn c1' =>
adamc@11 158 S.map2 (mfc ctx c2,
adamc@6 159 fn c2' =>
adamc@6 160 (CApp (c1', c2'), loc)))
adamc@8 161 | CAbs (x, k, c) =>
adamc@623 162 S.bind2 (mfk ctx k,
adamc@6 163 fn k' =>
adamc@623 164 S.map2 (mfc (bind (ctx, RelC (x, k))) c,
adamc@6 165 fn c' =>
adamc@8 166 (CAbs (x, k', c'), loc)))
adamc@6 167
adamc@6 168 | CName _ => S.return2 cAll
adamc@6 169
adamc@6 170 | CRecord (k, xcs) =>
adamc@623 171 S.bind2 (mfk ctx k,
adamc@6 172 fn k' =>
adamc@6 173 S.map2 (ListUtil.mapfold (fn (x, c) =>
adamc@11 174 S.bind2 (mfc ctx x,
adamc@6 175 fn x' =>
adamc@11 176 S.map2 (mfc ctx c,
adamc@6 177 fn c' =>
adamc@6 178 (x', c'))))
adamc@6 179 xcs,
adamc@6 180 fn xcs' =>
adamc@6 181 (CRecord (k', xcs'), loc)))
adamc@6 182 | CConcat (c1, c2) =>
adamc@11 183 S.bind2 (mfc ctx c1,
adamc@6 184 fn c1' =>
adamc@11 185 S.map2 (mfc ctx c2,
adamc@6 186 fn c2' =>
adamc@6 187 (CConcat (c1', c2'), loc)))
adamc@621 188 | CMap (k1, k2) =>
adamc@623 189 S.bind2 (mfk ctx k1,
adamc@67 190 fn k1' =>
adamc@623 191 S.map2 (mfk ctx k2,
adamc@67 192 fn k2' =>
adamc@621 193 (CMap (k1', k2'), loc)))
adamc@6 194
adamc@82 195 | CUnit => S.return2 cAll
adamc@82 196
adamc@207 197 | CTuple cs =>
adamc@207 198 S.map2 (ListUtil.mapfold (mfc ctx) cs,
adamc@207 199 fn cs' =>
adamc@207 200 (CTuple cs', loc))
adamc@207 201
adamc@207 202 | CProj (c, n) =>
adamc@207 203 S.map2 (mfc ctx c,
adamc@207 204 fn c' =>
adamc@207 205 (CProj (c', n), loc))
adamc@207 206
adamc@6 207 | CError => S.return2 cAll
adamc@76 208 | CUnif (_, _, _, ref (SOME c)) => mfc' ctx c
adamc@6 209 | CUnif _ => S.return2 cAll
adamc@623 210
adamc@623 211 | CKAbs (x, c) =>
adamc@623 212 S.map2 (mfc (bind (ctx, RelK x)) c,
adamc@623 213 fn c' =>
adamc@623 214 (CKAbs (x, c'), loc))
adamc@623 215 | CKApp (c, k) =>
adamc@623 216 S.bind2 (mfc ctx c,
adamc@623 217 fn c' =>
adamc@623 218 S.map2 (mfk ctx k,
adamc@623 219 fn k' =>
adamc@623 220 (CKApp (c', k'), loc)))
adamc@623 221 | TKFun (x, c) =>
adamc@623 222 S.map2 (mfc (bind (ctx, RelK x)) c,
adamc@623 223 fn c' =>
adamc@623 224 (TKFun (x, c'), loc))
adamc@6 225 in
adamc@6 226 mfc
adamc@6 227 end
adamc@6 228
adamc@11 229 fun mapfold {kind = fk, con = fc} =
adamc@623 230 mapfoldB {kind = fn () => fk,
adamc@11 231 con = fn () => fc,
adamc@11 232 bind = fn ((), _) => ()} ()
adamc@11 233
adamc@11 234 fun mapB {kind, con, bind} ctx c =
adamc@623 235 case mapfoldB {kind = fn ctx => fn k => fn () => S.Continue (kind ctx k, ()),
adamc@11 236 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@11 237 bind = bind} ctx c () of
adamc@11 238 S.Continue (c, ()) => c
adamc@34 239 | S.Return _ => raise Fail "ElabUtil.Con.mapB: Impossible"
adamc@34 240
adamc@34 241 fun map {kind, con} s =
adamc@34 242 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@34 243 con = fn c => fn () => S.Continue (con c, ())} s () of
adamc@34 244 S.Return () => raise Fail "ElabUtil.Con.map: Impossible"
adamc@34 245 | S.Continue (s, ()) => s
adamc@11 246
adamc@711 247 fun existsB {kind, con, bind} ctx c =
adamc@711 248 case mapfoldB {kind = fn ctx => fn k => fn () =>
adamc@711 249 if kind (ctx, k) then
adamc@711 250 S.Return ()
adamc@711 251 else
adamc@711 252 S.Continue (k, ()),
adamc@711 253 con = fn ctx => fn c => fn () =>
adamc@711 254 if con (ctx, c) then
adamc@711 255 S.Return ()
adamc@711 256 else
adamc@711 257 S.Continue (c, ()),
adamc@711 258 bind = bind} ctx c () of
adamc@711 259 S.Return _ => true
adamc@711 260 | S.Continue _ => false
adamc@711 261
adamc@711 262 fun exists {kind, con} c =
adamc@6 263 case mapfold {kind = fn k => fn () =>
adamc@6 264 if kind k then
adamc@6 265 S.Return ()
adamc@6 266 else
adamc@6 267 S.Continue (k, ()),
adamc@6 268 con = fn c => fn () =>
adamc@6 269 if con c then
adamc@6 270 S.Return ()
adamc@6 271 else
adamc@711 272 S.Continue (c, ())} c () of
adamc@2 273 S.Return _ => true
adamc@2 274 | S.Continue _ => false
adamc@2 275
adamc@448 276 fun foldB {kind, con, bind} ctx st c =
adamc@623 277 case mapfoldB {kind = fn ctx => fn k => fn st => S.Continue (k, kind (ctx, k, st)),
adamc@448 278 con = fn ctx => fn c => fn st => S.Continue (c, con (ctx, c, st)),
adamc@448 279 bind = bind} ctx c st of
adamc@448 280 S.Continue (_, st) => st
adamc@448 281 | S.Return _ => raise Fail "ElabUtil.Con.foldB: Impossible"
adamc@448 282
adamc@2 283 end
adamc@2 284
adamc@10 285 structure Exp = struct
adamc@10 286
adamc@11 287 datatype binder =
adamc@623 288 RelK of string
adamc@623 289 | RelC of string * Elab.kind
adamc@792 290 | NamedC of string * int * Elab.kind * Elab.con option
adamc@11 291 | RelE of string * Elab.con
adamc@11 292 | NamedE of string * Elab.con
adamc@11 293
adamc@11 294 fun mapfoldB {kind = fk, con = fc, exp = fe, bind} =
adamc@10 295 let
adamc@623 296 val mfk = Kind.mapfoldB {kind = fk, bind = fn (ctx, x) => bind (ctx, RelK x)}
adamc@10 297
adamc@11 298 fun bind' (ctx, b) =
adamc@11 299 let
adamc@11 300 val b' = case b of
adamc@623 301 Con.RelK x => RelK x
adamc@623 302 | Con.RelC x => RelC x
adamc@623 303 | Con.NamedC x => NamedC x
adamc@11 304 in
adamc@11 305 bind (ctx, b')
adamc@11 306 end
adamc@11 307 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@10 308
adamc@825 309 fun doVars ((p, _), ctx) =
adamc@825 310 case p of
adamc@825 311 PWild => ctx
adamc@825 312 | PVar xt => bind (ctx, RelE xt)
adamc@825 313 | PPrim _ => ctx
adamc@825 314 | PCon (_, _, _, NONE) => ctx
adamc@825 315 | PCon (_, _, _, SOME p) => doVars (p, ctx)
adamc@825 316 | PRecord xpcs =>
adamc@825 317 foldl (fn ((_, p, _), ctx) => doVars (p, ctx))
adamc@825 318 ctx xpcs
adamc@825 319
adamc@11 320 fun mfe ctx e acc =
adamc@11 321 S.bindP (mfe' ctx e acc, fe ctx)
adamc@11 322
adamc@11 323 and mfe' ctx (eAll as (e, loc)) =
adamc@10 324 case e of
adamc@14 325 EPrim _ => S.return2 eAll
adamc@14 326 | ERel _ => S.return2 eAll
adamc@10 327 | ENamed _ => S.return2 eAll
adamc@34 328 | EModProj _ => S.return2 eAll
adamc@10 329 | EApp (e1, e2) =>
adamc@11 330 S.bind2 (mfe ctx e1,
adamc@10 331 fn e1' =>
adamc@11 332 S.map2 (mfe ctx e2,
adamc@10 333 fn e2' =>
adamc@10 334 (EApp (e1', e2'), loc)))
adamc@26 335 | EAbs (x, dom, ran, e) =>
adamc@26 336 S.bind2 (mfc ctx dom,
adamc@26 337 fn dom' =>
adamc@26 338 S.bind2 (mfc ctx ran,
adamc@26 339 fn ran' =>
adamc@26 340 S.map2 (mfe (bind (ctx, RelE (x, dom'))) e,
adamc@26 341 fn e' =>
adamc@26 342 (EAbs (x, dom', ran', e'), loc))))
adamc@26 343
adamc@10 344 | ECApp (e, c) =>
adamc@11 345 S.bind2 (mfe ctx e,
adamc@10 346 fn e' =>
adamc@11 347 S.map2 (mfc ctx c,
adamc@10 348 fn c' =>
adamc@10 349 (ECApp (e', c'), loc)))
adamc@10 350 | ECAbs (expl, x, k, e) =>
adamc@623 351 S.bind2 (mfk ctx k,
adamc@10 352 fn k' =>
adamc@11 353 S.map2 (mfe (bind (ctx, RelC (x, k))) e,
adamc@10 354 fn e' =>
adamc@10 355 (ECAbs (expl, x, k', e'), loc)))
adamc@10 356
adamc@12 357 | ERecord xes =>
adamc@29 358 S.map2 (ListUtil.mapfold (fn (x, e, t) =>
adamc@12 359 S.bind2 (mfc ctx x,
adamc@12 360 fn x' =>
adamc@29 361 S.bind2 (mfe ctx e,
adamc@12 362 fn e' =>
adamc@29 363 S.map2 (mfc ctx t,
adamc@29 364 fn t' =>
adamc@29 365 (x', e', t')))))
adamc@12 366 xes,
adamc@12 367 fn xes' =>
adamc@12 368 (ERecord xes', loc))
adamc@12 369 | EField (e, c, {field, rest}) =>
adamc@12 370 S.bind2 (mfe ctx e,
adamc@12 371 fn e' =>
adamc@12 372 S.bind2 (mfc ctx c,
adamc@12 373 fn c' =>
adamc@12 374 S.bind2 (mfc ctx field,
adamc@12 375 fn field' =>
adamc@12 376 S.map2 (mfc ctx rest,
adamc@12 377 fn rest' =>
adamc@12 378 (EField (e', c', {field = field', rest = rest'}), loc)))))
adamc@445 379 | EConcat (e1, c1, e2, c2) =>
adamc@339 380 S.bind2 (mfe ctx e1,
adamc@339 381 fn e1' =>
adamc@445 382 S.bind2 (mfc ctx c1,
adamc@445 383 fn c1' =>
adamc@339 384 S.bind2 (mfe ctx e2,
adamc@339 385 fn e2' =>
adamc@445 386 S.map2 (mfc ctx c2,
adamc@445 387 fn c2' =>
adamc@445 388 (EConcat (e1', c1', e2', c2'),
adamc@445 389 loc)))))
adamc@149 390 | ECut (e, c, {field, rest}) =>
adamc@149 391 S.bind2 (mfe ctx e,
adamc@149 392 fn e' =>
adamc@149 393 S.bind2 (mfc ctx c,
adamc@149 394 fn c' =>
adamc@149 395 S.bind2 (mfc ctx field,
adamc@149 396 fn field' =>
adamc@149 397 S.map2 (mfc ctx rest,
adamc@149 398 fn rest' =>
adamc@149 399 (ECut (e', c', {field = field', rest = rest'}), loc)))))
adamc@12 400
adamc@493 401 | ECutMulti (e, c, {rest}) =>
adamc@493 402 S.bind2 (mfe ctx e,
adamc@493 403 fn e' =>
adamc@493 404 S.bind2 (mfc ctx c,
adamc@493 405 fn c' =>
adamc@493 406 S.map2 (mfc ctx rest,
adamc@493 407 fn rest' =>
adamc@493 408 (ECutMulti (e', c', {rest = rest'}), loc))))
adamc@493 409
adamc@182 410 | ECase (e, pes, {disc, result}) =>
adamc@171 411 S.bind2 (mfe ctx e,
adamc@171 412 fn e' =>
adamc@171 413 S.bind2 (ListUtil.mapfold (fn (p, e) =>
adamc@448 414 let
adamc@448 415 fun pb ((p, _), ctx) =
adamc@448 416 case p of
adamc@448 417 PWild => ctx
adamc@448 418 | PVar (x, t) => bind (ctx, RelE (x, t))
adamc@448 419 | PPrim _ => ctx
adamc@448 420 | PCon (_, _, _, NONE) => ctx
adamc@448 421 | PCon (_, _, _, SOME p) => pb (p, ctx)
adamc@448 422 | PRecord xps => foldl (fn ((_, p, _), ctx) =>
adamc@448 423 pb (p, ctx)) ctx xps
adamc@448 424 in
adamc@448 425 S.map2 (mfe (pb (p, ctx)) e,
adamc@448 426 fn e' => (p, e'))
adamc@448 427 end) pes,
adamc@171 428 fn pes' =>
adamc@182 429 S.bind2 (mfc ctx disc,
adamc@182 430 fn disc' =>
adamc@182 431 S.map2 (mfc ctx result,
adamc@182 432 fn result' =>
adamc@182 433 (ECase (e', pes', {disc = disc', result = result'}), loc)))))
adamc@171 434
adamc@10 435 | EError => S.return2 eAll
adamc@228 436 | EUnif (ref (SOME e)) => mfe ctx e
adamc@228 437 | EUnif _ => S.return2 eAll
adamc@447 438
adamc@825 439 | ELet (des, e, t) =>
adamc@447 440 let
adamc@826 441 val (des, ctx') = foldl (fn (ed, (des, ctx)) =>
adamc@826 442 let
adamc@826 443 val ctx' =
adamc@826 444 case #1 ed of
adamc@826 445 EDVal (p, _, _) => doVars (p, ctx)
adamc@826 446 | EDValRec vis =>
adamc@826 447 foldl (fn ((x, t, _), ctx) => bind (ctx, RelE (x, t)))
adamc@826 448 ctx vis
adamc@826 449 in
adamc@826 450 (S.bind2 (des,
adamc@826 451 fn des' =>
adamc@826 452 S.map2 (mfed ctx ed,
adamc@826 453 fn ed' => ed' :: des')),
adamc@826 454 ctx')
adamc@826 455 end)
adamc@447 456 (S.return2 [], ctx) des
adamc@447 457 in
adamc@447 458 S.bind2 (des,
adamc@447 459 fn des' =>
adamc@826 460 S.bind2 (mfe ctx' e,
adamc@447 461 fn e' =>
adamc@825 462 S.map2 (mfc ctx t,
adamc@825 463 fn t' =>
adamc@826 464 (ELet (rev des', e', t'), loc))))
adamc@447 465 end
adamc@447 466
adamc@623 467 | EKAbs (x, e) =>
adamc@623 468 S.map2 (mfe (bind (ctx, RelK x)) e,
adamc@623 469 fn e' =>
adamc@623 470 (EKAbs (x, e'), loc))
adamc@623 471 | EKApp (e, k) =>
adamc@623 472 S.bind2 (mfe ctx e,
adamc@623 473 fn e' =>
adamc@623 474 S.map2 (mfk ctx k,
adamc@623 475 fn k' =>
adamc@623 476 (EKApp (e', k'), loc)))
adamc@623 477
adamc@447 478 and mfed ctx (dAll as (d, loc)) =
adamc@447 479 case d of
adamc@825 480 EDVal (p, t, e) =>
adamc@825 481 S.bind2 (mfc ctx t,
adamc@825 482 fn t' =>
adamc@826 483 S.map2 (mfe ctx e,
adamc@825 484 fn e' =>
adamc@825 485 (EDVal (p, t', e'), loc)))
adamc@447 486 | EDValRec vis =>
adamc@447 487 let
adamc@453 488 val ctx = foldl (fn ((x, t, _), ctx) => bind (ctx, RelE (x, t))) ctx vis
adamc@447 489 in
adamc@447 490 S.map2 (ListUtil.mapfold (mfvi ctx) vis,
adamc@447 491 fn vis' =>
adamc@447 492 (EDValRec vis', loc))
adamc@447 493 end
adamc@447 494
adamc@447 495 and mfvi ctx (x, c, e) =
adamc@447 496 S.bind2 (mfc ctx c,
adamc@447 497 fn c' =>
adamc@447 498 S.map2 (mfe ctx e,
adamc@447 499 fn e' =>
adamc@447 500 (x, c', e')))
adamc@10 501 in
adamc@10 502 mfe
adamc@10 503 end
adamc@10 504
adamc@11 505 fun mapfold {kind = fk, con = fc, exp = fe} =
adamc@623 506 mapfoldB {kind = fn () => fk,
adamc@11 507 con = fn () => fc,
adamc@11 508 exp = fn () => fe,
adamc@11 509 bind = fn ((), _) => ()} ()
adamc@11 510
adamc@10 511 fun exists {kind, con, exp} k =
adamc@10 512 case mapfold {kind = fn k => fn () =>
adamc@10 513 if kind k then
adamc@10 514 S.Return ()
adamc@10 515 else
adamc@10 516 S.Continue (k, ()),
adamc@10 517 con = fn c => fn () =>
adamc@10 518 if con c then
adamc@10 519 S.Return ()
adamc@10 520 else
adamc@10 521 S.Continue (c, ()),
adamc@10 522 exp = fn e => fn () =>
adamc@10 523 if exp e then
adamc@10 524 S.Return ()
adamc@10 525 else
adamc@10 526 S.Continue (e, ())} k () of
adamc@10 527 S.Return _ => true
adamc@10 528 | S.Continue _ => false
adamc@10 529
adamc@211 530 fun mapB {kind, con, exp, bind} ctx e =
adamc@623 531 case mapfoldB {kind = fn ctx => fn k => fn () => S.Continue (kind ctx k, ()),
adamc@211 532 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@211 533 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@211 534 bind = bind} ctx e () of
adamc@211 535 S.Continue (e, ()) => e
adamc@211 536 | S.Return _ => raise Fail "ElabUtil.Exp.mapB: Impossible"
adamc@211 537
adamc@448 538 fun foldB {kind, con, exp, bind} ctx st e =
adamc@623 539 case mapfoldB {kind = fn ctx => fn k => fn st => S.Continue (k, kind (ctx, k, st)),
adamc@448 540 con = fn ctx => fn c => fn st => S.Continue (c, con (ctx, c, st)),
adamc@448 541 exp = fn ctx => fn e => fn st => S.Continue (e, exp (ctx, e, st)),
adamc@448 542 bind = bind} ctx e st of
adamc@448 543 S.Continue (_, st) => st
adamc@448 544 | S.Return _ => raise Fail "ElabUtil.Exp.foldB: Impossible"
adamc@448 545
adamc@10 546 end
adamc@10 547
adamc@34 548 structure Sgn = struct
adamc@34 549
adamc@34 550 datatype binder =
adamc@623 551 RelK of string
adamc@623 552 | RelC of string * Elab.kind
adamc@792 553 | NamedC of string * int * Elab.kind * Elab.con option
adamc@792 554 | Str of string * int * Elab.sgn
adamc@792 555 | Sgn of string * int * Elab.sgn
adamc@34 556
adamc@34 557 fun mapfoldB {kind, con, sgn_item, sgn, bind} =
adamc@34 558 let
adamc@34 559 fun bind' (ctx, b) =
adamc@34 560 let
adamc@34 561 val b' = case b of
adamc@623 562 Con.RelK x => RelK x
adamc@623 563 | Con.RelC x => RelC x
adamc@623 564 | Con.NamedC x => NamedC x
adamc@34 565 in
adamc@34 566 bind (ctx, b')
adamc@34 567 end
adamc@34 568 val con = Con.mapfoldB {kind = kind, con = con, bind = bind'}
adamc@34 569
adamc@623 570 val kind = Kind.mapfoldB {kind = kind, bind = fn (ctx, x) => bind (ctx, RelK x)}
adamc@34 571
adamc@34 572 fun sgi ctx si acc =
adamc@34 573 S.bindP (sgi' ctx si acc, sgn_item ctx)
adamc@34 574
adamc@156 575 and sgi' ctx (siAll as (si, loc)) =
adamc@34 576 case si of
adamc@34 577 SgiConAbs (x, n, k) =>
adamc@623 578 S.map2 (kind ctx k,
adamc@34 579 fn k' =>
adamc@34 580 (SgiConAbs (x, n, k'), loc))
adamc@34 581 | SgiCon (x, n, k, c) =>
adamc@623 582 S.bind2 (kind ctx k,
adamc@34 583 fn k' =>
adamc@34 584 S.map2 (con ctx c,
adamc@34 585 fn c' =>
adamc@34 586 (SgiCon (x, n, k', c'), loc)))
adamc@805 587 | SgiDatatype dts =>
adamc@805 588 S.map2 (ListUtil.mapfold (fn (x, n, xs, xncs) =>
adamc@805 589 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@805 590 case c of
adamc@805 591 NONE => S.return2 (x, n, c)
adamc@805 592 | SOME c =>
adamc@805 593 S.map2 (con ctx c,
adamc@805 594 fn c' => (x, n, SOME c'))) xncs,
adamc@805 595 fn xncs' => (x, n, xs, xncs'))) dts,
adamc@805 596 fn dts' =>
adamc@805 597 (SgiDatatype dts', loc))
adamc@191 598 | SgiDatatypeImp (x, n, m1, ms, s, xs, xncs) =>
adamc@162 599 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@162 600 case c of
adamc@162 601 NONE => S.return2 (x, n, c)
adamc@162 602 | SOME c =>
adamc@162 603 S.map2 (con ctx c,
adamc@162 604 fn c' => (x, n, SOME c'))) xncs,
adamc@162 605 fn xncs' =>
adamc@191 606 (SgiDatatypeImp (x, n, m1, ms, s, xs, xncs'), loc))
adamc@34 607 | SgiVal (x, n, c) =>
adamc@34 608 S.map2 (con ctx c,
adamc@34 609 fn c' =>
adamc@34 610 (SgiVal (x, n, c'), loc))
adamc@34 611 | SgiStr (x, n, s) =>
adamc@34 612 S.map2 (sg ctx s,
adamc@34 613 fn s' =>
adamc@34 614 (SgiStr (x, n, s'), loc))
adamc@59 615 | SgiSgn (x, n, s) =>
adamc@59 616 S.map2 (sg ctx s,
adamc@59 617 fn s' =>
adamc@59 618 (SgiSgn (x, n, s'), loc))
adamc@88 619 | SgiConstraint (c1, c2) =>
adamc@88 620 S.bind2 (con ctx c1,
adamc@88 621 fn c1' =>
adamc@88 622 S.map2 (con ctx c2,
adamc@88 623 fn c2' =>
adamc@88 624 (SgiConstraint (c1', c2'), loc)))
adamc@563 625 | SgiClassAbs (x, n, k) =>
adamc@623 626 S.map2 (kind ctx k,
adamc@563 627 fn k' =>
adamc@563 628 (SgiClassAbs (x, n, k'), loc))
adamc@563 629 | SgiClass (x, n, k, c) =>
adamc@623 630 S.bind2 (kind ctx k,
adamc@563 631 fn k' =>
adamc@563 632 S.map2 (con ctx c,
adamc@563 633 fn c' =>
adamc@563 634 (SgiClass (x, n, k', c'), loc)))
adamc@34 635
adamc@34 636 and sg ctx s acc =
adamc@34 637 S.bindP (sg' ctx s acc, sgn ctx)
adamc@34 638
adamc@34 639 and sg' ctx (sAll as (s, loc)) =
adamc@34 640 case s of
adamc@34 641 SgnConst sgis =>
adamc@34 642 S.map2 (ListUtil.mapfoldB (fn (ctx, si) =>
adamc@34 643 (case #1 si of
adamc@329 644 SgiConAbs (x, n, k) =>
adamc@792 645 bind (ctx, NamedC (x, n, k, NONE))
adamc@792 646 | SgiCon (x, n, k, c) =>
adamc@792 647 bind (ctx, NamedC (x, n, k, SOME c))
adamc@805 648 | SgiDatatype dts =>
adamc@805 649 foldl (fn ((x, n, ks, _), ctx) =>
adamc@805 650 let
adamc@805 651 val k' = (KType, loc)
adamc@805 652 val k = foldl (fn (_, k) => (KArrow (k', k), loc))
adamc@805 653 k' ks
adamc@805 654 in
adamc@805 655 bind (ctx, NamedC (x, n, k, NONE))
adamc@805 656 end) ctx dts
adamc@792 657 | SgiDatatypeImp (x, n, m1, ms, s, _, _) =>
adamc@792 658 bind (ctx, NamedC (x, n, (KType, loc),
adamc@792 659 SOME (CModProj (m1, ms, s), loc)))
adamc@34 660 | SgiVal _ => ctx
adamc@792 661 | SgiStr (x, n, sgn) =>
adamc@792 662 bind (ctx, Str (x, n, sgn))
adamc@792 663 | SgiSgn (x, n, sgn) =>
adamc@792 664 bind (ctx, Sgn (x, n, sgn))
adamc@203 665 | SgiConstraint _ => ctx
adamc@563 666 | SgiClassAbs (x, n, k) =>
adamc@792 667 bind (ctx, NamedC (x, n, (KArrow (k, (KType, loc)), loc), NONE))
adamc@792 668 | SgiClass (x, n, k, c) =>
adamc@792 669 bind (ctx, NamedC (x, n, (KArrow (k, (KType, loc)), loc), SOME c)),
adamc@34 670 sgi ctx si)) ctx sgis,
adamc@34 671 fn sgis' =>
adamc@34 672 (SgnConst sgis', loc))
adamc@34 673
adamc@34 674 | SgnVar _ => S.return2 sAll
adamc@41 675 | SgnFun (m, n, s1, s2) =>
adamc@41 676 S.bind2 (sg ctx s1,
adamc@41 677 fn s1' =>
adamc@792 678 S.map2 (sg (bind (ctx, Str (m, n, s1'))) s2,
adamc@41 679 fn s2' =>
adamc@41 680 (SgnFun (m, n, s1', s2'), loc)))
adamc@59 681 | SgnProj _ => S.return2 sAll
adamc@42 682 | SgnWhere (sgn, x, c) =>
adamc@42 683 S.bind2 (sg ctx sgn,
adamc@42 684 fn sgn' =>
adamc@42 685 S.map2 (con ctx c,
adamc@42 686 fn c' =>
adamc@42 687 (SgnWhere (sgn', x, c'), loc)))
adamc@34 688 | SgnError => S.return2 sAll
adamc@34 689 in
adamc@34 690 sg
adamc@34 691 end
adamc@34 692
adamc@34 693 fun mapfold {kind, con, sgn_item, sgn} =
adamc@623 694 mapfoldB {kind = fn () => kind,
adamc@34 695 con = fn () => con,
adamc@34 696 sgn_item = fn () => sgn_item,
adamc@34 697 sgn = fn () => sgn,
adamc@34 698 bind = fn ((), _) => ()} ()
adamc@34 699
adamc@792 700 fun mapB {kind, con, sgn_item, sgn, bind} ctx s =
adamc@792 701 case mapfoldB {kind = fn ctx => fn k => fn () => S.Continue (kind ctx k, ()),
adamc@792 702 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@792 703 sgn_item = fn ctx => fn sgi => fn () => S.Continue (sgn_item ctx sgi, ()),
adamc@792 704 sgn = fn ctx => fn s => fn () => S.Continue (sgn ctx s, ()),
adamc@792 705 bind = bind} ctx s () of
adamc@792 706 S.Continue (s, ()) => s
adamc@792 707 | S.Return _ => raise Fail "ElabUtil.Sgn.mapB: Impossible"
adamc@792 708
adamc@34 709 fun map {kind, con, sgn_item, sgn} s =
adamc@34 710 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@34 711 con = fn c => fn () => S.Continue (con c, ()),
adamc@34 712 sgn_item = fn si => fn () => S.Continue (sgn_item si, ()),
adamc@34 713 sgn = fn s => fn () => S.Continue (sgn s, ())} s () of
adamc@34 714 S.Return () => raise Fail "Elab_util.Sgn.map"
adamc@34 715 | S.Continue (s, ()) => s
adamc@34 716
adamc@2 717 end
adamc@34 718
adamc@76 719 structure Decl = struct
adamc@76 720
adamc@76 721 datatype binder =
adamc@623 722 RelK of string
adamc@623 723 | RelC of string * Elab.kind
adamc@792 724 | NamedC of string * int * Elab.kind * Elab.con option
adamc@76 725 | RelE of string * Elab.con
adamc@76 726 | NamedE of string * Elab.con
adamc@76 727 | Str of string * Elab.sgn
adamc@76 728 | Sgn of string * Elab.sgn
adamc@76 729
adamc@76 730 fun mapfoldB {kind = fk, con = fc, exp = fe, sgn_item = fsgi, sgn = fsg, str = fst, decl = fd, bind} =
adamc@76 731 let
adamc@623 732 val mfk = Kind.mapfoldB {kind = fk, bind = fn (ctx, x) => bind (ctx, RelK x)}
adamc@76 733
adamc@76 734 fun bind' (ctx, b) =
adamc@76 735 let
adamc@76 736 val b' = case b of
adamc@623 737 Con.RelK x => RelK x
adamc@623 738 | Con.RelC x => RelC x
adamc@623 739 | Con.NamedC x => NamedC x
adamc@76 740 in
adamc@76 741 bind (ctx, b')
adamc@76 742 end
adamc@76 743 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@76 744
adamc@76 745 fun bind' (ctx, b) =
adamc@76 746 let
adamc@76 747 val b' = case b of
adamc@623 748 Exp.RelK x => RelK x
adamc@623 749 | Exp.RelC x => RelC x
adamc@76 750 | Exp.NamedC x => NamedC x
adamc@76 751 | Exp.RelE x => RelE x
adamc@76 752 | Exp.NamedE x => NamedE x
adamc@76 753 in
adamc@76 754 bind (ctx, b')
adamc@76 755 end
adamc@76 756 val mfe = Exp.mapfoldB {kind = fk, con = fc, exp = fe, bind = bind'}
adamc@76 757
adamc@76 758 fun bind' (ctx, b) =
adamc@76 759 let
adamc@76 760 val b' = case b of
adamc@623 761 Sgn.RelK x => RelK x
adamc@623 762 | Sgn.RelC x => RelC x
adamc@76 763 | Sgn.NamedC x => NamedC x
adamc@792 764 | Sgn.Sgn (x, _, y) => Sgn (x, y)
adamc@792 765 | Sgn.Str (x, _, y) => Str (x, y)
adamc@76 766 in
adamc@76 767 bind (ctx, b')
adamc@76 768 end
adamc@76 769 val mfsg = Sgn.mapfoldB {kind = fk, con = fc, sgn_item = fsgi, sgn = fsg, bind = bind'}
adamc@76 770
adamc@76 771 fun mfst ctx str acc =
adamc@76 772 S.bindP (mfst' ctx str acc, fst ctx)
adamc@76 773
adamc@76 774 and mfst' ctx (strAll as (str, loc)) =
adamc@76 775 case str of
adamc@76 776 StrConst ds =>
adamc@76 777 S.map2 (ListUtil.mapfoldB (fn (ctx, d) =>
adamc@76 778 (case #1 d of
adamc@792 779 DCon (x, n, k, c) =>
adamc@792 780 bind (ctx, NamedC (x, n, k, SOME c))
adamc@805 781 | DDatatype dts =>
adamc@156 782 let
adamc@805 783 fun doOne ((x, n, xs, xncs), ctx) =
adamc@805 784 let
adamc@805 785 val ctx = bind (ctx, NamedC (x, n, (KType, loc), NONE))
adamc@805 786 in
adamc@805 787 foldl (fn ((x, _, co), ctx) =>
adamc@805 788 let
adamc@805 789 val t =
adamc@805 790 case co of
adamc@805 791 NONE => CNamed n
adamc@805 792 | SOME t => TFun (t, (CNamed n, loc))
adamc@805 793
adamc@805 794 val k = (KType, loc)
adamc@805 795 val t = (t, loc)
adamc@805 796 val t = foldr (fn (x, t) =>
adamc@805 797 (TCFun (Explicit,
adamc@805 798 x,
adamc@805 799 k,
adamc@805 800 t), loc))
adamc@805 801 t xs
adamc@805 802 in
adamc@805 803 bind (ctx, NamedE (x, t))
adamc@805 804 end)
adamc@805 805 ctx xncs
adamc@805 806 end
adamc@156 807 in
adamc@805 808 foldl doOne ctx dts
adamc@156 809 end
adamc@191 810 | DDatatypeImp (x, n, m, ms, x', _, _) =>
adamc@792 811 bind (ctx, NamedC (x, n, (KType, loc),
adamc@792 812 SOME (CModProj (m, ms, x'), loc)))
adamc@76 813 | DVal (x, _, c, _) =>
adamc@76 814 bind (ctx, NamedE (x, c))
adamc@123 815 | DValRec vis =>
adamc@123 816 foldl (fn ((x, _, c, _), ctx) => bind (ctx, NamedE (x, c))) ctx vis
adamc@76 817 | DSgn (x, _, sgn) =>
adamc@76 818 bind (ctx, Sgn (x, sgn))
adamc@76 819 | DStr (x, _, sgn, _) =>
adamc@76 820 bind (ctx, Str (x, sgn))
adamc@76 821 | DFfiStr (x, _, sgn) =>
adamc@88 822 bind (ctx, Str (x, sgn))
adamc@100 823 | DConstraint _ => ctx
adamc@203 824 | DExport _ => ctx
adamc@707 825 | DTable (tn, x, n, c, _, pc, _, cc) =>
adamc@705 826 let
adamc@705 827 val ct = (CModProj (n, [], "sql_table"), loc)
adamc@705 828 val ct = (CApp (ct, c), loc)
adamc@707 829 val ct = (CApp (ct, (CConcat (pc, cc), loc)), loc)
adamc@705 830 in
adamc@705 831 bind (ctx, NamedE (x, ct))
adamc@705 832 end
adamc@338 833 | DSequence (tn, x, n) =>
adamc@338 834 bind (ctx, NamedE (x, (CModProj (n, [], "sql_sequence"), loc)))
adamc@754 835 | DView (tn, x, n, _, c) =>
adamc@754 836 let
adamc@754 837 val ct = (CModProj (n, [], "sql_view"), loc)
adamc@754 838 val ct = (CApp (ct, c), loc)
adamc@754 839 in
adamc@754 840 bind (ctx, NamedE (x, ct))
adamc@754 841 end
adamc@792 842 | DClass (x, n, k, c) =>
adamc@792 843 bind (ctx, NamedC (x, n, (KArrow (k, (KType, loc)), loc), SOME c))
adamc@459 844 | DDatabase _ => ctx
adamc@459 845 | DCookie (tn, x, n, c) =>
adamc@459 846 bind (ctx, NamedE (x, (CApp ((CModProj (n, [], "cookie"), loc),
adamc@718 847 c), loc)))
adamc@720 848 | DStyle (tn, x, n) =>
adamc@720 849 bind (ctx, NamedE (x, (CModProj (n, [], "css_class"), loc))),
adamc@76 850 mfd ctx d)) ctx ds,
adamc@76 851 fn ds' => (StrConst ds', loc))
adamc@76 852 | StrVar _ => S.return2 strAll
adamc@76 853 | StrProj (str, x) =>
adamc@76 854 S.map2 (mfst ctx str,
adamc@76 855 fn str' =>
adamc@76 856 (StrProj (str', x), loc))
adamc@76 857 | StrFun (x, n, sgn1, sgn2, str) =>
adamc@76 858 S.bind2 (mfsg ctx sgn1,
adamc@76 859 fn sgn1' =>
adamc@76 860 S.bind2 (mfsg ctx sgn2,
adamc@76 861 fn sgn2' =>
adamc@76 862 S.map2 (mfst ctx str,
adamc@76 863 fn str' =>
adamc@76 864 (StrFun (x, n, sgn1', sgn2', str'), loc))))
adamc@76 865 | StrApp (str1, str2) =>
adamc@76 866 S.bind2 (mfst ctx str1,
adamc@76 867 fn str1' =>
adamc@76 868 S.map2 (mfst ctx str2,
adamc@76 869 fn str2' =>
adamc@76 870 (StrApp (str1', str2'), loc)))
adamc@76 871 | StrError => S.return2 strAll
adamc@76 872
adamc@76 873 and mfd ctx d acc =
adamc@76 874 S.bindP (mfd' ctx d acc, fd ctx)
adamc@76 875
adamc@76 876 and mfd' ctx (dAll as (d, loc)) =
adamc@76 877 case d of
adamc@76 878 DCon (x, n, k, c) =>
adamc@623 879 S.bind2 (mfk ctx k,
adamc@76 880 fn k' =>
adamc@76 881 S.map2 (mfc ctx c,
adamc@76 882 fn c' =>
adamc@76 883 (DCon (x, n, k', c'), loc)))
adamc@805 884 | DDatatype dts =>
adamc@805 885 S.map2 (ListUtil.mapfold (fn (x, n, xs, xncs) =>
adamc@805 886 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@805 887 case c of
adamc@805 888 NONE => S.return2 (x, n, c)
adamc@805 889 | SOME c =>
adamc@805 890 S.map2 (mfc ctx c,
adamc@805 891 fn c' => (x, n, SOME c'))) xncs,
adamc@805 892 fn xncs' =>
adamc@805 893 (x, n, xs, xncs'))) dts,
adamc@805 894 fn dts' =>
adamc@805 895 (DDatatype dts', loc))
adamc@191 896 | DDatatypeImp (x, n, m1, ms, s, xs, xncs) =>
adamc@162 897 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@162 898 case c of
adamc@162 899 NONE => S.return2 (x, n, c)
adamc@162 900 | SOME c =>
adamc@162 901 S.map2 (mfc ctx c,
adamc@162 902 fn c' => (x, n, SOME c'))) xncs,
adamc@162 903 fn xncs' =>
adamc@191 904 (DDatatypeImp (x, n, m1, ms, s, xs, xncs'), loc))
adamc@123 905 | DVal vi =>
adamc@123 906 S.map2 (mfvi ctx vi,
adamc@123 907 fn vi' =>
adamc@123 908 (DVal vi', loc))
adamc@123 909 | DValRec vis =>
adamc@123 910 S.map2 (ListUtil.mapfold (mfvi ctx) vis,
adamc@123 911 fn vis' =>
adamc@123 912 (DValRec vis', loc))
adamc@76 913 | DSgn (x, n, sgn) =>
adamc@76 914 S.map2 (mfsg ctx sgn,
adamc@76 915 fn sgn' =>
adamc@76 916 (DSgn (x, n, sgn'), loc))
adamc@76 917 | DStr (x, n, sgn, str) =>
adamc@76 918 S.bind2 (mfsg ctx sgn,
adamc@76 919 fn sgn' =>
adamc@76 920 S.map2 (mfst ctx str,
adamc@76 921 fn str' =>
adamc@76 922 (DStr (x, n, sgn', str'), loc)))
adamc@76 923 | DFfiStr (x, n, sgn) =>
adamc@76 924 S.map2 (mfsg ctx sgn,
adamc@76 925 fn sgn' =>
adamc@76 926 (DFfiStr (x, n, sgn'), loc))
adamc@88 927 | DConstraint (c1, c2) =>
adamc@88 928 S.bind2 (mfc ctx c1,
adamc@88 929 fn c1' =>
adamc@88 930 S.map2 (mfc ctx c2,
adamc@88 931 fn c2' =>
adamc@88 932 (DConstraint (c1', c2'), loc)))
adamc@109 933 | DExport (en, sgn, str) =>
adamc@109 934 S.bind2 (mfsg ctx sgn,
adamc@109 935 fn sgn' =>
adamc@109 936 S.map2 (mfst ctx str,
adamc@109 937 fn str' =>
adamc@109 938 (DExport (en, sgn', str'), loc)))
adamc@123 939
adamc@707 940 | DTable (tn, x, n, c, pe, pc, ce, cc) =>
adamc@704 941 S.bind2 (mfc ctx c,
adamc@203 942 fn c' =>
adamc@707 943 S.bind2 (mfe ctx pe,
adamc@707 944 fn pe' =>
adamc@707 945 S.bind2 (mfc ctx pc,
adamc@707 946 fn pc' =>
adamc@707 947 S.bind2 (mfe ctx ce,
adamc@707 948 fn ce' =>
adamc@707 949 S.map2 (mfc ctx cc,
adamc@707 950 fn cc' =>
adamc@707 951 (DTable (tn, x, n, c', pe', pc', ce', cc'), loc))))))
adamc@338 952 | DSequence _ => S.return2 dAll
adamc@754 953 | DView (tn, x, n, e, c) =>
adamc@754 954 S.bind2 (mfe ctx e,
adamc@754 955 fn e' =>
adamc@754 956 S.map2 (mfc ctx c,
adamc@754 957 fn c' =>
adamc@754 958 (DView (tn, x, n, e', c'), loc)))
adamc@203 959
adamc@563 960 | DClass (x, n, k, c) =>
adamc@623 961 S.bind2 (mfk ctx k,
adamc@563 962 fn k' =>
adamc@563 963 S.map2 (mfc ctx c,
adamc@563 964 fn c' =>
adamc@563 965 (DClass (x, n, k', c'), loc)))
adamc@213 966
adamc@338 967 | DDatabase _ => S.return2 dAll
adamc@271 968
adamc@459 969 | DCookie (tn, x, n, c) =>
adamc@459 970 S.map2 (mfc ctx c,
adamc@459 971 fn c' =>
adamc@459 972 (DCookie (tn, x, n, c'), loc))
adamc@720 973 | DStyle _ => S.return2 dAll
adamc@459 974
adamc@123 975 and mfvi ctx (x, n, c, e) =
adamc@123 976 S.bind2 (mfc ctx c,
adamc@123 977 fn c' =>
adamc@123 978 S.map2 (mfe ctx e,
adamc@123 979 fn e' =>
adamc@123 980 (x, n, c', e')))
adamc@76 981 in
adamc@76 982 mfd
adamc@76 983 end
adamc@76 984
adamc@76 985 fun mapfold {kind, con, exp, sgn_item, sgn, str, decl} =
adamc@623 986 mapfoldB {kind = fn () => kind,
adamc@76 987 con = fn () => con,
adamc@76 988 exp = fn () => exp,
adamc@76 989 sgn_item = fn () => sgn_item,
adamc@76 990 sgn = fn () => sgn,
adamc@76 991 str = fn () => str,
adamc@76 992 decl = fn () => decl,
adamc@76 993 bind = fn ((), _) => ()} ()
adamc@76 994
adamc@76 995 fun exists {kind, con, exp, sgn_item, sgn, str, decl} k =
adamc@76 996 case mapfold {kind = fn k => fn () =>
adamc@76 997 if kind k then
adamc@76 998 S.Return ()
adamc@76 999 else
adamc@76 1000 S.Continue (k, ()),
adamc@76 1001 con = fn c => fn () =>
adamc@76 1002 if con c then
adamc@76 1003 S.Return ()
adamc@76 1004 else
adamc@76 1005 S.Continue (c, ()),
adamc@76 1006 exp = fn e => fn () =>
adamc@76 1007 if exp e then
adamc@76 1008 S.Return ()
adamc@76 1009 else
adamc@76 1010 S.Continue (e, ()),
adamc@76 1011 sgn_item = fn sgi => fn () =>
adamc@76 1012 if sgn_item sgi then
adamc@76 1013 S.Return ()
adamc@76 1014 else
adamc@76 1015 S.Continue (sgi, ()),
adamc@76 1016 sgn = fn x => fn () =>
adamc@76 1017 if sgn x then
adamc@76 1018 S.Return ()
adamc@76 1019 else
adamc@76 1020 S.Continue (x, ()),
adamc@76 1021 str = fn x => fn () =>
adamc@76 1022 if str x then
adamc@76 1023 S.Return ()
adamc@76 1024 else
adamc@76 1025 S.Continue (x, ()),
adamc@76 1026 decl = fn x => fn () =>
adamc@76 1027 if decl x then
adamc@76 1028 S.Return ()
adamc@76 1029 else
adamc@76 1030 S.Continue (x, ())} k () of
adamc@76 1031 S.Return _ => true
adamc@76 1032 | S.Continue _ => false
adamc@76 1033
adamc@76 1034 fun search {kind, con, exp, sgn_item, sgn, str, decl} k =
adamc@76 1035 case mapfold {kind = fn x => fn () =>
adamc@76 1036 case kind x of
adamc@76 1037 NONE => S.Continue (x, ())
adamc@76 1038 | SOME v => S.Return v,
adamc@76 1039
adamc@76 1040 con = fn x => fn () =>
adamc@76 1041 case con x of
adamc@76 1042 NONE => S.Continue (x, ())
adamc@76 1043 | SOME v => S.Return v,
adamc@76 1044
adamc@76 1045 exp = fn x => fn () =>
adamc@76 1046 case exp x of
adamc@76 1047 NONE => S.Continue (x, ())
adamc@76 1048 | SOME v => S.Return v,
adamc@76 1049
adamc@76 1050 sgn_item = fn x => fn () =>
adamc@76 1051 case sgn_item x of
adamc@76 1052 NONE => S.Continue (x, ())
adamc@76 1053 | SOME v => S.Return v,
adamc@76 1054
adamc@76 1055 sgn = fn x => fn () =>
adamc@76 1056 case sgn x of
adamc@76 1057 NONE => S.Continue (x, ())
adamc@76 1058 | SOME v => S.Return v,
adamc@76 1059
adamc@76 1060 str = fn x => fn () =>
adamc@76 1061 case str x of
adamc@76 1062 NONE => S.Continue (x, ())
adamc@76 1063 | SOME v => S.Return v,
adamc@76 1064
adamc@76 1065 decl = fn x => fn () =>
adamc@76 1066 case decl x of
adamc@76 1067 NONE => S.Continue (x, ())
adamc@76 1068 | SOME v => S.Return v
adamc@76 1069
adamc@76 1070 } k () of
adamc@76 1071 S.Return x => SOME x
adamc@76 1072 | S.Continue _ => NONE
adamc@76 1073
adamc@448 1074 fun foldMapB {kind, con, exp, sgn_item, sgn, str, decl, bind} ctx st d =
adamc@623 1075 case mapfoldB {kind = fn ctx => fn x => fn st => S.Continue (kind (ctx, x, st)),
adamc@448 1076 con = fn ctx => fn x => fn st => S.Continue (con (ctx, x, st)),
adamc@448 1077 exp = fn ctx => fn x => fn st => S.Continue (exp (ctx, x, st)),
adamc@448 1078 sgn_item = fn ctx => fn x => fn st => S.Continue (sgn_item (ctx, x, st)),
adamc@448 1079 sgn = fn ctx => fn x => fn st => S.Continue (sgn (ctx, x, st)),
adamc@448 1080 str = fn ctx => fn x => fn st => S.Continue (str (ctx, x, st)),
adamc@448 1081 decl = fn ctx => fn x => fn st => S.Continue (decl (ctx, x, st)),
adamc@448 1082 bind = bind} ctx d st of
adamc@448 1083 S.Continue x => x
adamc@448 1084 | S.Return _ => raise Fail "ElabUtil.Decl.foldMapB: Impossible"
adamc@448 1085
adamc@448 1086 end
adamc@448 1087
adamc@448 1088 structure File = struct
adamc@448 1089
adamc@448 1090 fun maxName ds = foldl (fn (d, count) => Int.max (maxNameDecl d, count)) 0 ds
adamc@448 1091
adamc@448 1092 and maxNameDecl (d, _) =
adamc@448 1093 case d of
adamc@448 1094 DCon (_, n, _, _) => n
adamc@805 1095 | DDatatype dts =>
adamc@805 1096 foldl (fn ((_, n, _, ns), max) =>
adamc@448 1097 foldl (fn ((_, n', _), m) => Int.max (n', m))
adamc@805 1098 (Int.max (n, max)) ns) 0 dts
adamc@448 1099 | DDatatypeImp (_, n1, n2, _, _, _, ns) =>
adamc@448 1100 foldl (fn ((_, n', _), m) => Int.max (n', m))
adamc@448 1101 (Int.max (n1, n2)) ns
adamc@448 1102 | DVal (_, n, _, _) => n
adamc@448 1103 | DValRec vis => foldl (fn ((_, n, _, _), count) => Int.max (n, count)) 0 vis
adamc@448 1104 | DStr (_, n, sgn, str) => Int.max (n, Int.max (maxNameSgn sgn, maxNameStr str))
adamc@448 1105 | DSgn (_, n, sgn) => Int.max (n, maxNameSgn sgn)
adamc@448 1106 | DFfiStr (_, n, sgn) => Int.max (n, maxNameSgn sgn)
adamc@448 1107 | DConstraint _ => 0
adamc@563 1108 | DClass (_, n, _, _) => n
adamc@448 1109 | DExport _ => 0
adamc@707 1110 | DTable (n1, _, n2, _, _, _, _, _) => Int.max (n1, n2)
adamc@459 1111 | DSequence (n1, _, n2) => Int.max (n1, n2)
adamc@754 1112 | DView (n1, _, n2, _, _) => Int.max (n1, n2)
adamc@448 1113 | DDatabase _ => 0
adamc@459 1114 | DCookie (n1, _, n2, _) => Int.max (n1, n2)
adamc@720 1115 | DStyle (n1, _, n2) => Int.max (n1, n2)
adamc@448 1116 and maxNameStr (str, _) =
adamc@448 1117 case str of
adamc@448 1118 StrConst ds => maxName ds
adamc@448 1119 | StrVar n => n
adamc@448 1120 | StrProj (str, _) => maxNameStr str
adamc@448 1121 | StrFun (_, n, dom, ran, str) => foldl Int.max n [maxNameSgn dom, maxNameSgn ran, maxNameStr str]
adamc@448 1122 | StrApp (str1, str2) => Int.max (maxNameStr str1, maxNameStr str2)
adamc@448 1123 | StrError => 0
adamc@448 1124
adamc@448 1125 and maxNameSgn (sgn, _) =
adamc@448 1126 case sgn of
adamc@448 1127 SgnConst sgis => foldl (fn (sgi, count) => Int.max (maxNameSgi sgi, count)) 0 sgis
adamc@448 1128 | SgnVar n => n
adamc@448 1129 | SgnFun (_, n, dom, ran) => Int.max (n, Int.max (maxNameSgn dom, maxNameSgn ran))
adamc@448 1130 | SgnWhere (sgn, _, _) => maxNameSgn sgn
adamc@448 1131 | SgnProj (n, _, _) => n
adamc@448 1132 | SgnError => 0
adamc@448 1133
adamc@448 1134 and maxNameSgi (sgi, _) =
adamc@448 1135 case sgi of
adamc@448 1136 SgiConAbs (_, n, _) => n
adamc@448 1137 | SgiCon (_, n, _, _) => n
adamc@805 1138 | SgiDatatype dts =>
adamc@805 1139 foldl (fn ((_, n, _, ns), max) =>
adamc@805 1140 foldl (fn ((_, n', _), m) => Int.max (n', m))
adamc@805 1141 (Int.max (n, max)) ns) 0 dts
adamc@448 1142 | SgiDatatypeImp (_, n1, n2, _, _, _, ns) =>
adamc@448 1143 foldl (fn ((_, n', _), m) => Int.max (n', m))
adamc@448 1144 (Int.max (n1, n2)) ns
adamc@448 1145 | SgiVal (_, n, _) => n
adamc@448 1146 | SgiStr (_, n, sgn) => Int.max (n, maxNameSgn sgn)
adamc@448 1147 | SgiSgn (_, n, sgn) => Int.max (n, maxNameSgn sgn)
adamc@448 1148 | SgiConstraint _ => 0
adamc@563 1149 | SgiClassAbs (_, n, _) => n
adamc@563 1150 | SgiClass (_, n, _, _) => n
adamc@448 1151
adamc@34 1152 end
adamc@76 1153
adamc@76 1154 end