1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
(* Copyright (c) 2008, Adam Chlipala
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - The names of contributors may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*)
structure CoreEnv :> CORE_ENV = struct
open Core
structure U = CoreUtil
structure IM = IntBinaryMap
(* AST utility functions *)
val liftConInCon =
U.Con.mapB {kind = fn k => k,
con = fn bound => fn c =>
case c of
CRel xn =>
if xn < bound then
c
else
CRel (xn + 1)
| _ => c,
bind = fn (bound, U.Con.Rel _) => bound + 1
| (bound, _) => bound}
val lift = liftConInCon 0
(* Back to environments *)
exception UnboundRel of int
exception UnboundNamed of int
type env = {
relC : (string * kind) list,
namedC : (string * kind * con option) IM.map,
datatypes : (string * (string * int * con option) list) IM.map,
constructors : (string * con option * int) IM.map,
relE : (string * con) list,
namedE : (string * con * exp option * string) IM.map
}
val empty = {
relC = [],
namedC = IM.empty,
datatypes = IM.empty,
constructors = IM.empty,
relE = [],
namedE = IM.empty
}
fun pushCRel (env : env) x k =
{relC = (x, k) :: #relC env,
namedC = IM.map (fn (x, k, co) => (x, k, Option.map lift co)) (#namedC env),
datatypes = #datatypes env,
constructors = #constructors env,
relE = map (fn (x, c) => (x, lift c)) (#relE env),
namedE = IM.map (fn (x, c, eo, s) => (x, lift c, eo, s)) (#namedE env)}
fun lookupCRel (env : env) n =
(List.nth (#relC env, n))
handle Subscript => raise UnboundRel n
fun pushCNamed (env : env) x n k co =
{relC = #relC env,
namedC = IM.insert (#namedC env, n, (x, k, co)),
datatypes = #datatypes env,
constructors = #constructors env,
relE = #relE env,
namedE = #namedE env}
fun lookupCNamed (env : env) n =
case IM.find (#namedC env, n) of
NONE => raise UnboundNamed n
| SOME x => x
fun pushDatatype (env : env) x n xncs =
{relC = #relC env,
namedC = #namedC env,
datatypes = IM.insert (#datatypes env, n, (x, xncs)),
constructors = foldl (fn ((x, n, to), constructors) =>
IM.insert (constructors, n, (x, to, n)))
(#constructors env) xncs,
relE = #relE env,
namedE = #namedE env}
fun lookupDatatype (env : env) n =
case IM.find (#datatypes env, n) of
NONE => raise UnboundNamed n
| SOME x => x
fun lookupConstructor (env : env) n =
case IM.find (#constructors env, n) of
NONE => raise UnboundNamed n
| SOME x => x
fun pushERel (env : env) x t =
{relC = #relC env,
namedC = #namedC env,
datatypes = #datatypes env,
constructors = #constructors env,
relE = (x, t) :: #relE env,
namedE = #namedE env}
fun lookupERel (env : env) n =
(List.nth (#relE env, n))
handle Subscript => raise UnboundRel n
fun pushENamed (env : env) x n t eo s =
{relC = #relC env,
namedC = #namedC env,
datatypes = #datatypes env,
constructors = #constructors env,
relE = #relE env,
namedE = IM.insert (#namedE env, n, (x, t, eo, s))}
fun lookupENamed (env : env) n =
case IM.find (#namedE env, n) of
NONE => raise UnboundNamed n
| SOME x => x
fun declBinds env (d, loc) =
case d of
DCon (x, n, k, c) => pushCNamed env x n k (SOME c)
| DDatatype (x, n, xncs) =>
let
val env = pushDatatype env x n xncs
val env = pushCNamed env x n (KType, loc) NONE
in
foldl (fn ((x', n', NONE), env) => pushENamed env x' n' (CNamed n, loc) NONE ""
| ((x', n', SOME t), env) => pushENamed env x' n' (TFun (t, (CNamed n, loc)), loc) NONE "")
env xncs
end
| DVal (x, n, t, e, s) => pushENamed env x n t (SOME e) s
| DValRec vis => foldl (fn ((x, n, t, e, s), env) => pushENamed env x n t NONE s) env vis
| DExport _ => env
end
|
