Mercurial > urweb

annotate src/unpoly.sml @ 315:e21d0dddda09

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Unpoly non-recursive function
author Adam Chlipala <adamc@hcoop.net>
date Thu, 11 Sep 2008 09:36:47 -0400
parents
children 04ebfe929a98
rev   line source
adamc@315 1 (* Copyright (c) 2008, Adam Chlipala
adamc@315 2 * All rights reserved.
adamc@315 3 *
adamc@315 4 * Redistribution and use in source and binary forms, with or without
adamc@315 5 * modification, are permitted provided that the following conditions are met:
adamc@315 6 *
adamc@315 7 * - Redistributions of source code must retain the above copyright notice,
adamc@315 8 * this list of conditions and the following disclaimer.
adamc@315 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@315 10 * this list of conditions and the following disclaimer in the documentation
adamc@315 11 * and/or other materials provided with the distribution.
adamc@315 12 * - The names of contributors may not be used to endorse or promote products
adamc@315 13 * derived from this software without specific prior written permission.
adamc@315 14 *
adamc@315 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@315 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@315 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@315 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@315 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@315 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@315 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@315 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@315 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@315 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@315 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@315 26 *)
adamc@315 27
adamc@315 28 (* Simplify a Core program by repeating polymorphic function definitions *)
adamc@315 29
adamc@315 30 structure Unpoly :> UNPOLY = struct
adamc@315 31
adamc@315 32 open Core
adamc@315 33
adamc@315 34 structure E = CoreEnv
adamc@315 35 structure U = CoreUtil
adamc@315 36
adamc@315 37 structure IS = IntBinarySet
adamc@315 38 structure IM = IntBinaryMap
adamc@315 39
adamc@315 40
adamc@315 41 (** The actual specialization *)
adamc@315 42
adamc@315 43 val liftConInCon = E.liftConInCon
adamc@315 44 val subConInCon = E.subConInCon
adamc@315 45
adamc@315 46 val liftConInExp = E.liftConInExp
adamc@315 47 val subConInExp = E.subConInExp
adamc@315 48
adamc@315 49 type state = {
adamc@315 50 funcs : (kind list * (string * int * con * exp * string) list) IM.map,
adamc@315 51 decls : decl list,
adamc@315 52 nextName : int
adamc@315 53 }
adamc@315 54
adamc@315 55 fun kind (k, st) = (k, st)
adamc@315 56
adamc@315 57 fun con (c, st) = (c, st)
adamc@315 58
adamc@315 59 fun exp (e, st : state) =
adamc@315 60 case e of
adamc@315 61 ECApp _ =>
adamc@315 62 let
adamc@315 63 (*val () = Print.prefaces "exp" [("e", CorePrint.p_exp CoreEnv.empty (e, ErrorMsg.dummySpan))]*)
adamc@315 64
adamc@315 65 fun unravel (e, cargs) =
adamc@315 66 case e of
adamc@315 67 ECApp ((e, _), c) => unravel (e, c :: cargs)
adamc@315 68 | ENamed n => SOME (n, rev cargs)
adamc@315 69 | _ => NONE
adamc@315 70 in
adamc@315 71 case unravel (e, []) of
adamc@315 72 NONE => (e, st)
adamc@315 73 | SOME (n, cargs) =>
adamc@315 74 case IM.find (#funcs st, n) of
adamc@315 75 NONE => (e, st)
adamc@315 76 | SOME (ks, vis) =>
adamc@315 77 let
adamc@315 78 val (vis, nextName) = ListUtil.foldlMap
adamc@315 79 (fn ((x, n, t, e, s), nextName) =>
adamc@315 80 ((x, nextName, n, t, e, s), nextName + 1))
adamc@315 81 (#nextName st) vis
adamc@315 82
adamc@315 83 fun specialize (x, n, n_old, t, e, s) =
adamc@315 84 let
adamc@315 85 fun trim (t, e, cargs) =
adamc@315 86 case (t, e, cargs) of
adamc@315 87 ((TCFun (_, _, t), _),
adamc@315 88 (ECAbs (_, _, e), _),
adamc@315 89 carg :: cargs) =>
adamc@315 90 let
adamc@315 91 val t = subConInCon (length cargs, carg) t
adamc@315 92 val e = subConInExp (length cargs, carg) e
adamc@315 93 in
adamc@315 94 trim (t, e, cargs)
adamc@315 95 end
adamc@315 96 | (_, _, []) => SOME (t, e)
adamc@315 97 | _ => NONE
adamc@315 98 in
adamc@315 99 (*Print.prefaces "specialize"
adamc@315 100 [("t", CorePrint.p_con CoreEnv.empty t),
adamc@315 101 ("e", CorePrint.p_exp CoreEnv.empty e),
adamc@315 102 ("|cargs|", Print.PD.string (Int.toString (length cargs)))];*)
adamc@315 103 Option.map (fn (t, e) => (x, n, n_old, t, e, s))
adamc@315 104 (trim (t, e, cargs))
adamc@315 105 end
adamc@315 106
adamc@315 107 val vis = List.map specialize vis
adamc@315 108 in
adamc@315 109 if List.exists (not o Option.isSome) vis then
adamc@315 110 (e, st)
adamc@315 111 else
adamc@315 112 let
adamc@315 113 val vis = List.mapPartial (fn x => x) vis
adamc@315 114 val vis' = map (fn (x, n, _, t, e, s) =>
adamc@315 115 (x ^ "_unpoly", n, t, e, s)) vis
adamc@315 116 in
adamc@315 117 case List.find (fn (_, _, n_old, _, _, _) => n_old = n) vis of
adamc@315 118 NONE => raise Fail "Unpoly: Inconsistent 'val rec' record"
adamc@315 119 | SOME (_, n, _, _, _, _) =>
adamc@315 120 (ENamed n,
adamc@315 121 {funcs = #funcs st,
adamc@315 122 decls = (DValRec vis', ErrorMsg.dummySpan) :: #decls st,
adamc@315 123 nextName = nextName})
adamc@315 124 end
adamc@315 125 end
adamc@315 126 end
adamc@315 127 | _ => (e, st)
adamc@315 128
adamc@315 129 fun decl (d, st : state) =
adamc@315 130 case d of
adamc@315 131 DValRec (vis as ((x, n, t, e, s) :: rest)) =>
adamc@315 132 let
adamc@315 133 fun unravel (e, cargs) =
adamc@315 134 case e of
adamc@315 135 (ECAbs (_, k, e), _) =>
adamc@315 136 unravel (e, k :: cargs)
adamc@315 137 | _ => rev cargs
adamc@315 138
adamc@315 139 val cargs = unravel (e, [])
adamc@315 140
adamc@315 141 fun unravel (e, cargs) =
adamc@315 142 case (e, cargs) of
adamc@315 143 ((ECAbs (_, k, e), _), k' :: cargs) =>
adamc@315 144 U.Kind.compare (k, k') = EQUAL
adamc@315 145 andalso unravel (e, cargs)
adamc@315 146 | (_, []) => true
adamc@315 147 | _ => false
adamc@315 148 in
adamc@315 149 if List.exists (fn vi => not (unravel (#4 vi, cargs))) rest then
adamc@315 150 (d, st)
adamc@315 151 else
adamc@315 152 let
adamc@315 153 val ns = IS.addList (IS.empty, map #2 vis)
adamc@315 154 val nargs = length cargs
adamc@315 155
adamc@315 156 fun deAbs (e, cargs) =
adamc@315 157 case (e, cargs) of
adamc@315 158 ((ECAbs (_, _, e), _), _ :: cargs) => deAbs (e, cargs)
adamc@315 159 | (_, []) => e
adamc@315 160 | _ => raise Fail "Unpoly: deAbs"
adamc@315 161
adamc@315 162 (** Verifying lack of polymorphic recursion *)
adamc@315 163
adamc@315 164 fun kind _ = false
adamc@315 165 fun con _ = false
adamc@315 166
adamc@315 167 fun exp e =
adamc@315 168 case e of
adamc@315 169 ECApp (e, c) =>
adamc@315 170 let
adamc@315 171 fun isIrregular (e, pos) =
adamc@315 172 case #1 e of
adamc@315 173 ENamed n =>
adamc@315 174 IS.member (ns, n)
adamc@315 175 andalso
adamc@315 176 (case #1 c of
adamc@315 177 CRel i => i <> nargs - pos
adamc@315 178 | _ => true)
adamc@315 179 | ECApp (e, _) => isIrregular (e, pos + 1)
adamc@315 180 | _ => false
adamc@315 181 in
adamc@315 182 isIrregular (e, 1)
adamc@315 183 end
adamc@315 184 | ECAbs _ => true
adamc@315 185 | _ => false
adamc@315 186
adamc@315 187 val irregular = U.Exp.exists {kind = kind, con = con, exp = exp}
adamc@315 188 in
adamc@315 189 if List.exists (fn x => irregular (deAbs (#4 x, cargs))) vis then
adamc@315 190 (d, st)
adamc@315 191 else
adamc@315 192 (d, {funcs = foldl (fn (vi, funcs) =>
adamc@315 193 IM.insert (funcs, #2 vi, (cargs, vis)))
adamc@315 194 (#funcs st) vis,
adamc@315 195 decls = #decls st,
adamc@315 196 nextName = #nextName st})
adamc@315 197 end
adamc@315 198 end
adamc@315 199
adamc@315 200 | _ => (d, st)
adamc@315 201
adamc@315 202 val polyDecl = U.Decl.foldMap {kind = kind, con = con, exp = exp, decl = decl}
adamc@315 203
adamc@315 204 fun unpoly file =
adamc@315 205 let
adamc@315 206 fun doDecl (d : decl, st : state) =
adamc@315 207 let
adamc@315 208 val (d, st) = polyDecl st d
adamc@315 209 in
adamc@315 210 (rev (d :: #decls st),
adamc@315 211 {funcs = #funcs st,
adamc@315 212 decls = [],
adamc@315 213 nextName = #nextName st})
adamc@315 214 end
adamc@315 215
adamc@315 216 val (ds, _) = ListUtil.foldlMapConcat doDecl
adamc@315 217 {funcs = IM.empty,
adamc@315 218 decls = [],
adamc@315 219 nextName = U.File.maxName file + 1} file
adamc@315 220 in
adamc@315 221 ds
adamc@315 222 end
adamc@315 223
adamc@315 224 end