| Commit message (Expand) | Author | Age |
|---|
| * | Fixed bug #2398: destruct ex2/sig2/sigT2 in Program, patch by Paolo Herms. |  msozeau | 2011-06-07 |
| * | BinNat: N.binary_rect is now a definition instead of an opaque proof |  letouzey | 2011-05-05 |
| * | Peano recursion for positive: integration of Daniel Schepler's code | letouzey | 2011-05-05 |
| * | Minimal lemmas about Z.gt, N.gt and co | letouzey | 2011-05-05 |
| * | Modularisation of Znat, a few name changed elsewhere | letouzey | 2011-05-05 |
| * | BinInt: Z.add become the alternative Z.add' | letouzey | 2011-05-05 |
| * | Modularization of BinInt, related fixes in the stdlib | letouzey | 2011-05-05 |
| * | Modularization of Nnat | letouzey | 2011-05-05 |
| * | Wf.iter_nat becomes Peano.nat_iter (with an implicit arg) | letouzey | 2011-05-05 |
| * | BinNatDef containing all functions of BinNat, misc adaptations in BinPos | letouzey | 2011-05-05 |
| * | BinPosDef: a module with all code about positive, later Included in BinPos | letouzey | 2011-05-05 |
| * | Modularization of BinNat + fixes of stdlib | letouzey | 2011-05-05 |
| * | Modularization of Pnat | letouzey | 2011-05-05 |
| * | Modularization of BinPos + fixes in Stdlib | letouzey | 2011-05-05 |
| * | Definitions of positive, N, Z moved in Numbers/BinNums.v | letouzey | 2011-05-05 |
| * | Zdiv: results about eqm (the equality modulo some N) under a section | letouzey | 2011-05-05 |
| * | Better comments and organisation in Datatypes.v | letouzey | 2011-05-05 |
| * | Merge branch 'subclasses' into coq-trunk | msozeau | 2011-05-05 |
| * | As many notation for for vectors as for List. |  pboutill | 2011-05-03 |
| * | Fixing an "apply -> ... in hyp" bug (the hyp was considered as a fixed |  herbelin | 2011-04-28 |
| * | Fixed a bug of destruct which was sometimes forgetting local definitions behi... | herbelin | 2011-04-24 |
| * | Fix generated script for NMake, a rewrite necessitates full conversion for | msozeau | 2011-04-18 |
| * | - Improve unification (beta-reduction, and same heuristic as evarconv for red... | msozeau | 2011-04-13 |
| * | Fix scripts relying on unification not doing any beta reduction. | msozeau | 2011-04-13 |
| * | Unify meta types with the right flags, add betaiotazeta reduction to unificat... | msozeau | 2011-04-13 |
| * | A module out of Program to have list notations (bug 2463) | pboutill | 2011-04-08 |
| * | Cyclic: a small optimisation with nice effect on BigN.mul (thinks Benjamin) | letouzey | 2011-03-30 |
| * | - Fix solve_simpl_eqn which was cheking instances types in the wrong environm... | msozeau | 2011-03-23 |
| * | Init: some results in Type should rather be Defined than Qed | letouzey | 2011-03-21 |
| * | CompareSpec: a slight generalization/reformulation of CompSpec | letouzey | 2011-03-17 |
| * | - Add modulo_delta_types flag for unification to allow full | msozeau | 2011-03-13 |
| * | Inference of match predicate produces ill-typed unification problem, | msozeau | 2011-03-11 |
| * | ZBits,ZdivEucl,ZDivFloor: a few lemmas with weaker preconditions | letouzey | 2011-03-10 |
| * | Simplify proofs in Permutation using generalized rewriting. | msozeau | 2011-03-04 |
| * | - Allow rewriting under abitrary products, not just those in Prop. | msozeau | 2011-02-28 |
| * | Add a flag to hide obligations in Program-generated terms under an | msozeau | 2011-02-28 |
| * | BigQ : setting correct arguments scopes | letouzey | 2011-02-23 |
| * | In Program obligation, do not use auto on non-proposition goals by | msozeau | 2011-02-17 |
| * | - Use transparency information all the way through unification and | msozeau | 2011-02-17 |
| * | Fix compilation issues. | msozeau | 2011-02-16 |
| * | - Fix treatment of globality flag for typeclass instance hints (they | msozeau | 2011-02-14 |
| * | An automatic substitution of scope at functor application | letouzey | 2011-02-11 |
| * | Annotations at functor applications: | letouzey | 2011-02-11 |
| * | Remove obsolete TheoryList |  glondu | 2011-02-10 |
| * | Vectors fully use implicit arguments | pboutill | 2011-02-10 |
| * | Fixpoints are traverse during implicits arguments search to toplevel | pboutill | 2011-02-10 |
| * | Interp a definition with the implicit arguments of its local context | pboutill | 2011-02-10 |
| * | local variables can have implicits locally | pboutill | 2011-02-10 |
| * | Data structure telling implicits of local variables is a map in the | pboutill | 2011-02-10 |
| * | A fine-grain control of inlining at functor application via priority levels | letouzey | 2011-01-31 |
msozeau
letouzey
pboutill
herbelin
glondu