Quelques structures de donnée plus les modules principaux (et

parfaitement en cours) de la nouvelle machinerie de preuves.



git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@10251 85f007b7-540e-0410-9357-904b9bb8a0f7

1 files changed, 34 insertions, 0 deletions

diff --git a/proofs/proof.mli b/proofs/proof.mli
new file mode 100644
index 0000000000..4e30d8dafa
--- /dev/null
+++ b/proofs/proof.mli
@@ -0,0 +1,34 @@
+(************************************************************************)
+(*  v      *   The Coq Proof Assistant  /  The Coq Development Team     *)
+(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
+(*   \VV/  **************************************************************)
+(*    //   *      This file is distributed under the terms of the       *)
+(*         *       GNU Lesser General Public License Version 2.1        *)
+(************************************************************************)
+
+(* $Id: proof.mli aspiwack $ *)
+
+(* This module implements the actual proof datatype. It enforces strong
+   invariants, and it is the only module that should access the module
+   Subproof.
+   Actually from outside the proofs/ subdirectory, this is the only module
+   that should be used directly. *)
+
+open Term
+
+(* Type of a proof *)
+type 'a proof
+
+(* Type of the proof transformations *)
+type 'a transformation
+
+(* exception which represent a failure in a command.
+   Opposed to anomalies and uncaught exceptions. *)
+exception Failure of Pp.std_ppcmds
+
+(* function to raise a failure less verbosely *)
+val fail : Pp.std_ppcmds -> 'a
+
+val do_command : 'a transformation -> 'a proof -> unit
+
+