[GHC] #13855: Syntactic sugar to write the recursion in GHC

[GHC]

#13855: Syntactic sugar to write the recursion in GHC
-------------------------------------+-------------------------------------
        Reporter:  vanto             |                Owner:  (none)
            Type:  feature request   |               Status:  new
        Priority:  normal            |            Milestone:
       Component:  Compiler          |              Version:  8.0.2
      Resolution:                    |             Keywords:
Operating System:  Unknown/Multiple  |         Architecture:
                                     |  Unknown/Multiple
 Type of failure:  None/Unknown      |            Test Case:
      Blocked By:                    |             Blocking:
 Related Tickets:                    |  Differential Rev(s):
       Wiki Page:                    |
-------------------------------------+-------------------------------------

Comment (by j.waldmann):

 Please don't. You want to introduce new syntax for definition of
 functions? There are very good reasons for what's currently in the
 Language Standard. In this case: definitions are equations, because we
 want to do equational reasoning. Your proposal severely obfuscates the
 equations. I refuse to parse "fib n = 0 = 0".

--
Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/13855#comment:1>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler