On 13/08/2013, at 9:40 PM, Jan Clemens Gehrke wrote:
Hi Glasgow-Haskell-Users,
I'm trying to get started with DPH and have some problems.
If i try getting DPH with
cabal install dph-examples
I get to warnings numerous times. The first warning is:
You are using a new version of
On 08/02/2013, at 5:15 AM, Simon Peyton-Jones wrote:
So perhaps we principally need a way to point people away from GHC and
towards HP? eg We could prominently say at every download point “Stop! Are
you sure you want this? You might be better off with the Haskell Platform!
Here’s
On 06/12/2012, at 12:12 , Johan Tibell wrote:
I'm currently trying to implement word2Double#. Other such primops
support both x87 and sse floating point math. Do we still support x87
fp math? Which compiler flag enables it?
It's on by default unless you use the -sse2 flag. The x87 support is
On 06/12/2012, at 3:56 , Simon Peyton-Jones wrote:
Particularly valuable are offers to take responsibility for a
particular area (eg the LLVM code generator, or the FFI). I'm
hoping that this sea change will prove to be quite empowering,
with GHC becoming more and more a community project,
On 07/12/2012, at 4:21 , Ian Lynagh wrote:
On Thu, Dec 06, 2012 at 09:56:55PM +1100, Ben Lippmeier wrote:
I suppose I'm the default owner of the register allocators and non-LLVM
native code generators.
Great, thanks!
By the way, if you feel like doing some hacking this holiday season
On 01/12/2012, at 1:42 AM, Simon Peyton-Jones wrote:
| While writing a new nofib benchmark today I found myself wondering
| whether all the nofib benchmarks are run just before each release,
I think we could do with a GHC Performance Tsar. Especially now that Simon
has changed jobs, we
On 19/06/2012, at 24:48 , Tyson Whitehead wrote:
On June 18, 2012 04:20:51 John Lato wrote:
Given this, can anyone suggest any likely causes of this issue, or
anything I might want to look for? Also, should I be concerned about
the much larger gc_alloc_block_sync level for the slow run?
On 19/06/2012, at 10:59 , Manuel M T Chakravarty wrote:
I wonder, do we have a Repa FAQ (or similar) that explain such issues? (And
is easily discoverable?)
I've been trying to collect the main points in the haddocs for the main module
[1], but this one isn't there yet.
I need to update
On 19/06/2012, at 13:53 , Ben Lippmeier wrote:
On 19/06/2012, at 10:59 , Manuel M T Chakravarty wrote:
I wonder, do we have a Repa FAQ (or similar) that explain such issues? (And
is easily discoverable?)
I've been trying to collect the main points in the haddocs for the main
module
On 02/04/2012, at 10:10 PM, Jurriaan Hage wrote:
Can anyone tell me what the exact difference is between
1,842,979,344 bytes maximum residency (219 sample(s))
and
4451 MB total memory in use (0 MB lost due to fragmentation)
I could not find this information in the docs anywhere, but I
On 09/08/2011, at 23:15 , Sergei Trofimovich wrote:
the HEAD of syb-with-class fails with the following error when build
with ghc-7.2.1 and template-haskell-2.6:
http://code.google.com/p/syb-with-class/issues/detail?id=4
Is this a bug in TH?
Very likely:
On 19/05/2011, at 8:27 PM, Christian Höner zu Siederdissen wrote:
I'd like to use repa in a rather perverted mode, I guess:
for my programs I need to be able to update arrays in place and
repeatedly perform operations on them.
Right now, it basically works like this (in ST):
- create
On 06/12/2010, at 1:19 PM, David Terei wrote:
I haven't looked at these branches for a fair few weeks, the problem
when they fail to build usually is because all the libraries are just
set to follow HEAD, they're not actually branched themselves, just the
ghc compiler. So there are probably
On 27/07/2010, at 11:24 PM, Jean-Marie Gaillourdet wrote:
I've been trying to use repa and stumbled into rather strange behavior of my
program. Sometimes, there seems to be a deadlock at other times it seems
there is a livelock. Now, I've managed to prepare a version which
consistently
You can certainly create an array with these values, but in the provided code
it looks like each successive array element has a serial dependency on the
previous two elements. How were you expecting it to parallelise?
Repa arrays don't support visible destructive update. For many algorithms
On 03/05/2010, at 10:04 PM, Johan Tibell wrote:
On Mon, May 3, 2010 at 11:12 AM, Simon Peyton-Jones simo...@microsoft.com
wrote:
| Does this mean DPH is ready for abuse?
|
| The wiki page sounds pretty tentative, but it looks like it's been awhile
| since it's been updated.
|
|
No, GHC won't be a native cross compiler in 6.12. There are #ifdefs
through the code which control what target architecture GHC is being
compiled for, and at the moment it doesn't support the host
architecture being different from the target architecture.
I did some work on the native
Hi Satnam,
On 12/03/2009, at 12:24 AM, Satnam Singh wrote:
Before making the release I thought it would be an idea to ask
people what other features people would find useful or performance
tuning. So if you have any suggestions please do let us know!
Is it available in a branch
Here's the reference
http://portal.acm.org/citation.cfm?id=96748
Deciding ML typability is complete for deterministic exponential
time -- Harry G. Mairson.
Ben.
On 27/02/2009, at 10:12 AM, Ben Franksen wrote:
Hi
the attached module is a much reduced version of some type-level
On 19/08/2008, at 8:57 PM, Ian Lynagh wrote:
On Mon, Aug 18, 2008 at 09:20:54PM +1000, Ben Lippmeier wrote:
Ian: Did this problem result in Intel CC / GCC register allocator
freakouts?
Have you got me confused with someone else? I don't think I've ever
used
Intel CC.
Sorry, I
On 18/08/2008, at 8:13 PM, Simon Marlow wrote:
So would I usually, though I've had to turn down cc flags to get
darcs
to build on ia64 before (SHA1.hs generates enormous register
pressure).
We should really use a C implementation of SHA1, the Haskell version
isn't buying us anything
Hi Matt,
No, I don't think anything extra is done in the native code generator
when -O or -O2 are enabled. I believe that strictness information is
used in the core stages only, eg to change let bindings (which allocate
thunks) to case expressions (which don't) - but I haven't worked on the
22 matches
Mail list logo