Contoh comprehension

• List comprehensions no longer provide a convenient way to express wheel-rolling.

• The same rules for polymorphism and monomorphism as for list comprehensions apply to do expressions.

• List comprehensions are compiled to map and filter, where map operates in parallel over these arrays.

• The next two propositions relate shapelessness to monad comprehensions.

• Equations (l)- can be used as left to right rewrite rules to translate list comprehensions.

• Efficient compilation of list comprehensions and optimization of database queries have a lot in common.

• In this lab you are not allowed to use any of them (or any list comprehensions), but must write your own versions.

• Actually, genarray-with-loops are powerful array comprehensions, and fold-with-loops are versatile folding templates, both specifically designed for multi-dimensional arrays.

• A prototype implementation has been developed providing, amongst other things, the first concrete implementation of monad comprehensions known to us at the time of writing.

• Indeed, all of the languages discussed here use some parallel extension of list comprehensions and implicitly parallel higher-order functions such as map.

• List comprehensions consist of a generator and a filter.

• If this behavior is achieved, then neither expressibility nor efficiency requires a separate syntax for array comprehensions.

• List comprehensions provide an elegant, expressive means to concisely formulate certain patterns of calculation on lists.

• The parallel construct is the list and list comprehensions are compiled into potentially parallel loops.

• In section 3.4, we replace in it3a the abstract by the concrete expressions, simplify, replace iterators by list comprehensions, and introduce names for the intermediate values computed by the phases.