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 ∗ {\displaystyle *} and called "type", which is the kind of any data type that does not need any type parameters.
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 ∗ {\displaystyle *} and called "type", which is the kind of any data type that does not need any type parameters.
Source: Wikipedia "Kind (type theory)" · CC BY-SA 4.0
Share this article: X · Bluesky