Finite maps and sets using ordered association lists.
This commit includes the following changes: * More theorems about pre-, partial and total orders. * Define the lexicographic order on various commonly used data types. * Mergesort and its correctness proof. * Implement finite maps and sets using ordered association lists.
Showing
- theories/assoc.v 283 additions, 0 deletionstheories/assoc.v
- theories/base.v 58 additions, 46 deletionstheories/base.v
- theories/fin_collections.v 1 addition, 1 deletiontheories/fin_collections.v
- theories/fin_maps.v 4 additions, 4 deletionstheories/fin_maps.v
- theories/lexico.v 186 additions, 0 deletionstheories/lexico.v
- theories/nmap.v 2 additions, 1 deletiontheories/nmap.v
- theories/numbers.v 10 additions, 1 deletiontheories/numbers.v
- theories/orders.v 309 additions, 43 deletionstheories/orders.v
- theories/pmap.v 110 additions, 114 deletionstheories/pmap.v
- theories/prelude.v 2 additions, 1 deletiontheories/prelude.v
Loading
Please register or sign in to comment