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@193
|
54 val subConInCon =
|
adamc@193
|
55 U.Con.mapB {kind = fn k => k,
|
adamc@193
|
56 con = fn (xn, rep) => fn c =>
|
adamc@193
|
57 case c of
|
adamc@193
|
58 CRel xn' =>
|
adamc@193
|
59 (case Int.compare (xn', xn) of
|
adamc@193
|
60 EQUAL => #1 rep
|
adamc@193
|
61 | GREATER => CRel (xn' - 1)
|
adamc@193
|
62 | LESS => c)
|
adamc@193
|
63 | _ => c,
|
adamc@193
|
64 bind = fn ((xn, rep), U.Con.Rel _) => (xn+1, liftConInCon 0 rep)
|
adamc@193
|
65 | (ctx, _) => ctx}
|
adamc@193
|
66
|
adamc@16
|
67
|
adamc@16
|
68 (* Back to environments *)
|
adamc@16
|
69
|
adamc@16
|
70 exception UnboundRel of int
|
adamc@16
|
71 exception UnboundNamed of int
|
adamc@16
|
72
|
adamc@16
|
73 type env = {
|
adamc@16
|
74 relC : (string * kind) list,
|
adamc@16
|
75 namedC : (string * kind * con option) IM.map,
|
adamc@16
|
76
|
adamc@192
|
77 datatypes : (string * string list * (string * int * con option) list) IM.map,
|
adamc@192
|
78 constructors : (string * string list * con option * int) IM.map,
|
adamc@168
|
79
|
adamc@16
|
80 relE : (string * con) list,
|
adamc@109
|
81 namedE : (string * con * exp option * string) IM.map
|
adamc@16
|
82 }
|
adamc@16
|
83
|
adamc@16
|
84 val empty = {
|
adamc@16
|
85 relC = [],
|
adamc@16
|
86 namedC = IM.empty,
|
adamc@16
|
87
|
adamc@168
|
88 datatypes = IM.empty,
|
adamc@177
|
89 constructors = IM.empty,
|
adamc@168
|
90
|
adamc@16
|
91 relE = [],
|
adamc@16
|
92 namedE = IM.empty
|
adamc@16
|
93 }
|
adamc@16
|
94
|
adamc@16
|
95 fun pushCRel (env : env) x k =
|
adamc@16
|
96 {relC = (x, k) :: #relC env,
|
adamc@16
|
97 namedC = IM.map (fn (x, k, co) => (x, k, Option.map lift co)) (#namedC env),
|
adamc@16
|
98
|
adamc@168
|
99 datatypes = #datatypes env,
|
adamc@177
|
100 constructors = #constructors env,
|
adamc@168
|
101
|
adamc@16
|
102 relE = map (fn (x, c) => (x, lift c)) (#relE env),
|
adamc@109
|
103 namedE = IM.map (fn (x, c, eo, s) => (x, lift c, eo, s)) (#namedE env)}
|
adamc@16
|
104
|
adamc@16
|
105 fun lookupCRel (env : env) n =
|
adamc@16
|
106 (List.nth (#relC env, n))
|
adamc@16
|
107 handle Subscript => raise UnboundRel n
|
adamc@16
|
108
|
adamc@16
|
109 fun pushCNamed (env : env) x n k co =
|
adamc@16
|
110 {relC = #relC env,
|
adamc@16
|
111 namedC = IM.insert (#namedC env, n, (x, k, co)),
|
adamc@16
|
112
|
adamc@168
|
113 datatypes = #datatypes env,
|
adamc@177
|
114 constructors = #constructors env,
|
adamc@168
|
115
|
adamc@16
|
116 relE = #relE env,
|
adamc@16
|
117 namedE = #namedE env}
|
adamc@16
|
118
|
adamc@16
|
119 fun lookupCNamed (env : env) n =
|
adamc@16
|
120 case IM.find (#namedC env, n) of
|
adamc@16
|
121 NONE => raise UnboundNamed n
|
adamc@16
|
122 | SOME x => x
|
adamc@16
|
123
|
adamc@192
|
124 fun pushDatatype (env : env) x n xs xncs =
|
adamc@168
|
125 {relC = #relC env,
|
adamc@168
|
126 namedC = #namedC env,
|
adamc@168
|
127
|
adamc@192
|
128 datatypes = IM.insert (#datatypes env, n, (x, xs, xncs)),
|
adamc@182
|
129 constructors = foldl (fn ((x, n', to), constructors) =>
|
adamc@192
|
130 IM.insert (constructors, n', (x, xs, to, n)))
|
adamc@177
|
131 (#constructors env) xncs,
|
adamc@168
|
132
|
adamc@168
|
133 relE = #relE env,
|
adamc@168
|
134 namedE = #namedE env}
|
adamc@168
|
135
|
adamc@168
|
136 fun lookupDatatype (env : env) n =
|
adamc@168
|
137 case IM.find (#datatypes env, n) of
|
adamc@168
|
138 NONE => raise UnboundNamed n
|
adamc@168
|
139 | SOME x => x
|
adamc@168
|
140
|
adamc@177
|
141 fun lookupConstructor (env : env) n =
|
adamc@177
|
142 case IM.find (#constructors env, n) of
|
adamc@177
|
143 NONE => raise UnboundNamed n
|
adamc@177
|
144 | SOME x => x
|
adamc@177
|
145
|
adamc@16
|
146 fun pushERel (env : env) x t =
|
adamc@16
|
147 {relC = #relC env,
|
adamc@16
|
148 namedC = #namedC env,
|
adamc@16
|
149
|
adamc@168
|
150 datatypes = #datatypes env,
|
adamc@177
|
151 constructors = #constructors env,
|
adamc@168
|
152
|
adamc@16
|
153 relE = (x, t) :: #relE env,
|
adamc@16
|
154 namedE = #namedE env}
|
adamc@16
|
155
|
adamc@16
|
156 fun lookupERel (env : env) n =
|
adamc@16
|
157 (List.nth (#relE env, n))
|
adamc@16
|
158 handle Subscript => raise UnboundRel n
|
adamc@16
|
159
|
adamc@109
|
160 fun pushENamed (env : env) x n t eo s =
|
adamc@16
|
161 {relC = #relC env,
|
adamc@16
|
162 namedC = #namedC env,
|
adamc@16
|
163
|
adamc@168
|
164 datatypes = #datatypes env,
|
adamc@177
|
165 constructors = #constructors env,
|
adamc@168
|
166
|
adamc@16
|
167 relE = #relE env,
|
adamc@109
|
168 namedE = IM.insert (#namedE env, n, (x, t, eo, s))}
|
adamc@16
|
169
|
adamc@16
|
170 fun lookupENamed (env : env) n =
|
adamc@16
|
171 case IM.find (#namedE env, n) of
|
adamc@16
|
172 NONE => raise UnboundNamed n
|
adamc@16
|
173 | SOME x => x
|
adamc@16
|
174
|
adamc@163
|
175 fun declBinds env (d, loc) =
|
adamc@16
|
176 case d of
|
adamc@16
|
177 DCon (x, n, k, c) => pushCNamed env x n k (SOME c)
|
adamc@192
|
178 | DDatatype (x, n, xs, xncs) =>
|
adamc@163
|
179 let
|
adamc@192
|
180 val env = pushDatatype env x n xs xncs
|
adamc@163
|
181 val env = pushCNamed env x n (KType, loc) NONE
|
adamc@163
|
182 in
|
adamc@163
|
183 foldl (fn ((x', n', NONE), env) => pushENamed env x' n' (CNamed n, loc) NONE ""
|
adamc@163
|
184 | ((x', n', SOME t), env) => pushENamed env x' n' (TFun (t, (CNamed n, loc)), loc) NONE "")
|
adamc@163
|
185 env xncs
|
adamc@163
|
186 end
|
adamc@109
|
187 | DVal (x, n, t, e, s) => pushENamed env x n t (SOME e) s
|
adamc@126
|
188 | DValRec vis => foldl (fn ((x, n, t, e, s), env) => pushENamed env x n t NONE s) env vis
|
adamc@109
|
189 | DExport _ => env
|
adamc@247
|
190 | DTable (x, n, c, s) =>
|
adamc@247
|
191 let
|
adamc@247
|
192 val t = (CApp ((CFfi ("Basis", "table"), loc), c), loc)
|
adamc@247
|
193 in
|
adamc@247
|
194 pushENamed env x n t NONE s
|
adamc@247
|
195 end
|
adamc@271
|
196 | DDatabase _ => env
|
adamc@16
|
197
|
adamc@193
|
198 fun patBinds env (p, loc) =
|
adamc@193
|
199 case p of
|
adamc@193
|
200 PWild => env
|
adamc@193
|
201 | PVar (x, t) => pushERel env x t
|
adamc@193
|
202 | PPrim _ => env
|
adamc@193
|
203 | PCon (_, _, _, NONE) => env
|
adamc@193
|
204 | PCon (_, _, _, SOME p) => patBinds env p
|
adamc@193
|
205 | PRecord xps => foldl (fn ((_, p, _), env) => patBinds env p) env xps
|
adamc@193
|
206
|
adamc@16
|
207 end
|