OpaqueproofSourceThis module implements the handling of opaque proof terms. Opaque proof terms are special since:
opaque proof terms holds an index into an opaque table.type 'a delayed_universes = | PrivateMonomorphic of 'a| PrivatePolymorphic of int * Univ.ContextSet.tNumber of surrounding bound universes + local constraints
*)Create a fresh handle in the table.
Opaque terms are indexed by their library dirpath and an integer index. The two functions above activate this indirect storage, by telling how to retrieve terms.
val repr :
'c opaque ->
Mod_subst.substitution list * 'c list * Names.DirPath.t * opaque_handle