💡 Words with a Similar Meaning to "Type class"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| data typenoun | (programming) A classification or category of various types of data, that states the possible values that can be taken, how they are stored, and what range of operations are allowed on them. |
| ad hoc polymorphism | In programming languages, ad hoc polymorphismC. Strachey, Fundamental concepts in programming languages. |
| type signature | In computer science, a type signature or type annotation defines the inputs and outputs of a function, subroutine or method. |
| composite data type | In computer science, a composite data type or compound data type is a data type that consists of programming language scalar data types and other composite types that may be heterogeneous and hierarchical in nature. |
| primitive data type | In computer science, primitive data types are a set of basic data types from which all other data types are constructed. |
| interfacenoun | (computing) The point of interconnection between systems or subsystems. |
| class invariantnoun | (object-oriented programming) An invariant used to constrain objects of a class that is preserved by class methods and that constrains the state stored in the object. |
| functional programmingnoun | (programming) Programming in a style that, in lieu of assignment, uses procedure calls to bind variables to values, so that referential transparency is preserved. |
| nominal type systemnoun | (software) Synonym of nominative type system. |
| ontology language | In computer science and artificial intelligence, ontology languages are formal languages used to construct ontologies. |
| manifest typingnoun | (programming) A typing where the software programmer explicitly identifies the type of each declared variable. |
| templatenoun | A generic model or pattern from which other objects are based or derived. |
| coinductionnoun | (logic) A form of induction that allows some form of reasoning concerning sets that are not well founded; uses a form of relation called a bisimulation |
| purely functional data structure | In computer science, a purely functional data structure is a data structure that can be directly implemented in a purely functional language. |
| opaque data type | In computer science, an opaque data type is a data type whose concrete data structure is not defined in an interface. |
| high-level programming language | In computer science, a high-level programming language is a programming language with strong abstraction from the details of the computer. |
| c data types | In the C programming language, data types constitute the semantics and characteristics of storage of data elements. |
| assemblynoun | A congregation of people in one place for a purpose. |
| recordnoun | An item of information put into a temporary or permanent physical medium. |
| recursive data type | In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. |
Translate “Type class” into Another Language
Pick a language — the word will be pre-filled in the translator.