Mercurial > urweb

annotate src/elab_util.sml @ 343:ca98644af384

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Fix inexhaustive match
author Adam Chlipala <adamc@hcoop.net>
date Sun, 14 Sep 2008 19:22:04 -0400
parents 075b36dbb1a4
children b85e6ba56618
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@329 99 | Named of string * int * 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@334 122 | TDisjoint (ai, 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@334 129 (TDisjoint (ai, 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@329 243 | NamedC of string * int * 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@339 320 | EWith (e1, c, e2, {field, rest}) =>
adamc@339 321 S.bind2 (mfe ctx e1,
adamc@339 322 fn e1' =>
adamc@339 323 S.bind2 (mfc ctx c,
adamc@339 324 fn c' =>
adamc@339 325 S.bind2 (mfe ctx e2,
adamc@339 326 fn e2' =>
adamc@339 327 S.bind2 (mfc ctx field,
adamc@339 328 fn field' =>
adamc@339 329 S.map2 (mfc ctx rest,
adamc@339 330 fn rest' =>
adamc@339 331 (EWith (e1', c', e2', {field = field', rest = rest'}),
adamc@339 332 loc))))))
adamc@149 333 | ECut (e, c, {field, rest}) =>
adamc@149 334 S.bind2 (mfe ctx e,
adamc@149 335 fn e' =>
adamc@149 336 S.bind2 (mfc ctx c,
adamc@149 337 fn c' =>
adamc@149 338 S.bind2 (mfc ctx field,
adamc@149 339 fn field' =>
adamc@149 340 S.map2 (mfc ctx rest,
adamc@149 341 fn rest' =>
adamc@149 342 (ECut (e', c', {field = field', rest = rest'}), loc)))))
adamc@12 343
adamc@71 344 | EFold k =>
adamc@71 345 S.map2 (mfk k,
adamc@71 346 fn k' =>
adamc@71 347 (EFold k', loc))
adamc@71 348
adamc@182 349 | ECase (e, pes, {disc, result}) =>
adamc@171 350 S.bind2 (mfe ctx e,
adamc@171 351 fn e' =>
adamc@171 352 S.bind2 (ListUtil.mapfold (fn (p, e) =>
adamc@171 353 S.map2 (mfe ctx e,
adamc@171 354 fn e' => (p, e'))) pes,
adamc@171 355 fn pes' =>
adamc@182 356 S.bind2 (mfc ctx disc,
adamc@182 357 fn disc' =>
adamc@182 358 S.map2 (mfc ctx result,
adamc@182 359 fn result' =>
adamc@182 360 (ECase (e', pes', {disc = disc', result = result'}), loc)))))
adamc@171 361
adamc@10 362 | EError => S.return2 eAll
adamc@228 363 | EUnif (ref (SOME e)) => mfe ctx e
adamc@228 364 | EUnif _ => S.return2 eAll
adamc@10 365 in
adamc@10 366 mfe
adamc@10 367 end
adamc@10 368
adamc@11 369 fun mapfold {kind = fk, con = fc, exp = fe} =
adamc@11 370 mapfoldB {kind = fk,
adamc@11 371 con = fn () => fc,
adamc@11 372 exp = fn () => fe,
adamc@11 373 bind = fn ((), _) => ()} ()
adamc@11 374
adamc@10 375 fun exists {kind, con, exp} k =
adamc@10 376 case mapfold {kind = fn k => fn () =>
adamc@10 377 if kind k then
adamc@10 378 S.Return ()
adamc@10 379 else
adamc@10 380 S.Continue (k, ()),
adamc@10 381 con = fn c => fn () =>
adamc@10 382 if con c then
adamc@10 383 S.Return ()
adamc@10 384 else
adamc@10 385 S.Continue (c, ()),
adamc@10 386 exp = fn e => fn () =>
adamc@10 387 if exp e then
adamc@10 388 S.Return ()
adamc@10 389 else
adamc@10 390 S.Continue (e, ())} k () of
adamc@10 391 S.Return _ => true
adamc@10 392 | S.Continue _ => false
adamc@10 393
adamc@211 394 fun mapB {kind, con, exp, bind} ctx e =
adamc@211 395 case mapfoldB {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@211 396 con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
adamc@211 397 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@211 398 bind = bind} ctx e () of
adamc@211 399 S.Continue (e, ()) => e
adamc@211 400 | S.Return _ => raise Fail "ElabUtil.Exp.mapB: Impossible"
adamc@211 401
adamc@10 402 end
adamc@10 403
adamc@34 404 structure Sgn = struct
adamc@34 405
adamc@34 406 datatype binder =
adamc@34 407 RelC of string * Elab.kind
adamc@329 408 | NamedC of string * int * Elab.kind
adamc@34 409 | Str of string * Elab.sgn
adamc@59 410 | Sgn of string * Elab.sgn
adamc@34 411
adamc@34 412 fun mapfoldB {kind, con, sgn_item, sgn, bind} =
adamc@34 413 let
adamc@34 414 fun bind' (ctx, b) =
adamc@34 415 let
adamc@34 416 val b' = case b of
adamc@34 417 Con.Rel x => RelC x
adamc@34 418 | Con.Named x => NamedC x
adamc@34 419 in
adamc@34 420 bind (ctx, b')
adamc@34 421 end
adamc@34 422 val con = Con.mapfoldB {kind = kind, con = con, bind = bind'}
adamc@34 423
adamc@34 424 val kind = Kind.mapfold kind
adamc@34 425
adamc@34 426 fun sgi ctx si acc =
adamc@34 427 S.bindP (sgi' ctx si acc, sgn_item ctx)
adamc@34 428
adamc@156 429 and sgi' ctx (siAll as (si, loc)) =
adamc@34 430 case si of
adamc@34 431 SgiConAbs (x, n, k) =>
adamc@34 432 S.map2 (kind k,
adamc@34 433 fn k' =>
adamc@34 434 (SgiConAbs (x, n, k'), loc))
adamc@34 435 | SgiCon (x, n, k, c) =>
adamc@34 436 S.bind2 (kind k,
adamc@34 437 fn k' =>
adamc@34 438 S.map2 (con ctx c,
adamc@34 439 fn c' =>
adamc@34 440 (SgiCon (x, n, k', c'), loc)))
adamc@191 441 | SgiDatatype (x, n, xs, xncs) =>
adamc@156 442 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@156 443 case c of
adamc@156 444 NONE => S.return2 (x, n, c)
adamc@156 445 | SOME c =>
adamc@156 446 S.map2 (con ctx c,
adamc@156 447 fn c' => (x, n, SOME c'))) xncs,
adamc@156 448 fn xncs' =>
adamc@191 449 (SgiDatatype (x, n, xs, xncs'), loc))
adamc@191 450 | SgiDatatypeImp (x, n, m1, ms, s, xs, xncs) =>
adamc@162 451 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@162 452 case c of
adamc@162 453 NONE => S.return2 (x, n, c)
adamc@162 454 | SOME c =>
adamc@162 455 S.map2 (con ctx c,
adamc@162 456 fn c' => (x, n, SOME c'))) xncs,
adamc@162 457 fn xncs' =>
adamc@191 458 (SgiDatatypeImp (x, n, m1, ms, s, xs, xncs'), loc))
adamc@34 459 | SgiVal (x, n, c) =>
adamc@34 460 S.map2 (con ctx c,
adamc@34 461 fn c' =>
adamc@34 462 (SgiVal (x, n, c'), loc))
adamc@34 463 | SgiStr (x, n, s) =>
adamc@34 464 S.map2 (sg ctx s,
adamc@34 465 fn s' =>
adamc@34 466 (SgiStr (x, n, s'), loc))
adamc@59 467 | SgiSgn (x, n, s) =>
adamc@59 468 S.map2 (sg ctx s,
adamc@59 469 fn s' =>
adamc@59 470 (SgiSgn (x, n, s'), loc))
adamc@88 471 | SgiConstraint (c1, c2) =>
adamc@88 472 S.bind2 (con ctx c1,
adamc@88 473 fn c1' =>
adamc@88 474 S.map2 (con ctx c2,
adamc@88 475 fn c2' =>
adamc@88 476 (SgiConstraint (c1', c2'), loc)))
adamc@205 477 | SgiTable (tn, x, n, c) =>
adamc@203 478 S.map2 (con ctx c,
adamc@203 479 fn c' =>
adamc@205 480 (SgiTable (tn, x, n, c'), loc))
adamc@338 481 | SgiSequence _ => S.return2 siAll
adamc@211 482 | SgiClassAbs _ => S.return2 siAll
adamc@211 483 | SgiClass (x, n, c) =>
adamc@211 484 S.map2 (con ctx c,
adamc@211 485 fn c' =>
adamc@211 486 (SgiClass (x, n, c'), loc))
adamc@34 487
adamc@34 488 and sg ctx s acc =
adamc@34 489 S.bindP (sg' ctx s acc, sgn ctx)
adamc@34 490
adamc@34 491 and sg' ctx (sAll as (s, loc)) =
adamc@34 492 case s of
adamc@34 493 SgnConst sgis =>
adamc@34 494 S.map2 (ListUtil.mapfoldB (fn (ctx, si) =>
adamc@34 495 (case #1 si of
adamc@329 496 SgiConAbs (x, n, k) =>
adamc@329 497 bind (ctx, NamedC (x, n, k))
adamc@329 498 | SgiCon (x, n, k, _) =>
adamc@329 499 bind (ctx, NamedC (x, n, k))
adamc@191 500 | SgiDatatype (x, n, _, xncs) =>
adamc@329 501 bind (ctx, NamedC (x, n, (KType, loc)))
adamc@329 502 | SgiDatatypeImp (x, n, _, _, _, _, _) =>
adamc@329 503 bind (ctx, NamedC (x, n, (KType, loc)))
adamc@34 504 | SgiVal _ => ctx
adamc@34 505 | SgiStr (x, _, sgn) =>
adamc@59 506 bind (ctx, Str (x, sgn))
adamc@59 507 | SgiSgn (x, _, sgn) =>
adamc@88 508 bind (ctx, Sgn (x, sgn))
adamc@203 509 | SgiConstraint _ => ctx
adamc@211 510 | SgiTable _ => ctx
adamc@338 511 | SgiSequence _ => ctx
adamc@329 512 | SgiClassAbs (x, n) =>
adamc@329 513 bind (ctx, NamedC (x, n, (KArrow ((KType, loc), (KType, loc)), loc)))
adamc@329 514 | SgiClass (x, n, _) =>
adamc@329 515 bind (ctx, NamedC (x, n, (KArrow ((KType, loc), (KType, loc)), loc))),
adamc@34 516 sgi ctx si)) ctx sgis,
adamc@34 517 fn sgis' =>
adamc@34 518 (SgnConst sgis', loc))
adamc@34 519
adamc@34 520 | SgnVar _ => S.return2 sAll
adamc@41 521 | SgnFun (m, n, s1, s2) =>
adamc@41 522 S.bind2 (sg ctx s1,
adamc@41 523 fn s1' =>
adamc@41 524 S.map2 (sg (bind (ctx, Str (m, s1'))) s2,
adamc@41 525 fn s2' =>
adamc@41 526 (SgnFun (m, n, s1', s2'), loc)))
adamc@59 527 | SgnProj _ => S.return2 sAll
adamc@42 528 | SgnWhere (sgn, x, c) =>
adamc@42 529 S.bind2 (sg ctx sgn,
adamc@42 530 fn sgn' =>
adamc@42 531 S.map2 (con ctx c,
adamc@42 532 fn c' =>
adamc@42 533 (SgnWhere (sgn', x, c'), loc)))
adamc@34 534 | SgnError => S.return2 sAll
adamc@34 535 in
adamc@34 536 sg
adamc@34 537 end
adamc@34 538
adamc@34 539 fun mapfold {kind, con, sgn_item, sgn} =
adamc@34 540 mapfoldB {kind = kind,
adamc@34 541 con = fn () => con,
adamc@34 542 sgn_item = fn () => sgn_item,
adamc@34 543 sgn = fn () => sgn,
adamc@34 544 bind = fn ((), _) => ()} ()
adamc@34 545
adamc@34 546 fun map {kind, con, sgn_item, sgn} s =
adamc@34 547 case mapfold {kind = fn k => fn () => S.Continue (kind k, ()),
adamc@34 548 con = fn c => fn () => S.Continue (con c, ()),
adamc@34 549 sgn_item = fn si => fn () => S.Continue (sgn_item si, ()),
adamc@34 550 sgn = fn s => fn () => S.Continue (sgn s, ())} s () of
adamc@34 551 S.Return () => raise Fail "Elab_util.Sgn.map"
adamc@34 552 | S.Continue (s, ()) => s
adamc@34 553
adamc@2 554 end
adamc@34 555
adamc@76 556 structure Decl = struct
adamc@76 557
adamc@76 558 datatype binder =
adamc@76 559 RelC of string * Elab.kind
adamc@329 560 | NamedC of string * int * Elab.kind
adamc@76 561 | RelE of string * Elab.con
adamc@76 562 | NamedE of string * Elab.con
adamc@76 563 | Str of string * Elab.sgn
adamc@76 564 | Sgn of string * Elab.sgn
adamc@76 565
adamc@76 566 fun mapfoldB {kind = fk, con = fc, exp = fe, sgn_item = fsgi, sgn = fsg, str = fst, decl = fd, bind} =
adamc@76 567 let
adamc@76 568 val mfk = Kind.mapfold fk
adamc@76 569
adamc@76 570 fun bind' (ctx, b) =
adamc@76 571 let
adamc@76 572 val b' = case b of
adamc@76 573 Con.Rel x => RelC x
adamc@76 574 | Con.Named x => NamedC x
adamc@76 575 in
adamc@76 576 bind (ctx, b')
adamc@76 577 end
adamc@76 578 val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
adamc@76 579
adamc@76 580 fun bind' (ctx, b) =
adamc@76 581 let
adamc@76 582 val b' = case b of
adamc@76 583 Exp.RelC x => RelC x
adamc@76 584 | Exp.NamedC x => NamedC x
adamc@76 585 | Exp.RelE x => RelE x
adamc@76 586 | Exp.NamedE x => NamedE x
adamc@76 587 in
adamc@76 588 bind (ctx, b')
adamc@76 589 end
adamc@76 590 val mfe = Exp.mapfoldB {kind = fk, con = fc, exp = fe, bind = bind'}
adamc@76 591
adamc@76 592 fun bind' (ctx, b) =
adamc@76 593 let
adamc@76 594 val b' = case b of
adamc@76 595 Sgn.RelC x => RelC x
adamc@76 596 | Sgn.NamedC x => NamedC x
adamc@76 597 | Sgn.Sgn x => Sgn x
adamc@76 598 | Sgn.Str x => Str x
adamc@76 599 in
adamc@76 600 bind (ctx, b')
adamc@76 601 end
adamc@76 602 val mfsg = Sgn.mapfoldB {kind = fk, con = fc, sgn_item = fsgi, sgn = fsg, bind = bind'}
adamc@76 603
adamc@76 604 fun mfst ctx str acc =
adamc@76 605 S.bindP (mfst' ctx str acc, fst ctx)
adamc@76 606
adamc@76 607 and mfst' ctx (strAll as (str, loc)) =
adamc@76 608 case str of
adamc@76 609 StrConst ds =>
adamc@76 610 S.map2 (ListUtil.mapfoldB (fn (ctx, d) =>
adamc@76 611 (case #1 d of
adamc@329 612 DCon (x, n, k, _) =>
adamc@329 613 bind (ctx, NamedC (x, n, k))
adamc@191 614 | DDatatype (x, n, xs, xncs) =>
adamc@156 615 let
adamc@329 616 val ctx = bind (ctx, NamedC (x, n, (KType, loc)))
adamc@156 617 in
adamc@156 618 foldl (fn ((x, _, co), ctx) =>
adamc@156 619 let
adamc@156 620 val t =
adamc@156 621 case co of
adamc@156 622 NONE => CNamed n
adamc@156 623 | SOME t => TFun (t, (CNamed n, loc))
adamc@191 624
adamc@191 625 val k = (KType, loc)
adamc@191 626 val t = (t, loc)
adamc@191 627 val t = foldr (fn (x, t) =>
adamc@191 628 (TCFun (Explicit,
adamc@191 629 x,
adamc@191 630 k,
adamc@191 631 t), loc))
adamc@191 632 t xs
adamc@156 633 in
adamc@191 634 bind (ctx, NamedE (x, t))
adamc@156 635 end)
adamc@156 636 ctx xncs
adamc@156 637 end
adamc@191 638 | DDatatypeImp (x, n, m, ms, x', _, _) =>
adamc@329 639 bind (ctx, NamedC (x, n, (KType, loc)))
adamc@76 640 | DVal (x, _, c, _) =>
adamc@76 641 bind (ctx, NamedE (x, c))
adamc@123 642 | DValRec vis =>
adamc@123 643 foldl (fn ((x, _, c, _), ctx) => bind (ctx, NamedE (x, c))) ctx vis
adamc@76 644 | DSgn (x, _, sgn) =>
adamc@76 645 bind (ctx, Sgn (x, sgn))
adamc@76 646 | DStr (x, _, sgn, _) =>
adamc@76 647 bind (ctx, Str (x, sgn))
adamc@76 648 | DFfiStr (x, _, sgn) =>
adamc@88 649 bind (ctx, Str (x, sgn))
adamc@100 650 | DConstraint _ => ctx
adamc@203 651 | DExport _ => ctx
adamc@205 652 | DTable (tn, x, n, c) =>
adamc@338 653 bind (ctx, NamedE (x, (CApp ((CModProj (n, [], "sql_table"), loc),
adamc@213 654 c), loc)))
adamc@338 655 | DSequence (tn, x, n) =>
adamc@338 656 bind (ctx, NamedE (x, (CModProj (n, [], "sql_sequence"), loc)))
adamc@329 657 | DClass (x, n, _) =>
adamc@329 658 bind (ctx, NamedC (x, n, (KArrow ((KType, loc), (KType, loc)), loc)))
adamc@271 659 | DDatabase _ => ctx,
adamc@76 660 mfd ctx d)) ctx ds,
adamc@76 661 fn ds' => (StrConst ds', loc))
adamc@76 662 | StrVar _ => S.return2 strAll
adamc@76 663 | StrProj (str, x) =>
adamc@76 664 S.map2 (mfst ctx str,
adamc@76 665 fn str' =>
adamc@76 666 (StrProj (str', x), loc))
adamc@76 667 | StrFun (x, n, sgn1, sgn2, str) =>
adamc@76 668 S.bind2 (mfsg ctx sgn1,
adamc@76 669 fn sgn1' =>
adamc@76 670 S.bind2 (mfsg ctx sgn2,
adamc@76 671 fn sgn2' =>
adamc@76 672 S.map2 (mfst ctx str,
adamc@76 673 fn str' =>
adamc@76 674 (StrFun (x, n, sgn1', sgn2', str'), loc))))
adamc@76 675 | StrApp (str1, str2) =>
adamc@76 676 S.bind2 (mfst ctx str1,
adamc@76 677 fn str1' =>
adamc@76 678 S.map2 (mfst ctx str2,
adamc@76 679 fn str2' =>
adamc@76 680 (StrApp (str1', str2'), loc)))
adamc@76 681 | StrError => S.return2 strAll
adamc@76 682
adamc@76 683 and mfd ctx d acc =
adamc@76 684 S.bindP (mfd' ctx d acc, fd ctx)
adamc@76 685
adamc@76 686 and mfd' ctx (dAll as (d, loc)) =
adamc@76 687 case d of
adamc@76 688 DCon (x, n, k, c) =>
adamc@76 689 S.bind2 (mfk k,
adamc@76 690 fn k' =>
adamc@76 691 S.map2 (mfc ctx c,
adamc@76 692 fn c' =>
adamc@76 693 (DCon (x, n, k', c'), loc)))
adamc@191 694 | DDatatype (x, n, xs, xncs) =>
adamc@156 695 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@156 696 case c of
adamc@156 697 NONE => S.return2 (x, n, c)
adamc@156 698 | SOME c =>
adamc@156 699 S.map2 (mfc ctx c,
adamc@156 700 fn c' => (x, n, SOME c'))) xncs,
adamc@156 701 fn xncs' =>
adamc@191 702 (DDatatype (x, n, xs, xncs'), loc))
adamc@191 703 | DDatatypeImp (x, n, m1, ms, s, xs, xncs) =>
adamc@162 704 S.map2 (ListUtil.mapfold (fn (x, n, c) =>
adamc@162 705 case c of
adamc@162 706 NONE => S.return2 (x, n, c)
adamc@162 707 | SOME c =>
adamc@162 708 S.map2 (mfc ctx c,
adamc@162 709 fn c' => (x, n, SOME c'))) xncs,
adamc@162 710 fn xncs' =>
adamc@191 711 (DDatatypeImp (x, n, m1, ms, s, xs, xncs'), loc))
adamc@123 712 | DVal vi =>
adamc@123 713 S.map2 (mfvi ctx vi,
adamc@123 714 fn vi' =>
adamc@123 715 (DVal vi', loc))
adamc@123 716 | DValRec vis =>
adamc@123 717 S.map2 (ListUtil.mapfold (mfvi ctx) vis,
adamc@123 718 fn vis' =>
adamc@123 719 (DValRec vis', loc))
adamc@76 720 | DSgn (x, n, sgn) =>
adamc@76 721 S.map2 (mfsg ctx sgn,
adamc@76 722 fn sgn' =>
adamc@76 723 (DSgn (x, n, sgn'), loc))
adamc@76 724 | DStr (x, n, sgn, str) =>
adamc@76 725 S.bind2 (mfsg ctx sgn,
adamc@76 726 fn sgn' =>
adamc@76 727 S.map2 (mfst ctx str,
adamc@76 728 fn str' =>
adamc@76 729 (DStr (x, n, sgn', str'), loc)))
adamc@76 730 | DFfiStr (x, n, sgn) =>
adamc@76 731 S.map2 (mfsg ctx sgn,
adamc@76 732 fn sgn' =>
adamc@76 733 (DFfiStr (x, n, sgn'), loc))
adamc@88 734 | DConstraint (c1, c2) =>
adamc@88 735 S.bind2 (mfc ctx c1,
adamc@88 736 fn c1' =>
adamc@88 737 S.map2 (mfc ctx c2,
adamc@88 738 fn c2' =>
adamc@88 739 (DConstraint (c1', c2'), loc)))
adamc@109 740 | DExport (en, sgn, str) =>
adamc@109 741 S.bind2 (mfsg ctx sgn,
adamc@109 742 fn sgn' =>
adamc@109 743 S.map2 (mfst ctx str,
adamc@109 744 fn str' =>
adamc@109 745 (DExport (en, sgn', str'), loc)))
adamc@123 746
adamc@205 747 | DTable (tn, x, n, c) =>
adamc@203 748 S.map2 (mfc ctx c,
adamc@203 749 fn c' =>
adamc@205 750 (DTable (tn, x, n, c'), loc))
adamc@338 751 | DSequence _ => S.return2 dAll
adamc@203 752
adamc@338 753 | DClass (x, n, c) =>
adamc@213 754 S.map2 (mfc ctx c,
adamc@338 755 fn c' =>
adamc@338 756 (DClass (x, n, c'), loc))
adamc@213 757
adamc@338 758 | DDatabase _ => S.return2 dAll
adamc@271 759
adamc@123 760 and mfvi ctx (x, n, c, e) =
adamc@123 761 S.bind2 (mfc ctx c,
adamc@123 762 fn c' =>
adamc@123 763 S.map2 (mfe ctx e,
adamc@123 764 fn e' =>
adamc@123 765 (x, n, c', e')))
adamc@76 766 in
adamc@76 767 mfd
adamc@76 768 end
adamc@76 769
adamc@76 770 fun mapfold {kind, con, exp, sgn_item, sgn, str, decl} =
adamc@76 771 mapfoldB {kind = kind,
adamc@76 772 con = fn () => con,
adamc@76 773 exp = fn () => exp,
adamc@76 774 sgn_item = fn () => sgn_item,
adamc@76 775 sgn = fn () => sgn,
adamc@76 776 str = fn () => str,
adamc@76 777 decl = fn () => decl,
adamc@76 778 bind = fn ((), _) => ()} ()
adamc@76 779
adamc@76 780 fun exists {kind, con, exp, sgn_item, sgn, str, decl} k =
adamc@76 781 case mapfold {kind = fn k => fn () =>
adamc@76 782 if kind k then
adamc@76 783 S.Return ()
adamc@76 784 else
adamc@76 785 S.Continue (k, ()),
adamc@76 786 con = fn c => fn () =>
adamc@76 787 if con c then
adamc@76 788 S.Return ()
adamc@76 789 else
adamc@76 790 S.Continue (c, ()),
adamc@76 791 exp = fn e => fn () =>
adamc@76 792 if exp e then
adamc@76 793 S.Return ()
adamc@76 794 else
adamc@76 795 S.Continue (e, ()),
adamc@76 796 sgn_item = fn sgi => fn () =>
adamc@76 797 if sgn_item sgi then
adamc@76 798 S.Return ()
adamc@76 799 else
adamc@76 800 S.Continue (sgi, ()),
adamc@76 801 sgn = fn x => fn () =>
adamc@76 802 if sgn x then
adamc@76 803 S.Return ()
adamc@76 804 else
adamc@76 805 S.Continue (x, ()),
adamc@76 806 str = fn x => fn () =>
adamc@76 807 if str x then
adamc@76 808 S.Return ()
adamc@76 809 else
adamc@76 810 S.Continue (x, ()),
adamc@76 811 decl = fn x => fn () =>
adamc@76 812 if decl x then
adamc@76 813 S.Return ()
adamc@76 814 else
adamc@76 815 S.Continue (x, ())} k () of
adamc@76 816 S.Return _ => true
adamc@76 817 | S.Continue _ => false
adamc@76 818
adamc@76 819 fun search {kind, con, exp, sgn_item, sgn, str, decl} k =
adamc@76 820 case mapfold {kind = fn x => fn () =>
adamc@76 821 case kind x of
adamc@76 822 NONE => S.Continue (x, ())
adamc@76 823 | SOME v => S.Return v,
adamc@76 824
adamc@76 825 con = fn x => fn () =>
adamc@76 826 case con x of
adamc@76 827 NONE => S.Continue (x, ())
adamc@76 828 | SOME v => S.Return v,
adamc@76 829
adamc@76 830 exp = fn x => fn () =>
adamc@76 831 case exp x of
adamc@76 832 NONE => S.Continue (x, ())
adamc@76 833 | SOME v => S.Return v,
adamc@76 834
adamc@76 835 sgn_item = fn x => fn () =>
adamc@76 836 case sgn_item x of
adamc@76 837 NONE => S.Continue (x, ())
adamc@76 838 | SOME v => S.Return v,
adamc@76 839
adamc@76 840 sgn = fn x => fn () =>
adamc@76 841 case sgn x of
adamc@76 842 NONE => S.Continue (x, ())
adamc@76 843 | SOME v => S.Return v,
adamc@76 844
adamc@76 845 str = fn x => fn () =>
adamc@76 846 case str x of
adamc@76 847 NONE => S.Continue (x, ())
adamc@76 848 | SOME v => S.Return v,
adamc@76 849
adamc@76 850 decl = fn x => fn () =>
adamc@76 851 case decl x of
adamc@76 852 NONE => S.Continue (x, ())
adamc@76 853 | SOME v => S.Return v
adamc@76 854
adamc@76 855 } k () of
adamc@76 856 S.Return x => SOME x
adamc@76 857 | S.Continue _ => NONE
adamc@76 858
adamc@34 859 end
adamc@76 860
adamc@76 861 end