En ucuz lensler icin lutfen tiklayin.
Bir telefonla adrese teslim.
http://www.akdenizgoz.com
Akdeniz Goz Merkezi
Fevzipaþa No:73 Fatih0 212 635 74 74
Listeden cikmak icin [EMAIL PROTECTED]adresine bos mail gonderiniz
Your mail to 'Glasgow-haskell-bugs' with the subject
Kontakt Lenste yeni yil firsati 1 Kutu Lens 35 Milyon USTELIK
ADRESE TESLIM KACIRMAYIN_6357474__
Is being held until the list moderator can review it for approval.
The reason it is being held:
Post by non-member to a
Hal Daume III [EMAIL PROTECTED] writes:
Not for me, GHC 5.04.2 (Solaris).
here it goes right the first time, but then i have to type two more
letters (in this case 'b\n') to get it to respond to hello.
Solaris has a slightly bizarre buffering scheme in raw terminal
mode,
Hal Daume III [EMAIL PROTECTED] writes:
I'm not sure how generally useful this would be, but I would
find it useful to be able to attach notes to core expressions from
the Haskell code. The idea being something along the lines of a
code annotation like a pragma. [...]
Simon Peyton-Jones
using IORefs, one can construct linked lists in Haskell
that resemble one's used in imperative C programming.
eg, the following toy code creates a chain of 1000 linked records.
import IOExts
data Record= RecordNil
| Record String Int Chain
type Chain = IORef Record
main=makeChain
Colin [ccing GHC users in case there are other enthusiasts out there]
| we briefly discussed the lack in
| Concurrent Haskell of any way to set up a data-driven
| thread -- one that works on a data structure D without
| ever forcing its evaluation, only proceeding with the
| computation over D as
| 1. A facility to replace the default uncaught exception behaviour for
COM
| objects and similar shared library code
I'm out of my depth here. I think that if those interested in COMish
things get a consensus on what would be the Right Thing, and have some
idea about implementation, we'd be
Simon,
Next idea is to have a function
await :: a - b - b
which is rather like 'seq' except that it waits for its first argument
to be evaluated, whereas 'seq' evaluates it. Then you could write a new
version of 'length' which used await before every case expression. Is
that what you had in
Colin [ccing GHC users in case there are other enthusiasts out there]
| we briefly discussed the lack in
| Concurrent Haskell of any way to set up a data-driven
| thread -- one that works on a data structure D without
| ever forcing its evaluation, only proceeding with the
| computation
Volker,
I only saw your answer today since it was filed in my
Haskell-mailing-list folder. Indeed, I've moved on to
import Network.Socket
and then duplicated part of my code. One thing that I found annoying
was that the Protocol argument of
Network.Socket.socket
is not well specified. The type
I'm trying to build
ghc 5.04.2 from the source distribution (on Linux, RH 7.2), and get the
following error
..==fptools== make all -wr;in
11 matches
Mail list logo
