Find link

language:

Find link is a tool written by Edward Betts.

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

alternate case: comparison of programming languages

Global variable (1,112 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,180 words) [view diff] no match in snippet view article

In computer programming, an operator is a programming language construct that provides functionality that may not be possible to define as a user-defined

Higher-order function (2,655 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

Dependent type (2,609 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,587 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 multiple representations or formats within the same area of memory; that consists of a variable

Namespace (4,499 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

Anonymous function (2,340 words) [view diff] no match in snippet view article find links to article

In computer programming, an anonymous function (function literal, expression or block) is a function definition that is not bound to an identifier. Anonymous

Null coalescing operator (1,736 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

Enumerated type (4,872 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, a condition-name in the COBOL programming

Generator (computer programming) (3,261 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

Intersection type (2,794 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

Type introspection (1,447 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,188 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

Lazy initialization (2,769 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

Naming convention (programming) (3,936 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 (5,502 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

Variadic function (3,610 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

String interpolation (2,205 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

Foreach loop (4,244 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

Function object (4,382 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,732 words) [view diff] no match in snippet view article find links to article

In computer programming, an iterator is an object that progressively provides access to each item of a collection, in order. A collection may provide multiple

Scope (computer science) (10,552 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,966 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 (346 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;