Expand description
Foundation layer: expression nodes, arena, tree traversal, canonicalization, and core types.
Modules§
- assumptions
- Mathematical property inference engine.
- budget
- Limits on one call: an absolute deadline, a relative time limit, and a cap on the number of steps.
- config
- Configuration for controlling evaluation behavior.
- errors
- Error types for symplex.
- extended
- The extended line: a value of
Tor one of the two infinities. - interval
- Intervals and bounds with named endpoints:
Interval<T>for a set[a, b],(a, b),(a, b]or[a, b)between two finite endpoints,Bounds<T>for a closed constraint box side whose ends may be absent. - libfn
- The registry of library special functions, the nodes
ExprNode::Lib. - numeric
- Exact conversions between machine floats and rationals.
- rng
- Deterministic pseudo-random generators: seeded, reproducible, not cryptographic.
- truth
- Three-valued decisions, sign sets and the strength of evidence:
Truthfor “yes / no / not decided”,SignSetfor “which signs can this finite value have”, andEvidence/Verdict<T>for “how was that established”.