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... meer
Deze site maakt gebruik van cookies. Voor meer informatie volgt u deze link.
Hierop is meer te lezen over welke cookies wij plaatsen en waarom en welke mogelijke '3rd-party' cookies er bij kunnen komen.