Mercurial > urweb

annotate src/elab_util.sml @ 374:1099d083a702

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