swh:1:snp:deb9fd355bffe3d96f042bd4e5113afbb0d7cbb2
Tip revision: b529da0913cdf6dfc184487d2f99b3a837407271 authored by Alley Stoughton on 29 March 2021, 13:09:27 UTC
An axiom-free formalization of well-founded relations, induction
An axiom-free formalization of well-founded relations, induction
Tip revision: b529da0
ecWhy3Conv.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 Why3
module Talpha : sig
type t = Term.vsymbol list * Term.term
val compare : t -> t -> int
end
module Mta : EcMaps.Map.S with type key = Talpha.t
module Sta : EcMaps.Set.S with type M.key = Talpha.t