adamc@25: (* Copyright (c) 2008, Adam Chlipala adamc@25: * All rights reserved. adamc@25: * adamc@25: * Redistribution and use in source and binary forms, with or without adamc@25: * modification, are permitted provided that the following conditions are met: adamc@25: * adamc@25: * - Redistributions of source code must retain the above copyright notice, adamc@25: * this list of conditions and the following disclaimer. adamc@25: * - Redistributions in binary form must reproduce the above copyright notice, adamc@25: * this list of conditions and the following disclaimer in the documentation adamc@25: * and/or other materials provided with the distribution. adamc@25: * - The names of contributors may not be used to endorse or promote products adamc@25: * derived from this software without specific prior written permission. adamc@25: * adamc@25: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" adamc@25: * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE adamc@25: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE adamc@25: * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE adamc@25: * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR adamc@25: * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF adamc@25: * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS adamc@25: * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN adamc@25: * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) adamc@25: * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE adamc@25: * POSSIBILITY OF SUCH DAMAGE. adamc@25: *) adamc@25: adamc@25: structure MonoEnv :> MONO_ENV = struct adamc@25: adamc@25: open Mono adamc@25: adamc@25: structure IM = IntBinaryMap adamc@25: adamc@25: adamc@25: exception UnboundRel of int adamc@25: exception UnboundNamed of int adamc@25: adamc@25: type env = { adamc@25: namedT : (string * typ option) IM.map, adamc@25: adamc@25: relE : (string * typ) list, adamc@109: namedE : (string * typ * exp option * string) IM.map adamc@25: } adamc@25: adamc@25: val empty = { adamc@25: namedT = IM.empty, adamc@25: adamc@25: relE = [], adamc@25: namedE = IM.empty adamc@25: } adamc@25: adamc@25: fun pushTNamed (env : env) x n co = adamc@25: {namedT = IM.insert (#namedT env, n, (x, co)), adamc@25: adamc@25: relE = #relE env, adamc@25: namedE = #namedE env} adamc@25: adamc@25: fun lookupTNamed (env : env) n = adamc@25: case IM.find (#namedT env, n) of adamc@25: NONE => raise UnboundNamed n adamc@25: | SOME x => x adamc@25: adamc@25: fun pushERel (env : env) x t = adamc@25: {namedT = #namedT env, adamc@25: adamc@25: relE = (x, t) :: #relE env, adamc@25: namedE = #namedE env} adamc@25: adamc@25: fun lookupERel (env : env) n = adamc@25: (List.nth (#relE env, n)) adamc@25: handle Subscript => raise UnboundRel n adamc@25: adamc@109: fun pushENamed (env : env) x n t eo s = adamc@25: {namedT = #namedT env, adamc@25: adamc@25: relE = #relE env, adamc@109: namedE = IM.insert (#namedE env, n, (x, t, eo, s))} adamc@25: adamc@25: fun lookupENamed (env : env) n = adamc@25: case IM.find (#namedE env, n) of adamc@25: NONE => raise UnboundNamed n adamc@25: | SOME x => x adamc@25: adamc@25: fun declBinds env (d, _) = adamc@25: case d of adamc@109: DVal (x, n, t, e, s) => pushENamed env x n t (SOME e) s adamc@126: | DValRec vis => foldl (fn ((x, n, t, e, s), env) => pushENamed env x n t NONE s) env vis adamc@109: | DExport _ => env adamc@25: adamc@25: end