812c47d463
The main issue is nontermination for problems that do not have solution. When using dependent coercions, we keep creating goals of the form `CoeSort ... (coe (coe (coe ...))) ...`. Same for `CoeFun`. I am considering simplifying it even further, and making sure `CoeDep` can be used at most once in a sequence of coercions `CoeTC`. Another option is to use a very small amount of fuel to guarantee termination when solving coercion TC problems. cc @Kha @dselsam |
||
|---|---|---|
| .. | ||
| bench | ||
| compiler | ||
| elabissues | ||
| ir | ||
| lean | ||
| playground | ||
| plugin | ||