Mercurial > urweb

annotate src/mono_util.sml @ 37:367f058aba23

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Beefier nested selfification test
author Adam Chlipala <adamc@hcoop.net>
date Tue, 17 Jun 2008 17:14:21 -0400
parents 537db4ee89f4
children 92361a008a10
rev   line source
adamc@26 1 (* Copyright (c) 2008, Adam Chlipala
adamc@26 2 * All rights reserved.
adamc@26 3 *
adamc@26 4 * Redistribution and use in source and binary forms, with or without
adamc@26 5 * modification, are permitted provided that the following conditions are met:
adamc@26 6 *
adamc@26 7 * - Redistributions of source code must retain the above copyright notice,
adamc@26 8 * this list of conditions and the following disclaimer.
adamc@26 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@26 10 * this list of conditions and the following disclaimer in the documentation
adamc@26 11 * and/or other materials provided with the distribution.
adamc@26 12 * - The names of contributors may not be used to endorse or promote products
adamc@26 13 * derived from this software without specific prior written permission.
adamc@26 14 *
adamc@26 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@26 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@26 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@26 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@26 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@26 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@26 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@26 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@26 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@26 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@26 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@26 26 *)
adamc@26 27
adamc@26 28 structure MonoUtil :> MONO_UTIL = struct
adamc@26 29
adamc@26 30 open Mono
adamc@26 31
adamc@26 32 structure S = Search
adamc@26 33
adamc@26 34 structure Typ = struct
adamc@26 35
adamc@26 36 fun mapfold fc =
adamc@26 37 let
adamc@26 38 fun mft c acc =
adamc@26 39 S.bindP (mft' c acc, fc)
adamc@26 40
adamc@26 41 and mft' (cAll as (c, loc)) =
adamc@26 42 case c of
adamc@26 43 TFun (t1, t2) =>
adamc@26 44 S.bind2 (mft t1,
adamc@26 45 fn t1' =>
adamc@26 46 S.map2 (mft t2,
adamc@26 47 fn t2' =>
adamc@26 48 (TFun (t1', t2'), loc)))
adamc@26 49 | TRecord xts =>
adamc@26 50 S.map2 (ListUtil.mapfold (fn (x, t) =>
adamc@26 51 S.map2 (mft t,
adamc@26 52 fn t' =>
adamc@26 53 (x, t')))
adamc@26 54 xts,
adamc@26 55 fn xts' => (TRecord xts', loc))
adamc@26 56 | TNamed _ => S.return2 cAll
adamc@26 57 in
adamc@26 58 mft
adamc@26 59 end
adamc@26 60
adamc@26 61 fun map typ c =
adamc@26 62 case mapfold (fn c => fn () => S.Continue (typ c, ())) c () of
adamc@26 63 S.Return () => raise Fail "Mono_util.Typ.map"
adamc@26 64 | S.Continue (c, ()) => c
adamc@26 65
adamc@26 66 fun fold typ s c =
adamc@26 67 case mapfold (fn c => fn s => S.Continue (c, typ (c, s))) c s of
adamc@26 68 S.Continue (_, s) => s
adamc@26 69 | S.Return _ => raise Fail "MonoUtil.Typ.fold: Impossible"
adamc@26 70
adamc@26 71 fun exists typ k =
adamc@26 72 case mapfold (fn c => fn () =>
adamc@26 73 if typ c then
adamc@26 74 S.Return ()
adamc@26 75 else
adamc@26 76 S.Continue (c, ())) k () of
adamc@26 77 S.Return _ => true
adamc@26 78 | S.Continue _ => false
adamc@26 79
adamc@26 80 end
adamc@26 81
adamc@26 82 structure Exp = struct
adamc@26 83
adamc@26 84 datatype binder =
adamc@26 85 NamedT of string * int * typ option
adamc@26 86 | RelE of string * typ
adamc@26 87 | NamedE of string * int * typ * exp option
adamc@26 88
adamc@26 89 fun mapfoldB {typ = fc, exp = fe, bind} =
adamc@26 90 let
adamc@26 91 val mft = Typ.mapfold fc
adamc@26 92
adamc@26 93 fun mfe ctx e acc =
adamc@26 94 S.bindP (mfe' ctx e acc, fe ctx)
adamc@26 95
adamc@26 96 and mfe' ctx (eAll as (e, loc)) =
adamc@26 97 case e of
adamc@26 98 EPrim _ => S.return2 eAll
adamc@26 99 | ERel _ => S.return2 eAll
adamc@26 100 | ENamed _ => S.return2 eAll
adamc@26 101 | EApp (e1, e2) =>
adamc@26 102 S.bind2 (mfe ctx e1,
adamc@26 103 fn e1' =>
adamc@26 104 S.map2 (mfe ctx e2,
adamc@26 105 fn e2' =>
adamc@26 106 (EApp (e1', e2'), loc)))
adamc@26 107 | EAbs (x, dom, ran, e) =>
adamc@26 108 S.bind2 (mft dom,
adamc@26 109 fn dom' =>
adamc@26 110 S.bind2 (mft ran,
adamc@26 111 fn ran' =>
adamc@26 112 S.map2 (mfe (bind (ctx, RelE (x, dom'))) e,
adamc@26 113 fn e' =>
adamc@26 114 (EAbs (x, dom', ran', e'), loc))))
adamc@26 115
adamc@26 116 | ERecord xes =>
adamc@29 117 S.map2 (ListUtil.mapfold (fn (x, e, t) =>
adamc@29 118 S.bind2 (mfe ctx e,
adamc@26 119 fn e' =>
adamc@29 120 S.map2 (mft t,
adamc@29 121 fn t' =>
adamc@29 122 (x, e', t'))))
adamc@26 123 xes,
adamc@26 124 fn xes' =>
adamc@26 125 (ERecord xes', loc))
adamc@26 126 | EField (e, x) =>
adamc@26 127 S.map2 (mfe ctx e,
adamc@26 128 fn e' =>
adamc@26 129 (EField (e', x), loc))
adamc@26 130 in
adamc@26 131 mfe
adamc@26 132 end
adamc@26 133
adamc@26 134 fun mapfold {typ = fc, exp = fe} =
adamc@26 135 mapfoldB {typ = fc,
adamc@26 136 exp = fn () => fe,
adamc@26 137 bind = fn ((), _) => ()} ()
adamc@26 138
adamc@26 139 fun mapB {typ, exp, bind} ctx e =
adamc@26 140 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 141 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 142 bind = bind} ctx e () of
adamc@26 143 S.Continue (e, ()) => e
adamc@26 144 | S.Return _ => raise Fail "MonoUtil.Exp.mapB: Impossible"
adamc@26 145
adamc@26 146 fun map {typ, exp} e =
adamc@26 147 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 148 exp = fn e => fn () => S.Continue (exp e, ())} e () of
adamc@26 149 S.Return () => raise Fail "Mono_util.Exp.map"
adamc@26 150 | S.Continue (e, ()) => e
adamc@26 151
adamc@26 152 fun fold {typ, exp} s e =
adamc@26 153 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 154 exp = fn e => fn s => S.Continue (e, exp (e, s))} e s of
adamc@26 155 S.Continue (_, s) => s
adamc@26 156 | S.Return _ => raise Fail "MonoUtil.Exp.fold: Impossible"
adamc@26 157
adamc@26 158 fun exists {typ, exp} k =
adamc@26 159 case mapfold {typ = fn c => fn () =>
adamc@26 160 if typ c then
adamc@26 161 S.Return ()
adamc@26 162 else
adamc@26 163 S.Continue (c, ()),
adamc@26 164 exp = fn e => fn () =>
adamc@26 165 if exp e then
adamc@26 166 S.Return ()
adamc@26 167 else
adamc@26 168 S.Continue (e, ())} k () of
adamc@26 169 S.Return _ => true
adamc@26 170 | S.Continue _ => false
adamc@26 171
adamc@26 172 end
adamc@26 173
adamc@26 174 structure Decl = struct
adamc@26 175
adamc@26 176 datatype binder = datatype Exp.binder
adamc@26 177
adamc@26 178 fun mapfoldB {typ = fc, exp = fe, decl = fd, bind} =
adamc@26 179 let
adamc@26 180 val mft = Typ.mapfold fc
adamc@26 181
adamc@26 182 val mfe = Exp.mapfoldB {typ = fc, exp = fe, bind = bind}
adamc@26 183
adamc@26 184 fun mfd ctx d acc =
adamc@26 185 S.bindP (mfd' ctx d acc, fd ctx)
adamc@26 186
adamc@26 187 and mfd' ctx (dAll as (d, loc)) =
adamc@26 188 case d of
adamc@26 189 DVal (x, n, t, e) =>
adamc@26 190 S.bind2 (mft t,
adamc@26 191 fn t' =>
adamc@26 192 S.map2 (mfe ctx e,
adamc@26 193 fn e' =>
adamc@26 194 (DVal (x, n, t', e'), loc)))
adamc@26 195 in
adamc@26 196 mfd
adamc@26 197 end
adamc@26 198
adamc@26 199 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 200 mapfoldB {typ = fc,
adamc@26 201 exp = fn () => fe,
adamc@26 202 decl = fn () => fd,
adamc@26 203 bind = fn ((), _) => ()} ()
adamc@26 204
adamc@26 205 fun fold {typ, exp, decl} s d =
adamc@26 206 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 207 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 208 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 209 S.Continue (_, s) => s
adamc@26 210 | S.Return _ => raise Fail "MonoUtil.Decl.fold: Impossible"
adamc@26 211
adamc@26 212 end
adamc@26 213
adamc@26 214 structure File = struct
adamc@26 215
adamc@26 216 datatype binder = datatype Exp.binder
adamc@26 217
adamc@26 218 fun mapfoldB (all as {bind, ...}) =
adamc@26 219 let
adamc@26 220 val mfd = Decl.mapfoldB all
adamc@26 221
adamc@26 222 fun mff ctx ds =
adamc@26 223 case ds of
adamc@26 224 nil => S.return2 nil
adamc@26 225 | d :: ds' =>
adamc@26 226 S.bind2 (mfd ctx d,
adamc@26 227 fn d' =>
adamc@26 228 let
adamc@26 229 val b =
adamc@26 230 case #1 d' of
adamc@26 231 DVal (x, n, t, e) => NamedE (x, n, t, SOME e)
adamc@26 232 val ctx' = bind (ctx, b)
adamc@26 233 in
adamc@26 234 S.map2 (mff ctx' ds',
adamc@26 235 fn ds' =>
adamc@26 236 d' :: ds')
adamc@26 237 end)
adamc@26 238 in
adamc@26 239 mff
adamc@26 240 end
adamc@26 241
adamc@26 242 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 243 mapfoldB {typ = fc,
adamc@26 244 exp = fn () => fe,
adamc@26 245 decl = fn () => fd,
adamc@26 246 bind = fn ((), _) => ()} ()
adamc@26 247
adamc@26 248 fun mapB {typ, exp, decl, bind} ctx ds =
adamc@26 249 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 250 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 251 decl = fn ctx => fn d => fn () => S.Continue (decl ctx d, ()),
adamc@26 252 bind = bind} ctx ds () of
adamc@26 253 S.Continue (ds, ()) => ds
adamc@26 254 | S.Return _ => raise Fail "MonoUtil.File.mapB: Impossible"
adamc@26 255
adamc@26 256 fun fold {typ, exp, decl} s d =
adamc@26 257 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 258 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 259 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 260 S.Continue (_, s) => s
adamc@26 261 | S.Return _ => raise Fail "MonoUtil.File.fold: Impossible"
adamc@26 262
adamc@26 263 end
adamc@26 264
adamc@26 265 end