|
|
4a9e7492f4
|
Prove the other direction for associativity
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-16 19:31:39 -08:00 |
|
|
|
ba57e2558d
|
Add more cases for associativity lemma
|
2026-02-16 17:43:07 -08:00 |
|
|
|
1c37141234
|
Add more properties about lattices
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-16 17:43:07 -08:00 |
|
|
|
9072da4ab6
|
Add some cases for associativity lemma
|
2026-02-16 17:42:59 -08:00 |
|
|
|
3f923c2d7d
|
Clean up some definitions
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-16 12:57:59 -08:00 |
|
|
|
01555ee203
|
Make progress on properties of the dependent product
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-16 01:08:34 -08:00 |
|
|
|
a083f2f4ae
|
Construct proofs of 'basic' lattices
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-14 14:40:15 -08:00 |
|
|
|
27f65c10f7
|
Prove absroption laws
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-14 14:22:27 -08:00 |
|
|
|
c6e525ad7c
|
Add associativity proofs
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-14 13:47:39 -08:00 |
|
|
|
ccc3c7d5c7
|
Add meet/join operation and some properties
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-12 20:16:02 -08:00 |
|
|
|
05c55498ce
|
Extend proofs to meet as well as join
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-12 17:12:01 -08:00 |
|
|
|
6b462f1a83
|
Prove that having a total join function is decidable
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-05 16:54:22 -08:00 |
|
|
|
7382c632bc
|
Add some proofs about predecessors
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2026-02-05 16:16:12 -08:00 |
|
|
|
aa32706120
|
Fix typo
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-12-23 14:07:45 -08:00 |
|
|
|
4b0541caf5
|
Use "top" instead of T
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-12-23 14:06:28 -08:00 |
|
|
|
299938d97e
|
Add decidability proofs for properties
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-12-07 22:25:47 -08:00 |
|
|
|
927030c337
|
Prove that having a top and bottom element is decidable
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-12-07 19:28:56 -08:00 |
|
|
|
ef3c351bb0
|
Add some utility proofs about uniqueness etc.
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-12-07 19:28:27 -08:00 |
|
|
|
84c4ea6936
|
Prove final postulate about cycles in graphs
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-29 22:46:49 -08:00 |
|
|
|
a277c8f969
|
Prove walk splitting
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-29 21:34:39 -08:00 |
|
|
|
d1700f23fa
|
Add some helpers
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-29 13:24:27 -08:00 |
|
|
|
eb2d64f3b5
|
Properly state all-paths property using simple walks
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-28 21:31:54 -08:00 |
|
|
|
14214ab5e7
|
Reorder definitions to be in the order the graph is built up
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-28 17:09:57 -08:00 |
|
|
|
baece236d3
|
Re-define 'interior'
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-28 17:09:14 -08:00 |
|
|
|
6f642d85e0
|
Put self-paths into the adjacency graph
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-28 17:08:56 -08:00 |
|
|
|
25fa0140f0
|
Switch to a path definition that allows trivial self-loops
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-28 16:30:10 -08:00 |
|
|
|
27621992ad
|
Rename a helper
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-28 16:25:46 -08:00 |
|
|
|
e409cceae5
|
Start on an initial implementation of DAG-based builder
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-28 16:24:48 -08:00 |
|
|
|
8cb082e3c5
|
Delete original builder (lol)
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-28 16:24:29 -08:00 |
|
|
|
c199e9616f
|
Factor some code out into Utils
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-11-28 16:22:17 -08:00 |
|
|
|
f5457d8841
|
Move proof of least element into FiniteHeightLattice
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-26 13:16:22 +02:00 |
|
|
|
d99d4a2893
|
[WIP] Demonstrate partial lattice construction
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 19:51:27 +02:00 |
|
|
|
fbb98de40f
|
Prove the other absorption law
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 19:26:03 +02:00 |
|
|
|
706b593d1d
|
Write a lemma to wrangle PartialAbsorb proofs
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 19:14:49 +02:00 |
|
|
|
45606679f5
|
Prove one of the absorption laws
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 18:32:23 +02:00 |
|
|
|
7e099a2561
|
Delete debugging code
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 17:18:31 +02:00 |
|
|
|
2808759338
|
Add instances of semilattice proofs
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 17:18:19 +02:00 |
|
|
|
42bb8f8792
|
Extend laws on Path' to Path versions
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 17:17:59 +02:00 |
|
|
|
05e693594d
|
Prove idempotence of meet and join
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 17:17:25 +02:00 |
|
|
|
90e0046707
|
Prove missing congruence law
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 17:17:01 +02:00 |
|
|
|
13eee93255
|
Remove whitespace errors
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 15:26:41 +02:00 |
|
|
|
6243326665
|
Prove associativity of meet
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 15:21:59 +02:00 |
|
|
|
7b2114cd0f
|
Use a convenience function for creating the "greatest path"
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-25 15:21:43 +02:00 |
|
|
|
36ae125e1e
|
Prove associativity
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-22 18:05:08 +02:00 |
|
|
|
6055a79e6a
|
Prove a side lemma about nothing/just
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-22 18:04:53 +02:00 |
|
|
|
01f7f678d3
|
Prove congruence of various operations
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-22 18:02:45 +02:00 |
|
|
|
14f1494fc3
|
Provide a definition of partial congruence
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-22 18:01:48 +02:00 |
|
|
|
d3bac2fe60
|
Switch to representing least/greatest with absorption
It's more convenient this way to require non-partiality.
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-22 17:59:54 +02:00 |
|
|
|
5705f256fd
|
Prove some quasi-homomorphism properties
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-11 15:49:56 +02:00 |
|
|
|
d59ae90cef
|
Lock down more equivalence relation proofs
Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
|
2025-07-11 15:46:18 +02:00 |
|
