Danila Fedorin df4d072f22 Clean up comments in Graphs.lean and Program.lean

2026-08-09 18:17:02 -05:00

.claude

Lean migration: Phase 5 (language, CFGs, traces, Program)

2026-06-09 19:30:42 -07:00

Analysis

Move proof of least element into FiniteHeightLattice

2025-07-26 13:16:22 +02:00

Language

Fix broken code by moving fins to utils

2026-02-16 19:33:56 -08:00

Lattice

Require bottom element to actually be bottom; finish proof

2026-02-16 20:15:10 -08:00

lean

Clean up comments in Graphs.lean and Program.lean

2026-08-09 18:17:02 -05:00

Chain.agda

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

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

Equivalence.agda

Construct proofs of 'basic' lattices

2026-02-14 14:40:15 -08:00

Fixedpoint.agda

Move proof of least element into FiniteHeightLattice

2025-07-26 13:16:22 +02:00

Isomorphism.agda

Move proof of least element into FiniteHeightLattice

2025-07-26 13:16:22 +02:00

Language.agda

Switch maps (and consequently most of the code) to using instances

2025-01-04 21:16:22 -08:00

Lattice.agda

Require bottom element to actually be bottom; finish proof

2026-02-16 20:15:10 -08:00

LEAN_MIGRATION.md

Lean migration: typeclass-based parameter passing, as in the Agda original

2026-06-09 23:32:38 -07:00

Main.agda

Implement constant analysis

2025-01-05 19:39:12 -08:00

Showable.agda

Use instances to simplify printing code

2024-03-11 12:50:05 -07:00

Utils.agda

Add meet/join operation and some properties

2026-02-12 20:16:02 -08:00

Description

Attempts at formalizing static program analysis techniques in Agda.

3.1 MiB

Languages

Agda 100%