#3335: make some Applicative functions into methods, and split off Data.Functor
---------------------------------+------------------------------------------
Reporter: ross | Owner:
Type: proposal | Status: closed
Priority: normal | Milestone: Not GHC
Component: libraries/base | Version:
Severity: normal | Resolution: fixed
Keywords: | Difficulty: Unknown
Testcase: | Os: Unknown/Multiple
Architecture: Unknown/Multiple |
---------------------------------+------------------------------------------
Changes (by ross):
* status: new => closed
* resolution: => fixed
Comment:
There was substantial discussion by 8 people over 2 months.
* Making these methods redefinable allows significantly more efficient
implementations for some instances (e.g. (<$) for Seq, (*>) and (<*) for
parsers Edward Kmett is working on, some and many for first/empty
calculations for recursive descent parsers). The same could be achieved
by RULES, but these are GHC-only, and relying on the optimizer for
asymptotic improvements is dangerous.
* Other functions were suggested for the same treatment, but they can be
left to another proposal: (**), liftA2 and pair (= liftA2 (,)).
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/3335#comment:2>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
