|
adamc@2
|
1 (* Copyright (c) 2008, Adam Chlipala
|
|
adamc@2
|
2 * All rights reserved.
|
|
adamc@2
|
3 *
|
|
adamc@2
|
4 * Redistribution and use in source and binary forms, with or without
|
|
adamc@2
|
5 * modification, are permitted provided that the following conditions are met:
|
|
adamc@2
|
6 *
|
|
adamc@2
|
7 * - Redistributions of source code must retain the above copyright notice,
|
|
adamc@2
|
8 * this list of conditions and the following disclaimer.
|
|
adamc@2
|
9 * - Redistributions in binary form must reproduce the above copyright notice,
|
|
adamc@2
|
10 * this list of conditions and the following disclaimer in the documentation
|
|
adamc@2
|
11 * and/or other materials provided with the distribution.
|
|
adamc@2
|
12 * - The names of contributors may not be used to endorse or promote products
|
|
adamc@2
|
13 * derived from this software without specific prior written permission.
|
|
adamc@2
|
14 *
|
|
adamc@2
|
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
adamc@2
|
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
adamc@2
|
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
adamc@2
|
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
adamc@2
|
19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
adamc@2
|
20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
adamc@2
|
21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
adamc@2
|
22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
adamc@2
|
23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
adamc@2
|
24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
adamc@2
|
25 * POSSIBILITY OF SUCH DAMAGE.
|
|
adamc@2
|
26 *)
|
|
adamc@2
|
27
|
|
adamc@2
|
28 structure ElabUtil :> ELAB_UTIL = struct
|
|
adamc@2
|
29
|
|
adamc@2
|
30 open Elab
|
|
adamc@2
|
31
|
|
adamc@2
|
32 structure S = Search
|
|
adamc@2
|
33
|
|
adamc@2
|
34 structure Kind = struct
|
|
adamc@2
|
35
|
|
adamc@2
|
36 fun mapfold (f : (Elab.kind', 'state, 'abort) S.mapfold_arg) : (Elab.kind, 'state, 'abort) S.mapfolder =
|
|
adamc@2
|
37 let
|
|
adamc@2
|
38 fun mfk k acc =
|
|
adamc@2
|
39 S.bindP (mfk' k acc, f)
|
|
adamc@2
|
40
|
|
adamc@2
|
41 and mfk' (kAll as (k, loc)) =
|
|
adamc@2
|
42 case k of
|
|
adamc@2
|
43 KType => S.return2 kAll
|
|
adamc@2
|
44
|
|
adamc@2
|
45 | KArrow (k1, k2) =>
|
|
adamc@2
|
46 S.bind2 (mfk k1,
|
|
adamc@2
|
47 fn k1' =>
|
|
adamc@2
|
48 S.map2 (mfk k2,
|
|
adamc@2
|
49 fn k2' =>
|
|
adamc@2
|
50 (KArrow (k1', k2'), loc)))
|
|
adamc@2
|
51
|
|
adamc@2
|
52 | KName => S.return2 kAll
|
|
adamc@2
|
53
|
|
adamc@2
|
54 | KRecord k =>
|
|
adamc@2
|
55 S.map2 (mfk k,
|
|
adamc@2
|
56 fn k' =>
|
|
adamc@2
|
57 (KRecord k', loc))
|
|
adamc@2
|
58
|
|
adamc@2
|
59 | KError => S.return2 kAll
|
|
adamc@2
|
60
|
|
adamc@2
|
61 | KUnif (_, ref (SOME k)) => mfk' k
|
|
adamc@2
|
62 | KUnif _ => S.return2 kAll
|
|
adamc@2
|
63 in
|
|
adamc@2
|
64 mfk
|
|
adamc@2
|
65 end
|
|
adamc@2
|
66
|
|
adamc@2
|
67 fun exists f k =
|
|
adamc@2
|
68 case mapfold (fn (k, ()) =>
|
|
adamc@2
|
69 if f k then
|
|
adamc@2
|
70 S.Return ()
|
|
adamc@2
|
71 else
|
|
adamc@2
|
72 S.Continue (k, ())) k () of
|
|
adamc@2
|
73 S.Return _ => true
|
|
adamc@2
|
74 | S.Continue _ => false
|
|
adamc@2
|
75
|
|
adamc@2
|
76 end
|
|
adamc@2
|
77
|
|
adamc@2
|
78 end
|
