4a36f843f7
I changed the definition of pow so that a^(succ n) reduces to a * a^n rather than a^n * a. This has the nice effect that on nat and int, where multiplication is defined by recursion on the right, a^1 reduces to a, and a^2 reduces to a * a. The change was a pain in the neck, and in retrospect maybe not worth it, but oh, well. |
||
|---|---|---|
| .. | ||
| examples | ||
| basic.lean | ||
| bigops.lean | ||
| bquant.lean | ||
| default.lean | ||
| div.lean | ||
| fact.lean | ||
| find.lean | ||
| gcd.lean | ||
| nat.md | ||
| order.lean | ||
| pairing.lean | ||
| parity.lean | ||
| power.lean | ||
| sqrt.lean | ||
| sub.lean | ||