Mercurial > urweb

annotate src/flat_util.sig @ 86:7f9bcc8bfa1e

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
More with disjointness assumptions
author Adam Chlipala <adamc@hcoop.net>
date Tue, 01 Jul 2008 13:19:14 -0400
parents 104d43266b33
children
rev   line source
adamc@26 1 (* Copyright (c) 2008, Adam Chlipala
adamc@26 2 * All rights reserved.
adamc@26 3 *
adamc@26 4 * Redistribution and use in source and binary forms, with or without
adamc@26 5 * modification, are permitted provided that the following conditions are met:
adamc@26 6 *
adamc@26 7 * - Redistributions of source code must retain the above copyright notice,
adamc@26 8 * this list of conditions and the following disclaimer.
adamc@26 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@26 10 * this list of conditions and the following disclaimer in the documentation
adamc@26 11 * and/or other materials provided with the distribution.
adamc@26 12 * - The names of contributors may not be used to endorse or promote products
adamc@26 13 * derived from this software without specific prior written permission.
adamc@26 14 *
adamc@26 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@26 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@26 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@26 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@26 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@26 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@26 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@26 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@26 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@26 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@26 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@26 26 *)
adamc@26 27
adamc@26 28 signature FLAT_UTIL = sig
adamc@26 29
adamc@26 30 structure Typ : sig
adamc@28 31 val compare : Flat.typ * Flat.typ -> order
adamc@28 32 val sortFields : (string * Flat.typ) list -> (string * Flat.typ) list
adamc@28 33
adamc@26 34 val mapfold : (Flat.typ', 'state, 'abort) Search.mapfolder
adamc@26 35 -> (Flat.typ, 'state, 'abort) Search.mapfolder
adamc@26 36
adamc@26 37 val map : (Flat.typ' -> Flat.typ')
adamc@26 38 -> Flat.typ -> Flat.typ
adamc@26 39
adamc@26 40 val fold : (Flat.typ' * 'state -> 'state)
adamc@26 41 -> 'state -> Flat.typ -> 'state
adamc@26 42
adamc@26 43 val exists : (Flat.typ' -> bool) -> Flat.typ -> bool
adamc@26 44 end
adamc@26 45
adamc@26 46 structure Exp : sig
adamc@26 47 datatype binder =
adamc@26 48 NamedT of string * int * Flat.typ option
adamc@26 49 | RelE of string * Flat.typ
adamc@26 50 | NamedE of string * int * Flat.typ * Flat.exp option
adamc@26 51
adamc@26 52 val mapfoldB : {typ : (Flat.typ', 'state, 'abort) Search.mapfolder,
adamc@26 53 exp : ('typtext, Flat.exp', 'state, 'abort) Search.mapfolderB,
adamc@26 54 bind : 'typtext * binder -> 'typtext}
adamc@26 55 -> ('typtext, Flat.exp, 'state, 'abort) Search.mapfolderB
adamc@26 56 val mapfold : {typ : (Flat.typ', 'state, 'abort) Search.mapfolder,
adamc@26 57 exp : (Flat.exp', 'state, 'abort) Search.mapfolder}
adamc@26 58 -> (Flat.exp, 'state, 'abort) Search.mapfolder
adamc@26 59
adamc@26 60 val map : {typ : Flat.typ' -> Flat.typ',
adamc@26 61 exp : Flat.exp' -> Flat.exp'}
adamc@26 62 -> Flat.exp -> Flat.exp
adamc@26 63 val mapB : {typ : Flat.typ' -> Flat.typ',
adamc@26 64 exp : 'typtext -> Flat.exp' -> Flat.exp',
adamc@26 65 bind : 'typtext * binder -> 'typtext}
adamc@26 66 -> 'typtext -> (Flat.exp -> Flat.exp)
adamc@26 67
adamc@26 68 val fold : {typ : Flat.typ' * 'state -> 'state,
adamc@26 69 exp : Flat.exp' * 'state -> 'state}
adamc@26 70 -> 'state -> Flat.exp -> 'state
adamc@26 71
adamc@26 72 val exists : {typ : Flat.typ' -> bool,
adamc@26 73 exp : Flat.exp' -> bool} -> Flat.exp -> bool
adamc@26 74 end
adamc@26 75
adamc@26 76 structure Decl : sig
adamc@26 77 datatype binder = datatype Exp.binder
adamc@26 78
adamc@26 79 val mapfoldB : {typ : (Flat.typ', 'state, 'abort) Search.mapfolder,
adamc@26 80 exp : ('typtext, Flat.exp', 'state, 'abort) Search.mapfolderB,
adamc@26 81 decl : ('typtext, Flat.decl', 'state, 'abort) Search.mapfolderB,
adamc@26 82 bind : 'typtext * binder -> 'typtext}
adamc@26 83 -> ('typtext, Flat.decl, 'state, 'abort) Search.mapfolderB
adamc@26 84 val mapfold : {typ : (Flat.typ', 'state, 'abort) Search.mapfolder,
adamc@26 85 exp : (Flat.exp', 'state, 'abort) Search.mapfolder,
adamc@26 86 decl : (Flat.decl', 'state, 'abort) Search.mapfolder}
adamc@26 87 -> (Flat.decl, 'state, 'abort) Search.mapfolder
adamc@26 88
adamc@26 89 val fold : {typ : Flat.typ' * 'state -> 'state,
adamc@26 90 exp : Flat.exp' * 'state -> 'state,
adamc@26 91 decl : Flat.decl' * 'state -> 'state}
adamc@26 92 -> 'state -> Flat.decl -> 'state
adamc@26 93 end
adamc@26 94
adamc@26 95 structure File : sig
adamc@26 96 datatype binder =
adamc@26 97 NamedT of string * int * Flat.typ option
adamc@26 98 | RelE of string * Flat.typ
adamc@26 99 | NamedE of string * int * Flat.typ * Flat.exp option
adamc@26 100 | F of int * string * Flat.typ * Flat.typ * Flat.exp
adamc@26 101
adamc@26 102 val mapfoldB : {typ : (Flat.typ', 'state, 'abort) Search.mapfolder,
adamc@26 103 exp : ('typtext, Flat.exp', 'state, 'abort) Search.mapfolderB,
adamc@26 104 decl : ('typtext, Flat.decl', 'state, 'abort) Search.mapfolderB,
adamc@26 105 bind : 'typtext * binder -> 'typtext}
adamc@26 106 -> ('typtext, Flat.file, 'state, 'abort) Search.mapfolderB
adamc@26 107
adamc@26 108 val mapfold : {typ : (Flat.typ', 'state, 'abort) Search.mapfolder,
adamc@26 109 exp : (Flat.exp', 'state, 'abort) Search.mapfolder,
adamc@26 110 decl : (Flat.decl', 'state, 'abort) Search.mapfolder}
adamc@26 111 -> (Flat.file, 'state, 'abort) Search.mapfolder
adamc@26 112
adamc@26 113 val mapB : {typ : Flat.typ' -> Flat.typ',
adamc@26 114 exp : 'typtext -> Flat.exp' -> Flat.exp',
adamc@26 115 decl : 'typtext -> Flat.decl' -> Flat.decl',
adamc@26 116 bind : 'typtext * binder -> 'typtext}
adamc@26 117 -> 'typtext -> Flat.file -> Flat.file
adamc@26 118
adamc@26 119 val fold : {typ : Flat.typ' * 'state -> 'state,
adamc@26 120 exp : Flat.exp' * 'state -> 'state,
adamc@26 121 decl : Flat.decl' * 'state -> 'state}
adamc@26 122 -> 'state -> Flat.file -> 'state
adamc@26 123 end
adamc@26 124
adamc@26 125 end