Glossary
- λ-function
an anonymous function.
- Abstract Syntax Tree
the data structure representing a symbolic expression or program, with operators at nodes and values (typically symbols or numbers) at the leaves.
- Abstract type
a type with a visible name but hidden implementation. Abstract types are created by declaring only the name of the type in a module signature, and not the complete implementation of the type as given in the module structure.
- Accumulator
a variable used to build the result of a computation. The concept of an accumulator underpins the fold algorithm (introduced on page 40). For example, in the case of a function which sums the elements of a list, the accumulator is the variable which holds the cumulative sum while the algorithm is running.
- ADO.NET
part of the .NET framework that deals with database programming.
- Algorithm
a mathematical recipe for solving a problem. For example, Euclid's method is a well-known algorithm for finding the largest common divisor of two numbers.
- Array
a flat container which provides random access to its elements in O (1) time-complexity. See section 3.2.
- ASP.NET
part of the .NET framework that deals with web programming.
- Associative container
a container which represents a mapping from keys to values.
- Asymptotic complexity
an approximation to the complexity of an algorithm, derived in the limit of infinite input complexity and, typically, as a lower or upper bound. For example, an algorithm with a complexity f(n) = 3 + 3n + n2 has an asymptotic complexity ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access