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
ecSearch.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
open EcFol
open EcTyping
(* -------------------------------------------------------------------- *)
type pattern = (ptnmap * EcUnify.unienv) * form
type search = [
| `ByPath of Sp.t
| `ByPattern of pattern
]
val search : EcEnv.env -> search list -> (path * EcDecl.axiom) list
val sort : Sp.t -> (path * EcDecl.axiom) list -> (path * EcDecl.axiom) list
Computing file changes ...
