Mercurial > urweb

annotate src/mono_reduce.sml @ 598:4c2c740c6931

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Hooking a source into an input
author Adam Chlipala <adamc@hcoop.net>
date Sun, 11 Jan 2009 10:05:06 -0500
parents 0094e0242100
children 7c3c21eb5b4c
rev   line source
adamc@133 1 (* Copyright (c) 2008, Adam Chlipala
adamc@133 2 * All rights reserved.
adamc@133 3 *
adamc@133 4 * Redistribution and use in source and binary forms, with or without
adamc@133 5 * modification, are permitted provided that the following conditions are met:
adamc@133 6 *
adamc@133 7 * - Redistributions of source code must retain the above copyright notice,
adamc@133 8 * this list of conditions and the following disclaimer.
adamc@133 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@133 10 * this list of conditions and the following disclaimer in the documentation
adamc@133 11 * and/or other materials provided with the distribution.
adamc@133 12 * - The names of contributors may not be used to endorse or promote products
adamc@133 13 * derived from this software without specific prior written permission.
adamc@133 14 *
adamc@133 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@133 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@133 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@133 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@133 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@133 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@133 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@133 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@133 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@133 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@133 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@133 26 *)
adamc@133 27
adamc@133 28 (* Simplify a Mono program algebraically *)
adamc@133 29
adamc@133 30 structure MonoReduce :> MONO_REDUCE = struct
adamc@133 31
adamc@133 32 open Mono
adamc@133 33
adamc@133 34 structure E = MonoEnv
adamc@133 35 structure U = MonoUtil
adamc@133 36
adamc@470 37 structure IM = IntBinaryMap
adamc@470 38
adamc@133 39
adamc@252 40 fun impure (e, _) =
adamc@252 41 case e of
adamc@252 42 EWrite _ => true
adamc@252 43 | EQuery _ => true
adamc@307 44 | EDml _ => true
adamc@338 45 | ENextval _ => true
adamc@463 46 | EUnurlify _ => true
adamc@252 47 | EAbs _ => false
adamc@252 48
adamc@252 49 | EPrim _ => false
adamc@252 50 | ERel _ => false
adamc@252 51 | ENamed _ => false
adamc@252 52 | ECon (_, _, eo) => (case eo of NONE => false | SOME e => impure e)
adamc@297 53 | ENone _ => false
adamc@290 54 | ESome (_, e) => impure e
adamc@252 55 | EFfi _ => false
adamc@462 56 | EFfiApp ("Basis", "set_cookie", _) => true
adamc@565 57 | EFfiApp ("Basis", "new_client_source", _) => true
adamc@577 58 | EFfiApp ("Basis", "set_client_source", _) => true
adamc@579 59 | EFfiApp ("Basis", "alert", _) => true
adamc@252 60 | EFfiApp _ => false
adamc@252 61 | EApp ((EFfi _, _), _) => false
adamc@252 62 | EApp _ => true
adamc@252 63
adamc@387 64 | EUnop (_, e) => impure e
adamc@387 65 | EBinop (_, e1, e2) => impure e1 orelse impure e2
adamc@387 66
adamc@252 67 | ERecord xes => List.exists (fn (_, e, _) => impure e) xes
adamc@252 68 | EField (e, _) => impure e
adamc@252 69
adamc@252 70 | ECase (e, pes, _) => impure e orelse List.exists (fn (_, e) => impure e) pes
adamc@252 71
adamc@283 72 | EError (e, _) => impure e
adamc@283 73
adamc@252 74 | EStrcat (e1, e2) => impure e1 orelse impure e2
adamc@252 75
adamc@252 76 | ESeq (e1, e2) => impure e1 orelse impure e2
adamc@252 77 | ELet (_, _, e1, e2) => impure e1 orelse impure e2
adamc@252 78
adamc@252 79 | EClosure (_, es) => List.exists impure es
adamc@578 80 | EJavaScript (_, e, _) => impure e
adamc@568 81 | ESignalReturn e => impure e
adamc@572 82 | ESignalBind (e1, e2) => impure e1 orelse impure e2
adamc@574 83 | ESignalSource e => impure e
adamc@252 84
adamc@252 85
adamc@252 86 val liftExpInExp = Monoize.liftExpInExp
adamc@252 87
adamc@252 88 val subExpInExp' =
adamc@133 89 U.Exp.mapB {typ = fn t => t,
adamc@133 90 exp = fn (xn, rep) => fn e =>
adamc@133 91 case e of
adamc@133 92 ERel xn' =>
adamc@133 93 (case Int.compare (xn', xn) of
adamc@133 94 EQUAL => #1 rep
adamc@133 95 | GREATER=> ERel (xn' - 1)
adamc@133 96 | LESS => e)
adamc@133 97 | _ => e,
adamc@133 98 bind = fn ((xn, rep), U.Exp.RelE _) => (xn+1, liftExpInExp 0 rep)
adamc@133 99 | (ctx, _) => ctx}
adamc@133 100
adamc@252 101 fun subExpInExp (n, e1) e2 =
adamc@252 102 let
adamc@252 103 val r = subExpInExp' (n, e1) e2
adamc@252 104 in
adamc@252 105 (*Print.prefaces "subExpInExp" [("e1", MonoPrint.p_exp MonoEnv.empty e1),
adamc@252 106 ("e2", MonoPrint.p_exp MonoEnv.empty e2),
adamc@252 107 ("r", MonoPrint.p_exp MonoEnv.empty r)];*)
adamc@252 108 r
adamc@252 109 end
adamc@133 110
adamc@133 111 fun typ c = c
adamc@133 112
adamc@316 113 val swapExpVars =
adamc@316 114 U.Exp.mapB {typ = fn t => t,
adamc@316 115 exp = fn lower => fn e =>
adamc@316 116 case e of
adamc@316 117 ERel xn =>
adamc@316 118 if xn = lower then
adamc@316 119 ERel (lower + 1)
adamc@316 120 else if xn = lower + 1 then
adamc@316 121 ERel lower
adamc@316 122 else
adamc@316 123 e
adamc@316 124 | _ => e,
adamc@316 125 bind = fn (lower, U.Exp.RelE _) => lower+1
adamc@316 126 | (lower, _) => lower}
adamc@316 127
adamc@341 128 val swapExpVarsPat =
adamc@341 129 U.Exp.mapB {typ = fn t => t,
adamc@341 130 exp = fn (lower, len) => fn e =>
adamc@341 131 case e of
adamc@341 132 ERel xn =>
adamc@341 133 if xn = lower then
adamc@341 134 ERel (lower + 1)
adamc@341 135 else if xn >= lower + 1 andalso xn < lower + 1 + len then
adamc@341 136 ERel (xn - 1)
adamc@341 137 else
adamc@341 138 e
adamc@341 139 | _ => e,
adamc@341 140 bind = fn ((lower, len), U.Exp.RelE _) => (lower+1, len)
adamc@341 141 | (st, _) => st}
adamc@341 142
adamc@258 143 datatype result = Yes of E.env | No | Maybe
adamc@258 144
adamc@183 145 fun match (env, p : pat, e : exp) =
adamc@183 146 case (#1 p, #1 e) of
adamc@258 147 (PWild, _) => Yes env
adamc@258 148 | (PVar (x, t), _) => Yes (E.pushERel env x t (SOME e))
adamc@183 149
adamc@280 150 | (PPrim (Prim.String s), EStrcat ((EPrim (Prim.String s'), _), _)) =>
adamc@280 151 if String.isPrefix s' s then
adamc@280 152 Maybe
adamc@280 153 else
adamc@280 154 No
adamc@280 155
adamc@183 156 | (PPrim p, EPrim p') =>
adamc@183 157 if Prim.equal (p, p') then
adamc@258 158 Yes env
adamc@183 159 else
adamc@258 160 No
adamc@183 161
adamc@188 162 | (PCon (_, PConVar n1, NONE), ECon (_, PConVar n2, NONE)) =>
adamc@183 163 if n1 = n2 then
adamc@258 164 Yes env
adamc@183 165 else
adamc@258 166 No
adamc@183 167
adamc@188 168 | (PCon (_, PConVar n1, SOME p), ECon (_, PConVar n2, SOME e)) =>
adamc@183 169 if n1 = n2 then
adamc@183 170 match (env, p, e)
adamc@183 171 else
adamc@258 172 No
adamc@183 173
adamc@188 174 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, NONE), ECon (_, PConFfi {mod = m2, con = con2, ...}, NONE)) =>
adamc@185 175 if m1 = m2 andalso con1 = con2 then
adamc@258 176 Yes env
adamc@185 177 else
adamc@258 178 No
adamc@185 179
adamc@188 180 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, SOME ep), ECon (_, PConFfi {mod = m2, con = con2, ...}, SOME e)) =>
adamc@185 181 if m1 = m2 andalso con1 = con2 then
adamc@185 182 match (env, p, e)
adamc@185 183 else
adamc@258 184 No
adamc@185 185
adamc@183 186 | (PRecord xps, ERecord xes) =>
adamc@183 187 let
adamc@183 188 fun consider (xps, env) =
adamc@183 189 case xps of
adamc@258 190 [] => Yes env
adamc@183 191 | (x, p, _) :: rest =>
adamc@183 192 case List.find (fn (x', _, _) => x' = x) xes of
adamc@258 193 NONE => No
adamc@183 194 | SOME (_, e, _) =>
adamc@183 195 case match (env, p, e) of
adamc@258 196 No => No
adamc@258 197 | Maybe => Maybe
adamc@258 198 | Yes env => consider (rest, env)
adamc@183 199 in
adamc@183 200 consider (xps, env)
adamc@183 201 end
adamc@183 202
adamc@258 203 | _ => Maybe
adamc@183 204
adamc@318 205 datatype event =
adamc@318 206 WritePage
adamc@318 207 | ReadDb
adamc@318 208 | WriteDb
adamc@481 209 | UseRel
adamc@318 210 | Unsure
adamc@318 211
adamc@318 212 fun p_event e =
adamc@318 213 let
adamc@318 214 open Print.PD
adamc@318 215 in
adamc@318 216 case e of
adamc@318 217 WritePage => string "WritePage"
adamc@318 218 | ReadDb => string "ReadDb"
adamc@318 219 | WriteDb => string "WriteDb"
adamc@481 220 | UseRel => string "UseRel"
adamc@318 221 | Unsure => string "Unsure"
adamc@318 222 end
adamc@318 223
adamc@470 224 val p_events = Print.p_list p_event
adamc@470 225
adamc@318 226 fun patBinds (p, _) =
adamc@318 227 case p of
adamc@318 228 PWild => 0
adamc@318 229 | PVar _ => 1
adamc@318 230 | PPrim _ => 0
adamc@318 231 | PCon (_, _, NONE) => 0
adamc@318 232 | PCon (_, _, SOME p) => patBinds p
adamc@318 233 | PRecord xpts => foldl (fn ((_, p, _), n) => n + patBinds p) 0 xpts
adamc@318 234 | PNone _ => 0
adamc@318 235 | PSome (_, p) => patBinds p
adamc@318 236
adamc@470 237 fun reduce file =
adamc@470 238 let
adamc@470 239 fun countAbs (e, _) =
adamc@470 240 case e of
adamc@470 241 EAbs (_, _, _, e) => 1 + countAbs e
adamc@470 242 | _ => 0
adamc@318 243
adamc@470 244 val absCounts =
adamc@470 245 foldl (fn ((d, _), absCounts) =>
adamc@470 246 case d of
adamc@470 247 DVal (_, n, _, e, _) =>
adamc@470 248 IM.insert (absCounts, n, countAbs e)
adamc@470 249 | DValRec vis =>
adamc@470 250 foldl (fn ((_, n, _, e, _), absCounts) =>
adamc@470 251 IM.insert (absCounts, n, countAbs e))
adamc@470 252 absCounts vis
adamc@470 253 | _ => absCounts)
adamc@470 254 IM.empty file
adamc@387 255
adamc@470 256 fun summarize d (e, _) =
adamc@579 257 let
adamc@579 258 val s =
adamc@579 259 case e of
adamc@579 260 EPrim _ => []
adamc@579 261 | ERel n => if n = d then [UseRel] else []
adamc@579 262 | ENamed _ => []
adamc@579 263 | ECon (_, _, NONE) => []
adamc@579 264 | ECon (_, _, SOME e) => summarize d e
adamc@579 265 | ENone _ => []
adamc@579 266 | ESome (_, e) => summarize d e
adamc@579 267 | EFfi _ => []
adamc@579 268 | EFfiApp ("Basis", "set_cookie", es) => List.concat (map (summarize d) es) @ [Unsure]
adamc@579 269 | EFfiApp ("Basis", "new_client_source", es) => List.concat (map (summarize d) es) @ [Unsure]
adamc@579 270 | EFfiApp ("Basis", "set_client_source", es) => List.concat (map (summarize d) es) @ [Unsure]
adamc@579 271 | EFfiApp ("Basis", "alert", es) => List.concat (map (summarize d) es) @ [Unsure]
adamc@579 272 | EFfiApp (_, _, es) => List.concat (map (summarize d) es)
adamc@579 273 | EApp ((EFfi _, _), e) => summarize d e
adamc@579 274 | EApp _ =>
adamc@579 275 let
adamc@579 276 fun unravel (e, ls) =
adamc@579 277 case e of
adamc@579 278 ENamed n =>
adamc@579 279 let
adamc@579 280 val ls = rev ls
adamc@579 281 in
adamc@579 282 case IM.find (absCounts, n) of
adamc@579 283 NONE => [Unsure]
adamc@579 284 | SOME len =>
adamc@579 285 if length ls < len then
adamc@579 286 ls
adamc@579 287 else
adamc@579 288 [Unsure]
adamc@579 289 end
adamc@579 290 | ERel n => List.revAppend (ls,
adamc@579 291 if n = d then
adamc@579 292 [UseRel, Unsure]
adamc@579 293 else
adamc@579 294 [Unsure])
adamc@579 295 | EApp (f, x) =>
adamc@579 296 unravel (#1 f, summarize d x @ ls)
adamc@579 297 | _ => [Unsure]
adamc@579 298 in
adamc@579 299 unravel (e, [])
adamc@579 300 end
adamc@252 301
adamc@579 302 | EAbs (_, _, _, e) => List.filter (fn UseRel => true
adamc@579 303 | _ => false) (summarize (d + 1) e)
adamc@316 304
adamc@579 305 | EUnop (_, e) => summarize d e
adamc@579 306 | EBinop (_, e1, e2) => summarize d e1 @ summarize d e2
adamc@470 307
adamc@579 308 | ERecord xets => List.concat (map (summarize d o #2) xets)
adamc@579 309 | EField (e, _) => summarize d e
adamc@470 310
adamc@579 311 | ECase (e, pes, _) =>
adamc@579 312 let
adamc@579 313 val lss = map (fn (p, e) => summarize (d + patBinds p) e) pes
adamc@579 314 in
adamc@579 315 case lss of
adamc@579 316 [] => raise Fail "Empty pattern match"
adamc@579 317 | ls :: lss =>
adamc@579 318 if List.all (fn ls' => ls' = ls) lss then
adamc@579 319 summarize d e @ ls
adamc@579 320 else
adamc@579 321 [Unsure]
adamc@579 322 end
adamc@579 323 | EStrcat (e1, e2) => summarize d e1 @ summarize d e2
adamc@316 324
adamc@579 325 | EError (e, _) => summarize d e @ [Unsure]
adamc@318 326
adamc@579 327 | EWrite e => summarize d e @ [WritePage]
adamc@579 328
adamc@579 329 | ESeq (e1, e2) => summarize d e1 @ summarize d e2
adamc@579 330 | ELet (_, _, e1, e2) => summarize d e1 @ summarize (d + 1) e2
adamc@456 331
adamc@579 332 | EClosure (_, es) => List.concat (map (summarize d) es)
adamc@470 333
adamc@579 334 | EQuery {query, body, initial, ...} =>
adamc@579 335 List.concat [summarize d query,
adamc@579 336 summarize (d + 2) body,
adamc@579 337 summarize d initial,
adamc@579 338 [ReadDb]]
adamc@470 339
adamc@579 340 | EDml e => summarize d e @ [WriteDb]
adamc@579 341 | ENextval e => summarize d e @ [WriteDb]
adamc@579 342 | EUnurlify (e, _) => summarize d e
adamc@579 343 | EJavaScript (_, e, _) => summarize d e
adamc@579 344 | ESignalReturn e => summarize d e
adamc@579 345 | ESignalBind (e1, e2) => summarize d e1 @ summarize d e2
adamc@579 346 | ESignalSource e => summarize d e
adamc@579 347 in
adamc@579 348 (*Print.prefaces "Summarize"
adamc@579 349 [("e", MonoPrint.p_exp MonoEnv.empty (e, ErrorMsg.dummySpan)),
adamc@579 350 ("d", Print.PD.string (Int.toString d)),
adamc@579 351 ("s", p_events s)];*)
adamc@579 352 s
adamc@579 353 end
adamc@470 354
adamc@470 355 fun exp env e =
adamc@470 356 let
adamc@470 357 (*val () = Print.prefaces "exp" [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan))]*)
adamc@470 358
adamc@470 359 val r =
adamc@470 360 case e of
adamc@470 361 ERel n =>
adamc@470 362 (case E.lookupERel env n of
adamc@470 363 (_, _, SOME e') => #1 e'
adamc@470 364 | _ => e)
adamc@470 365 | ENamed n =>
adamc@470 366 (case E.lookupENamed env n of
adamc@470 367 (_, _, SOME e', _) => ((*Print.prefaces "Switch" [("n", Print.PD.string (Int.toString n)),
adamc@470 368 ("e'", MonoPrint.p_exp env e')];*)
adamc@470 369 #1 e')
adamc@470 370 | _ => e)
adamc@470 371
adamc@470 372 | EApp ((EAbs (x, t, _, e1), loc), e2) =>
adamc@470 373 ((*Print.prefaces "Considering" [("e1", MonoPrint.p_exp (E.pushERel env x t NONE) e1),
adamc@470 374 ("e2", MonoPrint.p_exp env e2),
adamc@470 375 ("sub", MonoPrint.p_exp env (reduceExp env (subExpInExp (0, e2) e1)))];*)
adamc@470 376 if impure e2 then
adamc@470 377 #1 (reduceExp env (ELet (x, t, e2, e1), loc))
adamc@470 378 else
adamc@470 379 #1 (reduceExp env (subExpInExp (0, e2) e1)))
adamc@470 380
adamc@470 381 | ECase (e', pes, {disc, result}) =>
adamc@442 382 let
adamc@470 383 fun push () =
adamc@470 384 case result of
adamc@470 385 (TFun (dom, result), loc) =>
adamc@470 386 if List.all (fn (_, (EAbs _, _)) => true | _ => false) pes then
adamc@470 387 EAbs ("_", dom, result,
adamc@470 388 (ECase (liftExpInExp 0 e',
adamc@470 389 map (fn (p, (EAbs (_, _, _, e), _)) =>
adamc@470 390 (p, swapExpVarsPat (0, patBinds p) e)
adamc@470 391 | _ => raise Fail "MonoReduce ECase") pes,
adamc@470 392 {disc = disc, result = result}), loc))
adamc@470 393 else
adamc@470 394 e
adamc@470 395 | _ => e
adamc@318 396
adamc@470 397 fun search pes =
adamc@470 398 case pes of
adamc@470 399 [] => push ()
adamc@470 400 | (p, body) :: pes =>
adamc@470 401 case match (env, p, e') of
adamc@470 402 No => search pes
adamc@470 403 | Maybe => push ()
adamc@470 404 | Yes env => #1 (reduceExp env body)
adamc@470 405 in
adamc@470 406 search pes
adamc@470 407 end
adamc@318 408
adamc@470 409 | EField ((ERecord xes, _), x) =>
adamc@470 410 (case List.find (fn (x', _, _) => x' = x) xes of
adamc@470 411 SOME (_, e, _) => #1 e
adamc@470 412 | NONE => e)
adamc@398 413
adamc@470 414 | ELet (x1, t1, (ELet (x2, t2, e1, b1), loc), b2) =>
adamc@470 415 let
adamc@470 416 val e' = (ELet (x2, t2, e1,
adamc@470 417 (ELet (x1, t1, b1,
adamc@470 418 liftExpInExp 1 b2), loc)), loc)
adamc@442 419 in
adamc@470 420 (*Print.prefaces "ELet commute" [("e", MonoPrint.p_exp env (e, loc)),
adamc@470 421 ("e'", MonoPrint.p_exp env e')];*)
adamc@470 422 #1 (reduceExp env e')
adamc@470 423 end
adamc@470 424 | EApp ((ELet (x, t, e, b), loc), e') =>
adamc@470 425 #1 (reduceExp env (ELet (x, t, e,
adamc@470 426 (EApp (b, liftExpInExp 0 e'), loc)), loc))
adamc@470 427
adamc@470 428 | ELet (x, t, e', (EAbs (x', t' as (TRecord [], _), ran, e''), loc)) =>
adamc@470 429 (*if impure e' then
adamc@470 430 e
adamc@470 431 else*)
adamc@470 432 (* Seems unsound in general without the check... should revisit later *)
adamc@470 433 EAbs (x', t', ran, (ELet (x, t, liftExpInExp 0 e', swapExpVars 0 e''), loc))
adamc@470 434
adamc@470 435 | ELet (x, t, e', b) =>
adamc@470 436 let
adamc@470 437 fun doSub () =
adamc@470 438 #1 (reduceExp env (subExpInExp (0, e') b))
adamc@470 439
adamc@470 440 fun trySub () =
adamc@470 441 case t of
adamc@470 442 (TFfi ("Basis", "string"), _) => doSub ()
adamc@568 443 | (TSignal _, _) => e
adamc@470 444 | _ =>
adamc@470 445 case e' of
adamc@470 446 (ECase _, _) => e
adamc@470 447 | _ => doSub ()
adamc@470 448 in
adamc@470 449 if impure e' then
adamc@470 450 let
adamc@470 451 val effs_e' = summarize 0 e'
adamc@489 452 val effs_e' = List.filter (fn x => x <> UseRel) effs_e'
adamc@470 453 val effs_b = summarize 0 b
adamc@470 454
adamc@470 455 (*val () = Print.prefaces "Try"
adamc@489 456 [("e", MonoPrint.p_exp env (e, ErrorMsg.dummySpan)),
adamc@489 457 ("e'", p_events effs_e'),
adamc@489 458 ("b", p_events effs_b)]*)
adamc@470 459
adamc@470 460 fun does eff = List.exists (fn eff' => eff' = eff) effs_e'
adamc@470 461 val writesPage = does WritePage
adamc@470 462 val readsDb = does ReadDb
adamc@470 463 val writesDb = does WriteDb
adamc@470 464
adamc@470 465 fun verifyUnused eff =
adamc@470 466 case eff of
adamc@481 467 UseRel => false
adamc@470 468 | _ => true
adamc@470 469
adamc@470 470 fun verifyCompatible effs =
adamc@470 471 case effs of
adamc@470 472 [] => false
adamc@470 473 | eff :: effs =>
adamc@470 474 case eff of
adamc@470 475 Unsure => false
adamc@481 476 | UseRel => List.all verifyUnused effs
adamc@470 477 | WritePage => not writesPage andalso verifyCompatible effs
adamc@470 478 | ReadDb => not writesDb andalso verifyCompatible effs
adamc@470 479 | WriteDb => not writesDb andalso not readsDb andalso verifyCompatible effs
adamc@470 480 in
adamc@470 481 (*Print.prefaces "verifyCompatible"
adamc@470 482 [("e'", MonoPrint.p_exp env e'),
adamc@470 483 ("b", MonoPrint.p_exp (E.pushERel env x t NONE) b),
adamc@470 484 ("effs_e'", Print.p_list p_event effs_e'),
adamc@470 485 ("effs_b", Print.p_list p_event effs_b)];*)
adamc@481 486 if List.null effs_e' orelse verifyCompatible effs_b then
adamc@470 487 trySub ()
adamc@470 488 else
adamc@470 489 e
adamc@470 490 end
adamc@470 491 else
adamc@442 492 trySub ()
adamc@442 493 end
adamc@252 494
adamc@470 495 | EStrcat ((EPrim (Prim.String s1), _), (EPrim (Prim.String s2), _)) =>
adamc@470 496 EPrim (Prim.String (s1 ^ s2))
adamc@268 497
adamc@572 498 | ESignalBind ((ESignalReturn e1, loc), e2) =>
adamc@572 499 #1 (reduceExp env (EApp (e2, e1), loc))
adamc@572 500
adamc@470 501 | _ => e
adamc@470 502 in
adamc@470 503 (*Print.prefaces "exp'" [("r", MonoPrint.p_exp env (r, ErrorMsg.dummySpan))];*)
adamc@470 504 r
adamc@470 505 end
adamc@470 506
adamc@470 507 and bind (env, b) =
adamc@470 508 case b of
adamc@470 509 U.Decl.Datatype (x, n, xncs) => E.pushDatatype env x n xncs
adamc@470 510 | U.Decl.RelE (x, t) => E.pushERel env x t NONE
adamc@470 511 | U.Decl.NamedE (x, n, t, eo, s) => E.pushENamed env x n t (Option.map (reduceExp env) eo) s
adamc@470 512
adamc@470 513 and reduceExp env = U.Exp.mapB {typ = typ, exp = exp, bind = bind} env
adamc@470 514
adamc@470 515 fun decl env d = d
adamc@398 516 in
adamc@470 517 U.File.mapB {typ = typ, exp = exp, decl = decl, bind = bind} E.empty file
adamc@398 518 end
adamc@133 519
adamc@133 520 end