aboutsummaryrefslogtreecommitdiff
path: root/CHANGES
diff options
context:
space:
mode:
authorGuillaume Melquiond2014-12-30 17:56:40 +0100
committerGuillaume Melquiond2014-12-30 17:56:40 +0100
commit47b8109321446ebf153807fe8a26151c7c0b003a (patch)
tree40bf81c2228a04f5208c96e9d248ac70bff7ef3f /CHANGES
parent755854f526c62b17173ef3fcd21624027ba2bc00 (diff)
Document the new behavior of lazymatch.
Diffstat (limited to 'CHANGES')
-rw-r--r--CHANGES3
1 files changed, 3 insertions, 0 deletions
diff --git a/CHANGES b/CHANGES
index 801501a2a7..075d1bcf89 100644
--- a/CHANGES
+++ b/CHANGES
@@ -143,6 +143,9 @@ Tactics
refine, use (refine c;shelve_unifiable). This can still cause
incompatibilities in rare occasions.
* New "give_up" tactic to skip over a goal without admitting it.
+- Matching using "lazymatch" was fundamentally modified. It now behaves
+ like "match" (immediate execution of the matching branch) but without
+ the backtracking mechanism in case of failure.
- New "cbn" tactic, a well-behaved simpl.
- Repeated identical calls to omega should now produce identical proof terms.
- Tactics btauto, a reflexive Boolean tautology solver.