Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 35893

A functional programming language

5
votes
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 …
answered Nov 25 '12 by Philip JF
37
votes
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 …
answered Sep 3 '11 by Philip JF