Answers are grounded in this paper and cite their sources.
This paper describes a set of Lisp macros that enable the use of "list comprehensions" which are a very powerful notation that provides a very compact expression of common list operations see [2] for a full discussion. List comprehensions have been introduced by David Turner in KRC, where they were called ZF-expressions [7]. They have since been introduced in several other pure functional languages like SASL [8], Miranda 1 [5] and Haskell [3].
No takes yet. Share an insight, caveat, or question.
Guy Lapalme (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: