The polymorphic Lambda Calculus (System F) is the type system which only has one type constructor — polymorphic lambda, with typing rules Abs and App (for introduction and elimination of terms) and kinding rules TAbs and TApp (for introduction and elimination of types). It also has the Var […]
aethy.com
Original post on aethy.com