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@16
|
54
|
adamc@16
|
55 (* Back to environments *)
|
adamc@16
|
56
|
adamc@16
|
57 exception UnboundRel of int
|
adamc@16
|
58 exception UnboundNamed of int
|
adamc@16
|
59
|
adamc@16
|
60 type env = {
|
adamc@16
|
61 relC : (string * kind) list,
|
adamc@16
|
62 namedC : (string * kind * con option) IM.map,
|
adamc@16
|
63
|
adamc@16
|
64 relE : (string * con) list,
|
adamc@20
|
65 namedE : (string * con * exp option) IM.map
|
adamc@16
|
66 }
|
adamc@16
|
67
|
adamc@16
|
68 val empty = {
|
adamc@16
|
69 relC = [],
|
adamc@16
|
70 namedC = IM.empty,
|
adamc@16
|
71
|
adamc@16
|
72 relE = [],
|
adamc@16
|
73 namedE = IM.empty
|
adamc@16
|
74 }
|
adamc@16
|
75
|
adamc@16
|
76 fun pushCRel (env : env) x k =
|
adamc@16
|
77 {relC = (x, k) :: #relC env,
|
adamc@16
|
78 namedC = IM.map (fn (x, k, co) => (x, k, Option.map lift co)) (#namedC env),
|
adamc@16
|
79
|
adamc@16
|
80 relE = map (fn (x, c) => (x, lift c)) (#relE env),
|
adamc@20
|
81 namedE = IM.map (fn (x, c, eo) => (x, lift c, eo)) (#namedE env)}
|
adamc@16
|
82
|
adamc@16
|
83 fun lookupCRel (env : env) n =
|
adamc@16
|
84 (List.nth (#relC env, n))
|
adamc@16
|
85 handle Subscript => raise UnboundRel n
|
adamc@16
|
86
|
adamc@16
|
87 fun pushCNamed (env : env) x n k co =
|
adamc@16
|
88 {relC = #relC env,
|
adamc@16
|
89 namedC = IM.insert (#namedC env, n, (x, k, co)),
|
adamc@16
|
90
|
adamc@16
|
91 relE = #relE env,
|
adamc@16
|
92 namedE = #namedE env}
|
adamc@16
|
93
|
adamc@16
|
94 fun lookupCNamed (env : env) n =
|
adamc@16
|
95 case IM.find (#namedC env, n) of
|
adamc@16
|
96 NONE => raise UnboundNamed n
|
adamc@16
|
97 | SOME x => x
|
adamc@16
|
98
|
adamc@16
|
99 fun pushERel (env : env) x t =
|
adamc@16
|
100 {relC = #relC env,
|
adamc@16
|
101 namedC = #namedC env,
|
adamc@16
|
102
|
adamc@16
|
103 relE = (x, t) :: #relE env,
|
adamc@16
|
104 namedE = #namedE env}
|
adamc@16
|
105
|
adamc@16
|
106 fun lookupERel (env : env) n =
|
adamc@16
|
107 (List.nth (#relE env, n))
|
adamc@16
|
108 handle Subscript => raise UnboundRel n
|
adamc@16
|
109
|
adamc@20
|
110 fun pushENamed (env : env) x n t eo =
|
adamc@16
|
111 {relC = #relC env,
|
adamc@16
|
112 namedC = #namedC env,
|
adamc@16
|
113
|
adamc@16
|
114 relE = #relE env,
|
adamc@20
|
115 namedE = IM.insert (#namedE env, n, (x, t, eo))}
|
adamc@16
|
116
|
adamc@16
|
117 fun lookupENamed (env : env) n =
|
adamc@16
|
118 case IM.find (#namedE env, n) of
|
adamc@16
|
119 NONE => raise UnboundNamed n
|
adamc@16
|
120 | SOME x => x
|
adamc@16
|
121
|
adamc@16
|
122 fun declBinds env (d, _) =
|
adamc@16
|
123 case d of
|
adamc@16
|
124 DCon (x, n, k, c) => pushCNamed env x n k (SOME c)
|
adamc@20
|
125 | DVal (x, n, t, e) => pushENamed env x n t (SOME e)
|
adamc@16
|
126
|
adamc@16
|
127 end
|