n
(software) a type in a nominative type system that cannot be instantiated.
n
(computer science) A kind of polymorphism where polymorphic functions can be applied to arguments of different types, as they can denote a number of distinct and potentially heterogeneous implementations depending on the types of argument to which they are applied.
n
(software, object-oriented programming) A class that is converted to another class using a so-called adapter class.
n
(programming) Synonym of lambda function
adj
(computing) Of a programming language: using successive functional transformations on data to arrive at a result.
n
(computing) The -> symbol, which has specific meanings in various programming languages.
adj
(computing) Describing a system which has been written so that different subsystems appear to add themselves to the main business logic without that logic having to include them explicitly.
n
(computing) An operator that sets the value stored in the storage location(s) denoted by a variable name.
n
(computing) An array-like data structure where the indices (called keys) are not limited to integers.
n
Brute Force and Ignorance - programming jargon for relying on raw computing power. For example, an algorithm that uses BFI might search through all possible options to find the single best option, whereas a more sophisticated algorithm might deduce the best option using a set of rules. BFI based algorithms tend to be simpler, and can under some circumstances be faster.
n
(software engineering) An invariant used to constrain objects of a class that is preserved by class methods and that constrains the state stored in the object.
n
(computing) A scope that indicates another variable of the same name and type is assigned to the local memory of each image.
n
(generic programming) A description of supported operations on a type, including their syntax and semantics.
adj
(programming, of a function) Which cannot change the value of its class’s attributes.
n
(programming) The proper declaration of objects as immutable in contexts where they are not expected to be modified.
adj
(programming) Exhibiting const correctness.
n
Abbreviation of constant. [That which is permanent or invariable.]
n
(programming) The declaration of variables or objects as immutable.
n
(object-oriented programming) The reversal of the order of data types acted upon by an operator.
n
(object-oriented programming) The conversion of data types from wider to narrower in certain situations.
n
(programming) Synonym of curly-bracket language
n
(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.
n
(computing) The specification of an object, such as a variable or function, establishing its existence but not necessarily describing its contents.
adj
(programming) That declares a construct.
n
(computing, programming) A compile-time transformation which eliminates higher-order functions, replacing them by a single first-order apply function.
n
(programming) An array in which most of the values are non-zero.
n
(programming) A style of dynamic typing in which an object's current set of methods and properties determines the valid semantics, rather than its inheritance from a particular class or implementation of a specific interface.
n
(computing) A dispatch method where the implementation of a function or method is assigned during runtime, as it cannot be assigned during compile time.
n
(computing, programming) A system in which type checking is performed at run time and not at compilation, opposed to static typing.
adj
(computing) belonging to a type system that checks the variable types at runtime.
n
(programming) A data type that allows variables to have any of a predefined set of values.
n
(databases) A join whose predicate uses only equality comparisons.
n
(computing, programming) Determination of the value of a variable or expression.
n
(programming, type systems) A type that hides the underlying concrete type(s).
n
(programming) A property added to an object at run-time.
n
(computing) A continuation that can be used like any other value in a programming language, giving a powerful ability to control flow of execution.
n
(computing, programming) The use of templates etc. to create generic source code that can be used in many situations.
n
(programming, Python) A generator expression.
n
(programming) A type system where some variables are statically-typed and some are dynamically-typed.
adj
(programming) Using gradual typing.
n
(functional programming) Initialism of higher-order function. [(computer science) A function that takes one or more functions as an input, and returns a function as a result.]
n
(programming) A property of some programming languages, in which the primary representation of programs is also a data structure in a primitive type of the language itself.
n
(computing, programming) A naming convention in which the name of a variable indicates its data type and intended use by including abbreviations as prefixes.
n
(programming) An operator that acts on every member of a set.
n
(object-oriented programming) A set of conceptual and technical difficulties that are often encountered when a relational database is being served by an object-oriented application program, particularly because objects or class definitions must be mapped to database tables defined by a relational schema.
adj
(computing theory) Having semantics that incorporates mutable variables.
n
(computer science) Synonym of subtype polymorphism
n
(programming) Practice of always using references instead of copies of equal objects.
n
(programming, ontologies) Such relationship expressed as an ontology component (regardless of whether the OOP paradigm per se is implemented).
n
(computing, programming) A lambda expression.
n
(programming) A construct used in statically-typed functional programming languages to access nested data structures.
adj
(programming) Having the scope of an identifier limited to the block of source code text that respectively declares or defines the identifier as a variable or function.
adj
(computing) Synonym of weakly-typed
n
(computing) A variable that may be modified by or within a macro
n
(object-oriented programming) conversion of data types between incompatible type systems.
n
(software, object-oriented programming) Synonym of member variable
n
(programming, Lua) A method belonging to a metatable.
n
(programming) In the Perl and Raku programming languages, an operator that can combine with other operators.
n
(chiefly programming) A conventional variable name used for an unspecified entity whose exact nature depends on context.
n
(programming, Lua) A table (of key-value pairs) containing references to functions that dictate certain behaviours of an object.
n
(programming) The type of a type.
n
(functional programming) A data type which represents a specific form of computation, along with the operations "return" and "bind".
n
(computer science) In a compiler, the process of converting a polymorphic function to a monomorphic function, by the creation of a specialised function for each different data type it is called with.
n
(computing theory) In the Hindley–Milner type system, a single specific data type.
n
(programming) A specific form of syntactic ambiguity resolution in the C++ programming language, whereby attempts to declare a variable may be undesirably interpreted as attempts to declare a function.
n
(software) Synonym of nominative type system
adj
(computing) Of an operator or function in a program, having no arguments.
n
(programming) A major type system where compatibility and equivalence of data types are determined by explicit declarations or the names of the types.
n
(object-oriented programming) An object that does nothing and is used instead of using a null.
n
(computing) A variable, etc. that is allowed to have a null value.
n
(programming) The conversion of a numeric data type into one that can hold more information. For example, the conversion of a long into a double.
n
(computing) A symbol that represents a construct in a programming language and differs from a normal function in its syntax.
n
(programming, sometimes capitalized) In various programming languages, a kind of variable that is assigned a specific data type but may or may not hold an actual value.
n
(computing, programming) An overloaded version of a function.
n
(computing) The representation of physical effects by simplified parameters in a computer model rather than by computing them dynamically.
n
(programming) A way to make a computer language more expressive, while maintaining full static type safety, by allowing a function or a data type to be written generically so that it can handle values identically without depending on their type.
n
(computer science) The process of fixing a number of arguments to a function, producing another function of smaller arity.
n
(computer science) Alternative form of partial application [(computer science) The process of fixing a number of arguments to a function, producing another function of smaller arity.]
n
(programming) Alternative form of call by value
n
(computing theory) A parameterized type that does not depend on all of its type parameters.
n
(mathematics, type theory) The property of certain typed formal systems of allowing for the use of type variables and binders/quantifiers over those type variables; likewise, the property of certain expressions (within such typed formal systems) of making use of at least one such typed variable.
n
(computing theory) In the Hindley–Milner type system, a data type containing variables bound by one or more ∀ (for-all) quantifiers.
n
(computing, dated, rare) A form of assignment to fixed-length string variables in which a shorter value is padded to the necessary length while a longer one is truncated.
n
(programming) A data type that can be only used in certain places, for example as the argument to a function.
n
(computing) Data that is artificially generated in order to test a program; test data.
n
(computing) Something resembling, or having certain characteristics of, a data type.
n
(computing, databases) The property of a relational database that enforces valid relationships between tables, such that no foreign key can contain a value that does not match a primary key in the corresponding linked table.
n
(databases, nonstandard) A variable that contains a relation, as distinguished from the relation itself.
n
(computing) A symbolic expression.
n
(programming, languages) Synonym of second-class object
n
(computing) A dispatch method where the implementation of a function or method is chosen solely on the type of the instance calling the method.
n
(countable, programming) A static variable.
n
(computing, programming) A system in which type checking is performed during compilation and not at run time, opposed to dynamic typing.
adj
(programming) Having the scope of an identifier limited to the block of source code text that respectively declares or defines the identifier as a variable or function.
adj
(computing) Belonging to a type system that checks the variable types at compile time.
n
(software engineering) An extensibility mechanism of the Unified Modeling Language, allowing a new element to be derived from an existing one with added specializations.
n
(computing, programming) A system that places any of various kinds of restriction on the interactions between objects of different data types.
adj
(computing) Belonging to a type system that enforces variables matching (or easily convertible to) the expected types.
n
(computing) The data type represented by a subclass.
n
(programming) Syntactic sugar.
n
(object-oriented programming) A package situated hierarchically above another package.
n
(programming) An identifier that is substituted by a pre-defined value prior to compilation.
n
(computing, database normalization) A functional dependency of an attribute on a superset of itself.
n
(software) changing an entity from one data type to another according to explicit or implicit rules.
n
(software) A compile-time process by which explicit data type annotations are removed from a program, before run-time execution.
n
(programming) An instance of type hinting: the specification of a data type in an otherwise untyped language.
n
(software) The automatic deduction of the type of an expression in a programming language.
n
(object-oriented programming) The ability of a program to examine at run time the type or properties of an object.
n
(programming, software compilation) the extent to which a programming language discourages or prevents type errors
v
(programming) To perform typechecking.
adj
(programming) Not susceptible to the class of programming errors that could lead to items of one data type being incorrectly treated as another type.
v
(computing) To verify whether a given value belongs to a certain data type.
adj
(computing, of a programming language) In which variables are typed.
n
(computing) A statement that declares a name for a data type.
adj
(computing) Not typeless; having the concept of types; typed.
adj
Alternative spelling of type-safe [(programming) Not susceptible to the class of programming errors that could lead to items of one data type being incorrectly treated as another type.]
n
(programming) Information stored with a variable indicating its current data type.
n
(computer science, type theory) In a functional language, inference of a polymorphic type only for syntactic values (values that can be evaluated at compile time) to ensure that a program is type-safe.
n
(programming) A data type having deep-copy semantics.
v
(computing, transitive) To convert a program that operates on scalar values into the equivalent program operating on vectors.
n
(programming) Synonym of vtable
n
(programming) A data type that cannot be named.
n
(computing, programming) A system that does not place any restriction on the interactions between objects of different data types.
adj
(computing) belonging to a type system that likely would not result in an error, if the variable passed does not closely match the expected type.
Note: Concept clusters like the one above are an experimental OneLook
feature. We've grouped words and phrases into thousands of clusters
based on a statistical analysis of how they are used in writing. Some
of the words and concepts may be vulgar or offensive. The names of the
clusters were written automatically and may not precisely describe
every word within the cluster; furthermore, the clusters may be
missing some entries that you'd normally associate with their
names. Click on a word to look it up on OneLook.
Our daily word games Threepeat and Compound Your Joy are going strong. Bookmark and enjoy!
Today's secret word is 7 letters and means "No longer existing; died out." Can you find it?