Unlock: Type Theory
Types as propositions, terms as proofs. Simply typed lambda calculus, the Curry-Howard correspondence, dependent types, and connections to programming language foundations and formal verification.
1 Prerequisites0 Mastered0 Working1 Gaps
Prerequisite mastery0%
Recommended probe
Basic Logic and Proof Techniques is your weakest prerequisite with available questions. You haven't been assessed on this topic yet.
Type TheoryTARGET
Not assessed18 questions
Sign in to track your mastery and see personalized gap analysis.