Constructors and projections for exact proof views #
These definitions attach exact, total, or finite semantic evidence to an executable model and move between the three proof-indexed views without changing its runtime bits.
The views let later theorems ask for precisely the exceptional-value hypothesis they need instead of carrying a record of unrelated facts. Constructors and projections pass through the underlying model value; their semantic proofs are erased.
Attach the exact total interpretation computed from an executable value.
Instances For
Attach a known exact finite dyadic interpretation.
Instances For
The bundled executable value has its indexed exact interpretation.
Forget exact encoding distinctions while retaining the same executable value.
Instances For
A finite exact refinement induces the corresponding real-valued refinement.
Instances For
Attach the exact value and status computed by an executable IEEE outcome.
Instances For
The bundled outcome's value has its indexed exact interpretation.
The bundled outcome has its indexed IEEE exception status.
Project the outcome's value to its exact proof-indexed view.
Instances For
Attach the exact total interpretation of an executable value.
Instances For
Attach the finite interpretation of an executable value known to be finite.
Instances For
Attach the signed-infinity interpretation of an executable value known to be infinite.
Instances For
Attach the payload-preserving interpretation of an executable value known to be a NaN.
Instances For
Positive infinity with its total interpretation in a conventional IEEE format.
Instances For
Negative infinity with its total interpretation in a conventional IEEE format.
Instances For
The bundled executable value has its indexed total interpretation.
The bundled value has the same interpretation through the generic numerical-system adapter.
A finite total refinement is the ordinary real-indexed refinement.