Mercurial > urweb

annotate src/cjr_env.sml @ 71:6431b315a1e3

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Elaborate efold
author Adam Chlipala <adamc@hcoop.net>
date Thu, 26 Jun 2008 11:09:30 -0400
parents d3cc191cb25f
children 717b6f8d8505
rev   line source
adamc@29 1 (* Copyright (c) 2008, Adam Chlipala
adamc@29 2 * All rights reserved.
adamc@29 3 *
adamc@29 4 * Redistribution and use in source and binary forms, with or without
adamc@29 5 * modification, are permitted provided that the following conditions are met:
adamc@29 6 *
adamc@29 7 * - Redistributions of source code must retain the above copyright notice,
adamc@29 8 * this list of conditions and the following disclaimer.
adamc@29 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@29 10 * this list of conditions and the following disclaimer in the documentation
adamc@29 11 * and/or other materials provided with the distribution.
adamc@29 12 * - The names of contributors may not be used to endorse or promote products
adamc@29 13 * derived from this software without specific prior written permission.
adamc@29 14 *
adamc@29 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@29 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@29 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@29 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@29 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@29 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@29 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@29 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@29 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@29 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@29 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@29 26 *)
adamc@29 27
adamc@29 28 structure CjrEnv :> CJR_ENV = struct
adamc@29 29
adamc@29 30 open Cjr
adamc@29 31
adamc@29 32 structure IM = IntBinaryMap
adamc@29 33
adamc@29 34
adamc@29 35 exception UnboundRel of int
adamc@29 36 exception UnboundNamed of int
adamc@29 37 exception UnboundF of int
adamc@29 38
adamc@29 39 type env = {
adamc@29 40 namedT : (string * typ option) IM.map,
adamc@29 41
adamc@29 42 numRelE : int,
adamc@29 43 relE : (string * typ) list,
adamc@29 44 namedE : (string * typ) IM.map,
adamc@29 45
adamc@29 46 F : (string * typ * typ) IM.map
adamc@29 47 }
adamc@29 48
adamc@29 49 val empty = {
adamc@29 50 namedT = IM.empty,
adamc@29 51
adamc@29 52 numRelE = 0,
adamc@29 53 relE = [],
adamc@29 54 namedE = IM.empty,
adamc@29 55
adamc@29 56 F = IM.empty
adamc@29 57 }
adamc@29 58
adamc@29 59 fun pushTNamed (env : env) x n co =
adamc@29 60 {namedT = IM.insert (#namedT env, n, (x, co)),
adamc@29 61
adamc@29 62 numRelE = #numRelE env,
adamc@29 63 relE = #relE env,
adamc@29 64 namedE = #namedE env,
adamc@29 65
adamc@29 66 F = #F env}
adamc@29 67
adamc@29 68 fun lookupTNamed (env : env) n =
adamc@29 69 case IM.find (#namedT env, n) of
adamc@29 70 NONE => raise UnboundNamed n
adamc@29 71 | SOME x => x
adamc@29 72
adamc@29 73 fun pushERel (env : env) x t =
adamc@29 74 {namedT = #namedT env,
adamc@29 75
adamc@29 76 numRelE = #numRelE env + 1,
adamc@29 77 relE = (x, t) :: #relE env,
adamc@29 78 namedE = #namedE env,
adamc@29 79
adamc@29 80 F = #F env}
adamc@29 81
adamc@29 82 fun lookupERel (env : env) n =
adamc@29 83 (List.nth (#relE env, n))
adamc@29 84 handle Subscript => raise UnboundRel n
adamc@29 85
adamc@29 86 fun countERels (env : env) = #numRelE env
adamc@29 87
adamc@29 88 fun listERels (env : env) = #relE env
adamc@29 89
adamc@29 90 fun pushENamed (env : env) x n t =
adamc@29 91 {namedT = #namedT env,
adamc@29 92
adamc@29 93 numRelE = #numRelE env,
adamc@29 94 relE = #relE env,
adamc@29 95 namedE = IM.insert (#namedE env, n, (x, t)),
adamc@29 96
adamc@29 97 F = #F env}
adamc@29 98
adamc@29 99 fun lookupENamed (env : env) n =
adamc@29 100 case IM.find (#namedE env, n) of
adamc@29 101 NONE => raise UnboundNamed n
adamc@29 102 | SOME x => x
adamc@29 103
adamc@29 104 fun pushF (env : env) n x dom ran =
adamc@29 105 {namedT = #namedT env,
adamc@29 106
adamc@29 107 numRelE = #numRelE env,
adamc@29 108 relE = #relE env,
adamc@29 109 namedE = #namedE env,
adamc@29 110
adamc@29 111 F = IM.insert (#F env, n, (x, dom, ran))}
adamc@29 112
adamc@29 113 fun lookupF (env : env) n =
adamc@29 114 case IM.find (#F env, n) of
adamc@29 115 NONE => raise UnboundF n
adamc@29 116 | SOME x => x
adamc@29 117
adamc@29 118 fun declBinds env (d, _) =
adamc@29 119 case d of
adamc@29 120 DVal (x, n, t, _) => pushENamed env x n t
adamc@29 121 | DFun (n, x, dom, ran, _) => pushF env n x dom ran
adamc@29 122 | DStruct _ => env
adamc@29 123
adamc@29 124 end