Version 1 (modified by ijones, 10 years ago) (diff)


Nondecreasing Indentation

See ExtensionDescriptionHowto for information on how to write these extension descriptions. Please add any new extensions to the list of HaskellExtensions.

Brief Explanation

Ross says: I think NondecreasingIndentation refers to changing > in the H98 (s9.3) rule

        L ({n}:ts) (m:ms)        =       { : (L ts (n:m:ms))     if n > m

to >=. GHC and Hugs do this if the previous token was "do", i.e. they accept

        f = do
                x <- readLn
                withFoo $ \ y -> do
                z <- readLn
                print (x+y+z)

but not

        g x = case x of
                Just y -> case y of
                Just z -> z



  • Just a minor adjustment
  • Pro


  • Con
  • Con