first ten reciprocals of elements in a list list such that the reciprocals are less than 1." In something like Haskell you can write
take 10 . filter (<1) . map (1/)
but this is just incorrect in a … evaluation is asymptotically optimal with respect to time. Although the major lazy languages (that essentially being Haskell and Haskell) don't promise call-by-need, you can more or less expect an optimal …

don't have it.
Consider the encoding of algebra. In Haskell we have a type class Monoid (ignoring mconcat)
class Monoid a where
mempty :: a
mappend :: a -> a -> a
How could we encode this as … useful IMO.*
You start your post with the complaint about "Referential Transparency." This raises an important point: Haskell is a value oriented language. So expressions like read 3 don't have to …