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).
known for
Bounded quantifierCalculus of constructionsCategorical logicChurch encodingCry (System F song)Curry–Howard correspondenceDependent typeF omegaFixed-point combinatorFωGirard-Reynolds isomorphismGiuseppe OttavianiGlasgow Haskell CompilerHigher-order polymorphic lambda calculusHindley–Milner type systemHistory of programming languagesJean-Yves GirardJohn C. ReynoldsKind (type theory)Lambda calculusLambda cubeList of computer scientistsList of important publications in computer scienceList of mathematical logic topicsList of performers on Top of the PopsList of programmersList of undecidable problemsMogensen–Scott encodingNormalization property (abstract rewriting)Oakenfold AnthemsPOPLmark challengeParametric polymorphismPegasus in popular culturePer Martin-LöfPolymorphic Lambda CalculusPolymorphic lambda calculusPolymorphism (computer science)Programming language theoryRank 1Second-order arithmetic
Link from a Wikipage to another Wikipage
primaryTopic
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).
has abstract
Il sistema F, anche conosciuto ...... di riscrittura di termini, è .
@it
Le système F est un formalisme ...... calcul » et son assimilation .
@fr
System F – jeden z wariantów r ...... wystąpienie zmiennej ten sam).
@pl
System F, also known as the (G ...... System F was picked by chance.
@en
System Fは型付きラムダ計算の一体系で,単純型付きラム ...... とともに,ラムダ・キューブの一角であるとみなすこともできる.
@ja
To Σύστημα F, επίσης γνωστό ως ...... αυτών με εξαρτώμενους τύπους.
@el
Система F (полиморфное лямбда- ...... типа любого допустимого типа.
@ru
系统F,也叫做多态lambda演算或二阶lambda演算,是 ...... 的lambda演算一起,可被看作Lambda立方体的一部分。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,016,004,357
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Il sistema F, anche conosciuto ...... di riscrittura di termini, è .
@it
Le système F est un formalisme ...... t d'exprimer du polymorphisme.
@fr
System F – jeden z wariantów r ...... do U, to również należy do U.
@pl
System F, also known as the (G ...... ntist John C. Reynolds (1974).
@en
System Fは型付きラムダ計算の一体系で,単純型付きラム ...... とともに,ラムダ・キューブの一角であるとみなすこともできる.
@ja
To Σύστημα F, επίσης γνωστό ως ...... ε ανεξάρτητα από τον και τον .
@el
Система F (полиморфное лямбда- ...... раммирования как Haskell и ML.
@ru
系统F,也叫做多态lambda演算或二阶lambda演算,是 ...... 的lambda演算一起,可被看作Lambda立方体的一部分。
@zh
label
Sistema F
@it
System F
@en
System F
@ja
System F
@pl
Système F
@fr
Σύστημα F
@el
Система F
@ru
系统F
@zh