You are here: irt.org | FOLDOC | listless
<programming> In functional programming, a property of a
function which allows it to be combined with other functions
in a way that eliminates intermediate data structures,
Phil Wadler's thesis gives the conditions for a function to
be in listless form: each input list is traversed only once,
one element at a time, from left to right. Each output list
is generated once, one element at a time, from left to right.
No other lists are generated or traversed.
Not all functions can be expressed in listless form
Nearby terms: list « list comprehension « List Enhanced « listless » Listproc » lists » Listserv
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL
©2018 Martin Webb