Common
Algebraic data type
Data type defined by combining other types
Algebraic data type
In computer programming, especially in functional programming and type theory, an algebraic data type (ADT) is a composite data type, i.e. a type formed by combining other types. An algebraic data type is defined by two key constructions: a sum and a product. These are sometimes referred to as "OR" and "AND" types. A sum type is a choice between possibilities. The value of a sum type can match one of several defined variants. For example, a type representing the state of a traffic light could be either Red, Amber, or Green. A shape type could be either a Circle (which stores a radius) or a Square (which stores a width). In formal terms, these variants are known as tagged unions or disjoint unions. Each variant has a name, called a constructor, which can also carry data. Enumerated types are a simple form of sum type where the constructors carry no data. A product type combines types together. A value of a product type will contain a value for each of its component types. For example, a...
Open boosters, collect cards and trade them. Free to play.
Play for free