annotate src/mono_env.sig @ 2300:57f6473b1469

More work on heuristics.
author Ziv Scully <ziv@mit.edu>
date Thu, 19 Nov 2015 18:13:01 -0500
parents 28a541bd2d23
children
rev   line source
adamc@25 1 (* Copyright (c) 2008, Adam Chlipala
adamc@25 2 * All rights reserved.
adamc@25 3 *
adamc@25 4 * Redistribution and use in source and binary forms, with or without
adamc@25 5 * modification, are permitted provided that the following conditions are met:
adamc@25 6 *
adamc@25 7 * - Redistributions of source code must retain the above copyright notice,
adamc@25 8 * this list of conditions and the following disclaimer.
adamc@25 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@25 10 * this list of conditions and the following disclaimer in the documentation
adamc@25 11 * and/or other materials provided with the distribution.
adamc@25 12 * - The names of contributors may not be used to endorse or promote products
adamc@25 13 * derived from this software without specific prior written permission.
adamc@25 14 *
adamc@25 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@25 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@25 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@25 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
ziv@2256 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@25 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@25 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@25 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@25 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@25 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@25 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@25 26 *)
adamc@25 27
adamc@25 28 signature MONO_ENV = sig
adamc@25 29
adamc@25 30 type env
adamc@25 31
adamc@25 32 val empty : env
adamc@25 33
adamc@25 34 exception UnboundRel of int
adamc@25 35 exception UnboundNamed of int
adamc@25 36
adamc@168 37 val pushDatatype : env -> string -> int -> (string * int * Mono.typ option) list -> env
adamc@168 38 val lookupDatatype : env -> int -> string * (string * int * Mono.typ option) list
adamc@25 39
adamc@178 40 val lookupConstructor : env -> int -> string * Mono.typ option * int
adamc@178 41
adamc@183 42 val pushERel : env -> string -> Mono.typ -> Mono.exp option -> env
adamc@183 43 val lookupERel : env -> int -> string * Mono.typ * Mono.exp option
adamc@25 44
adamc@109 45 val pushENamed : env -> string -> int -> Mono.typ -> Mono.exp option -> string -> env
adamc@109 46 val lookupENamed : env -> int -> string * Mono.typ * Mono.exp option * string
adamc@25 47
adamc@25 48 val declBinds : env -> Mono.decl -> env
adamc@179 49 val patBinds : env -> Mono.pat -> env
adamc@567 50 val patBindsN : Mono.pat -> int
adamc@993 51
adamc@993 52 val liftExpInExp : int -> Mono.exp -> Mono.exp
adam@1394 53 val subExpInExp : (int * Mono.exp) -> Mono.exp -> Mono.exp
adam@1394 54
adamc@25 55 end