3 ms·
Any dependent type theory is "semi-automated" because judgemental equality computes normal forms, there is no reason it should be this way, other than convenien
by voxl 5y ago
Any dependent type theory is "semi-automated" because judgemental equality computes normal forms, there is no reason it should be this way, other than convenience of course.