Mercurial > urweb

annotate src/mono_reduce.sml @ 290:df00701f2323

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
'read' type class
author Adam Chlipala <adamc@hcoop.net>
date Sun, 07 Sep 2008 11:53:30 -0400
parents c0e4ac23522d
children 59dc042629b9
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@133 37
adamc@252 38 fun impure (e, _) =
adamc@252 39 case e of
adamc@252 40 EWrite _ => true
adamc@252 41 | EQuery _ => true
adamc@252 42 | EAbs _ => false
adamc@252 43
adamc@252 44 | EPrim _ => false
adamc@252 45 | ERel _ => false
adamc@252 46 | ENamed _ => false
adamc@252 47 | ECon (_, _, eo) => (case eo of NONE => false | SOME e => impure e)
adamc@290 48 | ESome (_, e) => impure e
adamc@252 49 | EFfi _ => false
adamc@252 50 | EFfiApp _ => false
adamc@252 51 | EApp ((EFfi _, _), _) => false
adamc@252 52 | EApp _ => true
adamc@252 53
adamc@252 54 | ERecord xes => List.exists (fn (_, e, _) => impure e) xes
adamc@252 55 | EField (e, _) => impure e
adamc@252 56
adamc@252 57 | ECase (e, pes, _) => impure e orelse List.exists (fn (_, e) => impure e) pes
adamc@252 58
adamc@283 59 | EError (e, _) => impure e
adamc@283 60
adamc@252 61 | EStrcat (e1, e2) => impure e1 orelse impure e2
adamc@252 62
adamc@252 63 | ESeq (e1, e2) => impure e1 orelse impure e2
adamc@252 64 | ELet (_, _, e1, e2) => impure e1 orelse impure e2
adamc@252 65
adamc@252 66 | EClosure (_, es) => List.exists impure es
adamc@252 67
adamc@252 68
adamc@252 69 val liftExpInExp = Monoize.liftExpInExp
adamc@252 70
adamc@252 71 val subExpInExp' =
adamc@133 72 U.Exp.mapB {typ = fn t => t,
adamc@133 73 exp = fn (xn, rep) => fn e =>
adamc@133 74 case e of
adamc@133 75 ERel xn' =>
adamc@133 76 (case Int.compare (xn', xn) of
adamc@133 77 EQUAL => #1 rep
adamc@133 78 | GREATER=> ERel (xn' - 1)
adamc@133 79 | LESS => e)
adamc@133 80 | _ => e,
adamc@133 81 bind = fn ((xn, rep), U.Exp.RelE _) => (xn+1, liftExpInExp 0 rep)
adamc@133 82 | (ctx, _) => ctx}
adamc@133 83
adamc@252 84 fun subExpInExp (n, e1) e2 =
adamc@252 85 let
adamc@252 86 val r = subExpInExp' (n, e1) e2
adamc@252 87 in
adamc@252 88 (*Print.prefaces "subExpInExp" [("e1", MonoPrint.p_exp MonoEnv.empty e1),
adamc@252 89 ("e2", MonoPrint.p_exp MonoEnv.empty e2),
adamc@252 90 ("r", MonoPrint.p_exp MonoEnv.empty r)];*)
adamc@252 91 r
adamc@252 92 end
adamc@133 93
adamc@133 94 fun typ c = c
adamc@133 95
adamc@258 96 datatype result = Yes of E.env | No | Maybe
adamc@258 97
adamc@183 98 fun match (env, p : pat, e : exp) =
adamc@183 99 case (#1 p, #1 e) of
adamc@258 100 (PWild, _) => Yes env
adamc@258 101 | (PVar (x, t), _) => Yes (E.pushERel env x t (SOME e))
adamc@183 102
adamc@280 103 | (PPrim (Prim.String s), EStrcat ((EPrim (Prim.String s'), _), _)) =>
adamc@280 104 if String.isPrefix s' s then
adamc@280 105 Maybe
adamc@280 106 else
adamc@280 107 No
adamc@280 108
adamc@183 109 | (PPrim p, EPrim p') =>
adamc@183 110 if Prim.equal (p, p') then
adamc@258 111 Yes env
adamc@183 112 else
adamc@258 113 No
adamc@183 114
adamc@188 115 | (PCon (_, PConVar n1, NONE), ECon (_, PConVar n2, NONE)) =>
adamc@183 116 if n1 = n2 then
adamc@258 117 Yes env
adamc@183 118 else
adamc@258 119 No
adamc@183 120
adamc@188 121 | (PCon (_, PConVar n1, SOME p), ECon (_, PConVar n2, SOME e)) =>
adamc@183 122 if n1 = n2 then
adamc@183 123 match (env, p, e)
adamc@183 124 else
adamc@258 125 No
adamc@183 126
adamc@188 127 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, NONE), ECon (_, PConFfi {mod = m2, con = con2, ...}, NONE)) =>
adamc@185 128 if m1 = m2 andalso con1 = con2 then
adamc@258 129 Yes env
adamc@185 130 else
adamc@258 131 No
adamc@185 132
adamc@188 133 | (PCon (_, PConFfi {mod = m1, con = con1, ...}, SOME ep), ECon (_, PConFfi {mod = m2, con = con2, ...}, SOME e)) =>
adamc@185 134 if m1 = m2 andalso con1 = con2 then
adamc@185 135 match (env, p, e)
adamc@185 136 else
adamc@258 137 No
adamc@185 138
adamc@183 139 | (PRecord xps, ERecord xes) =>
adamc@183 140 let
adamc@183 141 fun consider (xps, env) =
adamc@183 142 case xps of
adamc@258 143 [] => Yes env
adamc@183 144 | (x, p, _) :: rest =>
adamc@183 145 case List.find (fn (x', _, _) => x' = x) xes of
adamc@258 146 NONE => No
adamc@183 147 | SOME (_, e, _) =>
adamc@183 148 case match (env, p, e) of
adamc@258 149 No => No
adamc@258 150 | Maybe => Maybe
adamc@258 151 | Yes env => consider (rest, env)
adamc@183 152 in
adamc@183 153 consider (xps, env)
adamc@183 154 end
adamc@183 155
adamc@258 156 | _ => Maybe
adamc@183 157
adamc@133 158 fun exp env e =
adamc@133 159 case e of
adamc@183 160 ERel n =>
adamc@183 161 (case E.lookupERel env n of
adamc@183 162 (_, _, SOME e') => #1 e'
adamc@183 163 | _ => e)
adamc@183 164 | ENamed n =>
adamc@133 165 (case E.lookupENamed env n of
adamc@133 166 (_, _, SOME e', _) => #1 e'
adamc@133 167 | _ => e)
adamc@133 168
adamc@252 169 | EApp ((EAbs (x, t, _, e1), loc), e2) =>
adamc@252 170 ((*Print.prefaces "Considering" [("e1", MonoPrint.p_exp env e1),
adamc@252 171 ("e2", MonoPrint.p_exp env e2)];*)
adamc@252 172 if impure e2 then
adamc@252 173 #1 (reduceExp env (ELet (x, t, e2, e1), loc))
adamc@252 174 else
adamc@252 175 #1 (reduceExp env (subExpInExp (0, e2) e1)))
adamc@133 176
adamc@184 177 | ECase (disc, pes, _) =>
adamc@258 178 let
adamc@258 179 fun search pes =
adamc@258 180 case pes of
adamc@258 181 [] => e
adamc@258 182 | (p, body) :: pes =>
adamc@258 183 case match (env, p, disc) of
adamc@258 184 No => search pes
adamc@258 185 | Maybe => e
adamc@258 186 | Yes env => #1 (reduceExp env body)
adamc@258 187 in
adamc@258 188 search pes
adamc@258 189 end
adamc@183 190
adamc@252 191 | EField ((ERecord xes, _), x) =>
adamc@252 192 (case List.find (fn (x', _, _) => x' = x) xes of
adamc@252 193 SOME (_, e, _) => #1 e
adamc@252 194 | NONE => e)
adamc@252 195
adamc@252 196 | ELet (x1, t1, (ELet (x2, t2, e1, b1), loc), b2) =>
adamc@252 197 let
adamc@252 198 val e' = (ELet (x2, t2, e1,
adamc@252 199 (ELet (x1, t1, b1,
adamc@252 200 liftExpInExp 1 b2), loc)), loc)
adamc@252 201 in
adamc@253 202 (*Print.prefaces "ELet commute" [("e", MonoPrint.p_exp env (e, loc)),
adamc@253 203 ("e'", MonoPrint.p_exp env e')];*)
adamc@252 204 #1 (reduceExp env e')
adamc@252 205 end
adamc@252 206 | EApp ((ELet (x, t, e, b), loc), e') =>
adamc@252 207 #1 (reduceExp env (ELet (x, t, e,
adamc@252 208 (EApp (b, liftExpInExp 0 e'), loc)), loc))
adamc@252 209 | ELet (x, t, e', b) =>
adamc@252 210 if impure e' then
adamc@252 211 e
adamc@252 212 else
adamc@252 213 #1 (reduceExp env (subExpInExp (0, e') b))
adamc@252 214
adamc@268 215 | EStrcat ((EPrim (Prim.String s1), _), (EPrim (Prim.String s2), _)) =>
adamc@268 216 EPrim (Prim.String (s1 ^ s2))
adamc@268 217
adamc@133 218 | _ => e
adamc@133 219
adamc@252 220 and bind (env, b) =
adamc@252 221 case b of
adamc@252 222 U.Decl.Datatype (x, n, xncs) => E.pushDatatype env x n xncs
adamc@252 223 | U.Decl.RelE (x, t) => E.pushERel env x t NONE
adamc@252 224 | U.Decl.NamedE (x, n, t, eo, s) => E.pushENamed env x n t (Option.map (reduceExp env) eo) s
adamc@252 225
adamc@133 226 and reduceExp env = U.Exp.mapB {typ = typ, exp = exp, bind = bind} env
adamc@133 227
adamc@133 228 fun decl env d = d
adamc@133 229
adamc@133 230 val reduce = U.File.mapB {typ = typ, exp = exp, decl = decl, bind = bind} E.empty
adamc@133 231
adamc@133 232 end