Deryck F Brown wrote:
However, having managed to build hsc.exe, I now have a compiler
that simply crashes trying to access location "0x000...8". I
am building with ghc-4.045 from Sigbjorn's web page (which is
still the current version there, despite the ghc page hinting
it might be 4.06!)
i'd like to read a byte stream from stdin.
the stream contains 0xFF now and then.
i fear that such a byte is treated as EOF by ghc,
because processing seems to stop right after it first occured.
do you know a workaround?
in case you're asking - i'm trying to implement the GMP (go modem
Johannes Waldmann wrote:
i'd like to read a byte stream from stdin. the stream contains 0xFF
now and then. i fear that such a byte is treated as EOF by ghc,
because processing seems to stop right after it first occured.
Hmmm, I've never experienced something like this. The following code
Hi,
if you're using ghc under Win32, this is expected behaviour
(and is there because of backwards compatibility with CP/M -
see http://support.microsoft.com/support/kb/articles/Q68/4/23.asp
for more info.)
The fix is to open your file in BinaryMode using
IOExts.openFileEx :: FilePath -
Thu, 10 Feb 2000 23:17:13 +1100 (EST), [EMAIL PROTECTED] [EMAIL PROTECTED] pisze:
Could we please have lightweight extensible records for Haskell
(as in the paper by (Mark|Simon Peyton) Jones in the 1999 Haskell
Workshop).
(http://www.cse.ogi.edu/~mpj/pubs/recpro.ps.gz)
I've read it. I
More. Extensible records makes a syntactic difference between field
access and function call. So if one wants to export a type abstractly
or simply to provide functions operating on it without fixing the
fact that they are physically fields, he ends in writing functions like
size:: MyRecord -
Juergen Pfitzenmaier [EMAIL PROTECTED]
writes on 9 Feb 2000
Maybe I understand why Sergey wants to use overlapping instances in his
DoCon. 2 years ago I tried to the same thing in C++ (also while implementing
a computer algebra system). Overlapping instances *may* be useful, but
in
Hi,
It seem that any record, no matter how trivial, can't be much
longer than about 200 lines in Haskell. If a try to compile a
300 line record containing just:
data X = X {
f1 :: String,
f2 :: String,
f3 :: String,
...
f300 :: String
}
It needs about 90M
Marcin 'Qrczak' Kowalczyk wrote:
[...]
In general I don't quite like the fact that records are getting more
anonymous. Magical instances of basic classes? How inelegant.
If I want the record type to have an identity, it will have to be
wrapped in a newtype, so I must think at the
Siva,
Are you aware of chapter 6 of the Haskell 98 Library Report:
http://haskell.org/onlinelibrary/array.html
There are a couple of examples of using arrays there which might be
enough to get you started.
Also, if you're looking at FFT, FPs, and paralelism, you'll probably be
interested
The "Gentle Introduction" covers arrays in some detail;
http://haskell.org/tutorial/
In terms of code, there's a bunch of old'ish (= bitrotting)
'numeric methods' code in
ftp://ftp.dcs.gla.ac.uk/pub/haskell/library/
contributed by Stephen Bevan.
--sigbjorn
Simon Peyton-Jones [EMAIL
Call For Papers
ACM-SIGPLAN 2nd International Conference on
Principles and Practice of Declarative Programming (PPDP 2000)
Montreal, Canada, September 20-22, 2000
http://www.cs.yorku.ca/ppdp-00
Does anyone know of a good source of tutorial material on
Haskell arrays? Anyone feel like typing something into
the Haskell Wiki?
Incidentally, the front page of the Haskell Wiki
http://haskell.org/wiki/wiki
is rather unhelpful. Not even a table of contents. No clue
as to what this
13 matches
Mail list logo
