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
COPYRIGHT.yaml
entities:
IMDEA : "IMDEA Software Institute"
INRIA : "Inria"
copyrights:
- pattern: ["src/*.ml*", "src/*/*.ml*"]
style: "ocaml"
license: "CeCILL-C-V1"
copyrights:
- { who: "IMDEA", date: "2012--2015" }
- { who: "INRIA", date: "2012--2015" }
- pattern: ["theories/*.ec", "theories/*/*.ec*"]
style: "ocaml"
license: "CeCILL-B-V1"
copyrights:
- { who: "IMDEA", date: "2012--2015" }
- { who: "INRIA", date: "2012--2015" }
Computing file changes ...