[Haskell-cafe] W3C discussion: Principle of Least Power
GK at ninebynine.org
Fri Dec 23 06:45:34 EST 2005
There's a possibly-interesting thread running on the W3C TAG mailing list 
about the "Principle of Least Power" , in which Haskell gets a mention.
The debate gets kind-of interesting around discussion of analyzability of
language expressions vs expressibility, with passing reference to Turing
completeness. Intuitively, I've felt that expressions in a pure functional
language are easier to analyze than expressions in (say) C or Java, despite them
all being fully Turing complete (so no difference in expressive power there).
Can it truly be said that it's easier to analyze a functional expression than a
C program? What could that actually mean? I feel the discussion is (so far)
missing a trick, but I'm not sure what it is.
More information about the Haskell-Cafe