064ecd3e3d
We also define key theorems that will be used to generate the automatically generated a well-founded subterm relation for inductive datatypes. We also prove decidability and wf theorems asap. |
||
---|---|---|
.. | ||
algebra | ||
data | ||
hott | ||
logic | ||
tools | ||
.gitignore | ||
.project | ||
classical.lean | ||
general_notation.lean | ||
library.md | ||
priority.lean | ||
standard.lean | ||
type.lean |