Danila Fedorin
a5f533d67a
This makes a finite-height proof for any `Fin n -> a` lattice immediate, and precludes the need for IterProd and Prod altogether. Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
22 lines
578 B
Lean4
22 lines
578 B
Lean4
import Spa.Lattice
|
|
import Spa.Fixedpoint
|
|
import Spa.Lattice.Unit
|
|
import Spa.Lattice.AboveBelow
|
|
import Spa.Lattice.FiniteMap
|
|
import Spa.Lattice.Bool
|
|
import Spa.Language.Base
|
|
import Spa.Language.Notation
|
|
import Spa.Language.Semantics
|
|
import Spa.Language.Graphs
|
|
import Spa.Language.Traces
|
|
import Spa.Language.Properties
|
|
import Spa.Language
|
|
import Spa.Analysis.Forward.Lattices
|
|
import Spa.Analysis.Forward.Evaluation
|
|
import Spa.Analysis.Forward.Adapters
|
|
import Spa.Analysis.Forward
|
|
import Spa.Showable
|
|
import Spa.Analysis.Utils
|
|
import Spa.Analysis.Sign
|
|
import Spa.Analysis.Constant
|