Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Don't use UIP in inversion_wff | 2016-12-03 | |
| | |||
* | Add inversion_wff | 2016-12-03 | |
| | |||
* | Add WfInversion | 2016-12-03 | |
| | |||
* | More powerful inversion_option | 2016-12-03 | |
| | |||
* | Move things to ExprInversion | 2016-12-03 | |
| | |||
* | Add invert_Var | 2016-12-03 | |
| | |||
* | Arguments for invert_Op | 2016-12-03 | |
| | |||
* | Fewer autogenerated names | 2016-12-03 | |
| | |||
* | Add invert_Op | 2016-12-03 | |
| | |||
* | Change some default names | 2016-12-03 | |
| | |||
* | Initial (not fully working) version of MapWithInterpInfo | 2016-12-02 | |
| | |||
* | Add SmartFlatTypeMapUnInterp | 2016-12-02 | |
| | |||
* | Add invert_LetIn | 2016-12-02 | |
| | |||
* | Arguments for invert_Pair | 2016-12-02 | |
| | |||
* | Add invert_Pair | 2016-12-02 | |
| | |||
* | Add SmartFlatTypeMapInterp | 2016-12-02 | |
| | |||
* | SmartFlatTypeMap arguments | 2016-12-02 | |
| | |||
* | Add SmartFlatTypeMap | 2016-12-02 | |
| | |||
* | Various application lemmas | 2016-11-23 | |
| | |||
* | Add lemmas about application | 2016-11-22 | |
| | |||
* | Add interp_all_binders_for' | 2016-11-22 | |
| | |||
* | Remove an admit | 2016-11-17 | |
| | |||
* | Add interpf_LetIn | 2016-11-17 | |
| | |||
* | : assert is not valid 8.4 syntax | 2016-11-17 | |
| | |||
* | Add Un{Return,Abs}_eta | 2016-11-16 | |
| | |||
* | Add : assert to a bunch of arguments | 2016-11-16 | |
| | | | | See https://coq.inria.fr/bugs/show_bug.cgi?id=5181#c3 | ||
* | Split fixedpoint in interpf | 2016-11-16 | |
| | |||
* | Arguments for Un{Return,Abs} | 2016-11-16 | |
| | |||
* | Add UnReturn, UnAbs | 2016-11-16 | |
| | |||
* | Support for 128-bit words | 2016-11-14 | |
| | | | | | I haven't found a good way to genericize the proofs of relatedness things, mostly because Modules and functors are annoying. | ||
* | Add word-size-independent interpretations | 2016-11-14 | |
| | |||
* | Fix reification of neg | 2016-11-11 | |
| | | | | Note that we don't actually use reified neg anywhwere. If we did, the previous commit wouldn't've built... | ||
* | Make [neg] a unary operation in reflection | 2016-11-11 | |
| | | | | | | It now takes a meta-level [Z] argument which is the bit width. I haven't modified any of the extraction directives, so I don't know if extraction still works nicely. | ||
* | Remove more conditional subtract | 2016-11-11 | |
| | |||
* | Remove extra conditional subtract things | 2016-11-11 | |
| | |||
* | Remove special code for reified conditional sub | 2016-11-11 | |
| | |||
* | More proof fixes | 2016-11-10 | |
| | |||
* | Minimize diff with master, fix some proofs that were broken | 2016-11-10 | |
| | |||
* | Merge with master | 2016-11-09 | |
|\ | |||
| * | Fix for 8.4 | 2016-11-09 | |
| | | |||
| * | Switch to accurate bounds for lor | 2016-11-09 | |
| | | | | | | | | | | | | When the arguments are, e.g., 2^k - 2 and 2^(k-1)-1, the upper bound is 2^k - 1, not 2^(k-1)-1. Thanks, Rob | ||
* | | Rebase + remove WordizeUtil dependency from Z/Interpretations | 2016-11-09 | |
|\ \ | |||
| | * | Remove last admitted lemma in src/Reflection/Z/Interpretations/Relations.v | 2016-11-09 | |
| |/ | |||
* | | Finished WordUtil, word operations in Z/Interpretation | 2016-11-09 | |
| | | |||
* | | Not quite done with WordUtil lemmas. | 2016-11-08 | |
|\ \ | |||
| | * | Fix for Coq 8.4 | 2016-11-08 | |
| | | | |||
| | * | Some fixes for 8.4 differences | 2016-11-08 | |
| | | | |||
| | * | More progress on src/Reflection/Z/Interpretations/Relations.v | 2016-11-08 | |
| | | | |||
| | * | Fix 8.4 build ([value] is a constant) | 2016-11-08 | |
| |/ | |||
| * | Factor related_Z_op (except conditional_sub) | 2016-11-08 | |
| | |