Mercurial > urweb

annotate src/elab_util.sml @ 254:f8d9395575ec

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Monoized binary operators
author Adam Chlipala <adamc@hcoop.net>
date Sun, 31 Aug 2008 14:33:22 -0400
parents 19e5791923d0
children 42dfb0d61cf0
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@6 46 fun mapfold f =
adamc@2 47 let
adamc@2 48 fun mfk k acc =
adamc@2 49 S.bindP (mfk' k acc, f)
adamc@2 50
adamc@2 51 and mfk' (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@2 56 S.bind2 (mfk k1,
adamc@2 57 fn k1' =>
adamc@2 58 S.map2 (mfk 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@2 65 S.map2 (mfk 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@207 72 S.map2 (ListUtil.mapfold mfk 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@76 78 | KUnif (_, _, ref (SOME k)) => mfk' k
adamc@2 79 | KUnif _ => S.return2 kAll
adamc@2 80 in
adamc@2 81 mfk
adamc@2 82 end
adamc@2 83
adamc@2 84 fun exists f k =
adamc@6 85 case mapfold (fn k => fn () =>
adamc@6 86 if f k then
adamc@6 87 S.Return ()
adamc@6 88 else
adamc@6 89 S.Continue (k, ())) k () of
adamc@6 90 S.Return _ => true
adamc@6 91 | S.Continue _ => false
adamc@6 92
adamc@6 93 end
adamc@6 94
adamc@6 95 structure Con = struct
adamc@6 96
adamc@11 97 datatype binder =
adamc@11 98 Rel of string * Elab.kind
adamc@11 99 | Named of string * Elab.kind
adamc@11 100
adamc@11 101 fun mapfoldB {kind = fk, con = fc, bind} =
adamc@6 102 let
adamc@6 103 val mfk = Kind.mapfold fk
adamc@6 104
adamc@11 105 fun mfc ctx c acc =
adamc@11 106 S.bindP (mfc' ctx c acc, fc ctx)
adamc@6 107
adamc@11 108 and mfc' ctx (cAll as (c, loc)) =
adamc@6 109 case c of
adamc@6 110 TFun (c1, c2) =>
adamc@11 111 S.bind2 (mfc ctx c1,
adamc@6 112 fn c1' =>
adamc@11 113 S.map2 (mfc ctx c2,
adamc@6 114 fn c2' =>
adamc@6 115 (TFun (c1', c2'), loc)))
adamc@6 116 | TCFun (e, x, k, c) =>
adamc@6 117 S.bind2 (mfk k,
adamc@6 118 fn k' =>
adamc@11 119 S.map2 (mfc (bind (ctx, Rel (x, k))) c,
adamc@6 120 fn c' =>
adamc@6 121 (TCFun (e, x, k', c'), loc)))
adamc@85 122 | TDisjoint (c1, c2, c3) =>
adamc@85 123 S.bind2 (mfc ctx c1,
adamc@85 124 fn c1' =>
adamc@85 125 S.bind2 (mfc ctx c2,
adamc@85 126 fn c2' =>
adamc@85 127 S.map2 (mfc ctx c3,
adamc@85 128 fn c3' =>
adamc@85 129 (TDisjoint (c1', c2', c3'), loc))))
adamc@6 130 | TRecord c =>
adamc@11 131 S.map2 (mfc ctx c,
adamc@6 132 fn c' =>
adamc@6 133 (TRecord c', loc))
adamc@6 134
adamc@6 135 | CRel _ => S.return2 cAll
adamc@6 136 | CNamed _ => S.return2 cAll
adamc@34 137 | CModProj _ => S.return2 cAll
adamc@6 138 | CApp (c1, c2) =>
adamc@11 139 S.bind2 (mfc ctx c1,
adamc@6 140 fn c1' =>
adamc@11 141 S.map2 (mfc ctx c2,
adamc@6 142 fn c2' =>
adamc@6 143 (CApp (c1', c2'), loc)))
adamc@8 144 | CAbs (x, k, c) =>
adamc@6 145 S.bind2 (mfk k,
adamc@6 146 fn k' =>
adamc@11 147 S.map2 (mfc (bind (ctx, Rel (x, k))) c,
adamc@6 148 fn c' =>
adamc@8 149 (CAbs (x, k', c'), loc)))
adamc@84 150 | CDisjoint (c1, c2, c3) =>
adamc@84 151 S.bind2 (mfc ctx c1,
adamc@84 152 fn c1' =>
adamc@84 153 S.bind2 (mfc ctx c2,
adamc@84 154 fn c2' =>
adamc@84 155 S.map2 (mfc ctx c3,
adamc@84 156 fn c3' =>
adamc@84 157 (CDisjoint (c1', c2', c3'), loc))))
adamc@6 158
adamc@6 159 | CName _ => S.return2 cAll
adamc@6 160
adamc@6 161 | CRecord (k, xcs) =>
adamc@6 162 S.bind2 (mfk k,
adamc@6 163 fn k' =>
adamc@6 164 S.map2 (ListUtil.mapfold (fn (x, c) =>
adamc@11 165 S.bind2 (mfc ctx x,
adamc@6 166 fn x' =>
adamc@11 167 S.map2 (mfc ctx c,
adamc@6 168 fn c' =>
adamc@6 169 (x', c'))))
adamc@6 170 xcs,
adamc@6 171 fn xcs' =>
adamc@6 172 (CRecord (k', xcs'), loc)))
adamc@6 173 | CConcat (c1, c2) =>
adamc@11 174 S.bind2 (mfc ctx c1,
adamc@6 175 fn c1' =>
adamc@11 176 S.map2 (mfc ctx c2,
adamc@6 177 fn c2' =>
adamc@6 178 (CConcat (c1', c2'), loc)))
adamc@67 179 | CFold (k1, k2) =>
adamc@67 180 S.bind2 (mfk k1,
adamc@67 181 fn k1' =>
adamc@67 182 S.map2 (mfk k2,
adamc@67 183 fn k2' =>
adamc@67 184 (CFold (k1', k2'), loc)))
adamc@6 185
adamc@82 186 | CUnit => S.return2 cAll
adamc@82 187
adamc@207 188 | CTuple cs =>
adamc@207 189 S.map2 (ListUtil.mapfold (mfc ctx) cs,
adamc@207 190 fn cs' =>
adamc@207 191 (CTuple cs', loc))
adamc@207 192
adamc@207 193 | CProj (c, n) =>
adamc@207 194 S.map2 (mfc ctx c,
adamc@207 195 fn c' =>
adamc@207 196 (CProj (c', n), loc))
adamc@207 197
adamc@6 198 | CError => S.return2 cAll
adamc@76 199 | CUnif (_, _, _, ref (SOME c)) => mfc' ctx c
adamc@6 200 | CUnif _ => S.return2 cAll
adamc@6 201 in
adamc@6 202 mfc
adamc@6 203 end
adamc@6 204
adamc@11 205 fun mapfold {kind = fk, con = fc} =
adamc@11 206 mapfoldB {kind = fk,
adamc@11 207 con = fn () => fc,
adamc@11 208 bind = fn ((), _) => ()} ()
adamc@11 209
adamc@11 210 fun mapB {kind, con, bind} ctx c =
adamc@11 211 case mapfoldB {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@11 212 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@11 213 bind = bind} ctx c () of
adamc@11 214 S.Continue (c, ()) => c
adamc@34 215 | S.Return _ => raise Fail "ElabUtil.Con.mapB: Impossible"
adamc@34 216
adamc@34 217 fun map {kind, con} s =
adamc@34 218 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@34 219 con = fn c => fn () => S.Continue (con c, ())} s () of
adamc@34 220 S.Return () => raise Fail "ElabUtil.Con.map: Impossible"
adamc@34 221 | S.Continue (s, ()) => s
adamc@11 222
adamc@6 223 fun exists {kind, con} k =
adamc@6 224 case mapfold {kind = fn k => fn () =>
adamc@6 225 if kind k then
adamc@6 226 S.Return ()
adamc@6 227 else
adamc@6 228 S.Continue (k, ()),
adamc@6 229 con = fn c => fn () =>
adamc@6 230 if con c then
adamc@6 231 S.Return ()
adamc@6 232 else
adamc@6 233 S.Continue (c, ())} k () of
adamc@2 234 S.Return _ => true
adamc@2 235 | S.Continue _ => false
adamc@2 236
adamc@2 237 end
adamc@2 238
adamc@10 239 structure Exp = struct
adamc@10 240
adamc@11 241 datatype binder =
adamc@11 242 RelC of string * Elab.kind
adamc@11 243 | NamedC of string * Elab.kind
adamc@11 244 | RelE of string * Elab.con
adamc@11 245 | NamedE of string * Elab.con
adamc@11 246
adamc@11 247 fun mapfoldB {kind = fk, con = fc, exp = fe, bind} =
adamc@10 248 let
adamc@10 249 val mfk = Kind.mapfold fk
adamc@10 250
adamc@11 251 fun bind' (ctx, b) =
adamc@11 252 let
adamc@11 253 val b' = case b of
adamc@11 254 Con.Rel x => RelC x
adamc@11 255 | Con.Named x => NamedC x
adamc@11 256 in
adamc@11 257 bind (ctx, b')
adamc@11 258 end
adamc@11 259 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@10 260
adamc@11 261 fun mfe ctx e acc =
adamc@11 262 S.bindP (mfe' ctx e acc, fe ctx)
adamc@11 263
adamc@11 264 and mfe' ctx (eAll as (e, loc)) =
adamc@10 265 case e of
adamc@14 266 EPrim _ => S.return2 eAll
adamc@14 267 | ERel _ => S.return2 eAll
adamc@10 268 | ENamed _ => S.return2 eAll
adamc@34 269 | EModProj _ => S.return2 eAll
adamc@10 270 | EApp (e1, e2) =>
adamc@11 271 S.bind2 (mfe ctx e1,
adamc@10 272 fn e1' =>
adamc@11 273 S.map2 (mfe ctx e2,
adamc@10 274 fn e2' =>
adamc@10 275 (EApp (e1', e2'), loc)))
adamc@26 276 | EAbs (x, dom, ran, e) =>
adamc@26 277 S.bind2 (mfc ctx dom,
adamc@26 278 fn dom' =>
adamc@26 279 S.bind2 (mfc ctx ran,
adamc@26 280 fn ran' =>
adamc@26 281 S.map2 (mfe (bind (ctx, RelE (x, dom'))) e,
adamc@26 282 fn e' =>
adamc@26 283 (EAbs (x, dom', ran', e'), loc))))
adamc@26 284
adamc@10 285 | ECApp (e, c) =>
adamc@11 286 S.bind2 (mfe ctx e,
adamc@10 287 fn e' =>
adamc@11 288 S.map2 (mfc ctx c,
adamc@10 289 fn c' =>
adamc@10 290 (ECApp (e', c'), loc)))
adamc@10 291 | ECAbs (expl, x, k, e) =>
adamc@10 292 S.bind2 (mfk k,
adamc@10 293 fn k' =>
adamc@11 294 S.map2 (mfe (bind (ctx, RelC (x, k))) e,
adamc@10 295 fn e' =>
adamc@10 296 (ECAbs (expl, x, k', e'), loc)))
adamc@10 297
adamc@12 298 | ERecord xes =>
adamc@29 299 S.map2 (ListUtil.mapfold (fn (x, e, t) =>
adamc@12 300 S.bind2 (mfc ctx x,
adamc@12 301 fn x' =>
adamc@29 302 S.bind2 (mfe ctx e,
adamc@12 303 fn e' =>
adamc@29 304 S.map2 (mfc ctx t,
adamc@29 305 fn t' =>
adamc@29 306 (x', e', t')))))
adamc@12 307 xes,
adamc@12 308 fn xes' =>
adamc@12 309 (ERecord xes', loc))
adamc@12 310 | EField (e, c, {field, rest}) =>
adamc@12 311 S.bind2 (mfe ctx e,
adamc@12 312 fn e' =>
adamc@12 313 S.bind2 (mfc ctx c,
adamc@12 314 fn c' =>
adamc@12 315 S.bind2 (mfc ctx field,
adamc@12 316 fn field' =>
adamc@12 317 S.map2 (mfc ctx rest,
adamc@12 318 fn rest' =>
adamc@12 319 (EField (e', c', {field = field', rest = rest'}), loc)))))
adamc@149 320 | ECut (e, c, {field, rest}) =>
adamc@149 321 S.bind2 (mfe ctx e,
adamc@149 322 fn e' =>
adamc@149 323 S.bind2 (mfc ctx c,
adamc@149 324 fn c' =>
adamc@149 325 S.bind2 (mfc ctx field,
adamc@149 326 fn field' =>
adamc@149 327 S.map2 (mfc ctx rest,
adamc@149 328 fn rest' =>
adamc@149 329 (ECut (e', c', {field = field', rest = rest'}), loc)))))
adamc@12 330
adamc@71 331 | EFold k =>
adamc@71 332 S.map2 (mfk k,
adamc@71 333 fn k' =>
adamc@71 334 (EFold k', loc))
adamc@71 335
adamc@182 336 | ECase (e, pes, {disc, result}) =>
adamc@171 337 S.bind2 (mfe ctx e,
adamc@171 338 fn e' =>
adamc@171 339 S.bind2 (ListUtil.mapfold (fn (p, e) =>
adamc@171 340 S.map2 (mfe ctx e,
adamc@171 341 fn e' => (p, e'))) pes,
adamc@171 342 fn pes' =>
adamc@182 343 S.bind2 (mfc ctx disc,
adamc@182 344 fn disc' =>
adamc@182 345 S.map2 (mfc ctx result,
adamc@182 346 fn result' =>
adamc@182 347 (ECase (e', pes', {disc = disc', result = result'}), loc)))))
adamc@171 348
adamc@10 349 | EError => S.return2 eAll
adamc@228 350 | EUnif (ref (SOME e)) => mfe ctx e
adamc@228 351 | EUnif _ => S.return2 eAll
adamc@10 352 in
adamc@10 353 mfe
adamc@10 354 end
adamc@10 355
adamc@11 356 fun mapfold {kind = fk, con = fc, exp = fe} =
adamc@11 357 mapfoldB {kind = fk,
adamc@11 358 con = fn () => fc,
adamc@11 359 exp = fn () => fe,
adamc@11 360 bind = fn ((), _) => ()} ()
adamc@11 361
adamc@10 362 fun exists {kind, con, exp} k =
adamc@10 363 case mapfold {kind = fn k => fn () =>
adamc@10 364 if kind k then
adamc@10 365 S.Return ()
adamc@10 366 else
adamc@10 367 S.Continue (k, ()),
adamc@10 368 con = fn c => fn () =>
adamc@10 369 if con c then
adamc@10 370 S.Return ()
adamc@10 371 else
adamc@10 372 S.Continue (c, ()),
adamc@10 373 exp = fn e => fn () =>
adamc@10 374 if exp e then
adamc@10 375 S.Return ()
adamc@10 376 else
adamc@10 377 S.Continue (e, ())} k () of
adamc@10 378 S.Return _ => true
adamc@10 379 | S.Continue _ => false
adamc@10 380
adamc@211 381 fun mapB {kind, con, exp, bind} ctx e =
adamc@211 382 case mapfoldB {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@211 383 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@211 384 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@211 385 bind = bind} ctx e () of
adamc@211 386 S.Continue (e, ()) => e
adamc@211 387 | S.Return _ => raise Fail "ElabUtil.Exp.mapB: Impossible"
adamc@211 388
adamc@10 389 end
adamc@10 390
adamc@34 391 structure Sgn = struct
adamc@34 392
adamc@34 393 datatype binder =
adamc@34 394 RelC of string * Elab.kind
adamc@34 395 | NamedC of string * Elab.kind
adamc@34 396 | Str of string * Elab.sgn
adamc@59 397 | Sgn of string * Elab.sgn
adamc@34 398
adamc@34 399 fun mapfoldB {kind, con, sgn_item, sgn, bind} =
adamc@34 400 let
adamc@34 401 fun bind' (ctx, b) =
adamc@34 402 let
adamc@34 403 val b' = case b of
adamc@34 404 Con.Rel x => RelC x
adamc@34 405 | Con.Named x => NamedC x
adamc@34 406 in
adamc@34 407 bind (ctx, b')
adamc@34 408 end
adamc@34 409 val con = Con.mapfoldB {kind = kind, con = con, bind = bind'}
adamc@34 410
adamc@34 411 val kind = Kind.mapfold kind
adamc@34 412
adamc@34 413 fun sgi ctx si acc =
adamc@34 414 S.bindP (sgi' ctx si acc, sgn_item ctx)
adamc@34 415
adamc@156 416 and sgi' ctx (siAll as (si, loc)) =
adamc@34 417 case si of
adamc@34 418 SgiConAbs (x, n, k) =>
adamc@34 419 S.map2 (kind k,
adamc@34 420 fn k' =>
adamc@34 421 (SgiConAbs (x, n, k'), loc))
adamc@34 422 | SgiCon (x, n, k, c) =>
adamc@34 423 S.bind2 (kind k,
adamc@34 424 fn k' =>
adamc@34 425 S.map2 (con ctx c,
adamc@34 426 fn c' =>
adamc@34 427 (SgiCon (x, n, k', c'), loc)))
adamc@191 428 | SgiDatatype (x, n, xs, xncs) =>
adamc@156 429 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@156 430 case c of
adamc@156 431 NONE => S.return2 (x, n, c)
adamc@156 432 | SOME c =>
adamc@156 433 S.map2 (con ctx c,
adamc@156 434 fn c' => (x, n, SOME c'))) xncs,
adamc@156 435 fn xncs' =>
adamc@191 436 (SgiDatatype (x, n, xs, xncs'), loc))
adamc@191 437 | SgiDatatypeImp (x, n, m1, ms, s, xs, xncs) =>
adamc@162 438 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@162 439 case c of
adamc@162 440 NONE => S.return2 (x, n, c)
adamc@162 441 | SOME c =>
adamc@162 442 S.map2 (con ctx c,
adamc@162 443 fn c' => (x, n, SOME c'))) xncs,
adamc@162 444 fn xncs' =>
adamc@191 445 (SgiDatatypeImp (x, n, m1, ms, s, xs, xncs'), loc))
adamc@34 446 | SgiVal (x, n, c) =>
adamc@34 447 S.map2 (con ctx c,
adamc@34 448 fn c' =>
adamc@34 449 (SgiVal (x, n, c'), loc))
adamc@34 450 | SgiStr (x, n, s) =>
adamc@34 451 S.map2 (sg ctx s,
adamc@34 452 fn s' =>
adamc@34 453 (SgiStr (x, n, s'), loc))
adamc@59 454 | SgiSgn (x, n, s) =>
adamc@59 455 S.map2 (sg ctx s,
adamc@59 456 fn s' =>
adamc@59 457 (SgiSgn (x, n, s'), loc))
adamc@88 458 | SgiConstraint (c1, c2) =>
adamc@88 459 S.bind2 (con ctx c1,
adamc@88 460 fn c1' =>
adamc@88 461 S.map2 (con ctx c2,
adamc@88 462 fn c2' =>
adamc@88 463 (SgiConstraint (c1', c2'), loc)))
adamc@205 464 | SgiTable (tn, x, n, c) =>
adamc@203 465 S.map2 (con ctx c,
adamc@203 466 fn c' =>
adamc@205 467 (SgiTable (tn, x, n, c'), loc))
adamc@211 468 | SgiClassAbs _ => S.return2 siAll
adamc@211 469 | SgiClass (x, n, c) =>
adamc@211 470 S.map2 (con ctx c,
adamc@211 471 fn c' =>
adamc@211 472 (SgiClass (x, n, c'), loc))
adamc@34 473
adamc@34 474 and sg ctx s acc =
adamc@34 475 S.bindP (sg' ctx s acc, sgn ctx)
adamc@34 476
adamc@34 477 and sg' ctx (sAll as (s, loc)) =
adamc@34 478 case s of
adamc@34 479 SgnConst sgis =>
adamc@34 480 S.map2 (ListUtil.mapfoldB (fn (ctx, si) =>
adamc@34 481 (case #1 si of
adamc@34 482 SgiConAbs (x, _, k) =>
adamc@34 483 bind (ctx, NamedC (x, k))
adamc@34 484 | SgiCon (x, _, k, _) =>
adamc@34 485 bind (ctx, NamedC (x, k))
adamc@191 486 | SgiDatatype (x, n, _, xncs) =>
adamc@156 487 bind (ctx, NamedC (x, (KType, loc)))
adamc@191 488 | SgiDatatypeImp (x, _, _, _, _, _, _) =>
adamc@156 489 bind (ctx, NamedC (x, (KType, loc)))
adamc@34 490 | SgiVal _ => ctx
adamc@34 491 | SgiStr (x, _, sgn) =>
adamc@59 492 bind (ctx, Str (x, sgn))
adamc@59 493 | SgiSgn (x, _, sgn) =>
adamc@88 494 bind (ctx, Sgn (x, sgn))
adamc@203 495 | SgiConstraint _ => ctx
adamc@211 496 | SgiTable _ => ctx
adamc@211 497 | SgiClassAbs (x, _) =>
adamc@211 498 bind (ctx, NamedC (x, (KArrow ((KType, loc), (KType, loc)), loc)))
adamc@211 499 | SgiClass (x, _, _) =>
adamc@211 500 bind (ctx, NamedC (x, (KArrow ((KType, loc), (KType, loc)), loc))),
adamc@34 501 sgi ctx si)) ctx sgis,
adamc@34 502 fn sgis' =>
adamc@34 503 (SgnConst sgis', loc))
adamc@34 504
adamc@34 505 | SgnVar _ => S.return2 sAll
adamc@41 506 | SgnFun (m, n, s1, s2) =>
adamc@41 507 S.bind2 (sg ctx s1,
adamc@41 508 fn s1' =>
adamc@41 509 S.map2 (sg (bind (ctx, Str (m, s1'))) s2,
adamc@41 510 fn s2' =>
adamc@41 511 (SgnFun (m, n, s1', s2'), loc)))
adamc@59 512 | SgnProj _ => S.return2 sAll
adamc@42 513 | SgnWhere (sgn, x, c) =>
adamc@42 514 S.bind2 (sg ctx sgn,
adamc@42 515 fn sgn' =>
adamc@42 516 S.map2 (con ctx c,
adamc@42 517 fn c' =>
adamc@42 518 (SgnWhere (sgn', x, c'), loc)))
adamc@34 519 | SgnError => S.return2 sAll
adamc@34 520 in
adamc@34 521 sg
adamc@34 522 end
adamc@34 523
adamc@34 524 fun mapfold {kind, con, sgn_item, sgn} =
adamc@34 525 mapfoldB {kind = kind,
adamc@34 526 con = fn () => con,
adamc@34 527 sgn_item = fn () => sgn_item,
adamc@34 528 sgn = fn () => sgn,
adamc@34 529 bind = fn ((), _) => ()} ()
adamc@34 530
adamc@34 531 fun map {kind, con, sgn_item, sgn} s =
adamc@34 532 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@34 533 con = fn c => fn () => S.Continue (con c, ()),
adamc@34 534 sgn_item = fn si => fn () => S.Continue (sgn_item si, ()),
adamc@34 535 sgn = fn s => fn () => S.Continue (sgn s, ())} s () of
adamc@34 536 S.Return () => raise Fail "Elab_util.Sgn.map"
adamc@34 537 | S.Continue (s, ()) => s
adamc@34 538
adamc@2 539 end
adamc@34 540
adamc@76 541 structure Decl = struct
adamc@76 542
adamc@76 543 datatype binder =
adamc@76 544 RelC of string * Elab.kind
adamc@76 545 | NamedC of string * Elab.kind
adamc@76 546 | RelE of string * Elab.con
adamc@76 547 | NamedE of string * Elab.con
adamc@76 548 | Str of string * Elab.sgn
adamc@76 549 | Sgn of string * Elab.sgn
adamc@76 550
adamc@76 551 fun mapfoldB {kind = fk, con = fc, exp = fe, sgn_item = fsgi, sgn = fsg, str = fst, decl = fd, bind} =
adamc@76 552 let
adamc@76 553 val mfk = Kind.mapfold fk
adamc@76 554
adamc@76 555 fun bind' (ctx, b) =
adamc@76 556 let
adamc@76 557 val b' = case b of
adamc@76 558 Con.Rel x => RelC x
adamc@76 559 | Con.Named x => NamedC x
adamc@76 560 in
adamc@76 561 bind (ctx, b')
adamc@76 562 end
adamc@76 563 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@76 564
adamc@76 565 fun bind' (ctx, b) =
adamc@76 566 let
adamc@76 567 val b' = case b of
adamc@76 568 Exp.RelC x => RelC x
adamc@76 569 | Exp.NamedC x => NamedC x
adamc@76 570 | Exp.RelE x => RelE x
adamc@76 571 | Exp.NamedE x => NamedE x
adamc@76 572 in
adamc@76 573 bind (ctx, b')
adamc@76 574 end
adamc@76 575 val mfe = Exp.mapfoldB {kind = fk, con = fc, exp = fe, bind = bind'}
adamc@76 576
adamc@76 577 fun bind' (ctx, b) =
adamc@76 578 let
adamc@76 579 val b' = case b of
adamc@76 580 Sgn.RelC x => RelC x
adamc@76 581 | Sgn.NamedC x => NamedC x
adamc@76 582 | Sgn.Sgn x => Sgn x
adamc@76 583 | Sgn.Str x => Str x
adamc@76 584 in
adamc@76 585 bind (ctx, b')
adamc@76 586 end
adamc@76 587 val mfsg = Sgn.mapfoldB {kind = fk, con = fc, sgn_item = fsgi, sgn = fsg, bind = bind'}
adamc@76 588
adamc@76 589 fun mfst ctx str acc =
adamc@76 590 S.bindP (mfst' ctx str acc, fst ctx)
adamc@76 591
adamc@76 592 and mfst' ctx (strAll as (str, loc)) =
adamc@76 593 case str of
adamc@76 594 StrConst ds =>
adamc@76 595 S.map2 (ListUtil.mapfoldB (fn (ctx, d) =>
adamc@76 596 (case #1 d of
adamc@76 597 DCon (x, _, k, _) =>
adamc@76 598 bind (ctx, NamedC (x, k))
adamc@191 599 | DDatatype (x, n, xs, xncs) =>
adamc@156 600 let
adamc@156 601 val ctx = bind (ctx, NamedC (x, (KType, loc)))
adamc@156 602 in
adamc@156 603 foldl (fn ((x, _, co), ctx) =>
adamc@156 604 let
adamc@156 605 val t =
adamc@156 606 case co of
adamc@156 607 NONE => CNamed n
adamc@156 608 | SOME t => TFun (t, (CNamed n, loc))
adamc@191 609
adamc@191 610 val k = (KType, loc)
adamc@191 611 val t = (t, loc)
adamc@191 612 val t = foldr (fn (x, t) =>
adamc@191 613 (TCFun (Explicit,
adamc@191 614 x,
adamc@191 615 k,
adamc@191 616 t), loc))
adamc@191 617 t xs
adamc@156 618 in
adamc@191 619 bind (ctx, NamedE (x, t))
adamc@156 620 end)
adamc@156 621 ctx xncs
adamc@156 622 end
adamc@191 623 | DDatatypeImp (x, n, m, ms, x', _, _) =>
adamc@156 624 bind (ctx, NamedC (x, (KType, loc)))
adamc@76 625 | DVal (x, _, c, _) =>
adamc@76 626 bind (ctx, NamedE (x, c))
adamc@123 627 | DValRec vis =>
adamc@123 628 foldl (fn ((x, _, c, _), ctx) => bind (ctx, NamedE (x, c))) ctx vis
adamc@76 629 | DSgn (x, _, sgn) =>
adamc@76 630 bind (ctx, Sgn (x, sgn))
adamc@76 631 | DStr (x, _, sgn, _) =>
adamc@76 632 bind (ctx, Str (x, sgn))
adamc@76 633 | DFfiStr (x, _, sgn) =>
adamc@88 634 bind (ctx, Str (x, sgn))
adamc@100 635 | DConstraint _ => ctx
adamc@203 636 | DExport _ => ctx
adamc@205 637 | DTable (tn, x, n, c) =>
adamc@205 638 bind (ctx, NamedE (x, (CApp ((CModProj (n, [], "table"), loc),
adamc@213 639 c), loc)))
adamc@213 640 | DClass (x, _, _) =>
adamc@213 641 bind (ctx, NamedC (x, (KArrow ((KType, loc), (KType, loc)), loc))),
adamc@76 642 mfd ctx d)) ctx ds,
adamc@76 643 fn ds' => (StrConst ds', loc))
adamc@76 644 | StrVar _ => S.return2 strAll
adamc@76 645 | StrProj (str, x) =>
adamc@76 646 S.map2 (mfst ctx str,
adamc@76 647 fn str' =>
adamc@76 648 (StrProj (str', x), loc))
adamc@76 649 | StrFun (x, n, sgn1, sgn2, str) =>
adamc@76 650 S.bind2 (mfsg ctx sgn1,
adamc@76 651 fn sgn1' =>
adamc@76 652 S.bind2 (mfsg ctx sgn2,
adamc@76 653 fn sgn2' =>
adamc@76 654 S.map2 (mfst ctx str,
adamc@76 655 fn str' =>
adamc@76 656 (StrFun (x, n, sgn1', sgn2', str'), loc))))
adamc@76 657 | StrApp (str1, str2) =>
adamc@76 658 S.bind2 (mfst ctx str1,
adamc@76 659 fn str1' =>
adamc@76 660 S.map2 (mfst ctx str2,
adamc@76 661 fn str2' =>
adamc@76 662 (StrApp (str1', str2'), loc)))
adamc@76 663 | StrError => S.return2 strAll
adamc@76 664
adamc@76 665 and mfd ctx d acc =
adamc@76 666 S.bindP (mfd' ctx d acc, fd ctx)
adamc@76 667
adamc@76 668 and mfd' ctx (dAll as (d, loc)) =
adamc@76 669 case d of
adamc@76 670 DCon (x, n, k, c) =>
adamc@76 671 S.bind2 (mfk k,
adamc@76 672 fn k' =>
adamc@76 673 S.map2 (mfc ctx c,
adamc@76 674 fn c' =>
adamc@76 675 (DCon (x, n, k', c'), loc)))
adamc@191 676 | DDatatype (x, n, xs, xncs) =>
adamc@156 677 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@156 678 case c of
adamc@156 679 NONE => S.return2 (x, n, c)
adamc@156 680 | SOME c =>
adamc@156 681 S.map2 (mfc ctx c,
adamc@156 682 fn c' => (x, n, SOME c'))) xncs,
adamc@156 683 fn xncs' =>
adamc@191 684 (DDatatype (x, n, xs, xncs'), loc))
adamc@191 685 | DDatatypeImp (x, n, m1, ms, s, xs, xncs) =>
adamc@162 686 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@162 687 case c of
adamc@162 688 NONE => S.return2 (x, n, c)
adamc@162 689 | SOME c =>
adamc@162 690 S.map2 (mfc ctx c,
adamc@162 691 fn c' => (x, n, SOME c'))) xncs,
adamc@162 692 fn xncs' =>
adamc@191 693 (DDatatypeImp (x, n, m1, ms, s, xs, xncs'), loc))
adamc@123 694 | DVal vi =>
adamc@123 695 S.map2 (mfvi ctx vi,
adamc@123 696 fn vi' =>
adamc@123 697 (DVal vi', loc))
adamc@123 698 | DValRec vis =>
adamc@123 699 S.map2 (ListUtil.mapfold (mfvi ctx) vis,
adamc@123 700 fn vis' =>
adamc@123 701 (DValRec vis', loc))
adamc@76 702 | DSgn (x, n, sgn) =>
adamc@76 703 S.map2 (mfsg ctx sgn,
adamc@76 704 fn sgn' =>
adamc@76 705 (DSgn (x, n, sgn'), loc))
adamc@76 706 | DStr (x, n, sgn, str) =>
adamc@76 707 S.bind2 (mfsg ctx sgn,
adamc@76 708 fn sgn' =>
adamc@76 709 S.map2 (mfst ctx str,
adamc@76 710 fn str' =>
adamc@76 711 (DStr (x, n, sgn', str'), loc)))
adamc@76 712 | DFfiStr (x, n, sgn) =>
adamc@76 713 S.map2 (mfsg ctx sgn,
adamc@76 714 fn sgn' =>
adamc@76 715 (DFfiStr (x, n, sgn'), loc))
adamc@88 716 | DConstraint (c1, c2) =>
adamc@88 717 S.bind2 (mfc ctx c1,
adamc@88 718 fn c1' =>
adamc@88 719 S.map2 (mfc ctx c2,
adamc@88 720 fn c2' =>
adamc@88 721 (DConstraint (c1', c2'), loc)))
adamc@109 722 | DExport (en, sgn, str) =>
adamc@109 723 S.bind2 (mfsg ctx sgn,
adamc@109 724 fn sgn' =>
adamc@109 725 S.map2 (mfst ctx str,
adamc@109 726 fn str' =>
adamc@109 727 (DExport (en, sgn', str'), loc)))
adamc@123 728
adamc@205 729 | DTable (tn, x, n, c) =>
adamc@203 730 S.map2 (mfc ctx c,
adamc@203 731 fn c' =>
adamc@205 732 (DTable (tn, x, n, c'), loc))
adamc@203 733
adamc@213 734 | DClass (x, n, c) =>
adamc@213 735 S.map2 (mfc ctx c,
adamc@213 736 fn c' =>
adamc@213 737 (DClass (x, n, c'), loc))
adamc@213 738
adamc@123 739 and mfvi ctx (x, n, c, e) =
adamc@123 740 S.bind2 (mfc ctx c,
adamc@123 741 fn c' =>
adamc@123 742 S.map2 (mfe ctx e,
adamc@123 743 fn e' =>
adamc@123 744 (x, n, c', e')))
adamc@76 745 in
adamc@76 746 mfd
adamc@76 747 end
adamc@76 748
adamc@76 749 fun mapfold {kind, con, exp, sgn_item, sgn, str, decl} =
adamc@76 750 mapfoldB {kind = kind,
adamc@76 751 con = fn () => con,
adamc@76 752 exp = fn () => exp,
adamc@76 753 sgn_item = fn () => sgn_item,
adamc@76 754 sgn = fn () => sgn,
adamc@76 755 str = fn () => str,
adamc@76 756 decl = fn () => decl,
adamc@76 757 bind = fn ((), _) => ()} ()
adamc@76 758
adamc@76 759 fun exists {kind, con, exp, sgn_item, sgn, str, decl} k =
adamc@76 760 case mapfold {kind = fn k => fn () =>
adamc@76 761 if kind k then
adamc@76 762 S.Return ()
adamc@76 763 else
adamc@76 764 S.Continue (k, ()),
adamc@76 765 con = fn c => fn () =>
adamc@76 766 if con c then
adamc@76 767 S.Return ()
adamc@76 768 else
adamc@76 769 S.Continue (c, ()),
adamc@76 770 exp = fn e => fn () =>
adamc@76 771 if exp e then
adamc@76 772 S.Return ()
adamc@76 773 else
adamc@76 774 S.Continue (e, ()),
adamc@76 775 sgn_item = fn sgi => fn () =>
adamc@76 776 if sgn_item sgi then
adamc@76 777 S.Return ()
adamc@76 778 else
adamc@76 779 S.Continue (sgi, ()),
adamc@76 780 sgn = fn x => fn () =>
adamc@76 781 if sgn x then
adamc@76 782 S.Return ()
adamc@76 783 else
adamc@76 784 S.Continue (x, ()),
adamc@76 785 str = fn x => fn () =>
adamc@76 786 if str x then
adamc@76 787 S.Return ()
adamc@76 788 else
adamc@76 789 S.Continue (x, ()),
adamc@76 790 decl = fn x => fn () =>
adamc@76 791 if decl x then
adamc@76 792 S.Return ()
adamc@76 793 else
adamc@76 794 S.Continue (x, ())} k () of
adamc@76 795 S.Return _ => true
adamc@76 796 | S.Continue _ => false
adamc@76 797
adamc@76 798 fun search {kind, con, exp, sgn_item, sgn, str, decl} k =
adamc@76 799 case mapfold {kind = fn x => fn () =>
adamc@76 800 case kind x of
adamc@76 801 NONE => S.Continue (x, ())
adamc@76 802 | SOME v => S.Return v,
adamc@76 803
adamc@76 804 con = fn x => fn () =>
adamc@76 805 case con x of
adamc@76 806 NONE => S.Continue (x, ())
adamc@76 807 | SOME v => S.Return v,
adamc@76 808
adamc@76 809 exp = fn x => fn () =>
adamc@76 810 case exp x of
adamc@76 811 NONE => S.Continue (x, ())
adamc@76 812 | SOME v => S.Return v,
adamc@76 813
adamc@76 814 sgn_item = fn x => fn () =>
adamc@76 815 case sgn_item x of
adamc@76 816 NONE => S.Continue (x, ())
adamc@76 817 | SOME v => S.Return v,
adamc@76 818
adamc@76 819 sgn = fn x => fn () =>
adamc@76 820 case sgn x of
adamc@76 821 NONE => S.Continue (x, ())
adamc@76 822 | SOME v => S.Return v,
adamc@76 823
adamc@76 824 str = fn x => fn () =>
adamc@76 825 case str x of
adamc@76 826 NONE => S.Continue (x, ())
adamc@76 827 | SOME v => S.Return v,
adamc@76 828
adamc@76 829 decl = fn x => fn () =>
adamc@76 830 case decl x of
adamc@76 831 NONE => S.Continue (x, ())
adamc@76 832 | SOME v => S.Return v
adamc@76 833
adamc@76 834 } k () of
adamc@76 835 S.Return x => SOME x
adamc@76 836 | S.Continue _ => NONE
adamc@76 837
adamc@34 838 end
adamc@76 839
adamc@76 840 end