Open
Conversation
* add fast implementation of integers and their properties * move properties of min and max over `ℕ` to the appropriate file * reorganize and format code * remove `--safe` flag * remove `--safe` flag * Fast int (#2) * direct solver application * direct solver application --------- Co-authored-by: Marcin Jan Turek-Grzybowski <marcinjangrzybowski@gmail.com> * add fast implementation of integers and their properties * move properties of min and max over `ℕ` to the appropriate file * reorganize and format code * remove `--safe` flag * remove `--safe` flag * remove `--safe` flag * Fast int (#2) * direct solver application * direct solver application --------- Co-authored-by: Marcin Jan Turek-Grzybowski <marcinjangrzybowski@gmail.com> * fix compatibility with the library * fix compatibility after rebase, start proving properties of fast integer min and max * add instances of `Nat` and `Int` as `Pseudolattice`, and of `Int` as `OrderedCommRing` * fix typo, add better make from Posets to Pseudolattices * update `makePseudolatticeFromPoset` and instances built using it * move `maxLUB` and `minGLB` to `Data.Nat.Order`, remove unnecessary imports * rewrite properties from `minAssoc` to `-max`, add temporary lemmas in `Nat`, add `UsingEq` into `min` and `max` over the Naturals * fix naming clash on import * rewrite properties from `pos+posLposMin` to `·DistNegsucLMax` * start work on Order: adapt properties from `isProp≤` to `≤SumLeftPos`, add boolean order, suggest alternative definition `_≤'_` * use more efficient implementation of quotient and remainder in `Int.Fast.Divisibility` * adapt properties from `pred-≤-pred` to `0≤o→≤-·o`, move import of `Bool.Base` together with the other imports * adapt properties from `<-·o` to `predℤ-≤-predℤ` * adapt properties from `¬m+posk<m` to `<-+pos-trans` * adapt properties from `<-pos+-trans` to `0<o→≤-·o-cancel` * adapt properties from `≤-o·-cancel` to `≤→min` ; add conversions between the order over the integers and the one over the naturals ; add `maxLUB`, `minGLB` , `≤→max` , `≤→min` to `Data.Nat.Order` * adapt properties from `≤MonotoneMin` to `_≟'_` ; add faster `_≟_` and tests. This finishes (a first but complete version) of `Data.Int.Fast` * edit `_≤'_` using recursive order, add `_≤ᵇ_` and `_≤''_` * update `minIdem` * clean comments, reorganize `Fast` modules, add more properties in `Int.Fast.Order`, add `Trichotomy` and `Ordering` in `BinaryRelation` * add fixity for `_≤_` in `PseudolatticeStr`, add `Properties` file * edit Fast using PL and OCR instances * remove `minIdem`, use PL instance of `Nat` in the `Int.Fast.Order` module * simplify some proofs, with additional converions between the order on Nat and the integer order between negsuc * Add order related instances of `Fast.Int` * revert addition of `Trichotomy` to `BinaryRelation`, add more tests to `Int.Fast.Order` * add missing `'` on commented test code * adapt instances of `Int` and `Int.Fast` as `OCR`, to the branch `ocr+pl-instances'` --------- Co-authored-by: Ettore Forigo <ettore.forigo@gmail.com> Co-authored-by: Marcin Jan Turek-Grzybowski <marcinjangrzybowski@gmail.com>
…seudolattices and simplify some proofs about min/max in `Int.Fast.Properties`
…ebraic instances
Contributor
|
"Fast" doesn't feel like a word to me anymore, after reading that 😄 |
* Resolve naming inconsistency between Iso and Category.isIso (agda#1274) s/leftInv/ret; s/rightInv/sec --------- Co-authored-by: Madeleine Sydney Ślaga <msyds@deertopia.net> * isIso name change fix (agda#1281) * Update fin (agda#1279) * Exchange Fin in Cubical.Data.Fin for the deifinition from Cubical.Data.Fin.Inductive. WIP * Fixed finj, predFin, inject<, flast, ¬Fin0 to work with new definition of Fin. * Minor changes * Fix sumFinGen * fix any? * Everything type checks now. Important changes: - Implicit argument added to toN - Implicit arguments in toN-injective slightly changed - Argument changed from implicit to explicit in elim * some formatting * change ¬Fin0 * remove comments * Add <ᵗ-asym * make properties type check * Remove dependencies on Cubical.Data.Fin.Inductive.Base * Things that work * Properties type check * more working files * factorEquiv * comment fix * LehmerCode type checks * SumFin.Base type checks * some cleanup and Axiom.Choice type checks not reliant on old Fin * Remove dependence on Fin.Inductive * Remove dependence on Fin.Inductive * Remove dependency on Fin.Infuctive * Remove dependency on Fin.Inductive * Remove dependencies on Fin.Inductive * type check * fix FinSet * _<ᵗ_ is well founded * type checks with new Fin * Everything builds * Move everything from Fin.Inductive.Properties to Fin.Properties and remove Fin.Inductive, Fin.Inductive.Base, Fin.Inductive.Properties * some cleanup * more cleanup * fix trailing whitespaces * files end with newline --------- Co-authored-by: croos <76143n@gmail.com> * fix defintions of `min` and `max`, add comment on limitations of `UsingEq` (agda#1270) * Change implementation of Inductive Order on Nat (agda#1283) * use boolean comparison in `Nat.Order.Inductive`, add non-strict and flipped inductive order, make faster instance search in `Fin.Literals` * fix typo * Place holder for paper (agda#1286) * placeholder * whitespae * Cellpaper2 (agda#1287) * placeholder * whitespae * form * fix imports: `Fin.Inductive.Base/Properties` → `Fin.Base/Properties` --------- Co-authored-by: Madeleine Sydney Ślaga <65362461+msyds@users.noreply.github.com> Co-authored-by: Madeleine Sydney Ślaga <msyds@deertopia.net> Co-authored-by: Max S. New <maxsnew@gmail.com> Co-authored-by: Caroline Roos <croos.math@gmail.com> Co-authored-by: croos <76143n@gmail.com> Co-authored-by: Axel Ljungström <49276137+aljungstrom@users.noreply.github.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
See #1276.
I have decided to change the organization of the modules by introducing a common
Fastdirectory, hosting the fastIntmodules and, in the future, fast rationals as well. The same change has been made for instances of algebraic structures.In my opinion, this organization seems conceptually clearer.
For example, in #1276 the instances of fast integers as
AbGroupare inCubical.Algebra.AbGroup.Instances.Int.Fast, with the file namedFast, whereas in this PR we haveCubical.Algebra.AbGroup.Instances.Fast.Int, with the file namedInt.Moreover, since in these PRs they are consistently referred to as "fast integers", having them under
Fast.Intappears more natural than the currentInt.Fast.Finally, the only fast
Intmodule already merged is theBasefile, so this reorganization is minimal.This PR depends on #1270, #1271, and #1272.