222 karma · joined January 17, 2010
Possibly something like:
* Show me a world without Null
* How does Haskell help me scale?
* When does less code give me more?
* Take me on a tour of HackageObviously it is trivial to show that it isn't a monad by the fact that javascript permits any action in pure code, but by the same token, unsafePerformIO proves that Haskell has no monads. I think it's fair to operate under a reasonable subset of jQuery functionality when asking the question.
He primarily advocates for avoiding the use of analogies, which you seem to agree with. He advocates using concrete monads in real code, which you also seem to agree with.
The only contentious point might be learning typeclasses and how monads fit into the Typeclassopedia. If you want to be able to trace how your monad-using code is evaluated this is a necessity. Like it or not. Also, attacking monads from both the concrete and the abstract at the same time seems to be a good approach, with satori being achieved once the understandings meet. A dynamic-programming approach?
You may possibly be disagreeing with the order in which he lists these components of learning in his 'Eightfold Path', but if the analogy to the Buddhist teachings is followed further, then the steps need not be taken in sequence.
The slides certainly include many monad examples besides maybe at any rate.
I think the slides are worth another look :)
#!/bin/bash
xargs -n 1 grep -l "$@"
This takes a list of files on stdin, then greps for the argument in all the files and spits out the matching files.The perk is that it can be chained:
find *.txt | narrow dog | narrow cat | narrow rabbit
This will find all the files that contain dog, cat, and rabbit.One might argue that women _on average_ may or may not understand a female audience better, but I can't even begin to think how someone wouldn't understand that variations between individual understandings would dwarf any potential divide here.
Although, this is just a guess as I don't know if the perl implementation is available anywhere.
http://blip.tv/oreilly-open-source-convention/oscon-2008-dam...
The fact that data-types are so cheap, both syntactically and computationally, really frees you up from having to worry about not creating them. I did go too far the other way for a while and created new types for everything. There exists a happy middle ground, but it's hard to define where exactly it lies.
To those saying "who cares" consider that you may wish to use this extension on a computer where you don't feel comfortable issuing your Google login credentials.
Is it the interface it provides, the types, the coupling of methods to data, or something else?
-- General implementation
type T = Int -> Set [Int]
g :: T -> T
...
g' = fix g -- Very slow
g'' = memoFix integral g -- Fast, Generic
g''' = memoFix integer g -- Fast enough to use
On a side note, the paper seems too readable to me! Usually these kinds of topics are presented in such a way as to make them almost completely incomprehensible. Something must be very wrong here.
[edit: How do you quote code?]