Construct · 1 fields · 1 citations

System F: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Programming languages

a typed lambda calculus with abstraction and application over types, giving the formal core of parametric polymorphism.

In programming languages, System F refers to a typed lambda calculus with abstraction and application over types, giving the formal core of parametric polymorphism. This meaning comes from Reynolds (1974) in Lecture Notes in Computer Science.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how System F sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

abstraction4 fields · 4 citationsjingle · one word, four constructs lambda calculus1 fields · 3 citationsanchor · a standalone construct polymorphism4 fields · 7 citationsjingle · one word, four fields

References

Reynolds, J. C. (1974). Towards a theory of type structure. In Lecture Notes in Computer Science (pp. 408-425). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-06859-7_148

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct