Lean migration: Phase 4 (IterProd + FiniteMap lattices)
- Spa.Lattice.IterProd: k-fold product, recursive Lattice instance,
fixed height k*hA + hB, bot = build of bottoms
- Spa.Lattice.FiniteMap: spine-pinned assoc lists ({l // l.map fst = ks});
with = the 1100-line Map.agda collapses into positional 'combine'.
Same lemma inventory (membership, locate, updating, GeneralizedUpdate,
valuesAt, Provenance-union, le_of_mem_mem) — Nodup is now an explicit
hypothesis where the Agda Map carried it intrinsically. Fixed height
|ks|*hB still via transport along the IterProd isomorphism, which no
longer needs Unique ks (representation is canonical).
Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-06-09 19:12:39 -07:00
|
|
|
|
import Spa.Lattice.Prod
|
|
|
|
|
|
import Spa.Lattice.Unit
|
|
|
|
|
|
|
|
|
|
|
|
namespace Spa
|
|
|
|
|
|
|
|
|
|
|
|
universe u
|
|
|
|
|
|
|
|
|
|
|
|
def IterProd (A B : Type u) : ℕ → Type u
|
|
|
|
|
|
| 0 => B
|
|
|
|
|
|
| k + 1 => A × IterProd A B k
|
|
|
|
|
|
|
|
|
|
|
|
namespace IterProd
|
|
|
|
|
|
|
|
|
|
|
|
variable {A B : Type u}
|
|
|
|
|
|
|
2026-06-25 13:55:00 -05:00
|
|
|
|
instance decidableEq [DecidableEq A] [DecidableEq B] :
|
Lean migration: Phase 4 (IterProd + FiniteMap lattices)
- Spa.Lattice.IterProd: k-fold product, recursive Lattice instance,
fixed height k*hA + hB, bot = build of bottoms
- Spa.Lattice.FiniteMap: spine-pinned assoc lists ({l // l.map fst = ks});
with = the 1100-line Map.agda collapses into positional 'combine'.
Same lemma inventory (membership, locate, updating, GeneralizedUpdate,
valuesAt, Provenance-union, le_of_mem_mem) — Nodup is now an explicit
hypothesis where the Agda Map carried it intrinsically. Fixed height
|ks|*hB still via transport along the IterProd isomorphism, which no
longer needs Unique ks (representation is canonical).
Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-06-09 19:12:39 -07:00
|
|
|
|
∀ k, DecidableEq (IterProd A B k)
|
|
|
|
|
|
| 0 => inferInstanceAs (DecidableEq B)
|
2026-06-25 13:55:00 -05:00
|
|
|
|
| k + 1 => @instDecidableEqProd A (IterProd A B k) _ (decidableEq k)
|
Lean migration: Phase 4 (IterProd + FiniteMap lattices)
- Spa.Lattice.IterProd: k-fold product, recursive Lattice instance,
fixed height k*hA + hB, bot = build of bottoms
- Spa.Lattice.FiniteMap: spine-pinned assoc lists ({l // l.map fst = ks});
with = the 1100-line Map.agda collapses into positional 'combine'.
Same lemma inventory (membership, locate, updating, GeneralizedUpdate,
valuesAt, Provenance-union, le_of_mem_mem) — Nodup is now an explicit
hypothesis where the Agda Map carried it intrinsically. Fixed height
|ks|*hB still via transport along the IterProd isomorphism, which no
longer needs Unique ks (representation is canonical).
Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-06-09 19:12:39 -07:00
|
|
|
|
|
|
|
|
|
|
def build (a : A) (b : B) : (k : ℕ) → IterProd A B k
|
|
|
|
|
|
| 0 => b
|
|
|
|
|
|
| k + 1 => (a, build a b k)
|
|
|
|
|
|
|
2026-06-22 18:33:48 -05:00
|
|
|
|
def fixedHeight [FiniteHeightLattice A] [FiniteHeightLattice B] :
|
|
|
|
|
|
∀ k, FiniteHeightLattice (IterProd A B k)
|
|
|
|
|
|
| 0 => inferInstanceAs (FiniteHeightLattice B)
|
2026-06-25 18:42:28 -05:00
|
|
|
|
| k + 1 => @Spa.prod A (IterProd A B k) _ (fixedHeight k)
|
Lean migration: Phase 4 (IterProd + FiniteMap lattices)
- Spa.Lattice.IterProd: k-fold product, recursive Lattice instance,
fixed height k*hA + hB, bot = build of bottoms
- Spa.Lattice.FiniteMap: spine-pinned assoc lists ({l // l.map fst = ks});
with = the 1100-line Map.agda collapses into positional 'combine'.
Same lemma inventory (membership, locate, updating, GeneralizedUpdate,
valuesAt, Provenance-union, le_of_mem_mem) — Nodup is now an explicit
hypothesis where the Agda Map carried it intrinsically. Fixed height
|ks|*hB still via transport along the IterProd isomorphism, which no
longer needs Unique ks (representation is canonical).
Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-06-09 19:12:39 -07:00
|
|
|
|
|
2026-06-25 13:55:00 -05:00
|
|
|
|
instance finiteHeight [FiniteHeightLattice A] [FiniteHeightLattice B] (k : ℕ) :
|
2026-06-22 18:33:48 -05:00
|
|
|
|
FiniteHeightLattice (IterProd A B k) := fixedHeight k
|
|
|
|
|
|
|
Lean migration: Phase 4 (IterProd + FiniteMap lattices)
- Spa.Lattice.IterProd: k-fold product, recursive Lattice instance,
fixed height k*hA + hB, bot = build of bottoms
- Spa.Lattice.FiniteMap: spine-pinned assoc lists ({l // l.map fst = ks});
with = the 1100-line Map.agda collapses into positional 'combine'.
Same lemma inventory (membership, locate, updating, GeneralizedUpdate,
valuesAt, Provenance-union, le_of_mem_mem) — Nodup is now an explicit
hypothesis where the Agda Map carried it intrinsically. Fixed height
|ks|*hB still via transport along the IterProd isomorphism, which no
longer needs Unique ks (representation is canonical).
Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-06-09 19:12:39 -07:00
|
|
|
|
end IterProd
|
|
|
|
|
|
|
|
|
|
|
|
end Spa
|