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@168:      datatypes : (string * (string * int * typ option) list) IM.map,
adamc@178:      constructors : (string * typ option * int) IM.map,
adamc@25: 
adamc@183:      relE : (string * typ * exp option) list,
adamc@109:      namedE : (string * typ * exp option * string) IM.map
adamc@25: }
adamc@25: 
adamc@25: val empty = {
adamc@168:     datatypes = IM.empty,
adamc@178:     constructors = IM.empty,
adamc@25: 
adamc@25:     relE = [],
adamc@25:     namedE = IM.empty
adamc@25: }
adamc@25: 
adamc@168: fun pushDatatype (env : env) x n xncs =
adamc@168:     {datatypes = IM.insert (#datatypes env, n, (x, xncs)),
adamc@182:      constructors = foldl (fn ((x, n', to), constructors) =>
adamc@182:                               IM.insert (constructors, n', (x, to, n)))
adamc@178:                           (#constructors env) xncs,
adamc@25: 
adamc@25:      relE = #relE env,
adamc@25:      namedE = #namedE env}
adamc@25: 
adamc@168: fun lookupDatatype (env : env) n =
adamc@168:     case IM.find (#datatypes env, n) of
adamc@25:         NONE => raise UnboundNamed n
adamc@25:       | SOME x => x
adamc@25: 
adamc@178: fun lookupConstructor (env : env) n =
adamc@178:     case IM.find (#constructors env, n) of
adamc@178:         NONE => raise UnboundNamed n
adamc@178:       | SOME x => x
adamc@178: 
adamc@800: structure U = MonoUtil
adamc@800: 
adamc@800: val liftExpInExp =
adamc@800:     U.Exp.mapB {typ = fn t => t,
adamc@800:                 exp = fn bound => fn e =>
adamc@800:                                      case e of
adamc@800:                                          ERel xn =>
adamc@800:                                          if xn < bound then
adamc@800:                                              e
adamc@800:                                          else
adamc@800:                                              ERel (xn + 1)
adamc@800:                                        | _ => e,
adamc@800:                 bind = fn (bound, U.Exp.RelE _) => bound + 1
adamc@800:                         | (bound, _) => bound}
adamc@800: 
adam@1394: val subExpInExp =
adam@1394:     U.Exp.mapB {typ = fn t => t,
adam@1394:                 exp = fn (xn, rep) => fn e =>
adam@1394:                                   case e of
adam@1394:                                       ERel xn' =>
adam@1394:                                       (case Int.compare (xn', xn) of
adam@1394:                                            EQUAL => #1 rep
adam@1394:                                          | GREATER=> ERel (xn' - 1)
adam@1394:                                          | LESS => e)
adam@1394:                                     | _ => e,
adam@1394:                 bind = fn ((xn, rep), U.Exp.RelE _) => (xn+1, liftExpInExp 0 rep)
adam@1394:                         | (ctx, _) => ctx}
adam@1394: 
adamc@183: fun pushERel (env : env) x t eo =
adamc@168:     {datatypes = #datatypes env,
adamc@178:      constructors = #constructors env,
adamc@800:      relE = (x, t, eo) :: map (fn (x, t, eo) => (x, t, Option.map (liftExpInExp 0) eo)) (#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@168:     {datatypes = #datatypes env,
adamc@178:      constructors = #constructors 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@164: fun declBinds env (d, loc) =
adamc@25:     case d of
adamc@808:         DDatatype dts =>
adamc@808:         foldl (fn ((x, n, xncs), env) =>
adamc@808:                   let
adamc@808:                       val env = pushDatatype env x n xncs
adamc@808:                       val dt = (TDatatype (n, ref (ElabUtil.classifyDatatype xncs, xncs)), loc)
adamc@808:                   in
adamc@808:                       foldl (fn ((x', n', NONE), env) => pushENamed env x' n' dt NONE ""
adamc@808:                               | ((x', n', SOME t), env) => pushENamed env x' n' (TFun (t, dt), loc) NONE "")
adamc@808:                             env xncs
adamc@808:                   end) env dts
adamc@164:       | 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@273:       | DTable _ => env
adamc@338:       | DSequence _ => env
adamc@754:       | DView _ => env
adamc@271:       | DDatabase _ => env
adamc@569:       | DJavaScript _ => env
adamc@725:       | DCookie _ => env
adamc@718:       | DStyle _ => env
adamc@1075:       | DTask _ => env
adamc@1199:       | DPolicy _ => env
adam@1294:       | DOnError _ => env
adamc@25: 
adamc@179: fun patBinds env (p, loc) =
adamc@179:     case p of
adamc@179:         PWild => env
adamc@183:       | PVar (x, t) => pushERel env x t NONE
adamc@179:       | PPrim _ => env
adamc@188:       | PCon (_, _, NONE) => env
adamc@188:       | PCon (_, _, SOME p) => patBinds env p
adamc@182:       | PRecord xps => foldl (fn ((_, p, _), env) => patBinds env p) env xps
adamc@288:       | PNone _ => env
adamc@288:       | PSome (_, p) => patBinds env p
adamc@179: 
adamc@567: fun patBindsN (p, loc) =
adamc@567:     case p of
adamc@567:         PWild => 0
adamc@567:       | PVar _ => 1
adamc@567:       | PPrim _ => 0
adamc@567:       | PCon (_, _, NONE) => 0
adamc@567:       | PCon (_, _, SOME p) => patBindsN p
adamc@567:       | PRecord xps => foldl (fn ((_, p, _), count) => count + patBindsN p) 0 xps
adamc@567:       | PNone _ => 0
adamc@567:       | PSome (_, p) => patBindsN p
adamc@567: 
adamc@25: end