Attempts at formalizing static program analysis techniques in Agda.

Danila Fedorin c1c34c69a5 Strengthen absorption laws ... If x \/ y is defined, x /\ (x \/ y) has to be defined, too. Previously, we stated them in terms of "if x /\ (x \/ y) is defined", which is not right. Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>		2025-07-11 15:44:29 +02:00
Analysis	Implement constant analysis	2025-01-05 19:39:12 -08:00
Language	Switch maps (and consequently most of the code) to using instances	2025-01-04 21:16:22 -08:00
Lattice	Strengthen absorption laws	2025-07-11 15:44:29 +02: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	Make 'IsDecidable' into a record to aid instance search	2025-01-04 18:58:56 -08:00
Isomorphism.agda	Switch maps (and consequently most of the code) to using instances	2025-01-04 21:16:22 -08:00
Language.agda	Switch maps (and consequently most of the code) to using instances	2025-01-04 21:16:22 -08:00
Lattice.agda	Add definitions about monotonicity to Lattice	2025-01-05 19:39:12 -08: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	Switch maps (and consequently most of the code) to using instances	2025-01-04 21:16:22 -08:00