Learning.Hist
From the authors
History of n complete rounds; n = 0 is the empty history.
-
๐ : Type u_5 -
๐ : Type u_6 -
๐จ : Type u_7
-
n : โ
Type (max (max u_7 u_6) u_5)Fin n โ Round ๐ ๐ ๐จNat : TypeThe natural numbers, starting at zero. This type is special-cased by both the kernel and the compiler, and overridden with an efficient implementation. Both use a fast arbitrary-precision arithmetic library (usually [GMP](https://gmplib.org/)); at runtime, `Nat` values that are sufficiently small are unboxed.
Fin : โ โ TypeNatural numbers less than some upper bound. In particular, a `Fin n` is a natural number `i` with the constraint that `i < n`. It is the canonical type with `n` elements.
Learning.Round : Type u_5 โ Type u_6 โ Type u_7 โ Type (max u_5 u_7 u_6)One round of interaction: an observation, then an action, then a feedback.Go to its page
Code
abbrev Hist (๐ ๐ ๐จ : Type*) (n : โ) := Fin n โ Round ๐ ๐ ๐จ
New in v4.34.0-rc2-74-ge05e4f3 (2026-09-10), and its meaning has not changed since.
Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file ยท open it in the Lean web editor.
Dependency graph
Audit surface: 1 project declarations, 3 external constants
โ Proved: no sorry anywhere in its closure
This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.