HPath in conjunction with
LaTeX macros to allow easy inclusion of Haskell in elaborate
documents.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Thanks; this should be enough for me to get it working again.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to these two projects and if any
docs remain for them.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
A quick check on Hayoo! and in my interpreter shows that
there are basically no instances of `IsString`. Is it
really so little used?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
2009/12/20 Brandon S. Allbery KF8NH allb...@ece.cmu.edu:
On Dec 20, 2009, at 17:09 , Jason Dusek wrote:
A quick check on Hayoo! and in my interpreter shows that
there are basically no instances of `IsString`. Is it
really so little used?
The only 2 instances I'm aware of are String
-include-dirs= and --extra-lib-dirs= to specify where it is.
It takes like a minute to err out, too. This isn't urgent or
anything but it would be nice to know how to get this build
process -- C generation followed by compilation -- to work
again.
--
Jason Dusek
:
http://en.wikipedia.org/wiki/CamelCase#Variations_and_synonyms
Cheers,
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
(for Haskell) approach.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Concatenating two `ByteString`s is O(n)?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/12/16 Stephen Tetley stephen.tet...@gmail.com:
2009/12/16 Jason Dusek jason.du...@gmail.com:
What is the relationship between the Parsec API, Applicative
and Alternative? Is the only point of overlap `|`?
Lots of functions in Text.ParserCombinators.Parsec.Combinator can be
defined
with a
Haskell comment, like `-- EOT`. Since your message always
comes wrapped in a list, you could just use the square
brackets to tell you when you're done.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
2009/12/16 Mitar mmi...@gmail.com:
On Wed, Dec 16, 2009 at 11:25 PM, Jason Dusek jason.du...@gmail.com wrote:
Criterion for garbage is that it is not readable with read and that
not because there would be not enough data available. It seems that I
will need to do buffer filling and reading
.
I've done one Haskell contract this year, for legal document
processing. This was a case where the client was definitely
more focused on the solution than the language used and
really cared a lot more about a good CLI and clearly defined
output for each processing step.
--
Jason Dusek
What is the relationship between the Parsec API, Applicative
and Alternative? Is the only point of overlap `|`?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/12/14 Edward Kmett ekm...@gmail.com:
[...] That doesn't mean that I want to subject myself to working
in such a sufficient computing environment :)
Sufficient?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
2009/12/12 Luke Palmer lrpal...@gmail.com:
On Fri, Dec 11, 2009 at 7:07 PM, Jason Dusek jason.du...@gmail.com wrote:
Where do we draw the line between machinery and packages?
The types don't tell us what libraries we need.
...you might mean what *haskell* libraries does a piece of
code
functions like bracketSmall are
necessary if we want to hide the stream itself from being exposed outside of
the traversal function. For example, your foldlSmall doesn't leak, but
something at the same level of scope as it could leak the list.
Jason
Hi Heinrich,
On Sat, Dec 12, 2009 at 2:42 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
Jason Dagit wrote:
My next experiment will be to find ways to express take this operation
and
apply it to a stream without letting the stream leak. One implication is
that gzReadFilePS
On Sat, Dec 12, 2009 at 1:37 PM, Johann Höchtl johann.hoec...@gmail.comwrote:
On Dec 12, 7:13 pm, Jason Dagit da...@codersbase.com wrote:
Hi Heinrich,
On Sat, Dec 12, 2009 at 2:42 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
Jason Dagit wrote:
My next experiment
to native code
in a way that trusts it to be pure, I don't see how having a
way to bind to nominally side-effecting Haskell code in a way
that trusts it to be pure adds anything to our troubles.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe
?
The types don't tell us what libraries we need. They don't
tell us how much RAM/CPU we need, either.
Pure functional code as the minimal essence of pure
computation -- everything else an EDSL.
Partial or total code?
--
Jason Dusek
___
Haskell-Cafe
is that it would allow for kind
polymorphism in a useful way. Or at least, in a way that I tend to yearn
for it.
Do you have anyway to get kind polymorphism?
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
-DxJ5S0sgPSl82kBQsa=Xoi=book_resultct=resultresnum=3ved=0CA8Q6AEwAjgK#v=onepageq=f=false
Looks like you're telling the truth. Learn something new every time I read
Haskell-Cafe :)
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
understand the holes in Haskell's type system. Have you
published some research on the flaws of Haskell's design? If Haskell is
unsound I'd certainly like to know where and why so that I can improve my
programs. Please help.
Thanks,
Jason
___
Haskell-Cafe
wren ng thornton wrote:
concat1 :: T a b - (b - T a b) - T a b
This could just as easily be
concat :: T a b - (b - T a c) - T a c
right? It's a little weird to call this concatenation, but I bet it
could come in handy.
--
Jason McCarty jmcca...@sent.com
to be
unjust, and it encourages more of the same. It's like
littering your own house.
+1
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'd suggest the Prelude and Data.List
The code is very clear and thoroughly documented.
Knowing what is there will pay off again and again.
- Jason
On Nov 30, 2009, at 5:22 AM, Michael Lesniak wrote:
Hello,
In terms of
to become a great programmer, you need to read great programs[1
Then the maintainer of Parsec specifies that 2.1.0.1 is
compatible with 2.1.0.0 and we can compile the second package,
the one that require 2.1.0.0, with 2.1.0.1 since they are
compatible and that is all it is asking for. Then we try to
use these two packages together and everything works.
--
Jason
)
As for `preserveMatrix`, it is some OpenGL thing; probably
what it does is ensure that any changes you make to one of the
matrices that make up the rendering state are undone once you
exit the enclosed computation.
--
Jason Dusek
___
Haskell-Cafe mailing list
; but this doesn't capture the notion that
all these records conform to a certain type equation. In this
way, Haskell is more demanding of you; but it also offers you
a way to make the semantics of your data explicit.
--
Jason Dusek
___
Haskell-Cafe
column wide.
In addition, a little utility is provided that constructs a
table of widths by character and a listing of character ranges
with the same width. On different systems, `wcwidth` may
assign different widths to the same character for some obscure
characters.
--
Jason Dusek
. However, I was quite keen on releasing my JSON
parser in a timely manner; the maintainer was (very
reasonably) not on my schedule and I'm not sure my patch was
ever applied.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
).
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
)
Linking demo ...
0x5cff -1 峿
:; chmod ug+x DemoFailure.hs DemoFailure.hs
0x5cff 2 峿
Switching between safe/unsafe does not make any difference. This
was run on a Macintosh.
--
Jason Dusek
#!/usr/bin/env runhaskell
{- DemoFailure.hs -}
{-# LANGUAGE
Thank you very much!
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
There is a Cabal package for this already:
http://hackage.haskell.org/package/setlocale
A call to `setLocale LC_ALL (Just )` in `main` fixes things.
--
Jason Dusek
2009/11/13 Daniel Fischer daniel.is.fisc...@web.de:
Am Samstag 14 November 2009 00:00:36 schrieb Jason Dusek:
I'm
on
linux. Does GHC on windows use GNU ld?
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
`closecport`? Maybe you could put in a
print statement in the C to find out?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
if this helps.
Here is the compilation script:
ghc -fglasgow-exts serial.c %1.hs -L./ -ljapi --make
erase *.hi
erase *.o
strip %1.exe
I encourage you to look into Cabal soon :)
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
`argv` is `char**` and not
`char*`, right?) so we introduce `stringPrim` and then build
up the primitives from that.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Does marking the call `unsafe` make any difference?
This is running on a *NIX of some flavour?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Nov 5, 2009 at 6:15 PM, brian bri...@aracnet.com wrote:
On Nov 5, 2009, at 8:26 AM, Jason Dagit wrote:
Haskell knows when I have a list of Doubles, you know, because it's
strongly typed.
Then it proceeds to box them. Huh ?
Imagine a computation which will yield a Double
2009/11/4 Philippos Apolinarius phi50...@yahoo.ca
Jason Dusek wrote:
How do you read in the IOUArray? By parsing a character
string or do you treat the file as binary numbers or ... ?
I always pare the file. Parsing the file has the advantage of
alowing me to have files of any format
/latest/html/libraries/base/System-IO.html#v:hSetBuffering
You probably want to look at 'interact' also.
Or just switch to readline as others have suggested.
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
2009/11/04 Jason Dusek jason.du...@gmail.com:
...you parse the file I imagine you in face...
in face - in fact
Sorry.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
How do you read in the IOUArray? By parsing a character string
or do you treat the file as binary numbers or ... ?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
do that, then getting the kth prime at run-time is O(k). Take
that AKS! :)
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, Nov 2, 2009 at 2:40 PM, Will Ness will_...@yahoo.com wrote:
Jason Dagit dagit at codersbase.com writes:
On Mon, Nov 2, 2009 at 1:59 PM, Will Ness will_n48 at yahoo.com
wrote:
Will Ness will_n48 at yahoo.com writes:
One _crucial_ tidbit I've left out: _type_signature_.
Adding
are.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
illegal. Why should they be? I truly don't
understand the resistance to this idea. :)
Don't you mean 3 `(-)` 2? I'm pretty sure -, without the parens is infix
and (-) is prefix. So it seems to me that you need the brackets for this to
be consistent.
Jason
reasonably happy considering the
relative cost.
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
(if you don't take 0*x = 0 as an axiom, I think
there are two possibilities for 0*∞).
--
Jason McCarty jmcca...@sent.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with view
patterns.
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
This version fixes defective handling of empty objects and
arrays.
http://hackage.haskell.org/package/json-b-0.0.4
Thanks to Dmitry Astapov for this fix.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
on hackage that there may not be any tests
for this package and it is a 0.1 release. I'd contact the author, as it
seems there is a deficiency in the documentation or a bug in the
implementation.
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
it
with your peers and show them fun and cool things you've written using
Haskell. I think this is more compelling for the uninitiated than
statements about perceived technical power of the language. I've heard
people explain this as, showing is better than telling.
Cheers,
Jason
at the
bottom that has exactly the format of the user property of
the schema ahead of it -- why is that? Well, `json-schema`
uses a fault tolerant parsing approach; the very last Tweet
was cut off and the user property's value was among the
things that could be salvaged.
--
Jason Dusek
2009/09/28 John A. De Goes j...@n-brain.net:
Libraries are _everything_...
Not exactly. Python would never have gotten a foothold over
Perl, nor Java over C, if cleaner language semantics weren't
enough for some shops or certain applications.
--
Jason Dusek
, that a wholesome vegetable -- good raw
or pickled or in little salady things like coleslaw -- finds
itself used as a disincentive.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Some day, we're going to need a short, catchy name for Cabal
packages. Let's call them cabbages.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
can be extended to the other ones, at the cost of
a few characters.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/09/20 Joe Fredette jfred...@gmail.com:
I also agree. Hackage should also be renamed to something appropriate.
The Cabbage Patch?
+1
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
I can notice in 2 minutes of
looking.
Good luck!
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sat, Sep 12, 2009 at 12:46 PM, Jason Dagit da...@codersbase.com wrote:
On Sat, Sep 12, 2009 at 12:08 PM, Diego Souza dso...@bitforest.orgwrote:
Hi,
I was trying to solve a simple problem in SPOJ, however, after two weeks
trying almost everything I could think of, I was still getting
library the
ability to apply the correct functions transparently in accordance with the
file system of the volume.
Yes, and in the meantime we can implement something like this in
workaround.hs.
Thanks!
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe
call rnf (I think).
That's my understanding, but I could be wrong.
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, `bint` just calls my `int` and `int` calls `lazy_int`
so why are there 41 million plus entries of `lazy_int`?
--
Jason Dusek
spoj-eugene-prof-opt-bang-acc-scc-dfold.prof
Description: Binary data
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
technical.
I'm sure I'm not alone when I say I'd like to see the longer,
more technical response.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
not a common
requirement, anyways).
http://hackage.haskell.org/package/bytestring-nums-0.3.0
I suspect that splitting the string into pieces and then
mapping the parser over the pieces will never be faster than
an all-in-one parser/tester/incrementer like the fast programs
have.
--
Jason
2009/08/30 Eugene Kirpichov ekirpic...@gmail.com:
Here's my version that works in 0.7s for me for a file with 10^7
9's but for some reason gets a 'wrong answer' at SPOJ :)
Maybe it gets a wrong answer because it reads all the input,
regardless of `n`.
--
Jason Dusek
I've updated Don Stewart's solution to compile with the modern
ByteString libs. I'll be looking at ways to improve the
performance of the `bytestring-nums` package.
--
Jason Dusek
http://github.com/jsnx/bytestring-nums/blob/d7de9db83e44ade9958fb3bfad0b29ede065b5dd/SPOJDons.hs
Say we have a nice thread on this and we all realize that the
precedence of `do` and `case` could be changed (and changing
`if` would be nice but we can't have everything). How many
months/years would it take for any change in that direction to
occur?
--
Jason Dusek
into Haskell examples.
You could do this as a warm up exercise before starting on your music
editor.
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
...
foo case...
foo if...
were always parsed as:
foo (do...)
foo (case...)
foo (if...)
This is what is usually meant.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
(+) fibs (tail fibs)
Then to get a specific fib, zero index, you do:
fib n = fibs !! n
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/gitit-discuss
If anyone would like to see an example of gitit using the darcs
filestore (we affectionately call it 'darcsit'), you can take a look
at the darcs project wiki:
http://wiki.darcs.net/
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe
like this library.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
and Linux? Is this a bug or am I doing
something wrong?
For me on OSX it has the intended behavior. Which is to say, every
time I type a key I see the ascii value of the key. I have no idea
why windows is being different.
Jason
___
Haskell-Cafe mailing
number corresponds to the length of
a given list?.
I'd love to see what you figure out.
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to a function
that can append them, the type system won't know that you have a
vector which is twice the original size.
Dan
On Fri, Aug 21, 2009 at 2:03 PM, David Menendezd...@zednenem.com wrote:
On Fri, Aug 21, 2009 at 1:03 PM, Jason Dagitda...@codersbase.com wrote:
Even with a type class
Aha. From `Data.ByteString.Lazy` we have:
null :: ByteString - Bool
null Empty = True
null _ = False
So either users need to norm ByteStrings before testing
them for emptiness or it needs to happen within the ByteString
code...
--
Jason Dusek
2009/08/19 Jason Dusek jason.du...@gmail.com:
Aha. From `Data.ByteString.Lazy` we have:
null :: ByteString - Bool
null Empty = True
null _ = False
So either users need to norm ByteStrings before testing
them for emptiness or it needs to happen within the ByteString
code
2009/08/18 Eric Wong wsy...@gmail.com:
When I was using C and Python, I used to think of most
applications in an simulation way.
By simulation way, do you mean object-oriented way?
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe
. Humans tend to
think of the world, and things in, in the way that they understand
things in their area of expertise.
If you develop expertise in Haskell (or FP in general) you will like
begin to see things in functional ways.
Jason
___
Haskell-Cafe
) return xs
foldlM f = foldl (\t h - t = flip f h) . return
depending on the monad.
foldl1M f (x:xs) = foldlM f x xs
--
Jason McCarty jmcca...@sent.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
it doesn't.
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
package:
http://code.google.com/p/dimensional/
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
reading research about effect systems for
the sake of version control. I'll have to look into this.
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of
information, and not just for files, but network, memory,
etc., then you'll be able to do some extremely powerful
parallelization optimization.
I am challenged to imagine optimizations that would be safe in
the case of File I/O.
--
Jason Dusek
___
Haskell
...
Thanks for the HP!
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
that for granted :)
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
writing yourself.
+1
--
Jason Dusek
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of the GNU GPLv3.
Note intended as a criticism of the GPL or your decision to use it, but does
this impact people's ability to use the Delve standard libraries in their
own non-GPL projects?
Good luck!
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe
catch on once it exists.
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
not a problem of antiquity but
instead one related to what configure finds when building GHC for that
system. In other words, it should be possible to make a version of GHC
locally that doesn't use timer_create and then your student should be good
to go.
Hope that helps,
Jason
to work around
this depending on how you want to solve it. By the way, for your StmtRec
you probably want a newtype instead of a type.
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/07/31 Jeremy Shaw jer...@n-heptane.com:
...why doesn't the stuff get freed eventually?
It is my understanding that the GHC runtime never lets go of
memory once it has requested it. (Confirmation either way
would be informative.)
--
Jason Dusek
...
And then use the module trick to switch the code around?
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
for
hugs.
Use GHC's profiler. Figure out why and where the code is slow and then you
can do something about it:
http://book.realworldhaskell.org/read/profiling-and-optimization.html
Jason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
501 - 600 of 1044 matches
Mail list logo