Jump to content

System F-sub

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by GreenComputer (talk | contribs) at 09:22, 26 December 2019 (Importing Wikidata short description: "Typed lambda calculus" (Shortdesc helper)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The correct title of this article is System F<:. The substitution of any brackets is due to technical restrictions.

In the branch of mathematical logic known as type theory, System F<:, pronounced "F-sub", is an extension of system F with subtyping. System F<: has been of central importance to programming language theory since the 1980s[citation needed] because the core of functional programming languages, like those in the ML family, support both parametric polymorphism and record subtyping, which can be expressed in System F<:.

See also

References

  • Cardelli, Luca; Martini, Simone; Mitchell, John C.; Scedrov, Andre (1994). "An extension of system F with subtyping". Information and Computation, vol. 9. North Holland, Amsterdam. pp. 4–56. doi:10.1006/inco.1994.1013. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
  • Pierce, Benjamin (2002). Types and Programming Languages. MIT Press. ISBN 978-0-262-16209-8., Chapter 26: Bounded quantification


This programming language theory or type theory-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=System_F-sub&oldid=932493783"