Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Work around an anomaly in pretyping/constr_matching | Jason Gross | 2017-04-03 |
| | |||
* | Document some tactics from Jade's pipleine side | Jason Gross | 2017-04-03 |
| | | | | | Also use more definitions and fewer tactics, and more general definitions. | ||
* | Fuse Pipeline.{Composition,ReflectiveTactics} | Jason Gross | 2017-04-03 |
| | | | | | They need to be modified together to keep track of the ordering of side-conditions. | ||
* | Fix missing unfold in proof | Jason Gross | 2017-04-03 |
| | |||
* | Add missing parentheses | Jason Gross | 2017-04-03 |
| | |||
* | Use projT2_map | Jason Gross | 2017-04-03 |
| | |||
* | Finally, a fully working IntegrationTest | Jason Gross | 2017-04-03 |
| | |||
* | WIP | Jason Gross | 2017-04-03 |
| | |||
* | WIP on integration | Jason Gross | 2017-04-03 |
| | |||
* | Rework and doc reflective pipeline (more Gallina) | Jason Gross | 2017-04-03 |
| | |||
* | Add an initial stab at doing the pipeline mostly in Gallina | Jason Gross | 2017-04-03 |
| | |||
* | Add a bit more documentation | Jason Gross | 2017-04-03 |
| | |||
* | Pipeline: reduce away reflective constants | Jason Gross | 2017-04-03 |
| | | | | | This makes it so that the term that shows up when the reflective subgoal is solved doesn't include things like [Interp] | ||
* | Start adding comments to Pipeline/ReflectiveTactics.v | Jason Gross | 2017-04-03 |
| | |||
* | Rename PreDefinitions to OutputType | Jason Gross | 2017-04-03 |
| | | | | As per https://github.com/mit-plv/fiat-crypto/pull/141#discussion_r109312653 | ||
* | Add and update documentation in Pipeline/Glue.v | Jason Gross | 2017-04-03 |
| | |||
* | An approximately first stab DeBruijn word-size-sel | Jason Gross | 2017-04-03 |
| | |||
* | Remove old reflective pipeline, making way the new | Jason Gross | 2017-04-03 |
| | |||
* | Remove everything after the individual reified ops | Jason Gross | 2017-04-03 |
| | | | | | This includes extraction and associated targets. I've left the .hs files lying around, currently unused. | ||
* | Fix parsing issue | Jason Gross | 2017-04-03 |
| | |||
* | Add proj2_sig_map | Jason Gross | 2017-04-03 |
| | |||
* | Don't require keeping track of which goals have evars; check that in tactics | Jason Gross | 2017-04-03 |
| | |||
* | Add UnifyAbstractReflexivity tactics | Jason Gross | 2017-04-03 |
| | |||
* | Fix a typo | Jason Gross | 2017-04-02 |
| | |||
* | Add projT2_map | Jason Gross | 2017-04-02 |
| | |||
* | Add Tactics.EvarExists | Jason Gross | 2017-04-02 |
| | |||
* | Add Util.SigmaAssoc | Jason Gross | 2017-04-02 |
| | |||
* | clear before abstract so we can handle existentials | Jason Gross | 2017-04-02 |
| | |||
* | Add ap_transport to Equality.v | Jason Gross | 2017-04-02 |
| | |||
* | Add InterpEta | Jason Gross | 2017-04-02 |
| | | | | It's a version of [Interp] that works even when there are destructuring lets. | ||
* | Remove the bits of the new reflective pipeline in master | Jason Gross | 2017-04-02 |
| | | | | This way, we can keep all of new pipeline code together in the PR | ||
* | Remove all the .v files in SpecificGen | Jason Gross | 2017-04-02 |
| | | | | This gets most of the way to 10 in #14. | ||
* | More extensive comment in NewBaseSystem | Jason Gross | 2017-04-02 |
| | | | | As per Andres' request on #138. | ||
* | Work around bug #5434 | Jason Gross | 2017-04-02 |
| | | | | | | | This is https://coq.inria.fr/bugs/show_bug.cgi?id=5434, [vm_compute] breaks an invariant asserted on line 115 of pretyping/constr_matching.ml. This was triggering whenever we tried to reify one of the operations. | ||
* | Coalesce Tuple.pointwise2 and Tuple.fieldwise | Jason Gross | 2017-04-02 |
| | | | | | | We don't need both of them. We keep the definition of pointwise2 because it's needed for reification to work, and we keep the name of fieldwise because it's used in more places. This closes #137. | ||
* | Generalize Z.InterpInlineConst | Jason Gross | 2017-04-02 |
| | |||
* | Better version of inversion_ProcessedReflectivePackage | Jason Gross | 2017-04-02 |
| | | | | Now it doesn't introduce needless dependencies | ||
* | Add inversion_ProcessedReflectivePackage | Jason Gross | 2017-04-02 |
| | |||
* | Add PreDefinitions pipeline file | Jason Gross | 2017-04-02 |
| | |||
* | Add Z instantiations of InlineConst | Jason Gross | 2017-04-02 |
| | |||
* | Add Z.Bounds.MapCastByDeBruijn instantiation | Jason Gross | 2017-04-02 |
| | |||
* | Add Z instantiation of MapCastByDeBruijnInterp | Jason Gross | 2017-04-02 |
| | |||
* | Add reflective_interp rewrite db | Jason Gross | 2017-04-02 |
| | |||
* | Rewrite in Op arguments before rewriting in Op | Jason Gross | 2017-04-01 |
| | | | | This fixes the rewriter to actually simplify deeply nested expressions. | ||
* | Also do eta under lets in Reflection/Eta.v | Jason Gross | 2017-04-01 |
| | |||
* | Add an initial glue file in the pipeline, no option in bounds | Jason Gross | 2017-04-01 |
| | | | | | | | We can do bounds analysis without options. Also, add some tactics from another branch for the glue to start the reflective pipeline. | ||
* | Fix definition of BoundedWord | Jason Gross | 2017-04-01 |
| | | | | | | | We need to take log2, because wordT takes lg(wordsize). We need to pass None rather than Some, because None means "the original output type of the function we're reifying is a tuple of Z" (as opposed to a tuple of words), which is the situation we're in. | ||
* | Split off BoundedWord.v from IntegrationTest.v | Jason Gross | 2017-04-01 |
| | |||
* | Add back word hex constant notations | Jason Gross | 2017-04-01 |
| | |||
* | Add RenameBinders | Jason Gross | 2017-04-01 |
| | | | | | It will someday allow for nicely named PHOAS binders (conditional on https://coq.inria.fr/bugs/show_bug.cgi?id=5414 being solved). |