Matches in DBpedia 2014 for { <http://dbpedia.org/resource/System_F> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- System_F abstract "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).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. As an example, the fact that the identity function can have any type of the form A→ A would be formalized in System F as the judgmentwhere is a type variable. The upper-case is traditionally used to denote type-level functions, as opposed to the lower-case which is used for value-level functions. (The superscripted means that the bound x is of type the expression after the colon is the type of the lambda expression preceding it.)As a term rewriting system, System F is strongly normalizing. Type inference in System F (without explicit type annotations) is undecidable however. Under the Curry–Howard isomorphism, System F corresponds to the fragment of second-order intuitionistic logic that uses only universal quantification. System F can be seen as part of the lambda cube, together with even more expressive typed lambda calculi, including those with dependent types.".
- System_F wikiPageExternalLink v=onepage&q=Nicolas%20Bourbaki&f=false.
- System_F wikiPageExternalLink Proofs%2BTypes.html.
- System_F wikiPageExternalLink Wells:Typability-and-Type-Checking-in-the-Second-Order-Lambda-Calculus-Are-Equivalent-and-Undecidable:LICS-1994.ps.gz.
- System_F wikiPageExternalLink SystemF.
- System_F wikiPageID "767637".
- System_F wikiPageRevisionID "585270669".
- System_F hasPhotoCollection System_F.
- System_F subject Category:1971_in_computer_science.
- System_F subject Category:1974_in_computer_science.
- System_F subject Category:Lambda_calculus.
- System_F subject Category:Polymorphism_(computer_science).
- System_F subject Category:Type_theory.
- System_F comment "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 label "Sistema F".
- System_F label "System F".
- System_F label "System F".
- System_F label "System F".
- System_F label "Système F".
- System_F label "Система F".
- System_F label "系统F".
- System_F sameAs Σύστημα_F.
- System_F sameAs Système_F.
- System_F sameAs Sistema_F.
- System_F sameAs System_F.
- System_F sameAs System_F.
- System_F sameAs m.039vd_.
- System_F sameAs Q2552799.
- System_F sameAs Q2552799.
- System_F wasDerivedFrom System_F?oldid=585270669.
- System_F isPrimaryTopicOf System_F.