Side Effect (computer Science)
In computer science, a function or expression is said to have a side effect if, in addition to returning a value, it also modifies some state or has an observable interaction with calling functions or the outside world. For example, a function might modify a global or static variable, modify one of its arguments, raise an exception, write data to a display or file, read data, or call other side-effecting functions. In the presence of side effects, a program's behavior depends on history; that is, the order of evaluation matters. Understanding a program with side effects requires knowledge about the context and its possible histories; and therefore can be hard to read, understand and debug.
Side effects are the most common way to enable a program to interact with the outside world (people, filesystems, other computers on networks). But the degree to which side effects are used depends on the programming paradigm. Imperative programming is known for its frequent utilization of side effects. In functional programming, side effects are rarely used. Functional languages such as Standard ML, Scheme and Scala do not restrict side effects, but it is customary for programmers to avoid them. The functional language Haskell restricts side effects with a static type system; it uses the concept of monads to do stateful and IO computations.
Assembly language programmers must be aware of hidden side effects — instructions that modify parts of the processor state which are not mentioned in the instruction's mnemonic. A classic example of a hidden side effect is an arithmetic instruction which explicitly modifies a register (an overt effect) and implicitly modifies condition codes (a hidden side effect). One defect of an instruction set with many hidden side effects is that, if many instructions have side effects on a single piece of state, like condition codes, then the logic required to update that state sequentially may become a performance bottleneck. The problem is particularly acute on processors designed with pipelining (since 1990) or with out-of-order execution. Such a processor may require additional control circuitry to detect hidden side effects and stall the pipeline if the next instruction depends on the results of those effects.
Read more about Side Effect (computer Science): Referential Transparency, Temporal Side Effects, Idempotence, Example
Famous quotes containing the words side and/or effect:
“As I went forth early on a still and frosty morning, the trees looked like airy creatures of darkness caught napping; on this side huddled together, with their gray hairs streaming, in a secluded valley which the sun had not penetrated; on that, hurrying off in Indian file along some watercourse, while the shrubs and grasses, like elves and fairies of the night, sought to hide their diminished heads in the snow.”
—Henry David Thoreau (1817–1862)
“That when that knot’s untied that made us one,
I may seem thine, who in effect am none.
And if I see not half my dayes that’s due,
What nature would, God grant to yours and you;”
—Anne Bradstreet (c. 1612–1672)