adamc@2: (* Copyright (c) 2008, Adam Chlipala
adamc@2:  * All rights reserved.
adamc@2:  *
adamc@2:  * Redistribution and use in source and binary forms, with or without
adamc@2:  * modification, are permitted provided that the following conditions are met:
adamc@2:  *
adamc@2:  * - Redistributions of source code must retain the above copyright notice,
adamc@2:  *   this list of conditions and the following disclaimer.
adamc@2:  * - Redistributions in binary form must reproduce the above copyright notice,
adamc@2:  *   this list of conditions and the following disclaimer in the documentation
adamc@2:  *   and/or other materials provided with the distribution.
adamc@2:  * - The names of contributors may not be used to endorse or promote products
adamc@2:  *   derived from this software without specific prior written permission.
adamc@2:  *
adamc@2:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@2:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@2:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@2:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@2:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
adamc@2:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@2:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@2:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@2:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@2:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@2:  * POSSIBILITY OF SUCH DAMAGE.
adamc@2:  *)
adamc@2: 
adamc@2: structure ElabUtil :> ELAB_UTIL = struct
adamc@2: 
adamc@2: open Elab
adamc@2: 
adamc@2: structure S = Search
adamc@2: 
adamc@2: structure Kind = struct
adamc@2: 
adamc@2: fun mapfold (f : (Elab.kind', 'state, 'abort) S.mapfold_arg) : (Elab.kind, 'state, 'abort) S.mapfolder =
adamc@2:     let
adamc@2:         fun mfk k acc =
adamc@2:             S.bindP (mfk' k acc, f)
adamc@2: 
adamc@2:         and mfk' (kAll as (k, loc)) =
adamc@2:             case k of
adamc@2:                 KType => S.return2 kAll
adamc@2: 
adamc@2:               | KArrow (k1, k2) =>
adamc@2:                 S.bind2 (mfk k1,
adamc@2:                       fn k1' =>
adamc@2:                          S.map2 (mfk k2,
adamc@2:                               fn k2' =>
adamc@2:                                  (KArrow (k1', k2'), loc)))
adamc@2: 
adamc@2:               | KName => S.return2 kAll
adamc@2: 
adamc@2:               | KRecord k =>
adamc@2:                 S.map2 (mfk k,
adamc@2:                         fn k' =>
adamc@2:                            (KRecord k', loc))
adamc@2: 
adamc@2:               | KError => S.return2 kAll
adamc@2: 
adamc@2:               | KUnif (_, ref (SOME k)) => mfk' k
adamc@2:               | KUnif _ => S.return2 kAll
adamc@2:     in
adamc@2:         mfk
adamc@2:     end
adamc@2: 
adamc@2: fun exists f k =
adamc@2:     case mapfold (fn (k, ()) =>
adamc@2:                      if f k then
adamc@2:                          S.Return ()
adamc@2:                      else
adamc@2:                          S.Continue (k, ())) k () of
adamc@2:         S.Return _ => true
adamc@2:       | S.Continue _ => false
adamc@2: 
adamc@2: end
adamc@2: 
adamc@2: end