Advanced
Compilers & Programming Language Theory
Q90 / 100
What is the difference between System F and System Fω?
Correct! Well done.
Incorrect.
The correct answer is B) System F adds universal quantification over types (∀T.T→T). System Fω further adds type-level lambda abstraction (type constructors as functions of kinds), enabling higher-kinded types
B
Correct Answer
System F adds universal quantification over types (∀T.T→T). System Fω further adds type-level lambda abstraction (type constructors as functions of kinds), enabling higher-kinded types
Explanation
System F (Girard/Reynolds): polymorphic lambda calculus with ∀. System Fω adds kind system: ⋆ (types), ⋆→⋆ (type constructors), (⋆→⋆)→⋆ (higher-kinded). Haskell uses a simplified System Fω-like core.
Progress
90/100