Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Bounded quantification
open-in-new
<p>In <a href="/facts/Type_theory/xj0xzVqI">type theory</a>, bounded quantification (also bounded polymorphism or constrained genericity) refers to <a href="/facts/Universally_quantified/agNmvJKN">universal</a> or <a href="/facts/Existential_type/Tz0bAMS9">existential quantifiers</a> which are restricted ("bounded") to range only over the subtypes of a particular type. Bounded quantification is an interaction of <a href="/facts/Parametric_polymorphism/ETb0G1zd">parametric polymorphism</a> with <a href="/facts/Subtyping/0L9t8twv">subtyping</a>. Bounded quantification has traditionally been studied in the <a href="/facts/Functional_programming/cdxqPEIM">functional</a> setting of <a href="/facts/System_F-sub/sJ73ej8w">System F<:</a>, but is available in modern <a href="/facts/Object-oriented_language/TxNMEcao">object-oriented languages</a> supporting <a href="/facts/Parametric_polymorphism/ETb0G1zd">parametric polymorphism</a> (<a href="/facts/Generic_programming/kqtqJk7p">generics</a>) such as <a href="/facts/Java_(programming_language)/9ScgFyAL">Java</a>, <a href="/facts/C_Sharp_(programming_language)/UC2gxeyb">C#</a> and <a href="/facts/Scala_(programming_language)/ebL8o6AK">Scala</a>. </p>