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

..

AboveBelow.agda

Implement constant analysis

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

Builder.agda

Prove that having a top and bottom element is decidable

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

ExtendBelow.agda

Add 'ExtendBelow' lattice, which adds new bottom to lattices

2025-04-20 19:13:07 -07:00

FiniteMap.agda

Re-export members of isLattice together with the record where needed

2025-01-04 22:43:13 -08:00

IterProd.agda

Switch product to using instances

2025-01-04 21:33:59 -08:00

Map.agda

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

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

MapSet.agda

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

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

Nat.agda

Make 'isLattice' for simple types be an instance

2025-01-04 17:27:38 -08:00

Prod.agda

Re-export members of isLattice together with the record where needed

2025-01-04 22:43:13 -08:00

Unit.agda

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

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