d4f2bb77b8
To make the equation compiler more convenient to use, we will add a couple of preprocessing steps. This commit adds the first one of them. In this step, we use type inference to refine pattern variables, and we relax the restrictions on inaccessible annotations. We will also add a preprocessing step that implements the "complete transition" step before we execute the elim_match step. |
||
|---|---|---|
| .. | ||
| basic.lean | ||
| bitwise.lean | ||
| default.lean | ||
| div.lean | ||
| gcd.lean | ||
| lemmas.lean | ||
| pow.lean | ||