list comprehension

L l

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definition of list comprehension words

noun Technical meaning of list comprehension (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: 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: 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]). 1

Just one definition for list comprehension

Information block about the term

Parts of speech for List comprehension

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of List comprehension

See also

All definitions of list comprehension

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?