A list comprehension is a syntactic construct available in some programming languages for creating a list based on existing lists. It follows the form of the mathematical set-builder notation (set comprehension) as distinct from the use of map and filter functions.

<functional programming> An expression in a {functional language} denoting the results of some operation on (selected) elements of one or more lists. An example in Haskell: [ (x,y) | x <- [1 .. 6], y <- [1 .. x], x+y < 10] This returns all pairs of numbers (x,y) where x and y are elements of the list 1, 2, ..., 10, y <= x and their sum is less than 10. A list comprehension is simply "syntactic sugar" for a combination of applications of the functions, concat, map and filter. For instance the above example could be written: filter p (concat (map ( x -> map ( y -> (x,y)) [1..x]) [1..6])) where p (x,y) = x+y < 10 According to a note by Rishiyur Nikhil <nikhil@crl.dec.com>, (August 1992), the term itself seems to have been coined by Phil Wadler circa 1983-5, although the programming construct itself goes back much further (most likely Jack Schwartz and the SETL language). The term "list comprehension" appears in the references below. The earliest reference to the notation is in Rod Burstall and John Darlington's description of their language, NPL. David Turner subsequently adopted this notation in his languages SASL, KRC and Miranda, where he has called them "{ZF expressions}", set abstractions and list abstractions (in his 1985 FPCA paper [Miranda: A Non-Strict Functional Language with Polymorphic Types]). ["The OL Manual" Philip Wadler, Quentin Miller and Martin Raskovsky, probably 1983-1985]. ["How to Replace Failure by a List of Successes" FPCA September 1985, Nancy, France, pp. 113-146]. (1995-02-22)

<programming> (After Zermelo Frankel set theory). {David Turner}'s name for list comprehension. (1995-03-27)

An electoral list is a grouping of candidates for election, usually found in proportional or mixed electoral systems, but also in some plurality electoral systems. An electoral list can be registered by a political party (a party list) or can constitute a group of independent candidates.

In computer science, a list or sequence is an abstract data type that represents a finite number of ordered values, where the same value may occur more than once. An instance of a list is a computer representation of the mathematical concept of a tuple or finite sequence; the (potentially) infinite analog of a list is a stream.

A regnal list or king list is, at its simplest, a list of successive monarchs. Some regnal lists may give the relationship between successive monarchs (e.

In Major League Baseball (MLB), the injured list (IL) is a method for teams to remove their injured players from the roster in order to summon healthy players. Before the 2019 season, it was known as the disabled list (DL).

A punch list is a document prepared during key milestones or near the end of a construction project listing work that does not conform to contract specifications that the general contractor must complete prior to final payment. The work may include incomplete or incorrect installations or incidental damage to existing finishes, material, and structures.

In cryptography, a certificate revocation list (or CRL) is "a list of digital certificates that have been revoked by the issuing certificate authority (CA) before their scheduled expiration date and should no longer be trusted". CRLs are no longer required by the CA/Browser forum, as alternate certificate revocation technologies (such as OCSP) are increasingly used instead.