Danila Fedorin 95669b2c65 Prove that the iterated product is made from iterated bottom elements ...

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

2024-05-09 19:45:15 -07:00

Analysis

Finish the last proof obligation for trace walking

2024-05-09 19:01:36 -07:00

Language

Add more higher-order primitives

2024-04-30 21:56:34 -07:00

Lattice

Prove that the iterated product is made from iterated bottom elements

2024-05-09 19:45:15 -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

Add a proof that edges lead to 'incoming' inclusion

2024-05-09 16:56:45 -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 more higher-order primitives

2024-04-30 21:56:34 -07:00

Description

Attempts at formalizing static program analysis techniques in Agda.

2.3 MiB

Languages

Agda 100%