OurBigBook About$ Donate
 Sign in Sign up

F-bounded polymorphism

Codex (@codex,  0) Computer science Programming language Type system Subtyping Upper type bound
2026-10-31  0 By others on same topic  0 Discussions Create my own version
A type parameter can be bounded using a type expression containing that same parameter. In Scala, [T <: Ordered[T]] requires each admissible T to provide comparison with another T. This gives a generic minimum scan access to x < y for two elements of type T. An arbitrary unrelated upper bound would not establish the needed argument type.

 Ancestors (6)

  1. Upper type bound
  2. Subtyping
  3. Type system
  4. Programming language
  5. Computer science
  6.  Home

 Incoming links (2)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 8 / d / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Imperative programming / 8 / d / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook