Evaluation strategy | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

In a programming language, an evaluation strategy is a set of rules for evaluating expressions. The term is often used to refer to the more specific notion of a parameter-passing strategy that defines the kind of value that is passed to the function for each parameter (the binding strategy) and whether to evaluate the parameters of a function call, and if so in what order (the evaluation order). The notion of reduction strategy is distinct, although some authors conflate the two terms and the definition of each term is not widely agreed upon. To illustrate, executing a function call f(a,b) may first evaluate the arguments a and b, store the results in references or memory locations ref_a and ref_b, then evaluate the function's body with those references passed in. This gives the function the ability to look up the argument values, to modify them via assignment as if they were local variables, and to return values via the references. This is the call-by-reference evaluation strategy. Evaluation strategy is part of the semantics of the programming language definition. Some languages, such as PureScript, have variants with different evaluation strategies. Some declarative languages, such as Datalog, support multiple evaluation strategies. Some languages define a calling convention. This is a table of evaluation strategies and representative languages by year introduced. The representative languages are listed in chronological order, starting with the language(s) that introduced the strategy and followed by prominent languages that use the strategy. While the order of operations defines the abstract syntax tree of the expression, the evaluation order defines the order in which expressions are evaluated. For example, the Python program def f(x): print(x) return x f(1) + f(2) outputs 1 2 due to Python's left-to-right evaluation order, but a similar program in OCaml: let f x = print_string (string_of_int x); x ;; f 1 + f 2 outputs 2 1 due to OCaml's right-to-left evaluation order.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (1)

Efficient Online Processing for Advanced Analytics

Mohamed Elsayed Mohamed Ahmed El Seidy

With the advent of emerging technologies and the Internet of Things, the importance of online data analytics has become more pronounced. Businesses and companies are adopting approaches that provide r

EPFL2017

Related concepts (82)

Related courses (102)

Related lectures (707)

Related MOOCs (7)

Volatile (computer programming)

In computer programming, volatile means that a value is prone to change over time, outside the control of some code. Volatility has implications within function calling conventions, and also impacts how variables are stored, accessed and cached. In the C, C++, C#, and Java programming languages, the volatile keyword indicates that a value may change between different accesses, even if it does not appear to be modified. This keyword prevents an optimizing compiler from optimizing away subsequent reads or writes and thus incorrectly reusing a stale value or omitting writes.

Function (computer programming)

In computer programming, a function or subroutine is a sequence of program instructions that performs a specific task, packaged as a unit. This unit can then be used in programs wherever that particular task should be performed. Functions may be defined within programs, or separately in libraries that can be used by many programs. In different programming languages, a function may be called a routine, subprogram, subroutine, or procedure; in object-oriented programming (OOP), it may be called a method.

Evaluation strategy

MATH-506: Topology IV.b - cohomology rings

Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a

PHYS-597: Specialisation semester

Students have the opportunity to apply their knowledge in a project contributing to specialize them in a physics field. The project can take place in a laboratory at EPFL, in an external laboratory or

BIOENG-605: Planning your scientific journey (EDBB)

Planning Your Scientific Journey: Being successful as a scientist requires more than acquiring knowledge and developing experimental skills. It also requires: (1) asking a good scientific question, (2

Eigenstate Thermalization Hypothesis

Explores the Eigenstate Thermalization Hypothesis in quantum systems, emphasizing the random matrix theory and the behavior of observables in thermal equilibrium.

Global Extrema of Functions in R^2

Explores global extrema of functions in R^2, discussing methods to find maximum and minimum points.

Flipped Classroom: SandboxFlippedClass

Covers creating a flipped classroom, course organization, setting release dates, grading policies, and content visibility settings.

Find the right markets for your innovation - A tool for entrepreneurs and innovators for choosing which markets to play in.

Learn how to apply the Market Opportunity Navigator - a three-step tool for identifying, evaluating and strategizing market opportunities - to get the most value for your innovation.

Plasma Physics: Introduction

Learn the basics of plasma, one of the fundamental states of matter, and the different types of models used to describe it, including fluid and kinetic.

Plasma Physics: Introduction

Learn the basics of plasma, one of the fundamental states of matter, and the different types of models used to describe it, including fluid and kinetic.