System F-sub
From Infogalactic: the planetary knowledge core
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
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found., Chapter 26: Bounded quantification
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This programming language theory or type theory-related article is a stub. You can help Wikipedia by expanding it. |
