System F Wikipedia »
System F, also known as the (Girard–Reynolds) polymorphic lambda calculus or the second-order lambda calculus, is a typed lambda calculus that differs from the simply typed lambda calculus by the introduction of a mechanism of universal quantification over types. System F thus formalizes the notion of parametric polymorphism in programming languages, and forms a theoretical basis for languages such as Haskell and ML. System F was discovered independently by the logician Jean-Yves Girard and the computer scientist John C. Reynolds.
List of links to System F fansites:
System F Links »
Register to update information, save favorites, post photos, news stories and comments.
Already A Member?