Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Add decidable equality with nil | 2017-08-13 | |
| | |||
* | Make some tactics a bit more powerful | 2017-07-08 | |
| | |||
* | More fine-grained tactics imports | 2017-07-08 | |
| | |||
* | More fine-grained imports | 2017-07-08 | |
| | |||
* | Add UnfoldArg | 2017-07-08 | |
| | |||
* | prove an admit in ArithmeticSynthesisTest | 2017-07-06 | |
| | |||
* | Add wrappers for subborrow and add_with_get_carry so they work when it is ↵ | 2017-06-29 | |
| | | | | not known that they split on a power of 2 | ||
* | remove unused admit (has been moved to Tuple.v) | 2017-06-26 | |
| | |||
* | Prove map2_append | 2017-06-25 | |
| | |||
* | write and prove Tuple.map2_cps | 2017-06-25 | |
| | |||
* | Fix a typo in push_Zmod that was causing looping | 2017-06-22 | |
| | |||
* | Fix some minor naming bugs in sig_assoc tactics | 2017-06-22 | |
| | |||
* | src/Demo.v: a 200-line introduction to BaseSystem ideas | 2017-06-21 | |
| | |||
* | Prove In_to_list_left_tl, In_left_hd, to_list_left_append | 2017-06-21 | |
| | |||
* | Add is_bounded_by_None_repeat_In_iff_lt | 2017-06-20 | |
| | |||
* | Add fold_left_orb_true, fold_left_orb_pull | 2017-06-20 | |
| | |||
* | Add is_bounded_by_None_repeat_In_iff | 2017-06-20 | |
| | |||
* | [Require NatUtil] should not change [tauto] | 2017-06-19 | |
| | | | | | | | | | Work around [bug #5444](https://coq.inria.fr/bugs/show_bug.cgi?id=5444), [Require Nsatz] should not change the behavior of [tauto]. Because [tauto] is stupid and checks to see whether or not [Classical_Prop] has been *required* to decide whether or not to use classical axioms. Aren't side-effects of [Require] wonderful? Since we're not actually using nsatz or psatz in NatUtil, we now simply [Require Import Lia]. | ||
* | Add ModInv | 2017-06-18 | |
| | | | | This closes #209. | ||
* | Stronger zero_bounds | 2017-06-18 | |
| | |||
* | Add div_nonneg to zarith | 2017-06-18 | |
| | |||
* | Add Z.div_nonneg | 2017-06-18 | |
| | |||
* | Add eq_ZToWord | 2017-06-17 | |
| | |||
* | Unfold Z.mul_split_at_bitwidth for reification | 2017-06-17 | |
| | | | | Also reimplement it with a shift and a mask | ||
* | finish tuple-ifying Montgomery API | 2017-06-16 | |
| | |||
* | CPSify Saturated API in preparation for CPSifying Montgomery (see #194) | 2017-06-15 | |
| | |||
* | Don't force [Require Import String] for debug msgs | 2017-06-15 | |
| | |||
* | Fix a changed case in the proof in loop.v | 2017-06-15 | |
| | |||
* | Better for_loop induction principle | 2017-06-15 | |
| | | | | Don't require that the test be strict | ||
* | Export ZUtil.Z2Nat in ZUtil | 2017-06-15 | |
| | |||
* | Add ZUtil.Z2Nat | 2017-06-15 | |
| | |||
* | Add for_cps_unroll1 | 2017-06-15 | |
| | | | | It unrolls a for-loop once at the head of the loop | ||
* | Add eq_loop_cps_large_n | 2017-06-15 | |
| | |||
* | move CPS notations to Util.CPSNotations | 2017-06-15 | |
| | |||
* | Loop changes, ScalarMultBase_correct with admits | 2017-06-14 | |
| | |||
* | loops WIP | 2017-06-14 | |
| | |||
* | ScalarMult: Z -> G -> G (closes #193) | 2017-06-14 | |
| | |||
* | Add mul_split_at_bitwidth, define things in terms of that | 2017-06-13 | |
| | | | | | This will make it easier on the reflective machinery, because it won't have to carry around such large constants. | ||
* | Add Z.peano_rect_strong | 2017-06-13 | |
| | | | | This version provides hypotheses about the non{negativity,positivity} of the Z. | ||
* | Add dec_eq_comparison | 2017-06-13 | |
| | |||
* | Add Z.peano_rect | 2017-06-13 | |
| | |||
* | Add Z.mul_split | 2017-06-13 | |
| | |||
* | Fix zrange notation levels | 2017-06-12 | |
| | | | | So that it doesn't interfere with [~> R] and [A ~> B]. | ||
* | Add unfold lemmas for id_with_alt | 2017-06-11 | |
| | |||
* | Add IdfunWithAlt | 2017-06-11 | |
| | |||
* | Add script to remake Tactics.v file | 2017-06-11 | |
| | |||
* | Add clearbody_all | 2017-06-11 | |
| | |||
* | Fix loop notations, add for loops | 2017-06-11 | |
| | |||
* | Reserve some more notations | 2017-06-11 | |
| | |||
* | cps notations WIP... | 2017-06-11 | |
| |