swh:1:snp:9f9174fb54ac68d4510837c2f930cf0558bce5b6
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
ecCoreHiPhl.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 EcParsetree
open EcTypes
open EcModules
open EcFol
open EcLogic
(* -------------------------------------------------------------------- *)
val process_phl_form : ty -> goal -> pformula -> form
val process_phl_formula : goal -> pformula -> form
val process_phl_exp : bool option -> pexpr -> ty option -> goal -> expr
val process_prhl_form : ty -> goal -> pformula -> form
val process_prhl_formula : goal -> pformula -> form
val process_prhl_post : goal -> pformula -> form
val process_prhl_stmt : bool -> goal -> pstmt -> stmt