Some people might be quite excited by Milan's work on significant
performance improvements to the containers package...
- Forwarded message from Milan Straka f...@ucw.cz -
Date: Thu, 24 Jun 2010 07:45:50 +0200
From: Milan Straka f...@ucw.cz
To: Don Stewart d...@galois.com
Cc: Claus
On 24 June 2010 16:57, Don Stewart d...@galois.com wrote:
Some people might be quite excited by Milan's work on significant
performance improvements to the containers package...
This looks quite nice; good work Milan!!!
As an aside, Alex Mason and I are discussing the possibility of taking
Finnally, I got it working.
I have one strange beahivour, but I think is better to post in leksah
maillist, I did a lot of noise here.
Cheers, and thanks a lot.
El mié, 23-06-2010 a las 10:31 +0200, Giuseppe Luigi Punzi escribió:
Hi Hamish, list...
El mié, 23-06-2010 a las 18:09 +1200,
On 24 June 2010 08:08, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
As an aside, Alex Mason and I are discussing the possibility of taking
advantage of AusHack *shameless plug* to write some kind of classes
for the different types of containers with a hierarchy. I know about
ListLike,
On 24 June 2010 17:15, Stephen Tetley stephen.tet...@gmail.com wrote:
There are some classes for bulk types in Simon Peyton-Jones's paper
Bulk Types with Class.
Cool, I'll have a look.
Personally, I'll take a lot of convincing that a class approach will
be better than using the module
Does anyone have any suggestions or do I have to start building haddock
myself?
Ok I built it from source rather than using the Haskell Platform exe and it now
works. Perhaps the packager of the Haskell Platform for Windows could take a
look at why the binary is behaving as it does?
Dominic.
On 24 June 2010 08:20, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
My rational for a class approach is that rather than having your
library spit out a list of values, etc. you let the consumer pick
which data type they prefer (if they're going to be just converting
your list into a Set,
On 24 June 2010 17:55, Stephen Tetley stephen.tet...@gmail.com wrote:
On 24 June 2010 08:20, Ivan Miljenovic ivan.miljeno...@gmail.com wrote:
My rational for a class approach is that rather than having your
library spit out a list of values, etc. you let the consumer pick
which data type they
On Wed, Jun 23, 2010 at 11:57:54PM -0700, Don Stewart wrote:
Some people might be quite excited by Milan's work on significant
performance improvements to the containers package...
Ah. This all looks excellent! Currently jhc spends about 30-40% of its
time in the containers package according to
Hello Felipe,
Thursday, June 24, 2010, 5:00:55 AM, you wrote:
Is that something that MonadFix is meant to be used for?
In current Gtk libraries, no. You'll do something like
However, if some library required you to supply the action while
constructing the button, then I guess the answer
On Tue, Jun 15, 2010 at 11:24 PM, braver delivera...@gmail.com wrote:
Wren -- thanks for the clarification! Someone said that Foldable on
Trie may not be very efficient -- is that true?
I use ByteString as a node type for the graph; these are Twitter user
names. Surely it's useful to
Hi all,
I'm trying to get some code to compile on Windows, and have run into an
unknown symbol. Has anyone else run into an unknown __fixunsdfdi? I'm using
GHC 6.12.3. I'm trying to use my persistent-sqlite package. To
reproduce, cabal install persistent-sqlite and then try running the example
Martin Drautzburg wrote:
From which angle would you approach problems like this? Should I get my hands
on a prolog-in-haskel implementation (which indeed seems to exist)? Or should
I roll my own poor-man's prolog? Or is this a
constraint-satisfaction-problem? Or is there even a more
On 17/06/2010 06:23, braver wrote:
WIth @dafis's help, there's a version tagged cafe3 on the master
branch which is better performing with ByteString. I also went ahead
and interned ByteString as Int, converting the structure to IntMap
everywhere. That's reflected on the new intern branch at
Statechart [1] is a program that compiles Rhapsody [2] statechart
diagrams [3] into C. Rhapsody is a UML cough, choke, gag... tool
from IBM intended for embedded systems development. If you use
Rhapsody, and its code generator makes your eyes bleed, statechart may
provide some relief.
-Tom
[1]
2010/6/17 Günther Schmidt gue.schm...@web.de:
BTW this is not meant as a fun post, I'm actually quite serious, ie. I need
money, only way of getting it is doing Java, C# or PHP.
So how does one get off haskell? Are there people in similar situations that
have managed? How did you do it?
I
Yves Parès wrote:
It helps me understand better, but would you have some simple code that
would do that ?
You can look at the definition of the coroutine monad transformer in
the monad-coroutine package as well:
http://hackage.haskell.org/package/monad-coroutine
The heart of
2010/6/24 Serguey Zefirov sergu...@gmail.com:
I should suggest code generation from Haskell to C#/Java and PHP.
Like Barrelfish, Atom, HJScript and many others EDSLs out there.
You will save yourself time, you will enjoy Haskell. Probably, you
will have problems with management because
On Mon, Jun 21, 2010 at 11:22 AM, Daniel Lyons fus...@storytotell.orgwrote:
Hi,
I'm having a little trouble figuring out precisely how to port the decision
tree code from the book Programming Collective Intelligence. You can see
the code here:
On Thursday, 24. June 2010 00:04:18 Alexander Solla wrote:
On Jun 23, 2010, at 1:50 PM, Martin Drautzburg wrote:
I said that a rhythm is a series of Moments (or Beats), each
expressed as
fractions of a bar. But each Moment also has volume. So I could
model rhythm
as Pairs of (Moment,
2010/6/22 José Romildo Malaquias j.romi...@gmail.com
Hello.
I have been teaching an introductory course on compiler construction to
our undergraduates students using Appel's Modern Compiler
Implementation in Java. There are also versions of the book in ML and
C. The books explain how to
On 24 June 2010 13:10, Simon Marlow marlo...@gmail.com wrote:
On 17/06/2010 06:23, braver wrote:
I'll work with Simon to investigate the runtime, but would welcome any
ideas on further speeding up cafe4.
An update on this: with the help of Alex I tracked down the problem (an
integer
On Jun 24, 2010, at 11:14 AM, Martin Drautzburg wrote:
Another question is: how much past and future knowledge do I need.
(I believe
the fundamental property of music is that things are ordered). In
order to
compute Volumes from Moments I can get pretty much away without the
past, but
On 6/23/10 10:06 PM, Duncan Coutts wrote:
Suppose both the zlib and tar packages specify build-depends:
bytestring-0.9.*. It's entirely possible for me to install zlib, then
upgrade to a new bugfix release of bytestring, install tar (using the
new bytestring) and then build htar depending on
Serguey Zefirov wrote:
I should suggest code generation from Haskell to C#/Java and PHP.
Like Barrelfish, Atom, HJScript and many others EDSLs out there.
You will save yourself time, you will enjoy Haskell. Probably, you
will have problems with management because your programs will appear
On Mon, 21 Jun 2010, Maurício CA wrote:
bitspeak is a small proof of concept application that allows
writing text using only two commands (yes/no, 1/2, top/down etc.).
Looks cool! Did you forget any dependencies tho? I get the following error:
Oops... Three modules ended up missing in
I'll work with Simon to investigate the runtime, but would welcome any
ideas on further speeding up cafe4.
An update on this: with the help of Alex I tracked down the problem (an
integer overflow bug in GHC's memory allocator), and his program now
runs to completion.
So this was about
Quoting Andrew Coppin andrewcop...@btinternet.com:
Serguey Zefirov wrote:
I should suggest code generation from Haskell to C#/Java and PHP.
Like Barrelfish, Atom, HJScript and many others EDSLs out there.
You will save yourself time, you will enjoy Haskell. Probably, you
will have problems
Hello, cafe
I have question about vector package.
Currently I'm playing with data types which are isomorphic to vectors of fixed
length. Think about vector in N-dimensional space, list of parameters to
function R^n → R, set of measurements with uncertainties, etc. They have
different semantics
On Tue, Jun 22, 2010 at 04:44:09PM +0200, Vo Minh Thu wrote:
2010/6/22 José Romildo Malaquias j.romi...@gmail.com:
On Tue, Jun 22, 2010 at 02:54:08PM +0200, Vo Minh Thu wrote:
2010/6/22 José Romildo Malaquias j.romi...@gmail.com:
Hello.
I have been teaching an introductory course on
2010/6/24 José Romildo Malaquias j.romi...@gmail.com:
On Tue, Jun 22, 2010 at 04:44:09PM +0200, Vo Minh Thu wrote:
2010/6/22 José Romildo Malaquias j.romi...@gmail.com:
On Tue, Jun 22, 2010 at 02:54:08PM +0200, Vo Minh Thu wrote:
2010/6/22 José Romildo Malaquias j.romi...@gmail.com:
Sure, sounds like fun :) I keep trying to learn Haskell and getting
nowhere, but the thing is I keep trying!
martin
On Mon, Jun 21, 2010 at 10:00 AM, C K Kashyap ckkash...@gmail.com wrote:
Hi,
I was wondering if it would be a good idea for the folks interested in
Haskell in Bangalore to get
Hi Simon et al,
I've picked up the HaBench/nofib/nobench issue again, needing a decent set of
real applications to do some exploring of what people these days call
split-compilation. We have a framework that was able to explore GCC
optimisations [1] -- the downside there was the dependency of
On 6/24/10 4:24 PM, Andy Georges wrote:
Or if any of you out there have (recent) apps with inputs that are open
source ... let us know.
Hi Andy.. you could run the hledger benchmarks, roughly like so:
$ cabal install tabular
$ darcs get --lazy http://joyful.com/repos/hledger
$ cd hledger
$
Hello Haskellers,
I am new to programming in Haskell and I am having trouble understanding
exactly when statements become evaluated. My goal is to try and measure how
long a computation takes without having to use a show function. The code I
am trying to use is below (taken in part from RWH
On 25 June 2010 10:57, Frank Moore fmo...@gmail.com wrote:
Hello Haskellers,
I am new to programming in Haskell and I am having trouble understanding
exactly when statements become evaluated. My goal is to try and measure how
long a computation takes without having to use a show function.
Thanks for the reply.
My main is now:
main = do
let as = [1..2e7] :: [Double]
start - getCurrentTime
let meanAs = mean as
let meanOver2 = meanAs `deepseq` meanAs / 2
end - getCurrentTime
putStrLn (show (end `diffUTCTime` start))
start - getCurrentTime
putStrLn (show meanOver2)
On 25 June 2010 11:19, Frank Moore frankmo...@math.cornell.edu wrote:
Thanks for the reply.
My main is now:
main = do
let as = [1..2e7] :: [Double]
start - getCurrentTime
let meanAs = mean as
let meanOver2 = meanAs `deepseq` meanAs / 2
end - getCurrentTime
putStrLn (show
On Friday 25 June 2010 02:57:31, Frank Moore wrote:
Hello Haskellers,
I am new to programming in Haskell and I am having trouble understanding
exactly when statements become evaluated. My goal is to try and measure
how long a computation takes without having to use a show function. The
Daniel,
This means *when meanOver2 is evaluated*, then evaluate (mean as).
Binding it in a let is lazy, so it won't be evaluated until it's needed
(for printing in this case).
Also note that (mean as) is a Double, so deepseq is just seq in this case
(but I suppose this is just a boiled down
AusHac2010 will be held from the 16th to the 18th of July at UNSW, where we'll
be working on various haskell projects such as:
The LLVM backend for GHC (I'm going to see if we can somehow get in contact
with David T during the hackathon so we can discuss what can be done)
A Generic graph class
On Jun 24, 5:07 am, Johan Tibell johan.tib...@gmail.com wrote:
The new The Performance of Haskell containers package paper compares the
performance of, among other things, Maps holding Strings/ByteString. It also
improves the performance of many operations on these. I think it's very
relevant
Claus -- cafe5 is pretty much where it's at. You're right, the proggy
was used as the bug finder, actually at cafe3, still using ByteString.
Having translated it from Clojure to Haskell to OCaml, I'm now
debugging the logic and perhaps the conceptual data structures. Then
better maps will be
Simon -- amazing feat! Thanks for tracking it down. I'll now happily
rely on the Haskell version if it is fast enough :).
-- Alexy
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Simon -- so how can I get me a new ghc now? From git, I suppose? (It
used to live in darcs...)
-- Alexy
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 25 June 2010 12:32, braver delivera...@gmail.com wrote:
Simon -- so how can I get me a new ghc now? From git, I suppose? (It
used to live in darcs...)
Still does if I recall correctly.
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
deliverable:
Simon -- so how can I get me a new ghc now? From git, I suppose? (It
used to live in darcs...)
It still lives in darcs.
Nightly builds are here: http://www.haskell.org/ghc/dist/stable/dist/
You'll want to check with Simon that the patch got pushed, though,
first.
-- Don
On Sat, Jun 19, 2010 at 1:06 AM, Roman Cheplyaka r...@ro-che.info wrote:
While ghc 6.12 finally has proper locale support, core packages (such as
unix) still use withCString and therefore work incorrectly when argument
(e.g. file path) is not ASCII.
Pardon me if I'm misunderstanding
On Thu, Jun 24, 2010 at 3:08 AM, Ivan Miljenovic
ivan.miljeno...@gmail.com wrote:
As an aside, Alex Mason and I are discussing the possibility of taking
advantage of AusHack *shameless plug* to write some kind of classes
for the different types of containers with a hierarchy. I know about
On 25 June 2010 14:41, David Menendez d...@zednenem.com wrote:
On Thu, Jun 24, 2010 at 3:08 AM, Ivan Miljenovic
ivan.miljeno...@gmail.com wrote:
As an aside, Alex Mason and I are discussing the possibility of taking
advantage of AusHack *shameless plug* to write some kind of classes
for the
50 matches
Mail list logo
