coq - The formal proof system

Age	Commit message (Expand)	Author
2014-10-09	A version of convert_concl and convert_hyp in new proof engine.	Hugo Herbelin
2014-10-06	decl_mode: stay in declarative mode	Enrico Tassi
2014-09-30	Add syntax for naming new goals in refine: writing ?[id] instead of _	Hugo Herbelin
2014-09-17	Revert specific syntax for primitive projections, avoiding ugly	Matthieu Sozeau
2014-09-12	Uniformisation of the order of arguments env and sigma.	Hugo Herbelin
2014-09-12	Referring to evars by names. Added a parser for evars (but parsing of	Hugo Herbelin
2014-09-05	Removing the old implementation of clear_body.	Pierre-Marie Pédrot
2014-09-04	Revert the two previous commits. I was testing in the wrong branch.	Pierre-Marie Pédrot
2014-09-04	Removing the old implementation of clear_body.	Pierre-Marie Pédrot
2014-09-04	Typing.sort_of does not leak evarmaps anymore.	Pierre-Marie Pédrot
2014-08-18	A reorganization of the "assert" tactics (hopefully uniform naming	Hugo Herbelin
2014-08-18	Reorganisation of intropattern code	Hugo Herbelin
2014-08-05	Experimentally adding an option for automatically erasing an	Hugo Herbelin
2014-08-05	Adding a syntax "enough" for the variant of "assert" with the order of	Hugo Herbelin
2014-08-05	STM: new "par:" goal selector, like "all:" but in parallel	Enrico Tassi
2014-06-12	Passing some tactics to the new monad type.	Pierre-Marie Pédrot
2014-06-06	Dead code.	Hugo Herbelin
2014-05-06	This commit adds full universe polymorphism and fast projections to Coq.	Matthieu Sozeau
2014-03-05	Remove many superfluous 'open' indicated by ocamlc -w +33	Pierre Letouzey
2014-02-24	Stack operations of Reductionops in Reductionops.Stack	Pierre Boutillier
2014-02-16	Removing non-marshallable data from the Agram constructor. Instead of	Pierre-Marie Pédrot
2013-12-17	Removing the need of evarmaps in constr internalization.	Pierre-Marie Pédrot
2013-11-27	Getting rid of goal-dependency in declarative mode argument evaluation.	Pierre-Marie Pédrot
2013-11-27	Adding generic solvers to term holes. For now, no resolution mechanism nor	Pierre-Marie Pédrot
2013-11-08	Porting Tactics.assumption to the new engine.	ppedrot
2013-11-02	Adds a new goal selector "all:".	aspiwack
2013-11-02	The tactic [admit] exits with the "unsafe" status.	aspiwack
2013-11-02	Cleanup of comments.	aspiwack
2013-11-02	Plug back the declarative mode.	aspiwack
2013-11-02	Makes the new Proofview.tactic the basic type of Ltac.	aspiwack
2013-10-24	More monomorphic List.mem + List.assoc + ...	letouzey
2013-10-24	Turn many List.assoc into List.assoc_f	letouzey
2013-10-05	Moving side effects into evar_map. There was no reason to keep another	ppedrot
2013-09-30	STM: better handle proof modes	gareuselesinge
2013-09-27	Removing a bunch of generic equalities.	ppedrot
2013-09-02	Removing more association lists in Constrintern.	ppedrot
2013-08-08	Vernac classification streamlined (handles VERNAC EXTEND)	gareuselesinge
2013-08-08	State Transaction Machine	gareuselesinge
2013-08-03	Replacing an association list by a map in globalizing environment.	ppedrot
2013-06-27	Removed the distinction between generic Ltac vars and Let/Intro	ppedrot
2013-06-21	Splitted up Genarg in four different levels:	ppedrot
2013-06-21	Cutting the dependency of Genarg in constr_expr, glob_constr	ppedrot
2013-06-21	Revert "parse "of" as KEYID "of""	gareuselesinge
2013-06-19	parse "of" as KEYID "of"	gareuselesinge
2013-06-18	Removing the various glob/subst/interp registering functions for	ppedrot
2013-06-06	Uniformizing generic argument types.	ppedrot
2013-05-09	A uniformization step around understand_* and interp_* functions.	herbelin
2013-04-29	Splitting Term into five unrelated interfaces:	ppedrot
2013-03-23	Minor code cleaning in CArray / CList.	ppedrot
2013-03-13	Restrict (try...with...) to avoid catching critical exn (part 5)	letouzey