Danila Fedorin 8abf6f8670 Make 'isLattice' for simple types be an instance ...

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

2025-01-04 17:27:38 -08:00

Analysis

Fuse 'FiniteMap' and 'FiniteValueMap'

2024-12-31 19:21:23 -08:00

Language

Slightly clean up import for in-dec for Graph edges

2024-11-16 15:15:42 -08:00

Lattice

Make 'isLattice' for simple types be an instance

2025-01-04 17:27:38 -08: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

Description

Attempts at formalizing static program analysis techniques in Agda.

2.3 MiB

Languages

Agda 100%