News for hackers. Stuff that matters.
Re:Alan Kay on Lisp and Fexprs by barrkel on Sunday February 14, 2010 @10:21PM (#1125813)
In this way, they are similar to C#'s expression trees, whereby lambdas passed as an argument where the parameter is of type Expression<T> receive an expression tree describing the lambda, rather than an actual callable object.
Re:Alan Kay on Lisp and Fexprs by doty on Monday February 15, 2010 @12:21AM (#1125945)
Although C# has rules about variable capture and partial-evaluation that do not necessarily apply to fexprs.