Attempts at formalizing static program analysis techniques in Agda.

Danila Fedorin 85fdf544b9 Translate informal proof of (node) transitivity into formal one. ... Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>		2024-04-08 20:57:08 -07:00
Analysis	Fix comments in Forward.agda	2024-03-23 12:09:14 -07:00
Lattice	Adjust behavior of eval to not require constant 'k in vars' threading	2024-03-22 17:15:40 -07:00
Chain.agda	Put the fixed point algorithm code into its own file	2023-09-16 13:39:35 -07:00
Equivalence.agda	Add some additional 'equivalence' definitions to Equivalence	2024-02-18 21:46:42 -08:00
Fixedpoint.agda	Fix definition of 'less than' to not involve a third variable.	2024-02-07 21:04:13 -08:00
Isomorphism.agda	Update with new changes to Agda	2024-03-03 16:44:10 -08:00
Language.agda	Translate informal proof of (node) transitivity into formal one.	2024-04-08 20:57:08 -07:00
Lattice.agda	Prove that the 'join' transformation is monotonic	2024-03-09 23:06:47 -08:00
Main.agda	Move more code out of Sign and into Main	2024-03-11 13:07:42 -07:00
Showable.agda	Use instances to simplify printing code	2024-03-11 12:50:05 -07:00
Utils.agda	Intermediate commit. Switch to *-based definition of <=.	2024-04-07 19:51:59 -07:00