News for hackers. Stuff that matters.
Re:Turn O(n^2) reverse into O(n) by Peaker on Monday December 16, 2013 @12:06PM (#6916067)
I think having simple and direct denotational semantics necessarily means having relatively complex, indirect operational semantics (e.g: Haskell). Having a simple and direct operational semantics necessarily means having complex and indirect denotational semantics (e.g: C).

C makes performance easy and correctness hard. Haskell makes correctness easy and performance hard.

The trick is, in most programs, you only need performance for a tiny subset of the program. You need correctness throughout the whole program.

Re:Turn O(n^2) reverse into O(n) by zvrba on Tuesday December 17, 2013 @02:28AM (#6919987)
Why do you think that there must be a tradeoff between simplicity of denotational and operational semantics?
Re:Turn O(n^2) reverse into O(n) by Peaker on Tuesday December 17, 2013 @08:03AM (#6920858)
Because operational semantics (of contemporary computers, at least) are very different from a simple denotational semantics.

We have to bridge that gap:

1) Either use a compiler that hides away the operational details

2) Or use a language that directly maps to the operational semantics, but then is necessarily far away from the denotational ones