Commit Graph

Select branches

Hide Pull Requests

main

Mono Color

• fa7e2b5bb6 Add a proof that AboveBelow is a fixed-height lattice (phew!) Danila Fedorin 2023-09-18 22:34:58 -0700
• c0db2ccd46 Add a lattice instance for the AboveBelow type Danila Fedorin 2023-09-18 20:56:08 -0700
• d338241319 Add a meet operation, too Danila Fedorin 2023-09-17 20:01:32 -0700
• 03c0b12a3c Start formalizing the bottom/top lattice Danila Fedorin 2023-09-17 19:50:21 -0700
• e4f87175a0 Remove IsDecidable record in favor of a plain definition Danila Fedorin 2023-09-17 19:43:24 -0700
• e3b8cc39f1 Put the fixed point algorithm code into its own file Danila Fedorin 2023-09-16 13:39:35 -0700
• cbebe599b2 Prove that it's a least fixed point Danila Fedorin 2023-09-16 13:07:31 -0700
• c338fa3ee5 Implement the fixed point algorithm Danila Fedorin 2023-09-16 00:23:44 -0700
• 866bc9124a Add a lemma about chains of length h+1 Danila Fedorin 2023-09-16 00:23:30 -0700
• 266c3dd81e Prove that a finite height lattice is bounded below Danila Fedorin 2023-09-15 21:07:14 -0700
• 5cab39ca82 Prove that AxB is a finite height semilattice Danila Fedorin 2023-09-03 23:56:39 -0700
• fb86d3f84f Generalize chains to allow equivalences Danila Fedorin 2023-09-03 21:05:57 -0700
• 67e96b27cf Add congruence instances for < and <= on semilattices Danila Fedorin 2023-09-03 19:33:04 -0700
• c9ec50c0ca Add a congruence requirement on Lattice. Danila Fedorin 2023-09-03 17:08:37 -0700
• eee814ae3c Add congruence for Map union and intersect Danila Fedorin 2023-09-03 16:57:56 -0700
• 29fb828ee2 Extract the equivalence code into its own module Danila Fedorin 2023-09-02 20:36:12 -0700
• b6292bf9bd Prove that a lattice of height h1+h2 exists for products Danila Fedorin 2023-08-20 21:53:27 -0700
• acf4a04814 Prove the chain mapping property Danila Fedorin 2023-08-20 20:49:08 -0700
• 561d0f343a Move < definition to Semilattice Danila Fedorin 2023-08-20 19:57:26 -0700
• 421f187e8b Clean up the Lattice definitions a fair bit Danila Fedorin 2023-08-20 19:02:47 -0700
• e62f429b86 Add instances for decidability and finite height lattices Danila Fedorin 2023-08-20 18:35:57 -0700
• 99cc5af243 Prove that Map equivalence is decidable Danila Fedorin 2023-08-19 16:30:53 -0700
• 3755a31bee Remove the starter files in NatMap Danila Fedorin 2023-08-19 14:22:40 -0700
• 46c084d24c Add the beginnings of a formalization of chains Danila Fedorin 2023-08-19 14:22:03 -0700
• c848f443e0 Add a lattice instance for Map Danila Fedorin 2023-08-05 18:33:49 -0700
• 7b93654c4f Prove the second absorption law for maps Danila Fedorin 2023-08-05 17:54:33 -0700
• dc405b989f Prove one absorption law Danila Fedorin 2023-08-05 14:13:06 -0700
• 990a785463 Add a witness for Map being an intersect semilattice Danila Fedorin 2023-08-05 12:48:44 -0700
• d3e0db449c Prove semilattice properties for intersect Danila Fedorin 2023-08-05 12:40:30 -0700
• 12e76527cc Prove provenance for intersection Danila Fedorin 2023-08-05 00:36:41 -0700
• 1780cdbda4 Add more properties of update(s) and start work on provenance Danila Fedorin 2023-08-05 00:02:50 -0700
• 66dfe14207 Prove that restrict needs the key in both maps Danila Fedorin 2023-08-04 00:07:10 -0700
• 56147cfc82 Implement map intersection Danila Fedorin 2023-08-03 23:46:26 -0700
• 7e1f70210b Remove trailing space Danila Fedorin 2023-07-30 22:26:05 -0700
• 77e2572157 Tweak the style of the Semilattice instance Danila Fedorin 2023-07-30 21:50:28 -0700
• 1b7a3f02eb Add an instance of Semilattice for Map. Danila Fedorin 2023-07-30 20:36:19 -0700
• a4eaa6269f Prove idempotence Danila Fedorin 2023-07-30 20:11:02 -0700
• fceee34cee Finish associativity proof Danila Fedorin 2023-07-30 19:54:38 -0700
• eca6181494 List all the cases for the other direction Danila Fedorin 2023-07-30 19:25:46 -0700
• 2c839db924 Prove associativity of maps (in one direction) Danila Fedorin 2023-07-30 19:08:51 -0700
• 1e4e8000cf Rename union-preserves to properly match what's being preserved Danila Fedorin 2023-07-30 17:57:06 -0700
• 70b85c99cc Rename the new provenance type and remove the old version Danila Fedorin 2023-07-30 16:45:02 -0700
• de2f202bdf Use an expression-based provenance to make enumerating cases easier Danila Fedorin 2023-07-30 16:43:07 -0700
• 6039c1dfab Rename 'merge' to 'union' Danila Fedorin 2023-07-30 15:18:09 -0700
• d786e6bf48 Eschew proof-by-symmetry Danila Fedorin 2023-07-30 14:16:35 -0700
• af0066eaa7 Rearrange a few functions Danila Fedorin 2023-07-30 13:49:38 -0700
• eaee73236f More tweaks to naming and style Danila Fedorin 2023-07-30 13:46:52 -0700
• 26db4cc86c Remove unnecessary -right prefix in theorem name. Danila Fedorin 2023-07-30 13:21:03 -0700
• b066db9829 Use inferred variables for proofs where possible Danila Fedorin 2023-07-30 13:19:00 -0700
• 4033a1b33d Prove most of commutativity by relying on in-dec. Danila Fedorin 2023-07-28 00:05:41 -0700
• 77b8b6fad9 Finally prove the provenance properties of merge. Danila Fedorin 2023-07-26 20:58:41 -0700
• 461732244a Finish all in/not-in proofs. Danila Fedorin 2023-07-26 20:40:28 -0700
• 12217e6928 Reformat the code to roughly fit into 80 columns. Danila Fedorin 2023-07-26 17:31:09 -0700
• 489b0532df Add intermediate state for insertion proofs Danila Fedorin 2023-07-25 22:58:42 -0700
• 6b51cd4050 Reorganize a bit and start on provenance Danila Fedorin 2023-07-25 19:56:47 -0700
• 88a712fa98 Implement the more powerful Map-functional theorem Danila Fedorin 2023-07-25 18:22:24 -0700
• c9ab1152c4 Minor cleanup of Map module Danila Fedorin 2023-07-25 00:10:57 -0700
• 850984ec15 Do away with implicit arguments in some places where they can't be inferred Danila Fedorin 2023-07-24 23:58:14 -0700
• 4aea9a0358 Migrate Maps to including a uniqueness proof Danila Fedorin 2023-07-24 23:55:09 -0700
• c2bc1c5421 Move the implementation details into a private module Danila Fedorin 2023-07-24 23:12:04 -0700
• 232bd65809 Add uniqueness preservation proof for merge Danila Fedorin 2023-07-24 23:02:43 -0700
• 87a476ab9e Add proofs of uniqueness preservation for map insert Danila Fedorin 2023-07-24 22:51:27 -0700
• c50195942d Start moving away from purely list-based maps. Danila Fedorin 2023-07-24 20:38:34 -0700
• f2e72b54ce Define unique as a data type to match stdlib All and Any Danila Fedorin 2023-07-23 21:34:24 -0700
• d9c18fe483 Prove that maps are functional assuming uniqueness Danila Fedorin 2023-07-23 17:50:25 -0700
• ab7ed2039a Add a generic Map module and prove its induced equivalence relation Danila Fedorin 2023-07-23 00:51:34 -0700
• 8febffc8e3 Add an equivalence constraint on lattice relations. Danila Fedorin 2023-07-15 15:16:51 -0700
• 971d75bb2b Parameterize by equivalence type Danila Fedorin 2023-07-15 14:40:11 -0700
• 46ff4465f2 Git rid of the bundles (for now) use IsWhatever Danila Fedorin 2023-07-15 13:12:21 -0700
• 7b993827bf Delete the unneeded <= relation from instances Danila Fedorin 2023-07-15 12:18:50 -0700
• 09d2125aea Add note to self Danila Fedorin 2023-07-14 22:45:17 -0700
• cdca2528e9 Add a lattice instance for products Danila Fedorin 2023-07-14 21:49:47 -0700
• 3b29ee0f74 Add a Semilattice isntance for Products. Danila Fedorin 2023-07-14 21:20:16 -0700
• 1ee6682c1a Factor the Semilattice instances for Nat into their own module Danila Fedorin 2023-07-14 19:59:07 -0700
• c9b514e9af Add a preorder instance for product Danila Fedorin 2023-07-14 19:42:29 -0700
• 2b3d429631 Get started on a semilattice instances for products Danila Fedorin 2023-07-14 18:42:29 -0700
• bac68b95f1 Add a Lattice instance for natural numbers. Danila Fedorin 2023-07-14 18:18:17 -0700
• c6dddb177e Get started on a lattice instance for naturals. Danila Fedorin 2023-07-13 23:22:29 -0700
• 422ea93edb Finish up the Nat semilattices Danila Fedorin 2023-07-13 21:50:27 -0700
• 97a3f25fd2 [WIP] Start lattice and semilattice proofs for Nat Danila Fedorin 2023-04-06 23:08:49 -0700
• 8b805be9d3 Add a map from natural numbers for use as a lattice transformer Danila Fedorin 2023-04-04 21:08:41 -0700
• 27eeead350 Add typeclasses for (semi)lattices and order Danila Fedorin 2023-04-04 21:08:31 -0700