English Wikipedia - The Free Encycl...
Download this dictionary
System F
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
logician
Jean-Yves Girard
(1972) and
computer scientist
John C. Reynolds
(1974).
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License