Mercurial > urweb

annotate src/mono_util.sig @ 188:8e9f97508f0d

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Datatype representation optimization
author Adam Chlipala <adamc@hcoop.net>
date Sun, 03 Aug 2008 19:49:21 -0400
parents 25b169416ea8
children ab86aa858e6c
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 MONO_UTIL = sig
adamc@26 29
adamc@188 30 val classifyDatatype : (string * int * Mono.typ option) list -> Mono.datatype_kind
adamc@188 31
adamc@26 32 structure Typ : sig
adamc@109 33 val compare : Mono.typ * Mono.typ -> order
adamc@109 34 val sortFields : (string * Mono.typ) list -> (string * Mono.typ) list
adamc@109 35
adamc@26 36 val mapfold : (Mono.typ', 'state, 'abort) Search.mapfolder
adamc@26 37 -> (Mono.typ, 'state, 'abort) Search.mapfolder
adamc@26 38
adamc@26 39 val map : (Mono.typ' -> Mono.typ')
adamc@26 40 -> Mono.typ -> Mono.typ
adamc@26 41
adamc@26 42 val fold : (Mono.typ' * 'state -> 'state)
adamc@26 43 -> 'state -> Mono.typ -> 'state
adamc@26 44
adamc@26 45 val exists : (Mono.typ' -> bool) -> Mono.typ -> bool
adamc@26 46 end
adamc@26 47
adamc@26 48 structure Exp : sig
adamc@26 49 datatype binder =
adamc@168 50 Datatype of string * int * (string * int * Mono.typ option) list
adamc@26 51 | RelE of string * Mono.typ
adamc@109 52 | NamedE of string * int * Mono.typ * Mono.exp option * string
adamc@26 53
adamc@26 54 val mapfoldB : {typ : (Mono.typ', 'state, 'abort) Search.mapfolder,
adamc@26 55 exp : ('typtext, Mono.exp', 'state, 'abort) Search.mapfolderB,
adamc@26 56 bind : 'typtext * binder -> 'typtext}
adamc@26 57 -> ('typtext, Mono.exp, 'state, 'abort) Search.mapfolderB
adamc@26 58 val mapfold : {typ : (Mono.typ', 'state, 'abort) Search.mapfolder,
adamc@26 59 exp : (Mono.exp', 'state, 'abort) Search.mapfolder}
adamc@26 60 -> (Mono.exp, 'state, 'abort) Search.mapfolder
adamc@26 61
adamc@26 62 val map : {typ : Mono.typ' -> Mono.typ',
adamc@26 63 exp : Mono.exp' -> Mono.exp'}
adamc@26 64 -> Mono.exp -> Mono.exp
adamc@26 65 val mapB : {typ : Mono.typ' -> Mono.typ',
adamc@26 66 exp : 'typtext -> Mono.exp' -> Mono.exp',
adamc@26 67 bind : 'typtext * binder -> 'typtext}
adamc@26 68 -> 'typtext -> (Mono.exp -> Mono.exp)
adamc@26 69
adamc@26 70 val fold : {typ : Mono.typ' * 'state -> 'state,
adamc@26 71 exp : Mono.exp' * 'state -> 'state}
adamc@26 72 -> 'state -> Mono.exp -> 'state
adamc@26 73
adamc@26 74 val exists : {typ : Mono.typ' -> bool,
adamc@26 75 exp : Mono.exp' -> bool} -> Mono.exp -> bool
adamc@26 76 end
adamc@26 77
adamc@26 78 structure Decl : sig
adamc@26 79 datatype binder = datatype Exp.binder
adamc@26 80
adamc@26 81 val mapfoldB : {typ : (Mono.typ', 'state, 'abort) Search.mapfolder,
adamc@26 82 exp : ('typtext, Mono.exp', 'state, 'abort) Search.mapfolderB,
adamc@26 83 decl : ('typtext, Mono.decl', 'state, 'abort) Search.mapfolderB,
adamc@26 84 bind : 'typtext * binder -> 'typtext}
adamc@26 85 -> ('typtext, Mono.decl, 'state, 'abort) Search.mapfolderB
adamc@26 86 val mapfold : {typ : (Mono.typ', 'state, 'abort) Search.mapfolder,
adamc@26 87 exp : (Mono.exp', 'state, 'abort) Search.mapfolder,
adamc@26 88 decl : (Mono.decl', 'state, 'abort) Search.mapfolder}
adamc@26 89 -> (Mono.decl, 'state, 'abort) Search.mapfolder
adamc@26 90
adamc@26 91 val fold : {typ : Mono.typ' * 'state -> 'state,
adamc@26 92 exp : Mono.exp' * 'state -> 'state,
adamc@26 93 decl : Mono.decl' * 'state -> 'state}
adamc@26 94 -> 'state -> Mono.decl -> 'state
adamc@26 95 end
adamc@26 96
adamc@26 97 structure File : sig
adamc@26 98 datatype binder = datatype Exp.binder
adamc@26 99
adamc@26 100 val mapfoldB : {typ : (Mono.typ', 'state, 'abort) Search.mapfolder,
adamc@26 101 exp : ('typtext, Mono.exp', 'state, 'abort) Search.mapfolderB,
adamc@26 102 decl : ('typtext, Mono.decl', 'state, 'abort) Search.mapfolderB,
adamc@26 103 bind : 'typtext * binder -> 'typtext}
adamc@26 104 -> ('typtext, Mono.file, 'state, 'abort) Search.mapfolderB
adamc@26 105
adamc@26 106 val mapfold : {typ : (Mono.typ', 'state, 'abort) Search.mapfolder,
adamc@26 107 exp : (Mono.exp', 'state, 'abort) Search.mapfolder,
adamc@26 108 decl : (Mono.decl', 'state, 'abort) Search.mapfolder}
adamc@26 109 -> (Mono.file, 'state, 'abort) Search.mapfolder
adamc@26 110
adamc@26 111 val mapB : {typ : Mono.typ' -> Mono.typ',
adamc@26 112 exp : 'typtext -> Mono.exp' -> Mono.exp',
adamc@26 113 decl : 'typtext -> Mono.decl' -> Mono.decl',
adamc@26 114 bind : 'typtext * binder -> 'typtext}
adamc@26 115 -> 'typtext -> Mono.file -> Mono.file
adamc@26 116
adamc@96 117 val map : {typ : Mono.typ' -> Mono.typ',
adamc@96 118 exp : Mono.exp' -> Mono.exp',
adamc@96 119 decl : Mono.decl' -> Mono.decl'}
adamc@96 120 -> Mono.file -> Mono.file
adamc@96 121
adamc@26 122 val fold : {typ : Mono.typ' * 'state -> 'state,
adamc@26 123 exp : Mono.exp' * 'state -> 'state,
adamc@26 124 decl : Mono.decl' * 'state -> 'state}
adamc@26 125 -> 'state -> Mono.file -> 'state
adamc@26 126 end
adamc@26 127
adamc@26 128 end