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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
|
(* 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 ElabUtil :> ELAB_UTIL = struct
open Elab
structure S = Search
structure Kind = struct
fun mapfold f =
let
fun mfk k acc =
S.bindP (mfk' k acc, f)
and mfk' (kAll as (k, loc)) =
case k of
KType => S.return2 kAll
| KArrow (k1, k2) =>
S.bind2 (mfk k1,
fn k1' =>
S.map2 (mfk k2,
fn k2' =>
(KArrow (k1', k2'), loc)))
| KName => S.return2 kAll
| KRecord k =>
S.map2 (mfk k,
fn k' =>
(KRecord k', loc))
| KError => S.return2 kAll
| KUnif (_, ref (SOME k)) => mfk' k
| KUnif _ => S.return2 kAll
in
mfk
end
fun exists f k =
case mapfold (fn k => fn () =>
if f k then
S.Return ()
else
S.Continue (k, ())) k () of
S.Return _ => true
| S.Continue _ => false
end
structure Con = struct
datatype binder =
Rel of string * Elab.kind
| Named of string * Elab.kind
fun mapfoldB {kind = fk, con = fc, bind} =
let
val mfk = Kind.mapfold fk
fun mfc ctx c acc =
S.bindP (mfc' ctx c acc, fc ctx)
and mfc' ctx (cAll as (c, loc)) =
case c of
TFun (c1, c2) =>
S.bind2 (mfc ctx c1,
fn c1' =>
S.map2 (mfc ctx c2,
fn c2' =>
(TFun (c1', c2'), loc)))
| TCFun (e, x, k, c) =>
S.bind2 (mfk k,
fn k' =>
S.map2 (mfc (bind (ctx, Rel (x, k))) c,
fn c' =>
(TCFun (e, x, k', c'), loc)))
| TRecord c =>
S.map2 (mfc ctx c,
fn c' =>
(TRecord c', loc))
| CRel _ => S.return2 cAll
| CNamed _ => S.return2 cAll
| CApp (c1, c2) =>
S.bind2 (mfc ctx c1,
fn c1' =>
S.map2 (mfc ctx c2,
fn c2' =>
(CApp (c1', c2'), loc)))
| CAbs (x, k, c) =>
S.bind2 (mfk k,
fn k' =>
S.map2 (mfc (bind (ctx, Rel (x, k))) c,
fn c' =>
(CAbs (x, k', c'), loc)))
| CName _ => S.return2 cAll
| CRecord (k, xcs) =>
S.bind2 (mfk k,
fn k' =>
S.map2 (ListUtil.mapfold (fn (x, c) =>
S.bind2 (mfc ctx x,
fn x' =>
S.map2 (mfc ctx c,
fn c' =>
(x', c'))))
xcs,
fn xcs' =>
(CRecord (k', xcs'), loc)))
| CConcat (c1, c2) =>
S.bind2 (mfc ctx c1,
fn c1' =>
S.map2 (mfc ctx c2,
fn c2' =>
(CConcat (c1', c2'), loc)))
| CError => S.return2 cAll
| CUnif (_, _, ref (SOME c)) => mfc' ctx c
| CUnif _ => S.return2 cAll
in
mfc
end
fun mapfold {kind = fk, con = fc} =
mapfoldB {kind = fk,
con = fn () => fc,
bind = fn ((), _) => ()} ()
fun mapB {kind, con, bind} ctx c =
case mapfoldB {kind = fn k => fn () => S.Continue (kind k, ()),
con = fn ctx => fn c => fn () => S.Continue (con ctx c, ()),
bind = bind} ctx c () of
S.Continue (c, ()) => c
| S.Return _ => raise Fail "Con.mapB: Impossible"
fun exists {kind, con} k =
case mapfold {kind = fn k => fn () =>
if kind k then
S.Return ()
else
S.Continue (k, ()),
con = fn c => fn () =>
if con c then
S.Return ()
else
S.Continue (c, ())} k () of
S.Return _ => true
| S.Continue _ => false
end
structure Exp = struct
datatype binder =
RelC of string * Elab.kind
| NamedC of string * Elab.kind
| RelE of string * Elab.con
| NamedE of string * Elab.con
fun mapfoldB {kind = fk, con = fc, exp = fe, bind} =
let
val mfk = Kind.mapfold fk
fun bind' (ctx, b) =
let
val b' = case b of
Con.Rel x => RelC x
| Con.Named x => NamedC x
in
bind (ctx, b')
end
val mfc = Con.mapfoldB {kind = fk, con = fc, bind = bind'}
fun mfe ctx e acc =
S.bindP (mfe' ctx e acc, fe ctx)
and mfe' ctx (eAll as (e, loc)) =
case e of
ERel _ => S.return2 eAll
| ENamed _ => S.return2 eAll
| EApp (e1, e2) =>
S.bind2 (mfe ctx e1,
fn e1' =>
S.map2 (mfe ctx e2,
fn e2' =>
(EApp (e1', e2'), loc)))
| EAbs (x, t, e) =>
S.bind2 (mfc ctx t,
fn t' =>
S.map2 (mfe (bind (ctx, RelE (x, t))) e,
fn e' =>
(EAbs (x, t', e'), loc)))
| ECApp (e, c) =>
S.bind2 (mfe ctx e,
fn e' =>
S.map2 (mfc ctx c,
fn c' =>
(ECApp (e', c'), loc)))
| ECAbs (expl, x, k, e) =>
S.bind2 (mfk k,
fn k' =>
S.map2 (mfe (bind (ctx, RelC (x, k))) e,
fn e' =>
(ECAbs (expl, x, k', e'), loc)))
| EError => S.return2 eAll
in
mfe
end
fun mapfold {kind = fk, con = fc, exp = fe} =
mapfoldB {kind = fk,
con = fn () => fc,
exp = fn () => fe,
bind = fn ((), _) => ()} ()
fun exists {kind, con, exp} k =
case mapfold {kind = fn k => fn () =>
if kind k then
S.Return ()
else
S.Continue (k, ()),
con = fn c => fn () =>
if con c then
S.Return ()
else
S.Continue (c, ()),
exp = fn e => fn () =>
if exp e then
S.Return ()
else
S.Continue (e, ())} k () of
S.Return _ => true
| S.Continue _ => false
end
structure E = ElabEnv
fun declBinds env (d, _) =
case d of
DCon (x, n, k, c) => E.pushCNamedAs env x n k (SOME c)
| DVal (x, n, t, _) => E.pushENamedAs env x n t
end
|
