system F
E588093
System F is a polymorphically typed lambda calculus that extends the simply typed lambda calculus with universal quantification over types, forming a foundational system for studying parametric polymorphism in programming languages and type theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| system F canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6370908 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: system F Context triple: [Scott encoding, relatedTo, system F]
-
A.
System1
System1 is a digital marketing and customer acquisition company specializing in data-driven advertising and online performance-based media.
-
B.
System
System is a core .NET namespace that provides fundamental classes and base types essential for building .NET applications.
-
C.
Sistema
Sistema is a consumer food storage and kitchenware brand known for its reusable plastic containers and lunch solutions.
-
D.
SYSM
SYSM is a prestigious Indian military decoration awarded for the highest degree of distinguished service during wartime, used as post-nominal letters by its recipients.
-
E.
System M
System M is the analog television broadcasting system used in NTSC countries, characterized by 525 lines per frame and a 60 Hz field rate.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: system F Target entity description: System F is a polymorphically typed lambda calculus that extends the simply typed lambda calculus with universal quantification over types, forming a foundational system for studying parametric polymorphism in programming languages and type theory.
-
A.
System1
System1 is a digital marketing and customer acquisition company specializing in data-driven advertising and online performance-based media.
-
B.
System
System is a core .NET namespace that provides fundamental classes and base types essential for building .NET applications.
-
C.
Sistema
Sistema is a consumer food storage and kitchenware brand known for its reusable plastic containers and lunch solutions.
-
D.
SYSM
SYSM is a prestigious Indian military decoration awarded for the highest degree of distinguished service during wartime, used as post-nominal letters by its recipients.
-
E.
System M
System M is the analog television broadcasting system used in NTSC countries, characterized by 525 lines per frame and a 60 Hz field rate.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
formal system
ⓘ
polymorphically typed lambda calculus ⓘ typed lambda calculus ⓘ |
| canEncode |
Church encodings of data structures
ⓘ
algebraic data types ⓘ existential types ⓘ product types ⓘ sum types ⓘ |
| extends | simply typed lambda calculus ⓘ |
| formalizes | parametric polymorphism ⓘ |
| hasAlternativeName |
polymorphic lambda calculus
ⓘ
second-order lambda calculus ⓘ |
| hasCorrespondenceWith | second-order intuitionistic logic ⓘ |
| hasFeature |
impredicative polymorphism
ⓘ
type abstraction ⓘ type application ⓘ type variables ⓘ |
| hasJudgmentForm | Γ ⊢ t : τ ⓘ |
| hasKindOfPolymorphism | parametric polymorphism ⓘ |
| hasProperty |
Church–Rosser property
ⓘ
confluent reduction ⓘ strong normalization ⓘ subject reduction ⓘ type safety ⓘ |
| hasQuantificationLevel | second-order ⓘ |
| hasRestriction | no general algorithm for type inference ⓘ |
| hasTermLanguage | lambda terms with type abstraction and application ⓘ |
| hasTypeSystem | second-order type system ⓘ |
| hasTypicalNotation | ∀α. τ for universal type quantification ⓘ |
| influenced |
Girard–Reynolds polymorphism in programming languages
ⓘ
Hindley–Milner type system ⓘ System Fω ⓘ
linked to:
System F
|
| isBasisFor | design of polymorphic type systems ⓘ |
| isMoreExpressiveThan | simply typed lambda calculus ⓘ |
| isSubsetOf |
Calculus of Constructions (in terms of expressiveness hierarchy)
ⓘ
linked to:
calculus of constructions
|
| isUndecidable |
typability problem
ⓘ
type inhabitation problem ⓘ |
| relatedTo | Curry–Howard correspondence ⓘ |
| requires | explicit type annotations for full type checking ⓘ |
| supports | universal quantification over types ⓘ |
| usedFor |
studying polymorphism in programming languages
ⓘ
studying type abstraction ⓘ |
| usedIn |
programming language theory
ⓘ
type theory ⓘ |
| wasIndependentlyIntroducedBy | John C. Reynolds ⓘ |
| wasIntroducedBy | Jean-Yves Girard ⓘ |
| wasIntroducedInYear | 1972 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: system F Description of subject: System F is a polymorphically typed lambda calculus that extends the simply typed lambda calculus with universal quantification over types, forming a foundational system for studying parametric polymorphism in programming languages and type theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.