Revision 92900c9f4290d631543ddf717e369c3cfd96cc22 authored by Pierre-Yves Strub on 09 December 2015, 16:46:57 UTC, committed by Pierre-Yves Strub on 09 December 2015, 16:49:49 UTC
The mechanism is to forbid non-keyed matching in `rewrite` when LHS && RHS of the rewriting equation are convertible. Currently, the whole `rewrite` is rejected if the matching succeeds but the result would result in a identity rewriting. A better mechanism should embed the identity detection rewriting mechanism into the form matching one.
1 parent b3f11a9
File | Mode | Size |
---|---|---|
config | ||
easycrypt | ||
scripts | ||
Makefile | -rw-r--r-- | 2.6 KB |
emacs.local.rc | -rw-r--r-- | 146 bytes |
pg-4.2.patch | -rw-r--r-- | 2.1 KB |
proof-site.patch | -rw-r--r-- | 348 bytes |
Computing file changes ...