News for hackers. Stuff that matters.
Re:Hasp: An S-Expression to Haskell Compiler by DanWaterworth on Sunday February 26, 2012 @12:52PM (#3636146)
If you would re-read my comment, you'll find that I didn't actually say I agree that all functional languages are syntactically sweetened lambda calculus, though I certainly said Haskell was.

My point was that although there are functional languages that are syntactic sugar over the lambda calculus, I don't know of any imperative languages (and in fact it would not make sense to design an imperative language) that is syntactic sugar over turing machine code.

I should have made my position clearer. I do agree that compiling any non-pure functional language via lambda calculus is a fruitless endeavor.

There are no comments on this comment yet.