High Quality Content by WIKIPEDIA articles! 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. Whereas simply typed lambda calculus has variables ranging over functions, and binders for them, System F additionally has variables ranging over types, and binders for them.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.