#960: Lexical call site string
--------------------------------+-------------------------------------------
Reporter: [EMAIL PROTECTED] | Owner:
Type: feature request | Status: new
Priority: normal | Milestone:
Component: Compiler | Version: 6.6
Severity: normal | Resolution:
Keywords: | Difficulty: Unknown
Testcase: | Architecture: Unknown
Os: Unknown |
--------------------------------+-------------------------------------------
Changes (by Neil Mitchell):
* cc: => [EMAIL PROTECTED]
Comment:
I think the transformation would be simpler than Hat, but would require
extra state to be passed round (the stack), so won't be as simple as HPC.
I think you could probably write this as a Yhc.Core transformation in a
few hours. I may give this a go sometime this week. It should also be
pretty easy to add into the Yhc runtime. (I suspect things will be harder
in GHC due to more aggressive optimisation, and more complex runtime)
I don't think something like Catch [1] would help narrow down the
expressions - Catch identifies multiple separate calls to head, some of
which might fail and some of which might pass - an implementation would
have to pass failure information if any of them might fail. In addition
Catch's transformations are quite heavy, so won't map directly onto the
original Haskell. Of course Catch might solve the problem by formal
verification, so might answer the question without actually running the
program (once its finished...)
[1] http://www-users.cs.york.ac.uk/~ndm/projects/catch.php
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/960>
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
