https://github.com/EasyCrypt/easycrypt
Tip revision: 17d639410a78b8b6dd6e66a4f11bd93d2809a6d9 authored by Alley Stoughton on 29 March 2021, 13:09:27 UTC
An axiom-free formalization of well-founded relations, induction and recursion.
An axiom-free formalization of well-founded relations, induction and recursion.
Tip revision: 17d6394
ecCoreHiPhl.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 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
