Welcome to MSDN Blogs Sign in | Join | Help

February 2007 - Posts

Friday, February 23, 2007 6:02 AM

Linq to ASCII Art

Last night I was searching for an audio version of Painters and Hackers by Paul Graham . Pretty soon I had completely forgotten about the book and found myself reading the Wikipedia article about Hackers . Isn't Internet search great? Of all of the things
Posted by wesdyer | 39 Comments
Filed under: ,
Tuesday, February 13, 2007 9:11 PM

The Virtues of Laziness

It seems that I riled some people up with my blog post yesterday. After some thought, I think the primary reason that there was some backlash is because some people feel that I violated one of the sacred principles of FP: lists are *the* data structure.
Posted by wesdyer | 22 Comments
Monday, February 12, 2007 7:41 PM

Why all the love for lists?

One of the things that I have noticed when participating in interviews with potential candidates is that most candidates have a favorite data structure. Presumably this is the data structure that they feel the most comfortable with. The problem is that
Posted by wesdyer | 14 Comments
Sunday, February 11, 2007 6:49 AM

Baby Names, Nameless Keys, and Mumbling

Baby Names I recently finished reading Freakonomics . It is a fascinating book about a number of strange phenomena. Its topics range from the economics of dealing crack to cheating in sumo wrestling. Among the sundry topics is a discussion concerning
Posted by wesdyer | 20 Comments
Filed under: , ,
Monday, February 05, 2007 6:12 PM

Memoization and Anonymous Recursion

Keith Farmer brought it to my attention that there is at least a little confusion about how closures work. Hopefully, I can help shed a little light on the subject. The question is why doesn't the following code actually memoize fib in the call to Test?
Posted by wesdyer | 11 Comments
Friday, February 02, 2007 7:17 PM

Anonymous Recursion in C#

Recursion is beautiful and lambdas are the ultimate abstraction. But how can they be used together? Lambdas are anonymous functions and recursion requires names. Let's try to define a lambda that computes the nth fibonacci number. Func<int, int>
Posted by wesdyer | 34 Comments
 
Page view tracker