so I am fascinated with cool graphics at http://www.globus.org check
out the black hole 3d from Max Plank Institute and imagine ... "we did it
with Haskell bindings to Globus API!!!"
On Sat, May 23, 2009 at 1:30 AM, Vasili I. Galchin wrote:
> Hello,
>
> 1) I think I read before that
Hello,
1) I think I read before that there some kind of MPI API (bindings) in
Haskell. Yes? If so, current state?
2) http://www.globus.org/ Globus bindings?
Kind regards,
Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Hi Paulo,
You are teasing me ;^) So what is the "semantics" of "import qualified
Blah"?
Regards,
Vasili
On Sat, May 23, 2009 at 12:47 AM, Paulo Tanimoto wrote:
> On Sat, May 23, 2009 at 12:39 AM, Vasili I. Galchin
> wrote:
> > Hello,
> >
> > I am working with some somewhat legacy cod
On Sat, May 23, 2009 at 12:39 AM, Vasili I. Galchin wrote:
> Hello,
>
> I am working with some somewhat legacy code. I understand what "import
> qualified Blah as B" means but what does "import qualified Blah" mean? Is
> this a deprecated feature? I saw with user defined module as well as wit
Vasili I. Galchin wrote:
Hello,
I am working with some somewhat legacy code. I understand what "import
qualified Blah as B" means but what does "import qualified Blah" mean? Is
this a deprecated feature? I saw with user defined module as well as with
"import qualified System" for example.
Hello,
I am working with some somewhat legacy code. I understand what "import
qualified Blah as B" means but what does "import qualified Blah" mean? Is
this a deprecated feature? I saw with user defined module as well as with
"import qualified System" for example.
REgards,
Vasili
__
I'm pleased to announce the availability of text 0.2, an efficient Unicode
text library that uses stream fusion. New and notable in this release is
support for lazy, chunked text, so you can process text files far larger
than memory using a small footprint.
Hackage page:
http://hackage.haskell.org
I suppose I should send my reply to the list ...
-- Forwarded message --
From: Antoine Latter
Date: Fri, May 22, 2009 at 5:54 PM
Subject: Re: [Haskell-cafe] Data.Binary suboptimal instance
To: Khudyakov Alexey
On Fri, May 22, 2009 at 4:36 PM, Khudyakov Alexey
wrote:
>> You ca
On Friday 22 May 2009 23:34:50 Henning Thielemann wrote:
> > So lately I've been working on a little program to generate trippy
> > graphics. (Indeed, some of you may remember it from a few years back...)
> > Anyway, getting to the point, I just restructured my program. As part of
> > the restructu
>> The new version of haddock makes use of GHC parser. How much
>> of effort would take to make haddock generate pretty-print
>> of the source code itself, (...)
> (...) Is this what you want or is there some reason why you
> want the code to be pretty-printed?
I usually have to resort to braces
Henning Thielemann wrote:
On Fri, 22 May 2009, Andrew Coppin wrote:
My first problem was quite simple. I want to write a program that
reads an item from the input file, processes it, writes it to the
output file, and repeats until the input file is empty. Data.Binary
doesn't appear to provid
On Fri, 22 May 2009, Andrew Coppin wrote:
So lately I've been working on a little program to generate trippy graphics.
(Indeed, some of you may remember it from a few years back...) Anyway,
getting to the point, I just restructured my program. As part of the
restructuring, I got rid of all th
2009/5/22 Maurício :
> Hi,
>
> The new version of haddock makes use of GHC
> parser. How much of effort would take to make
> haddock generate pretty-print of the source
> code itself, including haddock documentation
> (although probably loosing other comments)?
> Maybe even an html version that doc
So lately I've been working on a little program to generate trippy
graphics. (Indeed, some of you may remember it from a few years back...)
Anyway, getting to the point, I just restructured my program. As part of
the restructuring, I got rid of all the jiggery-pokery with
Data.Array.Storable an
Hi,
The new version of haddock makes use of GHC
parser. How much of effort would take to make
haddock generate pretty-print of the source
code itself, including haddock documentation
(although probably loosing other comments)?
Maybe even an html version that documentation
could point to?
Thanks,
Hi John,
On Thu, May 21, 2009 at 09:30:24PM -0500, John Goerzen wrote:
>
> I guess my larger point is just a plea to the community: please be
> really careful about what you do to GHC in point releases.
We are careful about what goes into the official GHC release.
However, ever since GHC 6.6 (
On Mon, May 18, 2009 at 11:38:09AM +0100, Neil Mitchell wrote:
>
> Is there a reason for the poor reliability of these servers?
We do have a plan to move community to a beefier machine with more
reliable hosting. There are a few details to sort out first, and then we
"just" need to find the time
On May 22, 2009, at 4:13 AM, Jason Dusek wrote:
I'd like to know what folks think about the use of `MonadPlus` in
this case.
The |guard| function is almost |filter|:
> import Control.Monad ( MonadPlus, guard )
>
> filter :: MonadPlus m => (a -> Bool) -> m a -> m a
> filter p m = do a <- m
>
Hi Mario,
It looks like the parallelize function is getting inlined when it's in
the same file, but not when it's in a separate file.
Adding a {-# INLINE parallelize #-} pragma to the module with
parallelize recovers all the performance for me.
You could probably see exactly what's happening in
Am Freitag 22 Mai 2009 15:11:32 schrieb Mario Blazevic:
> Daniel Fischer wrote:
> > Am Freitag 22 Mai 2009 04:59:51 schrieb Mario Blažević:
> >> ...
> >> I'm confused. I know that `par` must be able work across modules
> >> boundaries, because Control.Parallel.Strategies is a module and
> >> presum
I tried contacting Jun Mukai at the email address given in the package
but I haven't heard a reply. Just to get this out of the way I've put
my darcs repository with the changes I've made up on my website. It
should build and install with:
darcs get http://www.dicta.org.uk/website/website/haskelln
On Fri, May 22, 2009 at 1:08 PM, Henning Thielemann
wrote:
> Magnus Therning schrieb:
>> On Fri, May 22, 2009 at 12:13 AM, Vasili I. Galchin
>> wrote:
>>> Hello,
>>>
>>> I have some code with several test cases that use HUnit. I added hunit
>>> as one of my cabal dependencies but cabal compl
Henning Thielemann wrote:
> John Goerzen schrieb:
>> So this is annoying (CCing -cafe)
>>
>> I need NominalDiffTime and UTCTime to have Typeable instances. In
>> 6.10.1, they didn't ship with them out of the box, so I added them.
>> Apparently, in 6.10.3, they DO ship with those instances out of t
Daniel Fischer wrote:
Am Freitag 22 Mai 2009 04:59:51 schrieb Mario Blažević:
...
I'm confused. I know that `par` must be able work across modules
boundaries, because Control.Parallel.Strategies is a module and presumably
it works. What am I doing wrong?
You forgot
{-# INLINE parallelize #-}
Don Stewart wrote:
> duncan.coutts:
>> What we're currently missing is a PVP checker: a tool to compare APIs of
>> package versions and check that it is following the PVP. Ideally, we
>> will have packages opt-in to follow the PVP for those packages that do
>> opt-in we have the PVP enforced on hac
duncan.coutts:
> What we're currently missing is a PVP checker: a tool to compare APIs of
> package versions and check that it is following the PVP. Ideally, we
> will have packages opt-in to follow the PVP for those packages that do
> opt-in we have the PVP enforced on hackage using the checker to
Answer recorded at:
http://haskell.org/haskellwiki/Performance/Parallel
daniel.is.fischer:
> Am Freitag 22 Mai 2009 04:59:51 schrieb Mario Blažević:
> > I'll cut to the chase. The short program below works perfectly: when I
> > compile it with -O2 -threaded and run with +RTS -N2 command-line
Magnus Therning schrieb:
> On Fri, May 22, 2009 at 12:13 AM, Vasili I. Galchin
> wrote:
>> Hello,
>>
>> I have some code with several test cases that use HUnit. I added hunit
>> as one of my cabal dependencies but cabal complained with:
>>
>> Setup: At least the following dependencies are mis
Am Freitag 22 Mai 2009 04:59:51 schrieb Mario Blažević:
> I'll cut to the chase. The short program below works perfectly: when I
> compile it with -O2 -threaded and run with +RTS -N2 command-line options, I
> get a nearly 50% real-time improvement:
>
> $ time ./primes-test +RTS -N2
> 5001
>
> real
John Goerzen schrieb:
> So this is annoying (CCing -cafe)
>
> I need NominalDiffTime and UTCTime to have Typeable instances. In
> 6.10.1, they didn't ship with them out of the box, so I added them.
> Apparently, in 6.10.3, they DO ship with those instances out of the box.
>
> Annoyingly, that me
Duncan Coutts wrote:
What we're currently missing is a PVP checker: a tool to compare APIs of
package versions and check that it is following the PVP. Ideally, we
will have packages opt-in to follow the PVP for those packages that do
opt-in we have the PVP enforced on hackage using the checker to
On Thu, 2009-05-21 at 21:30 -0500, John Goerzen wrote:
> Duncan Coutts wrote:
> > On Thu, 2009-05-21 at 15:22 -0700, Alexander Dunlap wrote:
> >> Since those types come out of the time library, and that library's
> >> version *has* been bumped (I assume), couldn't you use Cabal to
> >> condition on
Conal Elliott wrote:
Hi Michael,
I'm going to hazard a guess. Please let me know how accurate it is.
Conal,
I think you described this situation well. You must know this kind of
person---I'm sure there's more than one in the world!
When asked to justify his design, the lead software arc
33 matches
Mail list logo
