Attempts at formalizing static program analysis techniques in Agda.

Danila Fedorin 828b652d3b Rename 'a' to 'b' in fixedpoint algorithm proof ... Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>		2024-08-18 10:28:45 -10:00
Analysis	Prove that the sign analysis is correct	2024-05-10 22:31:47 -07:00
Language	Prove that the inputs to wrap are empty	2024-05-10 21:25:40 -07:00
Lattice	Prove that the bottom map's valyes are all bottoms	2024-05-09 20:48:32 -07: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	Rename 'a' to 'b' in fixedpoint algorithm proof	2024-08-18 10:28:45 -10:00
Isomorphism.agda	Use records rather than nested pairs to represent 'fixed height'	2024-05-09 20:11:04 -07:00
Language.agda	Remove last remaining assumption for correctness	2024-05-10 21:30:56 -07:00
Lattice.agda	Add proofs about monotonicity of foldl	2024-05-08 21:48:41 -07:00
Main.agda	Add guardedness to Main directly	2024-08-08 13:28:25 -07:00
Showable.agda	Use instances to simplify printing code	2024-03-11 12:50:05 -07:00
Utils.agda	Add a proof about filter's distributivity	2024-05-09 23:06:49 -07:00