On Mon, Feb 11, 2013 at 6:47 PM, Johan Holmquist wrote:
> By "agressive optimisation" I mean an optimisation that drastically
> reduces run-time performance of (some part of) the program. So I guess
> automatic vectorisation could fall into this term.
Even something like running the program on a
> To me, it seems that something like this should be possible -- am i being
> naive? does it already exist?
During the compilation process GHC optimizes the code by performing successive
transformations of
the program. These transformations are known to preserve meaning of the program
- they a
On 2/11/13 11:47 AM, Johan Holmquist wrote:
I was about to leave this topic not to swamp the list with something
that appears to go nowere. But now I feel that I must answer the
comments, so here it goes.
By "agressive optimisation" I mean an optimisation that drastically
reduces run-time perfor
Francesco,
> I can confirm that 1.11.1 works.
I think I fixed this problem.
Would you try the master branch?
https://github.com/kazu-yamamoto/ghc-mod
--Kazu
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
On Tuesday, February 12, 2013, wrote:
> On Tue, 12 Feb 2013 15:57:37 -0700
> Nicolas Bock > wrote:
>
> > > Here is haskell version that is faster than python, almost as fast as
> c++.
> > > You need to install bytestring-lexing package for readDouble.
>
>
> I was hoping Branimir could comment on
On Tue, 12 Feb 2013 15:57:37 -0700
Nicolas Bock wrote:
> > Here is haskell version that is faster than python, almost as fast as c++.
> > You need to install bytestring-lexing package for readDouble.
I was hoping Branimir could comment on how the improvements were allocated.
how much is due t
What are the prospects for Haskell supporting Structured Graphs as defined here?
http://www.cs.utexas.edu/~wcook/Drafts/2012/graphs.pdf
Is there an interest by developers of GHC in doing this?
-John___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Thanks so much for your efforts, this really helped!
Thanks again,
nick
On Sat, Feb 9, 2013 at 11:54 PM, Branimir Maksimovic wrote:
> Here is haskell version that is faster than python, almost as fast as c++.
> You need to install bytestring-lexing package for readDouble.
>
> bmaxa@maxa:~/ha
A few months ago I took the Haskell plunge, and all goes well... -- but I
really want to understand the paradigms as fully as possible, and as it stands,
I find myself with three or four questions for which I've yet to find suitable
answers. I've picked one to ask the cafe -- like my other ques
I, too, am very happy to see this implemented. I'll give it a try and
tell you how it goes. (not inmediately, sadly, I don't have my arduino
with me.)
Thanks a lot!
On 11 February 2013 08:04, Alfredo Di Napoli wrote:
> Sounds cool!
> Thanks for your effort! :)
> A.
>
> On 10 February 2013 22:54,
On Mon, Feb 11, 2013 at 09:32:25AM +0100, Petr Pudlák wrote:
> While the implementation of Applicative can be defined without actually using
> `delay`:
>
> newtype ArrowApp a b c = ArrowApp (a b c)
>
> instance Arrow a => Functor (ArrowApp a b) where
> fmap f (ArrowApp a) = ArrowA
The version of cabal-dev on Hackage doesn't work with recent versions of
Haskell due to https://github.com/creswick/cabal-dev/issues/74 - You have
to install from a recent git checkout.
These instructions were done on Mac but should be straightforward enough to
do the same on Windows:
http://bob.i
Hello David, what I did is get cabal-dev from source (git clone git://
github.com/creswick/cabal-dev.git). This build fine, the upper bounds have
been edited. Hopefully the new version will be released soon.
JP
On Tue, Feb 12, 2013 at 11:45 AM, David Turner wrote:
> Hi,
>
> From a clean instal
Hi,
From a clean install of Haskell Platform 2012.4.0.0 (on Windows) I have
issued just:
> cabal update
> cabal install cabal-install
> cabal install cabal-dev
The last command fails with:
Resolving dependencies...
In order, the following would be installed:
tar-0.3.2.0 (new package)
transfo
2013/2/11 Ertugrul Söylemez
> Petr Pudlák wrote:
>
> > class Arrow a => ArrowDelay a where
> > delay :: a b c -> a () (b -> c)
> >
> > force :: Arrow a => a () (b -> c) -> a b c
> >
> > Perhaps it would be convenient to have ArrowDelay and the
> > corresponding conversions includ
The Python and Ruby communities are actively working on improving the
security of their packaging infrastructure. I haven't paid close attention
to any of the efforts so far, but anyone working on cabal/hackage security
should probably take a peek. I lurk on Python's catalog-sig list and here's
the
16 matches
Mail list logo