swh:1:snp:6d793aeab171a5710c1817dc2536aa4c79222a27
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
ecTerminal.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
* -------------------------------------------------------------------- *)
(* -------------------------------------------------------------------- *)
type terminal
type status = [
| `ST_Ok
| `ST_Failure of exn
]
type loglevel = EcGState.loglevel
(* -------------------------------------------------------------------- *)
val interactive : terminal -> bool
val next : terminal -> EcParsetree.prog
val notice : immediate:bool -> loglevel -> string -> terminal -> unit
val finish : status -> terminal -> unit
val finalize : terminal -> unit
val setwidth : terminal -> int -> unit
(* -------------------------------------------------------------------- *)
val from_channel : ?gcstats:bool -> name:string -> in_channel -> terminal
val from_tty : unit -> terminal
val from_emacs : unit -> terminal