diff options
| -rw-r--r-- | ANNONCE | 5 | ||||
| -rw-r--r-- | CHANGES | 4 |
2 files changed, 4 insertions, 5 deletions
@@ -27,9 +27,8 @@ on version 7.0. Marché's minimal edition distance algorithm, Buchberger's algorithm, RSA cryptographic algorithm, Stalmarck tautology checker algorithm, the Fundamental Theorem of Algebra and ZFC set theory). - - new tactics NewDestruct, NewInduction and Assert intended to - improve the behaviour of previous Elim and Induction, Case and - Destruct, and Cut tactics + - new induction tactics NewDestruct and NewInduction + - new tactic Assert for forward reasoning - known-bugs fixed - excessive memory use mainly fixed @@ -13,8 +13,8 @@ Main novelties References are to Coq V7.1 reference manual -- New primitive let-in construct (see section 1.2.8) -- Long names (see section 2.6) +- New primitive let-in construct (see sections 1.2.8 and ) +- Long names (see sections 2.6 and 2.7) - New high-level tactic language (see chapter 10) - Improved search facilities (see section 5.2) - New extraction algorithm managing the Type level (see chapter 17) |