System F
A kind of typed lambda calculus that introduces a mechanism of universal quantification over types.
Proper noun
- A kind of typed lambda calculus that introduces a mechanism of universal quantification over types.
A kind of typed lambda calculus that introduces a mechanism of universal quantification over types.