https://github.com/EasyCrypt/easycrypt
Tip revision: 9e2f905f6ff3f028c5eaeccb8a5370ec4ab3abe2 authored by Pierre-Yves Strub on 23 January 2022, 15:46:16 UTC
Theory for R[X]/<X^n+1>
Theory for R[X]/<X^n+1>
Tip revision: 9e2f905
ecPhlTrans.mli
(* --------------------------------------------------------------------
* Copyright (c) - 2012--2016 - IMDEA Software Institute
* Copyright (c) - 2012--2021 - Inria
* Copyright (c) - 2012--2021 - Ecole Polytechnique
*
* Distributed under the terms of the CeCILL-C-V1 license
* -------------------------------------------------------------------- *)
(* -------------------------------------------------------------------- *)
open EcParsetree
open EcCoreGoal.FApi
(* -------------------------------------------------------------------- *)
(* Transitivity rule for equiv
*
*
* 1. forall m1 m2 m3, Q1 m1 m2 => Q2 m2 m3 => Q m1 m3
* 2. c1 ~ c2 : P1 ==> Q1
* 3. c2 ~ c3 : P2 ==> Q2
* --------------------------------------------------------
* c1 ~ c3 : P ==> Q
* The most basic rule is normally:
* Q = exists m2, Q1 m1 m2 /\ Q2 m2 m3
*
* The actual rule is in this core rule + conseq.
*)
(* -------------------------------------------------------------------- *)
val process_equiv_trans :
trans_kind * trans_formula -> backward