coq - the Coq proof assistant

	Commit message (Expand)	Author	Age
*	.vi files: .vo files without proofs	Enrico Tassi	2014-01-04
*	Future: allow custom action when a delegated future is forced	Enrico Tassi	2014-01-04
*	Aux_file: cache information at compile time for later (re)use	Enrico Tassi	2014-01-04
*	CoqIDE: new feedback "incomplete" to signal partial Qed	Enrico Tassi	2013-12-24
*	Future: optional greedy chaining	Enrico Tassi	2013-12-24
*	Removing the useless pattern ident genarg.	Pierre-Marie Pédrot	2013-12-19
*	Fix CoqIDE on windows	Enrico Tassi	2013-12-10
*	Removing RefArgType generic argument.	Pierre-Marie Pédrot	2013-12-01
*	Getting rid of casted_open_constr. It was only used by the	Pierre-Marie Pédrot	2013-11-30
*	Old message Interp returns the state id so that one can BackTo it	Enrico Tassi	2013-11-27
*	New option --help-XML-protocol to document the XML procol used by -ideslave	Enrico Tassi	2013-11-27
*	First stab at retrocompatible INTERP message	Enrico Tassi	2013-11-27
*	Adding a generic Int.Map using persistent arrays.	Pierre-Marie Pédrot	2013-11-26
*	Adding fold_left / fold_right function to maps.	Pierre-Marie Pédrot	2013-11-24
*	Hardening the reading function of vo files.	Pierre-Marie Pédrot	2013-11-24
*	Tweaking arity & allocation of some basic functions.	Pierre-Marie Pédrot	2013-11-24
*	Using hashes instead of strings in dynamic tags. In case of collision, an	Pierre-Marie Pédrot	2013-11-22
*	Better implementation for stores.	ppedrot	2013-11-16
*	Adding an unsafe mapping function to maps.	ppedrot	2013-11-13
*	Useless array manipulation in Rtrees.	ppedrot	2013-11-08
*	Do not compute formatter UTF8 length at creation time.	ppedrot	2013-11-08
*	Partial application hunt.	ppedrot	2013-11-07
*	better IStream.concat	ppedrot	2013-11-06
*	Adding closure-preventing functions in CArray. These functions are all	ppedrot	2013-11-04
*	Allocation friendly version of Util.iterate.	ppedrot	2013-11-04
*	Added an update function in CMap. It has the same signature as Map.add, but	ppedrot	2013-11-04
*	Manual coding of Int.Map.find. We use unsafe features, but this function	ppedrot	2013-11-04
*	Adds a tactic give_up.	aspiwack	2013-11-02
*	Adds a shelve tactic.	aspiwack	2013-11-02
*	Future: better doc + restore ~pure optimization	gareuselesinge	2013-10-31
*	More monomorphic List.mem + List.assoc + ...	letouzey	2013-10-24
*	Rtree : cleanup of the comparing code	letouzey	2013-10-24
*	Specializing hash functions for widely used types.	ppedrot	2013-10-24
*	Fix the semantic of the new List.remove_assoc_f	letouzey	2013-10-24
*	Ephemeron: add a function to run a collection cycle	gareuselesinge	2013-10-24
*	Turn many List.assoc into List.assoc_f	letouzey	2013-10-24
*	cList: a few alternative to hashtbl-based uniquize, distinct, subset	letouzey	2013-10-23
*	CList.factorize_left with a parametric equality	letouzey	2013-10-23
*	CList.prefix_of and CList.drop_prefix with a parametric equality	letouzey	2013-10-23
*	cList.index is now cList.index_f, same for index0	letouzey	2013-10-23
*	cList: set-as-list functions are now with an explicit comparison	letouzey	2013-10-23
*	Small optimizations in unification.	ppedrot	2013-10-23
*	Removing some generic equalities.	ppedrot	2013-10-22
*	Optimizing evar filters. It seems to cost quite a lot in unification,	ppedrot	2013-10-22
*	More efficient operations in CArray.	ppedrot	2013-10-22
*	New feedback message: SlaveStatus	gareuselesinge	2013-10-22
*	Future: ported to Ephemeron + exception enhancing	gareuselesinge	2013-10-18
*	Ephemeron: marshaling friendly keys	gareuselesinge	2013-10-18
*	Some more hand-written comparison functions to avoid polymorphic comparison.	xclerc	2013-10-14
*	Vcs: the gc method returns the set of nodes that were collected	gareuselesinge	2013-10-11