Mercurial > urweb

comparison src/elab_util.sml @ 2:64f09f7822c3

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