Revision a52f3279764e0095d59a4d8c7063342b2fa83178 authored by Pierre-Yves Strub on 13 July 2018, 18:34:30 UTC, committed by Pierre-Yves Strub on 13 July 2018, 18:35:17 UTC
This tactic tries to prove goal of the form "islossless M.f". It uses random/lossless solve DB for pruning goals related to the losslessness of samplings or call to abstract procs.
1 parent de5cd4a
ecUid.mli
(* --------------------------------------------------------------------
* Copyright (c) - 2012--2016 - IMDEA Software Institute
* Copyright (c) - 2012--2018 - Inria
* Copyright (c) - 2012--2018 - Ecole Polytechnique
*
* Distributed under the terms of the CeCILL-C-V1 license
* -------------------------------------------------------------------- *)
(* -------------------------------------------------------------------- *)
open EcMaps
open EcSymbols
(* -------------------------------------------------------------------- *)
val unique : unit -> int
(* -------------------------------------------------------------------- *)
type uid = int
type uidmap
val create : unit -> uidmap
val lookup : uidmap -> symbol -> uid option
val forsym : uidmap -> symbol -> uid
(* -------------------------------------------------------------------- *)
val uid_equal : uid -> uid -> bool
val uid_compare : uid -> uid -> int
module Muid : Map.S with type key = uid
module Suid : Set.S with module M = Map.MakeBase(Muid)
(* -------------------------------------------------------------------- *)
module NameGen : sig
type t
val ofint : int -> string
val bulk : ?fmt:(string -> string) -> int -> string list
val create : unit -> t
val get : t -> uid -> string
end
Computing file changes ...
