High Quality Content by WIKIPEDIA articles! In type theory, a branch of mathematical logic, in a given typed calculus. In the case of simply typed lambda calculus, a type has an inhabitant if and only if its corresponding proposition is a tautology of minimal implicative logic. Similarly, a System F type has an inhabitant if and only if its corresponding proposition is a tautology of second-order logic. For most typed calculus, the type inhabitation problem is very hard. Richard Statman proved that for simply typed lambda calculus the type inhabitation problem is PSPACE-complete. For other calculi, like System F, the problem is even undecidable.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.