Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: Comparison of programming languages (algebraic data type) (view), Comparison of programming languages (array) (view), Comparison of programming languages (associative array) (view), Comparison of programming languages (basic instructions) (view), Comparison of programming languages (functional programming) (view), Comparison of programming languages (list comprehension) (view), Comparison of programming languages (object-oriented programming) (view), Comparison of programming languages (string functions) (view), Comparison of programming languages (strings) (view), Comparison of programming languages (syntax) (view), Comparison of programming languages by type system (view)

searching for Comparison of programming languages 25 found (105 total)

alternate case: comparison of programming languages

Higher-order function (2,617 words) [view diff] no match in snippet view article find links to article

In mathematics and computer science, a higher-order function (HOF) is a function that does at least one of the following: takes one or more functions as
Namespace (3,352 words) [view diff] no match in snippet view article find links to article
In computing, a namespace is a set of signs (names) that are used to identify and refer to objects of various kinds. A namespace ensures that all of a
Global variable (1,299 words) [view diff] no match in snippet view article find links to article
In computer programming, a global variable is a variable with global scope, meaning that it is visible (hence accessible) throughout the program, unless
Operator (computer programming) (1,756 words) [view diff] no match in snippet view article
In computer programming, operators are constructs defined within programming languages which behave generally like functions, but which differ syntactically
Dependent type (2,366 words) [view diff] no match in snippet view article find links to article
In computer science and logic, a dependent type is a type whose definition depends on a value. It is an overlapping feature of type theory and type systems
Union type (2,588 words) [view diff] no match in snippet view article find links to article
In computer science, a union is a value that may have any of several representations or formats within the same position in memory; that consists of a
Null coalescing operator (2,180 words) [view diff] no match in snippet view article find links to article
The null coalescing operator is a binary operator that is part of the syntax for a basic conditional expression in several programming languages, such
Type safety (3,647 words) [view diff] no match in snippet view article find links to article
In computer science, type safety and type soundness are the extent to which a programming language discourages or prevents type errors. Type safety is
Intersection type (2,386 words) [view diff] no match in snippet view article find links to article
In type theory, an intersection type can be allocated to values that can be assigned both the type σ{\displaystyle \sigma } and the type τ{\displaystyle
Enumerated type (4,403 words) [view diff] no match in snippet view article find links to article
In computer programming, an enumerated type (also called enumeration, enum, or factor in the R programming language, and a categorical variable in statistics)
Generator (computer programming) (3,106 words) [view diff] no match in snippet view article
In computer science, a generator is a routine that can be used to control the iteration behaviour of a loop. All generators are also iterators. A generator
Type introspection (1,436 words) [view diff] no match in snippet view article find links to article
In computing, type introspection is the ability of a program to examine the type or properties of an object at runtime. Some programming languages possess
Method overriding (2,163 words) [view diff] no match in snippet view article find links to article
Method overriding, in object-oriented programming, is a language feature that allows a subclass or child class to provide a specific implementation of
Naming convention (programming) (3,739 words) [view diff] no match in snippet view article
In computer programming, a naming convention is a set of rules for choosing the character sequence to be used for identifiers which denote variables, types
Coroutine (4,987 words) [view diff] no match in snippet view article find links to article
Coroutines are computer program components that allow execution to be suspended and resumed, generalizing subroutines for cooperative multitasking. Coroutines
Lazy initialization (2,803 words) [view diff] no match in snippet view article find links to article
In computer programming, lazy initialization is the tactic of delaying the creation of an object, the calculation of a value, or some other expensive process
Variadic function (3,239 words) [view diff] no match in snippet view article find links to article
In mathematics and in computer programming, a variadic function is a function of indefinite arity, i.e., one which accepts a variable number of arguments
Foreach loop (4,052 words) [view diff] no match in snippet view article find links to article
In computer programming, foreach loop (or for-each loop) is a control flow statement for traversing items in a collection. foreach is usually used in place
String interpolation (2,183 words) [view diff] no match in snippet view article find links to article
In computer programming, string interpolation (or variable interpolation, variable substitution, or variable expansion) is the process of evaluating a
Function object (4,372 words) [view diff] no match in snippet view article find links to article
In computer programming, a function object is a construct allowing an object to be invoked or called as if it were an ordinary function, usually with the
Iterator (5,910 words) [view diff] no match in snippet view article find links to article
In computer programming, an iterator is an object that enables a programmer to traverse a container, particularly lists. Various types of iterators are
Scope (computer science) (10,579 words) [view diff] no match in snippet view article
In computer programming, the scope of a name binding (an association of a name to an entity, such as a variable) is the part of a program where the name
Exception handling syntax (4,752 words) [view diff] no match in snippet view article find links to article
Exception handling syntax is the set of keywords and/or structures provided by a computer programming language to allow exception handling, which separates
Callable object (344 words) [view diff] no match in snippet view article find links to article
A callable object, in computer programming, is any object that can be called like a function. pointer to function; pointer to member function; functor;
Anonymous function (9,472 words) [view diff] no match in snippet view article find links to article
In computer programming, an anonymous function (function literal, lambda abstraction, lambda function, lambda expression or block) is a function definition