Danila Fedorin e0248397b7 Prove that predecessors imply edges ...

Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>

2024-05-09 23:18:51 -07:00

Analysis

Almost prove correctness

2024-05-09 22:49:53 -07:00

Language

Prove that predecessors imply edges

2024-05-09 23:18:51 -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

Use records rather than nested pairs to represent 'fixed height'

2024-05-09 20:11:04 -07:00

Isomorphism.agda

Use records rather than nested pairs to represent 'fixed height'

2024-05-09 20:11:04 -07:00

Language.agda

Move predecessor code into Graphs

2024-05-09 23:13:49 -07:00

Lattice.agda

Add proofs about monotonicity of foldl

2024-05-08 21:48:41 -07:00

Main.agda

Add more test programs

2024-05-08 23:30:23 -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

Description

Attempts at formalizing static program analysis techniques in Agda.

2.3 MiB

Languages

Agda 100%