1. Fill in the gaps.
In languages, a is a collection of rules that assign a property called a to the various constructs — such as variables, expressions, functions or modules — a computer program is composed of. The main purpose a type system is to reduce errors or in computer programs by checking whether different in the program are used according to a set of rules. This checking, called , can happen at compile time ( typing), at run time ( typing), or as a combination thereof. Moreover typing rules can be strictly enforced, which is called typing, or loosely enforced, which is called typing. Languages with strong typing are called and languages with weak typing are called . Programs written in the former type of languages usually contain less .
Most programming languages include so called or built-in data types: the type which represents the values: true and ; types: data type (one with fractional ) and data type (whole ); and text data types: (sequences of characters) and .
Moreover often a programmer can their own data types. For example, a programmer might a new data type named „complex number” that would include and parts.
Many programming languages also include implementations of data types, such as stack that can be implemented an , or as a linked . Abstract types can be handled by code that does not know what underlying types are contained in them. Programming that is agnostic concrete data types is called programming. Arrays and are considered concrete data types because they specify how their contents are in memory.