News for hackers. Stuff that matters.
Re:Alan Kay on Lisp and Fexprs by jjs on Sunday February 14, 2010 @04:46PM (#1125345)
Interesting...

Fexprs appear to be runtime-only first-class macros.

Re:Alan Kay on Lisp and Fexprs by gwern on Sunday February 14, 2010 @07:42PM (#1125618)
They look to me like lazy functions (eg. in Haskell), but no one else has mentioned the term laziness, so I must be mistaken in some respect.
Re:Alan Kay on Lisp and Fexprs by _delirium on Sunday February 14, 2010 @08:32PM (#1125673)
There's a similarity in that neither fexprs nor lazy functions evaluate their arguments up front, but lazy functions will eventually, if they run and access that argument at all, get an evaluated version of it. Fexprs can get the actual raw unevaluated argument and poke at it, so if you call (foo (+ 1 2)), foo gets the syntax-tree (+ 1 2) if it's an fexpr, while if it's a function, lazy or otherwise, it will only ever see the value 3.
Re:Alan Kay on Lisp and Fexprs by camccann on Sunday February 14, 2010 @10:03PM (#1125791)
...so, basically it gives the same ease of understanding program flow that lazy evaluation offers, but without the distracting complexity of referential transparency? Okay, then.
Re:Alan Kay on Lisp and Fexprs by jjs on Sunday February 14, 2010 @10:57PM (#1125852)
[...] but without the distracting complexity of referential transparency?

How could referential transparency possibly be distracting or complex?

Re:Alan Kay on Lisp and Fexprs by camccann on Sunday February 14, 2010 @11:03PM (#1125865)
In exactly the same way that lazy evaluation makes program flow easy to follow.

Or perhaps in the same way that the internet makes sarcasm easily recognized, I suppose...

Re:Alan Kay on Lisp and Fexprs by jjs on Monday February 15, 2010 @12:52AM (#1125976)
Aha!

So the value of your words depended on evaluating them in a sarcastic context. This lack of referential transparency made it difficult to reason about them at compile-time.

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.