swh:1:snp:643a6f0153c0a6d697c7dfd0bdbfdda747446c2d
Tip revision: 7c35bc466c977edb46bcc1a4fc4e069c212f2a20 authored by Alley Stoughton on 28 April 2021, 13:36:14 UTC
Simplified recursion theorem to not use predecs, but just well-founded
Simplified recursion theorem to not use predecs, but just well-founded
Tip revision: 7c35bc4
ecTypeClass.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 EcPath
type node = path
type graph
type nodes
exception CycleDetected
module Graph : sig
val empty : graph
val add : src:node -> dst:node -> graph -> graph
val has_path : src:node -> dst:node -> graph -> bool
val dump : graph -> string
end
module Nodes : sig
val empty : graph -> nodes
val add : node -> nodes -> nodes
val toset : nodes -> Sp.t
val reduce : Sp.t -> graph -> Sp.t
end