#1544: Derived Read instances for recursive datatypes with infix constructors
are
too inefficient
-------------------------------------+--------------------------------------
Reporter: jcpetru...@gmail.com | Owner:
Type: bug | Status: new
Priority: normal | Milestone: 6.12.1
Component: Compiler | Version: 6.6.1
Severity: normal | Resolution:
Keywords: | Difficulty: Unknown
Testcase: | Os: Unknown/Multiple
Architecture: Unknown/Multiple |
-------------------------------------+--------------------------------------
Comment (by Doaitse):
We consider this problem basically solved by the ChristmasTree library we
uploaded to Hackage, with its associated packages.
See:
http://hackage.haskell.org/packages/archive/ChristmasTree/0.1/doc/html
/Text-GRead.html
I am currently doubtful whether this should be incorporated in the GHC as
it stands now. We think it is better to find some other uses of the TTTAS
library before we decide how to proceed. Thus far we got no questions
about these packages, which implies either that they solve the problem or
that they are not used at all. In neither case this provides information
to us on how to proceed. At least the severity could be lowered to
"minor"?
Doaitse
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/1544#comment:19>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
Glasgow-haskell-bugs@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
