Danila Fedorin 927030c337 Prove that having a top and bottom element is decidable ...

Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>

2025-12-07 19:28:56 -08:00

Analysis

Move proof of least element into FiniteHeightLattice

2025-07-26 13:16:22 +02:00

Language

Factor some code out into Utils

2025-11-28 16:22:17 -08:00

Lattice

Prove that having a top and bottom element is decidable

2025-12-07 19:28:56 -08:00

Chain.agda

Use records rather than nested pairs to represent 'fixed height'

2024-05-09 20:11:04 -07:00

Equivalence.agda

Add some additional 'equivalence' definitions to Equivalence

2024-02-18 21:46:42 -08:00

Fixedpoint.agda

Move proof of least element into FiniteHeightLattice

2025-07-26 13:16:22 +02:00

Isomorphism.agda

Move proof of least element into FiniteHeightLattice

2025-07-26 13:16:22 +02:00

Language.agda

Switch maps (and consequently most of the code) to using instances

2025-01-04 21:16:22 -08:00

Lattice.agda

Move proof of least element into FiniteHeightLattice

2025-07-26 13:16:22 +02:00

Main.agda

Implement constant analysis

2025-01-05 19:39:12 -08:00

Showable.agda

Use instances to simplify printing code

2024-03-11 12:50:05 -07:00

Utils.agda

Add some utility proofs about uniqueness etc.

2025-12-07 19:28:27 -08:00

Description

Attempts at formalizing static program analysis techniques in Agda.

2.3 MiB

Languages

Agda 100%