Mercurial > urweb

annotate src/core_env.sml @ 338:e976b187d73a

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
SQL sequences
author Adam Chlipala <adamc@hcoop.net>
date Sun, 14 Sep 2008 11:02:18 -0400
parents e21d0dddda09
children e0e9e9eca1cb
rev   line source
adamc@16 1 (* Copyright (c) 2008, Adam Chlipala
adamc@16 2 * All rights reserved.
adamc@16 3 *
adamc@16 4 * Redistribution and use in source and binary forms, with or without
adamc@16 5 * modification, are permitted provided that the following conditions are met:
adamc@16 6 *
adamc@16 7 * - Redistributions of source code must retain the above copyright notice,
adamc@16 8 * this list of conditions and the following disclaimer.
adamc@16 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@16 10 * this list of conditions and the following disclaimer in the documentation
adamc@16 11 * and/or other materials provided with the distribution.
adamc@16 12 * - The names of contributors may not be used to endorse or promote products
adamc@16 13 * derived from this software without specific prior written permission.
adamc@16 14 *
adamc@16 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@16 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@16 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@16 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@16 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@16 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@16 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@16 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@16 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@16 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@16 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@16 26 *)
adamc@16 27
adamc@16 28 structure CoreEnv :> CORE_ENV = struct
adamc@16 29
adamc@16 30 open Core
adamc@16 31
adamc@16 32 structure U = CoreUtil
adamc@16 33
adamc@16 34 structure IM = IntBinaryMap
adamc@16 35
adamc@16 36
adamc@16 37 (* AST utility functions *)
adamc@16 38
adamc@16 39 val liftConInCon =
adamc@16 40 U.Con.mapB {kind = fn k => k,
adamc@16 41 con = fn bound => fn c =>
adamc@16 42 case c of
adamc@16 43 CRel xn =>
adamc@16 44 if xn < bound then
adamc@16 45 c
adamc@16 46 else
adamc@16 47 CRel (xn + 1)
adamc@16 48 | _ => c,
adamc@16 49 bind = fn (bound, U.Con.Rel _) => bound + 1
adamc@16 50 | (bound, _) => bound}
adamc@16 51
adamc@16 52 val lift = liftConInCon 0
adamc@16 53
adamc@193 54 val subConInCon =
adamc@193 55 U.Con.mapB {kind = fn k => k,
adamc@193 56 con = fn (xn, rep) => fn c =>
adamc@193 57 case c of
adamc@193 58 CRel xn' =>
adamc@193 59 (case Int.compare (xn', xn) of
adamc@193 60 EQUAL => #1 rep
adamc@193 61 | GREATER => CRel (xn' - 1)
adamc@193 62 | LESS => c)
adamc@193 63 | _ => c,
adamc@193 64 bind = fn ((xn, rep), U.Con.Rel _) => (xn+1, liftConInCon 0 rep)
adamc@193 65 | (ctx, _) => ctx}
adamc@193 66
adamc@16 67
adamc@315 68 val liftConInExp =
adamc@315 69 U.Exp.mapB {kind = fn k => k,
adamc@315 70 con = fn bound => fn c =>
adamc@315 71 case c of
adamc@315 72 CRel xn =>
adamc@315 73 if xn < bound then
adamc@315 74 c
adamc@315 75 else
adamc@315 76 CRel (xn + 1)
adamc@315 77 | _ => c,
adamc@315 78 exp = fn _ => fn e => e,
adamc@315 79 bind = fn (bound, U.Exp.RelC _) => bound + 1
adamc@315 80 | (bound, _) => bound}
adamc@315 81
adamc@315 82 val subConInExp =
adamc@315 83 U.Exp.mapB {kind = fn k => k,
adamc@315 84 con = fn (xn, rep) => fn c =>
adamc@315 85 case c of
adamc@315 86 CRel xn' =>
adamc@315 87 (case Int.compare (xn', xn) of
adamc@315 88 EQUAL => #1 rep
adamc@315 89 | GREATER => CRel (xn' - 1)
adamc@315 90 | LESS => c)
adamc@315 91 | _ => c,
adamc@315 92 exp = fn _ => fn e => e,
adamc@315 93 bind = fn ((xn, rep), U.Exp.RelC _) => (xn+1, liftConInCon 0 rep)
adamc@315 94 | (ctx, _) => ctx}
adamc@315 95
adamc@16 96 (* Back to environments *)
adamc@16 97
adamc@16 98 exception UnboundRel of int
adamc@16 99 exception UnboundNamed of int
adamc@16 100
adamc@16 101 type env = {
adamc@16 102 relC : (string * kind) list,
adamc@16 103 namedC : (string * kind * con option) IM.map,
adamc@16 104
adamc@192 105 datatypes : (string * string list * (string * int * con option) list) IM.map,
adamc@192 106 constructors : (string * string list * con option * int) IM.map,
adamc@168 107
adamc@16 108 relE : (string * con) list,
adamc@109 109 namedE : (string * con * exp option * string) IM.map
adamc@16 110 }
adamc@16 111
adamc@16 112 val empty = {
adamc@16 113 relC = [],
adamc@16 114 namedC = IM.empty,
adamc@16 115
adamc@168 116 datatypes = IM.empty,
adamc@177 117 constructors = IM.empty,
adamc@168 118
adamc@16 119 relE = [],
adamc@16 120 namedE = IM.empty
adamc@16 121 }
adamc@16 122
adamc@16 123 fun pushCRel (env : env) x k =
adamc@16 124 {relC = (x, k) :: #relC env,
adamc@16 125 namedC = IM.map (fn (x, k, co) => (x, k, Option.map lift co)) (#namedC env),
adamc@16 126
adamc@168 127 datatypes = #datatypes env,
adamc@177 128 constructors = #constructors env,
adamc@168 129
adamc@16 130 relE = map (fn (x, c) => (x, lift c)) (#relE env),
adamc@109 131 namedE = IM.map (fn (x, c, eo, s) => (x, lift c, eo, s)) (#namedE env)}
adamc@16 132
adamc@16 133 fun lookupCRel (env : env) n =
adamc@16 134 (List.nth (#relC env, n))
adamc@16 135 handle Subscript => raise UnboundRel n
adamc@16 136
adamc@16 137 fun pushCNamed (env : env) x n k co =
adamc@16 138 {relC = #relC env,
adamc@16 139 namedC = IM.insert (#namedC env, n, (x, k, co)),
adamc@16 140
adamc@168 141 datatypes = #datatypes env,
adamc@177 142 constructors = #constructors env,
adamc@168 143
adamc@16 144 relE = #relE env,
adamc@16 145 namedE = #namedE env}
adamc@16 146
adamc@16 147 fun lookupCNamed (env : env) n =
adamc@16 148 case IM.find (#namedC env, n) of
adamc@16 149 NONE => raise UnboundNamed n
adamc@16 150 | SOME x => x
adamc@16 151
adamc@192 152 fun pushDatatype (env : env) x n xs xncs =
adamc@168 153 {relC = #relC env,
adamc@168 154 namedC = #namedC env,
adamc@168 155
adamc@192 156 datatypes = IM.insert (#datatypes env, n, (x, xs, xncs)),
adamc@182 157 constructors = foldl (fn ((x, n', to), constructors) =>
adamc@192 158 IM.insert (constructors, n', (x, xs, to, n)))
adamc@177 159 (#constructors env) xncs,
adamc@168 160
adamc@168 161 relE = #relE env,
adamc@168 162 namedE = #namedE env}
adamc@168 163
adamc@168 164 fun lookupDatatype (env : env) n =
adamc@168 165 case IM.find (#datatypes env, n) of
adamc@168 166 NONE => raise UnboundNamed n
adamc@168 167 | SOME x => x
adamc@168 168
adamc@177 169 fun lookupConstructor (env : env) n =
adamc@177 170 case IM.find (#constructors env, n) of
adamc@177 171 NONE => raise UnboundNamed n
adamc@177 172 | SOME x => x
adamc@177 173
adamc@16 174 fun pushERel (env : env) x t =
adamc@16 175 {relC = #relC env,
adamc@16 176 namedC = #namedC env,
adamc@16 177
adamc@168 178 datatypes = #datatypes env,
adamc@177 179 constructors = #constructors env,
adamc@168 180
adamc@16 181 relE = (x, t) :: #relE env,
adamc@16 182 namedE = #namedE env}
adamc@16 183
adamc@16 184 fun lookupERel (env : env) n =
adamc@16 185 (List.nth (#relE env, n))
adamc@16 186 handle Subscript => raise UnboundRel n
adamc@16 187
adamc@109 188 fun pushENamed (env : env) x n t eo s =
adamc@16 189 {relC = #relC env,
adamc@16 190 namedC = #namedC env,
adamc@16 191
adamc@168 192 datatypes = #datatypes env,
adamc@177 193 constructors = #constructors env,
adamc@168 194
adamc@16 195 relE = #relE env,
adamc@109 196 namedE = IM.insert (#namedE env, n, (x, t, eo, s))}
adamc@16 197
adamc@16 198 fun lookupENamed (env : env) n =
adamc@16 199 case IM.find (#namedE env, n) of
adamc@16 200 NONE => raise UnboundNamed n
adamc@16 201 | SOME x => x
adamc@16 202
adamc@163 203 fun declBinds env (d, loc) =
adamc@16 204 case d of
adamc@16 205 DCon (x, n, k, c) => pushCNamed env x n k (SOME c)
adamc@192 206 | DDatatype (x, n, xs, xncs) =>
adamc@163 207 let
adamc@192 208 val env = pushDatatype env x n xs xncs
adamc@163 209 val env = pushCNamed env x n (KType, loc) NONE
adamc@163 210 in
adamc@163 211 foldl (fn ((x', n', NONE), env) => pushENamed env x' n' (CNamed n, loc) NONE ""
adamc@163 212 | ((x', n', SOME t), env) => pushENamed env x' n' (TFun (t, (CNamed n, loc)), loc) NONE "")
adamc@163 213 env xncs
adamc@163 214 end
adamc@109 215 | DVal (x, n, t, e, s) => pushENamed env x n t (SOME e) s
adamc@126 216 | DValRec vis => foldl (fn ((x, n, t, e, s), env) => pushENamed env x n t NONE s) env vis
adamc@109 217 | DExport _ => env
adamc@247 218 | DTable (x, n, c, s) =>
adamc@247 219 let
adamc@338 220 val t = (CApp ((CFfi ("Basis", "sql_table"), loc), c), loc)
adamc@338 221 in
adamc@338 222 pushENamed env x n t NONE s
adamc@338 223 end
adamc@338 224 | DSequence (x, n, s) =>
adamc@338 225 let
adamc@338 226 val t = (CFfi ("Basis", "sql_sequence"), loc)
adamc@247 227 in
adamc@247 228 pushENamed env x n t NONE s
adamc@247 229 end
adamc@271 230 | DDatabase _ => env
adamc@16 231
adamc@193 232 fun patBinds env (p, loc) =
adamc@193 233 case p of
adamc@193 234 PWild => env
adamc@193 235 | PVar (x, t) => pushERel env x t
adamc@193 236 | PPrim _ => env
adamc@193 237 | PCon (_, _, _, NONE) => env
adamc@193 238 | PCon (_, _, _, SOME p) => patBinds env p
adamc@193 239 | PRecord xps => foldl (fn ((_, p, _), env) => patBinds env p) env xps
adamc@193 240
adamc@16 241 end