#7498: panic : Register allocator: out of stack slots (need 147)
--+-
Reporter: erikd| Owner: erikd
Type: bug | Status: closed
Priority: high
#5467: Template Haskell: support for Haddock comments
-+--
Reporter: reinerp | Owner:
Type: feature request | Status: new
Priority: normal|
#7505: Commentary shipped with GHC sources is outdated
--+-
Reporter: jstolarek | Owner:
Type: bug| Status: new
Priority: normal |
#7506: adding extra arguments to a foreign import statement can cause ghc to
panic
---+
Reporter: jwlato | Owner:
Type: bug | Status: new
#7507: loop fusion not working for Int32, Int64 as it does for Int ?
-+--
Reporter: j.waldmann| Owner:
Type: bug | Status: new
Priority: normal|
The sure-fire way is to make a loop that doesn't allocate if the rules fire;
after all that's the ultimate goal. Then you can put it in
tests/perf/should_run.
doing -ddump-simpl and greping for stuff that should/should-not be there is
another alternative we use in places.
Simon
|
Best thing to do is to produce a concrete example, showing the code you think
is sub-optimal
Simon
From: glasgow-haskell-users-boun...@haskell.org
[mailto:glasgow-haskell-users-boun...@haskell.org] On Behalf Of Sean Leather
Sent: 14 December 2012 22:13
To: GHC Users List; Ian Lynagh
Subject:
I don't understand the problem clearly enough to help. Can you give a concrete
example?
Simon
| -Original Message-
| From: glasgow-haskell-users-boun...@haskell.org [mailto:glasgow-haskell-
| users-boun...@haskell.org] On Behalf Of Johan Tibell
| Sent: 14 December 2012 23:17
| To:
Dear Ian,
I'm not sure if I mentioned that the binary distribution fails those
tests too, and several others on top:
http://pastebin.com/E45cTqvy
To get from thirteen failures to three is at least an improvement!
Tim
___
Glasgow-haskell-users
This compiles badly in 7.4.2:
f :: Int - Word
f = fromIntegral
I need a workaround.
On Mon, Dec 17, 2012 at 2:35 AM, Simon Peyton-Jones
simo...@microsoft.com wrote:
I don't understand the problem clearly enough to help. Can you give a
concrete example?
Simon
| -Original
On Montag, 17. Dezember 2012, 07:07:21, Johan Tibell wrote:
This compiles badly in 7.4.2:
f :: Int - Word
f = fromIntegral
I need a workaround.
Mine produces (with optimisations, of course)
Convert.f :: GHC.Types.Int - GHC.Word.Word
[GblId,
Arity=1,
Caf=NoCafRefs,
Str=DmdType
Hi,
Turns out that I need a larger example to trigger the bug. I can
reliable trigger it using the unordered-containers library. I won't
bore you with the details. The workaround I need is this:
forall x. integerToWord (smallInteger x) = int2Word# x
Hi Jan,
On Sat, Dec 15, 2012 at 04:08:23PM +0100, Jan Stolarek wrote:
[killy@xerxes : /dane/uczelnia/projekty/ghc-build] ./configure
checking for gfind... no
checking for find... /usr/bin/find
checking for GHC version date... configure: WARNING: cannot determine
snapshot version: no .git
Am 16.12.2012 20:24, schrieb Jason Dagit:
How does this compare with fgl? http://hackage.haskell.org/package/fgl
FGL is a pure Haskell library while our haskell-igraph package uses the
foreign function interface to run all graph-related calculations in C
the C library igraph (I haven't
Mike Meyer m...@mired.org writes:
Niklas Larsson metanik...@gmail.com wrote:
2012/12/15 Mike Meyer m...@mired.org:
Only if Tanenbaum documented the internal behavior of Linux before
it was written.
Tannenbaum wrote Minix, the operating system that Linus used (and
hacked on) before he did
Mike Meyer m...@mired.org writes:
As it's commonly understood, reverse engineering doesn't involve
looking at the code.
I guess I should make it clear that I don't use it in the strict sense -
I would call that clean-room reverse engineering. (I'm not sure which
is the most commonly
Ketil Malde ke...@malde.org wrote:
The point of the point is that neither of these are translations of
literary works, there is no precedence for considering them as such, and
that reading somebody's work (whether literary or source code) before
writing one's own does not imply that the
Hello cafe,
I'd like to retrieve the path in which binaries get installed when I
`cabal install` a package.
Normally, this would be ~/.cabal/bin on my Linux, but since I share my
home folder on two architectures, in ~/.cabal/config I set the
user-install prefix to ~/.cabal/$arch, so binaries get
There's getBinDir in the generated module Paths_pkgname
(dist/build/autogen/Paths_pkgname.hs).
This module is generated by cabal configure and can be imported
in the modules of your package.
Roman
* Björn Peemöller b...@informatik.uni-kiel.de [2012-12-17 11:05:52+0100]
Hello cafe,
I'd like
Clearly Haskell has great possibilities in the field of
language-processing. And the nuisances associated with little actual
computation buried under much data-structure navigation are well addressed
by 'strategic-programming' systems.
But now comes the rub -- there seem to be a lot of very
Hi Ravi,
You might want to browse through Comparing Libraries for Generic
Programming in Haskell:
http://www.cs.uu.nl/research/techreps/repo/CS-2008/2008-010.pdf
SYB and Uniplate are two widely used and well-maintained systems for
strategic traversals over arbitrary datatypes. There are other
On Mon, Dec 17, 2012 at 4:06 PM, José Pedro Magalhães j...@cs.uu.nl wrote:
Hi Ravi,
You might want to browse through Comparing Libraries for Generic
Programming in Haskell:
http://www.cs.uu.nl/research/techreps/repo/CS-2008/2008-010.pdf
SYB and Uniplate are two widely used and
Am 16.12.2012 20:24, schrieb Jason Dagit:
How does this compare with fgl? http://hackage.haskell.org/package/fgl
FGL is a pure Haskell library while our haskell-igraph package uses the
foreign function interface to run all graph-related calculations in C
the C library igraph (I haven't
Getting test failures, I believe, due to using conditional properties
within quickckeck etc
[TEST] RecFunSpec:map (test/RecFunSpec.hs:48)
Gave up! Passed only 20 tests.
*** Failed! (2ms)
Is there a way for HTF/Quickcheck to specify these are not failed i.e.
only fail if there is an actual error
Unfortunately, I don't know the answer to your question.
However, if you don't find a solution, I suggest using SmallCheck
instead of QuickCheck — it works better when you have many unsuitable
cases.
https://github.com/feuerbach/smallcheck/wiki/Comparison-with-QuickCheck
As far as I know,
On Mon, Dec 17, 2012 at 03:50:32PM +, gra...@fatlazycat.com wrote:
Getting test failures, I believe, due to using conditional properties
within quickckeck etc
[TEST] RecFunSpec:map (test/RecFunSpec.hs:48)
Gave up! Passed only 20 tests.
*** Failed! (2ms)
Is there a way for
On 12/17/12, Ketil Malde ke...@malde.org wrote:
I would use copying to mean verbatim cut-and-pasting, which is something
else.
I feel I should point out that, while that's currently a common
definition of copying, it's not the legal definition. Copyright law
predates the ability to
Ketil Malde ke...@malde.org wrote:
Mike Meyer m...@mired.org writes:
Niklas Larsson metanik...@gmail.com wrote:
2012/12/15 Mike Meyer m...@mired.org:
Only if Tanenbaum documented the internal behavior of Linux before
it was written.
Tannenbaum wrote Minix, the operating system that Linus used
Ketil Malde ke...@malde.org wrote:
In particular when copyright is concerned, I believe that verbatim
copying in many cases will require a license to the original work, but
merly examining the original work to make use of algorithms, tricks,
and
structures from it will not.
If you don't actually
Strafunski is now rather out of date - it was developed before Cabal
and used a custom install depending whether or not you wanted to use
the DriFt preprocessor.
Andy Gill has a modern re-implementation of Strafuski on Hackage called KURE.
Aside from SYB, Neil Mitchell's Uniplate is popular and
So I heard back from softwarefreedom.org, and they're looking for a
representative from haskell.org to talk to them, as they want to avoid
conflict-of-interests with other clients.
Does anyone with any official status want to talk to real lawyers about
this issue, then let the list know of
I gave Shelly a try. Pretty cool - using it for some of the scripts on
my system. Has me wondering though: is anyone working on creating a
actual Haskell-like scripting language and engine?
Shelly is cool, as I said, but I imagine it would be more valuable to
have another language that is
I won't compare and contrast all these, but I want to point out that there
is a nicer version of uniplate in the lens package.
On Dec 17, 2012 5:31 AM, Ravi Sahni ganeshsahn...@gmail.com wrote:
Clearly Haskell has great possibilities in the field of
language-processing. And the nuisances
Shelly is cool, as I said, but I imagine it would be more valuable to
have another language that is actually separate from Haskell, with an
interpreter that is more lightweight and changes much less frequently
(than GHC). Something that could be nearly as portable as Bash or Perl.
Hugs? It
On Mon, Dec 17, 2012 at 06:04:15PM +0200, Roman Cheplyaka wrote:
Unfortunately, I don't know the answer to your question.
However, if you don't find a solution, I suggest using SmallCheck
instead of QuickCheck — it works better when you have many unsuitable
cases.
On 12/17/2012 01:47 PM, Clark Gaebel wrote:
Does anyone ... want to talk to real lawyers ...
No.
This is absurd. If anyone cares, email the original author and explain
the situation. Ask if he's cool with the reimplemented version. Chances
are he'll say yeah, and we've just solved the problem
Recently I read this article I happened across, about the categorical
design pattern:
http://www.haskellforall.com/2012/08/the-category-design-pattern.html
Barely understood it, of course, but it was a rather intriguing concept.
So now I'm looking at all my programming problems trying to make
On 18/12/2012, at 3:45 PM, Christopher Howard wrote:
Recently I read this article I happened across, about the categorical
design pattern:
http://www.haskellforall.com/2012/08/the-category-design-pattern.html
It's basically the very old idea that an Abstract Data Type
should be a nice
Christopher Howard christopher.how...@frigidcode.com wrote:
Say you created a type called Component (C for short), the idea
being to compose Components out of other Components. Every C has zero
or more connectors on it. Two Cs can be connected to form a new C
using some kind of composition
So what use are conditional properties meant to be used for ??
If you just want 2 integers that are not equal, it would seem a lot
simpler to do this as a conditional rather than constructing some pair
in an arbitrary instance ?!?
Thanks
On Mon, Dec 17, 2012, at 11:20 PM, Simon Hengel wrote:
40 matches
Mail list logo
