Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Eager evaluation

Index Eager evaluation

In computer programming, eager evaluation, also known as strict evaluation or greedy evaluation, is the evaluation strategy used by most traditional programming languages. [1]

19 relations: C Sharp (programming language), Carry-lookahead adder, Church encoding, Computer programming, Concurrent computing, Dead code, Evaluation strategy, Expression (mathematics), Graph reduction, Imperative programming, Lazy evaluation, Linearizability, Operator (computer programming), Out-of-order execution, Program optimization, Programming language, Race condition, Thread (computing), Variable (computer science).

C Sharp (programming language)

C# (/si: ʃɑːrp/) is a multi-paradigm programming language encompassing strong typing, imperative, declarative, functional, generic, object-oriented (class-based), and component-oriented programming disciplines.

New!!: Eager evaluation and C Sharp (programming language) · See more »

Carry-lookahead adder

A carry-lookahead adder (CLA) or fast adder is a type of adder used in digital logic.

New!!: Eager evaluation and Carry-lookahead adder · See more »

Church encoding

In mathematics, Church encoding is a means of representing data and operators in the lambda calculus.

New!!: Eager evaluation and Church encoding · See more »

Computer programming

Computer programming is the process of building and designing an executable computer program for accomplishing a specific computing task.

New!!: Eager evaluation and Computer programming · See more »

Concurrent computing

Concurrent computing is a form of computing in which several computations are executed during overlapping time periods—concurrently—instead of sequentially (one completing before the next starts).

New!!: Eager evaluation and Concurrent computing · See more »

Dead code

In computer programming, dead code is a section in the source code of a program which is executed but whose result is never used in any other computation.

New!!: Eager evaluation and Dead code · See more »

Evaluation strategy

Evaluation strategies are used by programming languages to determine when to evaluate the argument(s) of a function call (for function, also read: operation, method, or relation) and what kind of value to pass to the function.

New!!: Eager evaluation and Evaluation strategy · See more »

Expression (mathematics)

In mathematics, an expression or mathematical expression is a finite combination of symbols that is well-formed according to rules that depend on the context.

New!!: Eager evaluation and Expression (mathematics) · See more »

Graph reduction

In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated.

New!!: Eager evaluation and Graph reduction · See more »

Imperative programming

In computer science, imperative programming is a programming paradigm that uses statements that change a program's state.

New!!: Eager evaluation and Imperative programming · See more »

Lazy evaluation

In programming language theory, lazy evaluation, or call-by-need is an evaluation strategy which delays the evaluation of an expression until its value is needed (non-strict evaluation) and which also avoids repeated evaluations (sharing).

New!!: Eager evaluation and Lazy evaluation · See more »

Linearizability

In concurrent programming, an operation (or set of operations) is atomic, linearizable, indivisible or uninterruptible if it appears to the rest of the system to occur at once without being interrupted.

New!!: Eager evaluation and Linearizability · See more »

Operator (computer programming)

Programming languages typically support a set of operators: constructs which behave generally like functions, but which differ syntactically or semantically from usual functions.

New!!: Eager evaluation and Operator (computer programming) · See more »

Out-of-order execution

In computer engineering, out-of-order execution (or more formally dynamic execution) is a paradigm used in most high-performance central processing units to make use of instruction cycles that would otherwise be wasted.

New!!: Eager evaluation and Out-of-order execution · See more »

Program optimization

In computer science, program optimization or software optimization is the process of modifying a software system to make some aspect of it work more efficiently or use fewer resources.

New!!: Eager evaluation and Program optimization · See more »

Programming language

A programming language is a formal language that specifies a set of instructions that can be used to produce various kinds of output.

New!!: Eager evaluation and Programming language · See more »

Race condition

A race condition or race hazard is the behavior of an electronics, software, or other system where the output is dependent on the sequence or timing of other uncontrollable events.

New!!: Eager evaluation and Race condition · See more »

Thread (computing)

In computer science, a thread of execution is the smallest sequence of programmed instructions that can be managed independently by a scheduler, which is typically a part of the operating system.

New!!: Eager evaluation and Thread (computing) · See more »

Variable (computer science)

In computer programming, a variable or scalar is a storage location (identified by a memory address) paired with an associated symbolic name (an identifier), which contains some known or unknown quantity of information referred to as a value.

New!!: Eager evaluation and Variable (computer science) · See more »

Redirects here:

Avaliacao ansiosa, Avaliação ansiosa, Eager execution, Strict evaluation.

References

[1] https://en.wikipedia.org/wiki/Eager_evaluation

OutgoingIncoming
Hey! We are on Facebook now! »