Attempts at formalizing static program analysis techniques in Agda.
Go to file
Danila Fedorin 51accb6438 Define 'minus', too -- with no monotonicity proof.
I'm still thinking about how this should be achieved most easily.

Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
2024-03-10 16:40:49 -07:00
Analysis Define 'minus', too -- with no monotonicity proof. 2024-03-10 16:40:49 -07:00
Lattice Prove that the 'join' transformation is monotonic 2024-03-09 23:06:47 -08: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 Add a way to retrieve the code for a particular state 2024-03-09 23:09:50 -08:00
Lattice.agda Prove that the 'join' transformation is monotonic 2024-03-09 23:06:47 -08:00
Main.agda Use named modules to avoid having to pass redundant parameters 2024-03-09 21:46:15 -08:00
Utils.agda Add more properties of uniqueness 2024-03-09 13:54:01 -08:00