go-v.orgcodex
Menu
Page tools

codex · Philosophy

Bounded quantification

In type theory, bounded quantification (also bounded polymorphism or constrained genericity) refers to universal or existential quantifiers which are restricted ("bounded") to range only over the subtypes of a particular type. Bounded quantification is an interaction of parametric polymorphism with subtyping. Bounded quantification has traditionally been studied in the functional setting of System F<:, but is available in modern object-oriented languages supporting parametric polymorphism (generics) such as Java, C# and Scala.

Wikipedia contributors, "Bounded quantification", Wikipedia, revision 1385097601, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex