In the last months I'm thinking about dynamic languages and trying to understand what's the good part of it. Driven by this curiosity I've came to Lisp lectures by Abelson and Sussman. Yesterday I watched first lecture which is introduction to prefix notation, expressions and functional concept.
As a exercise they model and implement function for computation of square root. My attention was attracted by functional concept, so I tried to implement it. But I was too lazy to get and install any Lisp. Instead of it I implemented it in C# 3.0 using lambda expressions.
I'm curious how far I could get with this approach and whether it will be possible to convert most of the concepts of Lisp and do them in C#. I guess that I will hit the barrier as soon as more dynamic features of Lisp will be shown in next lectures. I will see.
Func<double, double, double> average = (y, x) => (x + y) / 2; Func<double, double> square = x => x * x; Func<double, double> abs = (x) => x < 0 ? -x : x; Func<double, double, double> newGuess = (guess, x) => average(guess, x / guess); Func<double, double, double, bool> goodEnough = (guess, x, tolerance) => (abs(square(guess) - x) < tolerance); Func<double, double, double, double> tryGuess = null; tryGuess = ( guess, x, tolerance ) => goodEnough(guess, x, tolerance) ? guess : tryGuess(newGuess(guess, x), x, tolerance); Func<double, double> squareRoot = ( x ) => tryGuess(1, x, 0.001); double root = squareRoot(2);