System F (also polymorphic lambda calculus or second-order lambda calculus) is a typed lambda calculus that introduces, to simply typed lambda calculus, a mechanism of universal quantification over types. System F formalizes parametric polymorphism in programming languages, thus forming a theoretical basis for languages such as Haskell and ML. It was discovered independently by logician Jean-Yves Girard (1972) and computer scientist John C. Reynolds.
Whereas simply typed lambda calculus has variables ranging over terms, and binders for them, System F... plus
Ce site utilise des cookies. Pour plus d'informations, cliquez ce lien. Vous pouvez lire ici quels cookies nous plaçons, pourquoi et quels cookies "tiers" éventuels peuvent être ajoutés.