Math 2.0

Concept

Kind (type theory)

Summary

In the area of mathematical logic and computer science known as type theory, a kind is the type of a type constructor or, less commonly, the type of a higher-order type operator (type constructor). A kind system is essentially a simply typed lambda calculus "one level up", endowed with a primitive type, usually denoted ∗* and called "type", which is the kind of any data type that does not need any type parameters.

Further reading

  1. Wikipedia, page 20627460, revision 1364770437, Kind (type theory). adopted
About this page
TagB80MD5GX2D
URIm2://B80MD5GX2D
Aliaseshigher-kind, higher-kinded, higher-kinded-type
Kindconcept
WritingW1 stated
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.