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