Exposing the minimal amount of internal of the Logic monad in order to

allow reusability of the implementation throughout the Coq codebase.

We effectively feature a generalized version of the logical monad where the
input state, the output state and the inner exception can be arbitrarily chosen.
This will allow for more efficient implementations of close variants of the
monad.

1 files changed, 1 insertions, 1 deletions

diff --git a/proofs/proofview.ml b/proofs/proofview.ml
index 6e653806b..64ea5aea0 100644
--- a/proofs/proofview.ml
+++ b/proofs/proofview.ml
@@ -887,7 +887,7 @@ module Unsafe = struct
 
 end
 
-
+module UnsafeRepr = Proof.Unsafe
 
 (** {7 Notations} *)