Bugs item #710864, was opened at 2003-03-27 17:48
Message generated for change (Comment added) made by simonpj
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=710864group_id=8032
Category: Profiling
Group: 5.04.2
Status: Open
Resolution: None
Priority: 5
The (Interactive) Glasgow Haskell Compiler -- version 6.2
We are pleased to announce a new major release of the Glasgow Haskell
Compiler (GHC), version 6.2.
The following haskell program :
--
module Main where
accentLetters :: String
accentLetters = éàô
main :: IO ()
main = do putStr (show accentLetters)
--
after being compiled will give the result :
\233\224\244
But, exactly the same program, without the show function
will
Done, I believe. It'll be in the next release (6.3/6.4).
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:glasgow-haskell-users-
| [EMAIL PROTECTED] On Behalf Of Mike Gunter
| Sent: 07 December 2003 16:50
| To: [EMAIL PROTECTED]
| Subject: Re: ghc warnings messed up in 6.01
This has to be one of the most irritating ways a program can
fall over.
Can't the Haskell RTS try just a /little/ harder to help the poor
programmer? For example by saying what sort of exception it is, and
(if it's a dynamic exception) what type it has?
An unknown exception is a dynamic
The (Interactive) Glasgow Haskell Compiler -- version 6.2
We are pleased to announce a new major release of the Glasgow Haskell
Compiler (GHC), version 6.2.
Imagine I have a data structure like so:
data E = EAp E E | ELam Int E | ELetRec [(Int,E)] E | EVar Int
now, I want to annotate every occurence of E with some pass specific
information, such as free variables or levels for lambda lifting.
in [PEY91] this technique was used:
data EAn a = EaAp
On 16-Dec-2003, John Meacham [EMAIL PROTECTED] wrote:
newtype Id a = Id a
type Er f = f (E f) -- E used recursivly
data E f = EAp (Er f) (Er f) | ELam Int (Er f) |
ELetRec [(Int,Er f)] (Er f) | EVar Int
[...] problem 2 persists. If I don't want to be constantly
casting to and
G'day all.
Quoting John Meacham [EMAIL PROTECTED]:
Imagine I have a data structure like so:
data E = EAp E E | ELam Int E | ELetRec [(Int,E)] E | EVar Int
now, I want to annotate every occurence of E with some pass specific
information, such as free variables or levels for lambda lifting.
G'day all.
Quoting Fergus Henderson [EMAIL PROTECTED]:
Unless I missed something, none of those solve all the problems that
Meacham is trying to solve (numbers 1 and 2 in his original mail).
Many of them solve problem number 1, in that an unannotated structure
is computationally identical to
Hi all, I am trying to lear more about arrows in haskell, so I am
reading the paper at:
http://www.soi.city.ac.uk/~ross/papers/fop.html
However, I can't understand how to produce a working and meaningful
example of the trace function, or the loop arrow (I am using the
automata example).
The
On Tue, Dec 16, 2003 at 01:31:19PM +0100, Vincenzo aka Nick Name wrote:
Hi all, I am trying to lear more about arrows in haskell, so I am
reading the paper at:
http://www.soi.city.ac.uk/~ross/papers/fop.html
However, I can't understand how to produce a working and meaningful
example of
12 matches
Mail list logo