Bounded Polymorphism

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.

Overview

The purpose of bounded quantification is to allow for polymorphic functions to depend on some specific behaviour of objects instead of type inheritance. It assumes a record-based model for object classes, where every class member is a record element and all class members are named functions. Object attributes are represented as functions that take no argument and return an object. The specific behaviour is then some function name along with the types of the arguments and the return type. Bounded quantification allows to considers all objects with such a function. An example would be a polymorphic min function that considers all objects that are comparable to each other.

F-bounded quantification

''F''-bounded quantification or recursively bounded quantification, introduced in 1989, allows for more precise typing of functions that are applied on recursive types. A recursive type is one that includes a function that uses it as a type for some argument or its return value.''F''-bounded polymorphism for object-oriented programming. Canning, Cook, Hill, Olthof and Mitchell. http://dl.acm.org/citation.cfm?id=99392

Example

This kind of type constraint can be expressed in Java with a generic interface. The following example demonstrates how to describe types that can be compared to each other and use this as typing information in polymorphic functions. The Test.min function uses simple bounded quantification and does not preserve the type of the assigned types, in contrast with the Test.Fmin function which uses F-bounded quantification.

In mathematical notation, the types of the two functions are

:min: ∀ T, ∀ S ⊆ . S → S → S
:Fmin: ∀ T ⊆ Comparable T → T → T

where

:Comparable =

interface Comparable

class Integer implements Comparable

class String implements Comparable

class Test

See also

* Covariance and contravariance (computer science)
* Curiously recurring template pattern
* Wildcard (Java)

Notes

References

*
* Peter S. Canning, William R. Cook, Walter L. Hill, John C. Mitchell, and William Olthoff
"F-bounded polymorphism for object-oriented programming"
In ''Conference on Functional Programming Languages and Computer Architecture'', 1989.
* Benjamin C. Pierce "Intersection types and bounded polymorphism". ''Lecture Notes in Computer Science'' 664, 1993.
* Gilad Bracha, Martin Odersky, David Stoutamire, and Philip Wadler. "Making the future safe for the past: Adding genericity to the Java programming language". In ''Object-Oriented Programming: Systems, Languages, Applications'' (OOPSLA). ACM, October 1998.
* Andrew Kennedy and Don Syme. "Design and Implementation of Generics for the .NET Common Language Runtime". In ''Programming Language Design and Implementation'', 2001.
* {{cite book, last=Pierce, first=Benjamin C., authorlink=Benjamin C. Pierce, title=Types and Programming Languages, publisher=MIT Press, date=2002, isbn=978-0-262-16209-8, Chapter 26: Bounded quantification

External links

Bounded Polymorphism
at the Portland Pattern Repository

"F-bounded Polymorphism"
in ''The Cecil Language: Specification and Rationale''

Polymorphism (computer science)
Object-oriented programming
Type theory
Articles with example Java code