The following message is a courtesy copy of an article
that has been posted to comp.lang.functional as well.
Hi,
what is the wisdom behind representing a TimeDiff as a struct of year,
month, week and so on, instead of simply the (fractional) number of
seconds, or similar?
In particular, the
Keith Wansbrough [EMAIL PROTECTED] writes:
what is the wisdom behind representing a TimeDiff as a struct of year,
month, week and so on, instead of simply the (fractional) number of
seconds, or similar?
Firstly, I believe that the Time module is broken, and no one has yet
come up with a
Alec [EMAIL PROTECTED] writes:
On Wednesday 09 January 2002 06:50 am, S.D.Mechveliani wrote:
Zhe Fu [EMAIL PROTECTED] writes
Is there any built-in functions in Haskell to implement
diffential operation and partial diffential operation?
Or can anyone give me some advices about how to
DK [EMAIL PROTECTED] writes:
What I would like to ask, is how can I take a string from a list, and
manipulate it, in order to convert it to an integer.
That's very simple, and I'm of course happy to help out with homework
questions. (That's what mailinglists are for, after all.) So, how
Sigbjorn Finne [EMAIL PROTECTED] writes:
Yes, that's true at the moment, but it's something that we expect
to fix shortly. More precisely, Sigbjorn has been working on a
fix. It relies on using an OS thread to make a potentially-blocking
call, so it's a robust fix.
Modulo settling a
Simon Peyton-Jones [EMAIL PROTECTED] writes:
| Ahem - how far would this be from a real multithreaded
| implementation, i.e. one that could use a few OS threads to
| take advantage of multiple CPUs in an SMP system?
Not very far. We have had a working implementation of
such a thing,
Manuel M. T. Chakravarty [EMAIL PROTECTED] writes:
The detailed choice of colours is, of course, adjustable.
At least on a Unix machine, I am quite sure you can use
XEmacs also in batch mode to generate the HTML
Sure. Have a look at -batch, -f and -eval options. Be prepared for a
bit of
Richard Uhtenwoldt [EMAIL PROTECTED] writes:
Here are some Google search results that suggest how many web pages
are devoted to particular langauges. (Google tells you how many pages
match your query.) A better survey of language popularity would
include newsgroup and mailing list traffic,
Ashley Yakeley [EMAIL PROTECTED] writes:
I have a curious Haskell design pattern. It's called one class per
function.
[...]
I'm not sure if this is a good thing or a bad thing or what.
In many cases, I think a finer split would be advantageous, e.g. the
much-debated Num. One obvious
Martin Odersky [EMAIL PROTECTED] writes:
Redundancy maybe? What's wrong in having both layout and punctuation?
Short answer: What's wrong with it is that humans use layout to infer
the semantic meaning, compilers use punctuation. Thus it's not really
redundancy.
-kzm
--
If I haven't seen
Jon Fairbairn [EMAIL PROTECTED] writes:
Why -f anyway? It took me ages to work out what
-fallow-overlapping-instances meant -- I wondered how
fallow could apply to overlapping instances.
I suppose it's a GCCism, where options starting with -f specifiy
*f*lags. (Which doesn't seem to apply
Jamie Love [EMAIL PROTECTED] writes:
My questions include:
Is HaskellDB dead? Is it worth extending?
Is HaskellDirect dead or superseeded by the Haskell FFI?
I am having difficulty discovering which FFI technology/package is
still useful, viable and alive,
You have of course looked at
Colin Runciman [EMAIL PROTECTED] writes:
Could it be that the string-comparison sort simply has less sorting to do
than the int-comparison sort?
Not quite improbable, hang on while I print the profiling (with
comparison in its own function): Yes, that seems to be the case, for
90K values to
Koen Claessen [EMAIL PROTECTED] writes:
Another reason might be that the ints in the list are not
evaluated yet; and sorting the list on the ints forces
evaluation of them which maybe takes time?
Yes, I've thought of that, but (and correct me if I'm wrong!) I was
under the impression that
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
for 90K values to sort, I get 7M string comparisons and 321M integer
..and with different parameters giving 127K values, ie. a factor of
1.4, I get 12M and 614M comparisons, *very* close to the expected
O(n²) behavior of insertion sort.
The default
Jon Fairbairn [EMAIL PROTECTED] writes:
data Port = Tcpmux | Nbp | Echo_ddp | Rje | Zip | Echo_tcp | ...
deriving Enum, ...
instance Num Port where ...
Or, alternatively, just use Strings, and have a portFromString first
check /etc/services for a match, then try to parse the
Ralf Hinze [EMAIL PROTECTED] writes:
The haskell mailing list is getting an increasing amount of
spam, viruses, and virus warnings. Would it be possible
to change the list policy to only allow submissions from
subscribed members? Please?
I'd like to second this. The amount of spam etc is
anatoli [EMAIL PROTECTED] writes:
Dependence on the current locale is EXTREMELY inconvenient.
Imagine that you're writing a Web browser.
Web browsers get input with MIME declarations, and shouldn't rely on
*any* default setting. Instead, they should read [Word8] and decode
the contents
Ken Shan [EMAIL PROTECTED] writes:
I suggest that the following Haskell types be used for the five items
above:
1. Word8
2. CChar
3. CodePoint
4. Word16
5. Char
On most machines, Char will be a wrapper around Word8. (This
contradicts the present language standard.)
Can you
George Russell [EMAIL PROTECTED] writes:
Ketil wrote (quoting Ken)
On most machines, Char will be a wrapper around Word8. (This
contradicts the present language standard.)
Can you point out any machine where this is not the case? One with a
Haskell implementation, or likely to have one
George Russell [EMAIL PROTECTED] writes:
How does the file system know the difference? I think you mean that
C chars on Solaris are signed, not that files and sockets don't
contain octets.
Well, you can define the files to contain only directed graphs if it makes
you feel any happier,
George Russell [EMAIL PROTECTED] writes:
Ketil Z. Malde wrote:
[snip]
and on Solaris the default representation of a characters is as a
signed quantity.
Why should we care?
If you want to talk to any C libraries or C programs which use
characters, which some of us do. GNU readline
Wolfgang Jeltsch [EMAIL PROTECTED] writes:
In my opinion, the mailing list software should include an appropriate
Reply-To header field in every mail sent to the list so that replies are
automatically sent to the list.
[...]
Reply-To fields from several other lists I'm subscribed to and
George Russell [EMAIL PROTECTED] writes:
The situation with Enum on Ratio is pretty bad but at least
it's not hopeless, since rational numbers are at least exact. But
for Float/Double it seems to be a total disaster area.
My vote would be to scrap it. Enum sounds like it defines an
Ketil Z Malde [EMAIL PROTECTED] writes:
My vote would be to scrap it. Enum sounds like it defines an ordering
of elements, and that's IMHO not what the actual implementation looks
Just before everybody else points it out; that's a bit imprecise.
But the IMHO obvious way to regard succ would
Ian Lynagh [EMAIL PROTECTED] writes:
I note with some sadness the more restrictive license that may be placed
on the Haskell 98 Report, as reported by the HCA.
I have a hard time imagining what this actually means. The report, as
it is licensed now allows for:
I have just grabbed a copy of
Richard Braakman [EMAIL PROTECTED] writes:
On Thu, Nov 28, 2002 at 10:21:53PM +, Alistair Bayley wrote:
Wouldn't this have been better called unique? (analogous to the Unix
program uniq). I was looking for a unique in the GHC Data.List library a
few days ago, and didn't see one, so I
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
Malcolm Wallace [EMAIL PROTECTED] writes:
Ingo Wechsung [EMAIL PROTECTED] writes:
I wonder if the compiler could check, if all possible combinations have
been checked in a pattern match.
In ghc, use the compile-time option -fwarn-incomplete
[EMAIL PROTECTED] writes:
S.D.Mechveliani writes:
As Haskell has the standard functions fst, snd to decompose (a,b),
maybe, it worths to provide also [...]
I've found some of these useful, except I named them differently:
fst3 :: (a,b,c) - a
snd3 :: (a,b,c) - b
thd3 :: (a,b,c) - c
Matthew Donadio [EMAIL PROTECTED] writes:
OK, my question then has to do with the efficiency of lists versus
arrays. Do the latest compilers handle handle arrays efficiently, or
are lists really the way to go?
I've currently struggled a bit with arrays. I have a list based
program
Dominic Steinitz [EMAIL PROTECTED] writes:
Would it be possible to set up a mailing list for those interested?
We're getting a lot of these lists now (gui, libs, cafe) -- are they
really warranted? Couldn't they all fit in the libraries list? I'd
like to keep an ear to all of these
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
Prelude :r
phase `Literate pre-processor' failed (exitcode = 1)
I've no idea what trigged this, perhaps running out of file handles?
I forgot: GHC version 5.04.1. It seems that this is definitely
Simon Marlow [EMAIL PROTECTED] writes:
-- | add data from a file to the histogram
addFile :: FiniteMap String Int - String - IO (FiniteMap
String Int)
addFile fm name = do
x - readFile name
return (addHist fm x)
-- | add data from all files in a
Dean Herington [EMAIL PROTECTED] writes:
Ketil Z. Malde wrote:
-- | add data from a file to the histogram
addFile :: FiniteMap String Int - String - IO (FiniteMap String Int)
addFile fm name = do
x - readFile name
return (addHist fm x)
I changed this to read x
Dean Herington [EMAIL PROTECTED] writes:
Yes, getting the right amount of strictness--and in the right places--can be
tricky.
Tell me about it!
You should do the counting strictly:
Just n - case n+1 of n1 - addToFM f w n1
Thanks for the tip. Just performing this change didn't
Just a quick status report, and to note a couple of lessons learned:
Things work adequately, as far as I can tell. I can now process heaps
of data, without blowing up anything. Appears to be faster than
spam-stat.el, at least, although I haven't measured.
I'm back to using readFile for file
Steffen Mazanek [EMAIL PROTECTED] writes:
I am wondering if it would be worth while (and possible) to allow the
definition of types by regular expressions, e.g.
data Date = Date #RegExp([0-9][0-9]-[0-9][0-9]-[0-9][0-9][0-9][0-9])
or easier with some auxiliary constructs.
Not sure I follow
Mike T. Machenry [EMAIL PROTECTED] writes:
I am having a problem. I recently desided I wanted a bunch function to return
float instead of Int. I changed their type and wrote a new function that
returned a float. I figured it'd be okay if all the others still returned
Int since it's trivial
Matthew Donadio [EMAIL PROTECTED] writes:
Thank does sound like a pain, but it's better than putting fromIntegral
all over my code. Why can't Haskell unify a an expected float with an
infered int? It seems that this would make life alot easier.
Personally, I think that one of the things that
Hi,
This is one of those topics everybody else seems to be familiar with,
but which I don't quite understand, and can't seem to find any good
information about.
I have a function declared as:
anova2 :: (Fractional c, Ord b)
= [a-b] - (a-c) - [a] - [Anova1 c]
where the first
John Hughes [EMAIL PROTECTED] writes:
ICFP Programming Contest
There are just ten days to go to the sixth ICFP Programming Contest!
This *is* announced to all relevant groups (as in comp.lang.*, at
least)?
-kzm
--
If I haven't seen further, it is by standing in
Hi,
I have a small function to find all indices in an array where a given
subword can be found, looking like this:
ind i ws ar
| i+length ws-1 len e = []
| and [ar!(i+j) == ws!!j | j-[0..length ws-1]] = i : ind (i+1) ws ar
| otherwise = ind (i+1) ws ar
(i::Int is
Fredrik Petersson [EMAIL PROTECTED] writes:
something like [if (thenumber index) then (index,int+1) \and break\ else
(index,int) | (index,int) - [thelist]]
I think you need to write an explicit recursion, instead of using a
list comprehension.
Can i use some help-boolean to set it false
Iavor Diatchki [EMAIL PROTECTED] writes:
Adrian Hey wrote:
IMHO preserving the status quo wrt records should be low priority.
It really doesn't bother me much if new (useful) language features break
existing code. I think this is a better option than permanently
impoverishing the language
Johannes Waldmann [EMAIL PROTECTED] writes:
What about ad-hoc overloading (allowing visible entities to share names,
as long as they can be distinugished by their typing).
This is orthogonal to the proper records issue (?)
but it might improve the current situtation (?)
and it seems
Robert Ennals [EMAIL PROTECTED] writes:
[Heavy snippage, hopefully preserving semantics]
data Foo = Foo {wibble :: Int, wobble :: String}
deriving Wibble
We could imagine the definition of Foo being automatically desugared to the
following:
data Foo = Foo Int String
instance
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
Robert Ennals [EMAIL PROTECTED] writes:
BTW, isn't this more or less exactly what Simon suggested (at the very
top of this thread)?
-kzm
--
If I haven't seen further, it is by standing in the footprints of giants
[EMAIL PROTECTED] writes:
- There are features you might want to *disable*. eg.
GHC lets you turn off the monomorphism restriction.
NoMonomorphismRestriction?
Perhaps something like this:
{-# LANGUAGE Haskell98 +FFI -MonomorphismRestriction #-}
Nice!
I feel pragmas embedded in
Simon Peyton-Jones [EMAIL PROTECTED] writes:
So far we have not been regarding 6.2 as ultra-urgent because we
don't know of anyone who is really stuck with 6.0. Please let us
know if you are in fact stuck.
I already mentioned that I really need large file support, and I'd add
that I have
Andrew J Bromage [EMAIL PROTECTED] writes:
class Plus a b c | a b - c where
(+) :: a - b - c
class Mult a b c | a b - c where
(*) :: a - b - c
This kind of approach was discussed a while ago, and has a bunch of
things to recommend it. Is the functional
Simon Marlow [EMAIL PROTECTED] writes:
There is something really fishy going on; I checked out the same code
in a different directory, and built it in the same way, without
getting the same behaviour.
Hmm. Profiling isn't deterministic though, because heap samples happen
based on a timer
I've no idea if the following is supposed to work, but the message
tells me to report it, so here it is. Happens for all attempts to
define co-recursive functions, this is just the simplest example.
Prelude let { f = g ; g = f}
ghc-6.0: panic! (the `impossible' happened, GHC version 6.0):
Hi,
I can't reproduce it, but on one occasion running profiling with -hd,
I got corrupt .hp output, with a large block of NULs in an otherwise
normal output (The output is large, but I can make it available if
anybody wants it). Rerunning the exact same command line produced a
normal .hp.
Just
Simon Marlow [EMAIL PROTECTED] writes:
You must give the full module name in the header, eg.
module A.B.C where
This surprised me somewhat, and I must have missed any
discussion/rationale. Could you elaborate/point me at the relevant
information?
It seems to me that A.B could be
Jorge Adriano [EMAIL PROTECTED] writes:
Anyway, I was coding some simple GA, and as you probably know I need to use
random values. The most elegant way I could think of was to generate some
[...]
Monads! (right?)
Well, I suppose so. Generally speaking.
But, you might want to consider
Koen Claessen [EMAIL PROTECTED] writes:
| Does anyone have any better suggestions?
I think any solution that leaves it transparent as to if it
is a compiled or an interpreted module is fine.
But I have understood that this is hard to achieve...
How about using a different command for
S.D.Mechveliani [EMAIL PROTECTED] writes:
To my notes on ghc-5.02.2 Simon Marlow writes
Do you have the readline-devel RPM installed? This is needed to
compile GHC with readline support.
I run ghc here on two machines.
And it appears now that both are under Debian Linux.
Some
Hi
I'm building some stuff here that is basically a glorified and
specialized version of quicksort. It is very quick, and works like a
charm for my purposes, except that it consumes way too much space,
about 100 bytes times the size of the input list. Which means that,
for my data sets, the
While waiting for the gurus to bestow upon me fragments of their
wisdom, I've stumbled further on my path to enligthenment:
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
E.g. how much [space] for [...] a data type with only nullary data
constructors -- should I use Word8s instead?
From my
Simon Marlow [EMAIL PROTECTED] writes:
Actually no... but perhaps it's time to turn it on.
Yeah, I noticed a slight saving by turning an Int into an !Int, but
only when using -funbox-... option.
So the array shouldn't be too costly, I think - but perhaps an
UArray would reduce cost from
Hi,
from the GHC documentation (5.17.1 in the libraries section), I get
the impression that (!) is a member of the IArray class. While I'm
messing about with kinds and stuff getting this properly instantiated,
I get an error claiming that
EST.lhs:44:
Class `IArray' does not have a method
Simon Marlow [EMAIL PROTECTED] writes:
Yes, I see. Would it be possible to have a standard strict list,
Yes, it would be possible, but we can't do it without making
sweeping changes to standard libraries and deviating from Haskell 98
quite a bit. It's something to bear in mind should the
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
Thanks for all your help, though!
One interesting(?) observation,
using a custom data type of
data STuple = STuple !Int Foo
is slightly less efficient than using a normal tuple
(Int,Foo)
Seems to go against theory, in which
Simon Marlow [EMAIL PROTECTED] writes:
data STuple = STuple !Int Foo
is slightly less efficient than using a normal tuple
(Int,Foo)
Just checking... with -funbox-strict-fields, right?
Yep.
It's possible that the boxed Int is being reconstructed for some
reason.
The need to recompile everything after upgrading was recently
mentioned, I think, on this list. After upgrading from .1 to .2
(trying to get profiling on track), ghci gave me a slightly cryptic
message about an unknow symbol (stg_gc_enter_1). No big deal, and
after I removed the .o's,
Ashley Yakeley [EMAIL PROTECTED] writes:
At 2002-02-19 14:13, Duncan Coutts wrote:
So what I mean is, can we have links to more binaries than just Red Hat?
Debian, Mandrake, FreeBSD. (I know these's SuSE)
Seconded.
I'm not sure what the point would be, if they are in the
distributions
Simon Marlow [EMAIL PROTECTED] writes:
Cross compilation in GHC is usually done by taking .hc files
generated on a machine with a working GHC and compiling them on the
target machine using only gcc. This is how we bootstrap GHC on new
machines.
So then it reduces to getting a GCC cross
Simon Peyton-Jones [EMAIL PROTECTED] writes:
| Ahem - how far would this be from a real multithreaded
| implementation, i.e. one that could use a few OS threads to
| take advantage of multiple CPUs in an SMP system?
Not very far. We have had a working implementation of
such a thing,
Simon Marlow [EMAIL PROTECTED] writes:
warning: -O conflicts with --interactive; -O turned off.
So, is GHCi supposed to work w/ optimized modules after all?
Sure, GHCi is supposed to be able to load optimised object code just as
well as non-optimised object code. If it doesn't, this is a
Hi,
I really like the profiling options in GHC, but I wonder if there's
any good way of improving heap profiling speed? I've tried using -i
to reduce the number of measurements, but it didn't seem to help a
lot.
I see an order of magnitude speed degradation with heap profiling,
which is
Re the current and recurring conflicts between profiling and
non-profiling code; how hard would it be to name GHC's output files
differently when compiling with -prof?
I.e. without, you get the normal foo.hs - foo.o result, but with
-prof you could get e.g. foo.po or foo.p.o instead? (And of
Simon Marlow [EMAIL PROTECTED] writes:
The proposal, therefore, is to extend the meaning of '-prof' to mean
'-prof -osuf p_o -hisuf p_hi' or similar.
I wasn't aware of these ('-*suf') options. Are they respected by the
linker stage? I.e. will ghc --make when invoked with -osuf and -hisuf
Sven Moritz Hallberg [EMAIL PROTECTED] writes:
I see the people being very nice. But there is the question whether MS would
draw them away from GHC if it desides to go full-scale with something based
on GHC.
This is rather irrelevant in the context of licenses -- MS could do
this anyway,
Hi,
I have what I think is a really strange problem. I have a fair sized
problem, which involves sorting a data set, first on labels (which are
Strings) and then on scores (which are Ints).
The strange thing is that string sorting is *vastly* faster than int
scoring! Now, I've tried
Colin Runciman [EMAIL PROTECTED] writes:
Could it be that the string-comparison sort simply has less sorting to do
than the int-comparison sort?
Not quite improbable, hang on while I print the profiling (with
comparison in its own function): Yes, that seems to be the case, for
90K values to
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
for 90K values to sort, I get 7M string comparisons and 321M integer
..and with different parameters giving 127K values, ie. a factor of
1.4, I get 12M and 614M comparisons, *very* close to the expected
O(n²) behavior of insertion sort.
The default
Colin Runciman [EMAIL PROTECTED] writes:
Also, curiously enough, it could just as well be the problem that your
int-sorting phase has too *little* sorting to do, as this common
version of quickSort degenerates both for in-order and reverse-order
inputs.
*lights go on*
Of course! While I
Simon Marlow [EMAIL PROTECTED] writes:
There was some concern about the lack of laziness and stack
overflows [of merge- vs. quicksort], but the general concensus was
that merge sort was a better choice. Feel free to argue otherwise
:)
I'll hereby argue for using a quicksort implementation
Serge D. Mechveliani [EMAIL PROTECTED] writes:
ButsortBy' (compare) [1 .. n]
costs too much, even for n = 11000.
It costs (on worst data) many times more than mergeSort.
Yes, but why do you want to sort sorted data?
I think the multiple value cost, i.e. that
sortBy
Simon Marlow [EMAIL PROTECTED] writes:
GHC support will be intermittent at best for the next week or so, as
Simon I are both heading out to Pittsburgh for ICFP and the Haskell
workshop. Catch you all later...
And here I recently started using GHC 5.04 from the provided RH7.2
packages, and
At the moment, I have a user defined data type on which I have defined
some operations, instantiated (not derived) Eq and so on. However,
for efficiency I'm storing the actual data in UArrays of Word8.
In order for everything to work, I need functions 'toW8' and 'fromW8'
to map between the
Hal Daume III [EMAIL PROTECTED] writes:
If you have a short program which demonstrates the same problem, I'm sure
Simon would love to get a copy...
I have a longish program that demonstrates the same problem; that is,
it only fails when the moon is aligned or something. :-)
It happens (has
Hal Daume III [EMAIL PROTECTED] writes:
So I love the fact that I can derive anything I want on
newtypes. However, there seem to be problems with it. If I write:
newtype Foo = Foo Int deriving (Show)
x = show (Foo 5)
Then x is Foo 5
However, if I do
newtype Foo = Foo
Ashley Yakeley [EMAIL PROTECTED] writes:
I did notice that for -osuf you seem to need the '.' but for -hisuf you
don't...
Weird, I've never seen that behavior (GHC 5.02 and 5.04, x86-Linux and
Sparc-Solaris). I just checked with 5.04 on my Linux box, and 5.02 on
a Sun, just to make sure.
Hi,
I'm occasionally getting an error, when running a compiled program, I
get:
| fatal error: GetMBlock: misaligned block 0x401fe000 returned when
| allocating 1 megablock(s) at 0xbff0
apparently, this only happens on one computer (Red Hat 7.1), and not
others (Red Hat 7.2), which leads
I posted something on haskell@, but perhaps this is a better forum for
possible bug reports (I didn't get any replies, at any rate).
(Edited severely for brevity and relevance)
-kzm
---BeginMessage---
[...]
Talking about warnings, it is probably patently stupid to put
{-# OPTIONS
Zdenek Dvorak [EMAIL PROTECTED] writes:
DiffArray seems to be broken :). Either that or I'm using it
incorrectly.
I've tried to use DiffArray recently and it is terribly slow.
Just another data point. I'm fumbling around with Arrays these days
(see my recent post on haskell-cafe) and thought
Hi,
when toying around with GHCi, I got a bunch of
Prelude :r
phase `Literate pre-processor' failed (exitcode = 1)
Prelude :l Hist
phase `Literate pre-processor' failed (exitcode = 1)
ghc -c -Wall didn't find anything suspicious, and in the end, exiting
and restarting ghci did the
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
[EMAIL PROTECTED] (Ketil Z. Malde) writes:
Prelude :r
phase `Literate pre-processor' failed (exitcode = 1)
I've no idea what trigged this, perhaps running out of file handles?
I forgot: GHC version 5.04.1. It seems that this is definitely
Simon Marlow [EMAIL PROTECTED] writes:
-- | add data from a file to the histogram
addFile :: FiniteMap String Int - String - IO (FiniteMap
String Int)
addFile fm name = do
x - readFile name
return (addHist fm x)
-- | add data from all files in a
Just a quick status report, and to note a couple of lessons learned:
Things work adequately, as far as I can tell. I can now process heaps
of data, without blowing up anything. Appears to be faster than
spam-stat.el, at least, although I haven't measured.
I'm back to using readFile for file
I notice the release notes say a few architectures should be possible
to port to, in particular AIX/POWER. How possible is that, exactly?
Has anybody done it with any success? Alternatively, is there any
alternative Haskell compiler (I guess that would be NHC?) that works
for this architecture?
Martin Norbäck [EMAIL PROTECTED] writes:
{-# OPTIONS -fglasgow-exts -cpp #-}
-- parser produced by Happy Version 1.13
{-# OPTIONS -fno-warn-unused-matches #-}
Generally, it'd be nice to be able to occasionally suppress warnings
for sections of code (with better than module granularity), where
Simon Peyton-Jones [EMAIL PROTECTED] writes:
Yes, I'm afraid so. With -fglasgow-exts Template Haskell captures
[t| ... |]
and
[p| ... |]
and similarly [d| and [e|
for quotations.
I had a similar experience when I defined the (?) operator. Which
obviously clashes with the
Simon Peyton-Jones [EMAIL PROTECTED] writes:
Ken Shan was making good progress on an Alpha port of GHC. Ken, could
you update us on the status?
Courtesy of the good people at SGI, I have now access to an SGI Altix
(8 Itanium processors, and lots of RAM that I Really Need). So, I'm
very
Simon Marlow [EMAIL PROTECTED] writes:
There isn't a flag to turn off array bounds checking - it would require
compiling against different libraries.
I must have misremembered it from somewhere, perhaps confusing it with
-fliberate-case-threshold mentioned a while ago (which probably
belongs
Simon Marlow [EMAIL PROTECTED] writes:
Apparently, the function keys insert 'ESC O x', with varying x's,
perhaps it's the ESC that breaks GHCi?
Could be a readline bug, but I don't have a RedHat 9 system here to
test on.
Apparently, Python behaves in the same way. I'll file a report with
Simon Marlow [EMAIL PROTECTED] writes:
I don't know how the Ada guys do it. Perhaps they have an alternate
set of compiled libraries with bounds-checking turned off?
Me neither, I've just heard the idea discussed, not the actual
technology.
I suppose I can do it by wrapping array accesses
Hi,
Is it possible to link libc statically with GHC? My Linux box has
been upgraded, and compiled binaries no longer work on older
systems. :-(
-kzm
--
If I haven't seen further, it is by standing in the footprints of giants
___
Simon Marlow [EMAIL PROTECTED] writes:
-optl-static should do the trick.
That worked nicely, thanks!
(PS: Am I looking in the wrong places, or are a lot of GHC options
undocumented? I seem to remember options being brandished about (turn
of array bounds checking, tuning unboxing and stuff)
1 - 100 of 153 matches
Mail list logo
