New answers tagged

2

Spurred by comments in Pierre Marie's answer, I'll add some clarification on the difference between type checking and type synthesis. Generally, type checking in a dependent type system is designed to be decidable up to normalization for fully annotated terms, that is, $\lambda x : T.t$ and $\Pi x : T. U$ for example (you need type annotations in other ...


Top 50 recent answers are included