[Haskell-cafe] Re: [Off topic] Proving an impossibility
Brandon S. Allbery KF8NH
allbery at ece.cmu.edu
Tue Sep 4 08:32:54 EDT 2007
On Sep 4, 2007, at 5:02 , Miguel Mitrofanov wrote:
>> It depends on arbitrary restrictions on what constitutes an
>> (boolean) expression, something that is anathema to
>> functional programmers :-) Spot the language:
>> while if E
>> then S; F
>> else False
>> do T
>>> It reminds me of a paper by Knuth, where he states that
>>> "goto" statement is necessary; don't remember the title,
>> I don't remember needing a goto in Haskell...
> Well, for imperative languages, of course.
We're talking goto-the-concept, since "break" counts as "goto"; thus,
so does MonadCont, and so does pattern match failure in a monad.
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery at kf8nh.com
system administrator [openafs,heimdal,too many hats] allbery at ece.cmu.edu
electrical and computer engineering, carnegie mellon university KF8NH
More information about the Haskell-Cafe