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: signature ELAB_UTIL = sig
adamc@2: 
adamc@2: structure Kind : sig
adamc@6:     val mapfold : (Elab.kind', 'state, 'abort) Search.mapfolder
adamc@2:                   -> (Elab.kind, 'state, 'abort) Search.mapfolder
adamc@2:     val exists : (Elab.kind' -> bool) -> Elab.kind -> bool
adamc@2: end
adamc@2: 
adamc@6: structure Con : sig
adamc@11:     datatype binder =
adamc@11:              Rel of string * Elab.kind
adamc@11:            | Named of string * Elab.kind
adamc@11: 
adamc@11:     val mapfoldB : {kind : (Elab.kind', 'state, 'abort) Search.mapfolder,
adamc@11:                     con : ('context, Elab.con', 'state, 'abort) Search.mapfolderB,
adamc@11:                     bind : 'context * binder -> 'context}
adamc@11:                    -> ('context, Elab.con, 'state, 'abort) Search.mapfolderB
adamc@6:     val mapfold : {kind : (Elab.kind', 'state, 'abort) Search.mapfolder,
adamc@10:                    con : (Elab.con', 'state, 'abort) Search.mapfolder}
adamc@6:                   -> (Elab.con, 'state, 'abort) Search.mapfolder
adamc@11: 
adamc@11:     val mapB : {kind : Elab.kind' -> Elab.kind',
adamc@11:                 con : 'context -> Elab.con' -> Elab.con',
adamc@11:                 bind : 'context * binder -> 'context}
adamc@11:                -> 'context -> (Elab.con -> Elab.con)
adamc@34:     val map : {kind : Elab.kind' -> Elab.kind',
adamc@34:                con : Elab.con' -> Elab.con'}
adamc@34:               -> Elab.con -> Elab.con
adamc@6:     val exists : {kind : Elab.kind' -> bool,
adamc@6:                   con : Elab.con' -> bool} -> Elab.con -> bool
adamc@6: end
adamc@6: 
adamc@10: structure Exp : sig
adamc@11:     datatype binder =
adamc@11:              RelC of string * Elab.kind
adamc@11:            | NamedC of string * Elab.kind
adamc@11:            | RelE of string * Elab.con
adamc@11:            | NamedE of string * Elab.con
adamc@11: 
adamc@11:     val mapfoldB : {kind : (Elab.kind', 'state, 'abort) Search.mapfolder,
adamc@11:                     con : ('context, Elab.con', 'state, 'abort) Search.mapfolderB,
adamc@11:                     exp : ('context, Elab.exp', 'state, 'abort) Search.mapfolderB,
adamc@11:                     bind : 'context * binder -> 'context}
adamc@11:                    -> ('context, Elab.exp, 'state, 'abort) Search.mapfolderB
adamc@10:     val mapfold : {kind : (Elab.kind', 'state, 'abort) Search.mapfolder,
adamc@10:                    con : (Elab.con', 'state, 'abort) Search.mapfolder,
adamc@10:                    exp : (Elab.exp', 'state, 'abort) Search.mapfolder}
adamc@10:                   -> (Elab.exp, 'state, 'abort) Search.mapfolder
adamc@10:     val exists : {kind : Elab.kind' -> bool,
adamc@10:                   con : Elab.con' -> bool,
adamc@10:                   exp : Elab.exp' -> bool} -> Elab.exp -> bool
adamc@10: end
adamc@10: 
adamc@34: structure Sgn : sig
adamc@34:     datatype binder =
adamc@34:              RelC of string * Elab.kind
adamc@34:            | NamedC of string * Elab.kind
adamc@34:            | Str of string * Elab.sgn
adamc@34: 
adamc@34:     val mapfoldB : {kind : (Elab.kind', 'state, 'abort) Search.mapfolder,
adamc@34:                     con : ('context, Elab.con', 'state, 'abort) Search.mapfolderB,
adamc@34:                     sgn_item : ('context, Elab.sgn_item', 'state, 'abort) Search.mapfolderB,
adamc@34:                     sgn : ('context, Elab.sgn', 'state, 'abort) Search.mapfolderB,
adamc@34:                     bind : 'context * binder -> 'context}
adamc@34:                    -> ('context, Elab.sgn, 'state, 'abort) Search.mapfolderB
adamc@34: 
adamc@34: 
adamc@34:     val mapfold : {kind : (Elab.kind', 'state, 'abort) Search.mapfolder,
adamc@34:                    con : (Elab.con', 'state, 'abort) Search.mapfolder,
adamc@34:                    sgn_item : (Elab.sgn_item', 'state, 'abort) Search.mapfolder,
adamc@34:                    sgn : (Elab.sgn', 'state, 'abort) Search.mapfolder}
adamc@34:                   -> (Elab.sgn, 'state, 'abort) Search.mapfolder
adamc@34: 
adamc@34:     val map : {kind : Elab.kind' -> Elab.kind',
adamc@34:                con : Elab.con' -> Elab.con',
adamc@34:                sgn_item : Elab.sgn_item' -> Elab.sgn_item',
adamc@34:                sgn : Elab.sgn' -> Elab.sgn'}
adamc@34:               -> Elab.sgn -> Elab.sgn
adamc@34: 
adamc@2: end
adamc@34: 
adamc@34: end