#4013: build fails on OS X: Invalid Mach-O file:Address out of bounds while
relocating object file
-+--
Reporter: igloo |Owner:
Type: bug | Status: new
#4154: Deadlock in Chan module
-+--
Reporter: NeilMitchell |Owner:
Type: bug | Status: new
Priority: high |
#3260: Linking stage2 on PPC gives scattered reloc r_address too large
-+--
Reporter: benl |Owner:
Type: bug | Status: new
Priority: highest
#4093: compiler hangs (type checking?)
-+--
Reporter: dias |Owner: simonpj
Type: bug | Status: new
Priority: high |Milestone: 6.14.1
#4112: Building GHC with local libgmp.a fails
+---
Reporter: Itkovian |Owner:
Type: bug | Status: new
Priority: high
#3972: ghc 6.12.1 and 6.13.20090922 consume a lot more memory than 6.10.4 when
compiling language-python package
---+
Reporter: bjpop |Owner: simonpj
#3961: -O results in incorrect behavior
-+--
Reporter: RichardG |Owner: simonpj
Type: bug | Status: new
Priority: high |Milestone:
#3959: indenting change causes internal error
-+--
Reporter: RichardG |Owner: simonpj
Type: bug | Status: new
Priority: low |Milestone: 6.14.1
#3898: Many floating point documentation/behaviour mismatches.
-+--
Reporter: draconx |Owner:
Type: bug | Status: new
Priority: high
#4139: Spurious non-exhaustive pattern match warnings are given using GADTs
--+-
Reporter: blarsen|Owner: simonpj
Type: bug| Status:
#2861: stage2 crash: PAP object entered!
---+
Reporter: simonmar | Owner:
Type: bug | Status: closed
Priority: high | Milestone: 6.12
#3808: piping binary files sometimes fail
+---
Reporter: paolino| Owner:
Type: bug| Status: new
Priority: high | Milestone: 6.14.1
#3807: Test for correct shared library generation
-+--
Reporter: asuffield |Owner: duncan
Type: bug | Status: new
Priority: high |
#3795: Haddock executable not versioned
-+--
Reporter: lpsmith |Owner:
Type: bug | Status: new
Priority: high |Milestone: 6.14.1
#3132: cgCase of PrimAlts needs care in new codegen
-+--
Reporter: int-e | Owner:
Type: bug | Status: new
Priority: high|
#2917: alloca and allocaArray do not respect alignment
-+--
Reporter: guest | Owner:
Type: bug | Status: new
Priority: high|
#1605: hppa port -- gmp handed misaligned memory
---+
Reporter: guest |Owner:
Type: bug | Status: new
Priority: low
#3286: junk `naughty x86_64 register' after expression
-+--
Reporter: igloo | Owner: igloo
Type: bug | Status: closed
Priority: high|
#3983: -O2 makes exception disappear
---+
Reporter: benjamin_scarlet|Owner: simonpj
Type: bug | Status: new
Priority: low |
#4136: Automatically derived Read of operator is not inverse of automatically
derived Show
+---
Reporter: dsf| Owner:
Type: bug|
#4173: Bad warning from quoted instance
-+--
Reporter: igloo | Owner:
Type: bug | Status: closed
Priority: normal |
#4173: Bad warning from quoted instance
--+-
Reporter: igloo| Owner:
Type: bug | Status: closed
Priority: normal |
#4184: Squirrelly inliner behaviour leads to 80x slowdown
-+--
Reporter: bos | Owner:
Type: bug | Status: new
Priority:
#4180: do not consider associativity for unary minus for fixity resolution
--+-
Reporter: maeder |Owner:
Type: proposal | Status: new
Priority:
#4173: Bad warning from quoted instance
--+-
Reporter: igloo| Owner:
Type: bug | Status: closed
Priority: normal |
#4187: Seg fault with Text.Regex
+---
Reporter: kfisher | Owner:
Type: bug | Status: new
Priority: normal | Component: Runtime System
Version: 6.13
#4188: Template Haskell support for reifying non-vanilla data constructors
-+--
Reporter: illissius | Owner: illissius
Type: feature request | Status: new
Priority:
#4038: segmentation fault between GHC-6.12.2 and gtk2hs
-+--
Reporter: guest | Owner: simonmar
Type: bug | Status: closed
Priority: highest |
#4187: Seg fault with Text.Regex
+---
Reporter: kfisher | Owner:
Type: bug | Status: new
Priority: normal | Component: Runtime System
Version: 6.13
#4188: Template Haskell support for reifying non-vanilla data constructors
-+--
Reporter: illissius | Owner: illissius
Type: feature request | Status: new
Priority:
| The head has -dsuppress-coercions which omits coercion terms when pretty
| printing Core. It would be easy to backport that to 6.12.
The HEAD also has a coercion optimiser that dramatically shrinks some large
coercion terms.
| I might revert both mwc-random and statistics back to using plain
On 13/07/2010 05:49, Evan Laforge wrote:
On Mon, Jul 12, 2010 at 6:54 PM, John Meachamj...@repetae.net wrote:
Hi, is a StablePtr what you are after?
Indeed, it looks like StablePtr will get me what I want. It's a
little less convenient than FunPtr because I'm already doing some
finalization
It compiles to
lift f d = f (d `cast` blah)
which seems fine to me. Are you unhappy with that?
Simon
From: glasgow-haskell-users-boun...@haskell.org
[mailto:glasgow-haskell-users-boun...@haskell.org] On Behalf Of Louis Wasserman
Sent: 09 July 2010 03:30
To: glasgow-haskell-users@haskell.org
Mmmm, let's give a slightly different example:
foo :: Foo - Int
foo (Foo a) = a + 1
bar :: Int - Int
bar = foo . Foo
and I'd expect bar to be replaced with (foo `cast` (Int - Int)) and
inlined, eliminating an allocation. In general, we'd get the equivalent of
the no-allocation versions of
Or a different way:
I want -fdo-lambda-eta-expansion (which, if I understand correctly, actually
triggers eta *reduction*) to eliminate argument casts, as well.
My motivation: I'm working on a generalized trie library, and due to
http://hackage.haskell.org/trac/ghc/ticket/4185, I can't use
Hi Evan, Ed,
On Jul 12, 2010, at 22:53, Edward Z. Yang wrote:
Excerpts from Evan Laforge's message of Mon Jul 12 16:43:45 -0400
2010:
Yeah, that's definitely the safest and simplest. But the copying
defeats the purpose of passing a pointer in the first place, which
was
to not have to
Excerpts from Axel Simon's message of Tue Jul 13 16:03:01 -0400 2010:
If your C code has a way to properly unref a pointer then you could
wrap your ForeignPtr in a StablePtr and pass that to C land. Once C
has freed the StablePtr the ForeignPtr can become dead when Haskell
has dropped
On Jul 13, 2010, at 22:17, Edward Z. Yang wrote:
Excerpts from Axel Simon's message of Tue Jul 13 16:03:01 -0400 2010:
If your C code has a way to properly unref a pointer then you could
wrap your ForeignPtr in a StablePtr and pass that to C land. Once C
has freed the StablePtr the ForeignPtr
Excerpts from Axel Simon's message of Tue Jul 13 16:28:29 -0400 2010:
Well, if the C code hangs on to the StablePtr that wraps the
ForeignPtr, its finalizer won't be run. But can run again once the
StablePtr is freed. So you can take out the Ptr in the ForeignPtr and
use it in C land as
Hi,
I have encountered a bug in GHC type checker. I have stripped down my code to
small manageable example that illustrates the bug:
{-# LANGUAGE GADTs #-}
{-# OPTIONS -Wall #-}
module StrangeGADT where
data Q a where
ToQ :: (QA a) = a - Q a
Sum :: (QA a, Num a) = Q [a] - Q a
class QA a
On Wednesday 14 July 2010 00:11:00, George Giorgidze wrote:
Hi,
I have encountered a bug in GHC type checker. I have stripped down my
code to small manageable example that illustrates the bug:
{-# LANGUAGE GADTs #-}
{-# OPTIONS -Wall #-}
module StrangeGADT where
data Q a where
ToQ ::
Whether or not the new FGL that Thomas Bereknyei and I are working on
should keep the name was a semi-hot issue when we first mentioned the
fact that we were working on a new version about a month ago. As such,
I've created a survey here to try and find out what the Haskell
community overall
Thank you for all the people who have voted; we so far have 42 results
in about 12 hours.
Some indication of the results so far:
* 62% prefer inductive-graphs
* 62% have indicated that they use fgl or do some graph-related stuff
(no correlation, just an interesting coincidence; I have not as
Simon Peyton-Jones schrieb:
Yes, I somewhat hacked up the rules for ! in an ad-hoc way. I really wanted
to allow
f !x !y = (x,y)
which meant a bit of fiddling, because LHSs are parsed as terms, so this is
parsed as
(f ! x) ! y
(ie as infix operators) and I have to
On 10/07/2010 22:02, John Meacham wrote:
On Fri, Jul 09, 2010 at 09:33:52AM +0100, Simon Marlow wrote:
On 08/07/2010 09:45, John Meacham wrote:
On Thu, Jul 08, 2010 at 07:09:29AM +, Simon Peyton-Jones wrote:
(ie as infix operators) and I have to squizzle around to re-interpret them as
Simon Marlow schrieb:
BTW, here's a related proposal made by Simon PJ earlier this year:
http://hackage.haskell.org/trac/haskell-prime/wiki/NegationBindsTightly
please consider merging the proposals, or at least clearly identifying
the differences, if any.
Thanks for pointing this out.
Hi,
2010/7/13 Gregory Crosswhite gcr...@phys.washington.edu:
Just out of curiosity, what work is being done in the data parallel
haskell / repa projects regarding cache locality?
Hi,
I'm not knowledgeable at all about this, but for a technical
introduction to DPH, I found the following
Hi all,
We plan to release bug fix version : gtk2hs-0.11.1
Please report any bug of gtk2hs-0.11.0, we will fix it before release
gtk2hs-0.11.1
We plan to add many new APIs in gtk2hs-0.12.0,
so gtk2hs-0.11.1 will be the last stable version with current APIs.
Thanks for your help!
-- Andy
On 12/07/2010 18:29, Felipe Lessa wrote:
On Mon, Jul 12, 2010 at 9:50 AM, Simon Marlowmarlo...@gmail.com wrote:
And hopefully things will improve over time, as fewer packages will need to
depend on base. We could also start pulling out APIs that are currently in
base into separate packages,
hello,
iam really new to haskell,
i want to define a function which takes as a parameter a list which can
contain other lists, eg. [1,[2,3],[4,[5,6]]]
how would i define a function that can iterate through the items so (in this
example)
iter1 = 1
iter2 = [2,3]
iter3 = [4,[5,6]]
?
( can i do
On 13 July 2010 10:58, vadali shlomivak...@gmail.com wrote:
hello,
iam really new to haskell,
i want to define a function which takes as a parameter a list which can
contain other lists, eg. [1,[2,3],[4,[5,6]]]
how would i define a function that can iterate through the items so (in this
Hi Vadali,
On Tue, Jul 13, 2010 at 10:58 AM, vadali shlomivak...@gmail.com wrote:
hello,
iam really new to haskell,
i want to define a function which takes as a parameter a list which can
contain other lists, eg. [1,[2,3],[4,[5,6]]]
how would i define a function that can iterate through
vadali shlomivak...@gmail.com writes:
hello,
iam really new to haskell,
i want to define a function which takes as a parameter a list which can
contain other lists, eg. [1,[2,3],[4,[5,6]]]
how would i define a function that can iterate through the items so (in this
example)
iter1 = 1
Thank you all for replying!
I am really beginning my baby steps in this fascinating language, and was
just wondering if it was possible to naturally scan lists with arbitrary
lists (aka trees :) ).
I guess this forum specifically is too advancaed for me (yet!), so my next
questions will be
2010/7/13 Ivan Lazar Miljenovic ivan.miljeno...@gmail.com:
vadali shlomivak...@gmail.com writes:
hello,
iam really new to haskell,
i want to define a function which takes as a parameter a list which can
contain other lists, eg. [1,[2,3],[4,[5,6]]]
how would i define a function that can
On 13 Jul 2010, at 10:11, Shlomi Vaknin wrote:
Thank you all for replying!
I am really beginning my baby steps in this fascinating language, and was
just wondering if it was possible to naturally scan lists with arbitrary
lists (aka trees :) ).
Trees aren't lists, Trees are trees...
On 12/07/2010 22:12, John Meacham wrote:
On Mon, Jul 12, 2010 at 01:50:01PM +0100, Simon Marlow wrote:
Right. I like the idea of packages being able to declare re-exported
modules, indeed I considered doing this in GHC (when we needed base3)
but decided not to mainly because we would still
Thank you Bob,
your example clarified how actually using such data type would appear in
haskell. I naively thought it would be as simple as defining a regular list,
but i see it is slightly more strict than that. I appreciate your help!
Vadali
On Tue, Jul 13, 2010 at 11:18 AM, Thomas Davie
Andy Stewart schrieb:
Hi all,
We plan to release bug fix version : gtk2hs-0.11.1
Please report any bug of gtk2hs-0.11.0, we will fix it before release
gtk2hs-0.11.1
I'm looking forward for this bug-fix release (since gtk2hs-0.11.0 did
not work for me).
Because I've almost missed this
2010/7/2 Heinrich Apfelmus apfel...@quantentunnel.de:
Sergey Mironov wrote:
Hello list!
I am trying to understand zipper concept using papers like [1] and [2].
Though main idea looks clear, I still have a problem in applying it for
custom data types.
Please help me with deriving
On Sun, Jul 11, 2010 at 12:43:47AM +0200, Jose A. Ortega Ruiz wrote:
On Sat, Jul 10 2010, wren ng thornton wrote:
[...]
Yes, you can add multiple dependencies. The syntax is to use , after
the first |.
While having eight parameters is surely a desperate need for
refactoring,
On Wed, Jul 07, 2010 at 09:56:08AM +0100, Patrick Browne wrote:
Hi,
In Haskell what roles are played by 1)lambda calculus and 2) equational
logic? Are these roles related?
Hopefully this question can be answered at a level suitable for this forum.
Since no one else has responded I'll take a
Thomas M. DuBuisson wrote:
Comments on the zipWith' function inside of Data.ByteString say:
-- Rewrite rules
-- are used to automatically covert zipWith into zipWith' when a pack is
-- performed on the result of zipWith.
This is only true internally to Data.ByteString because the zipWith'
Hello
I'm wondering if anyone ever benchmarked marshalling in Haskell/GHC. No
matter how much I optimize my Haskell code my program still seems to run
slow, which leads me to beleive that Marshalling is painfully slow.
Does anyone know a way I can test this and fix it?
Regards,
Phyx
On Tue, Jul 13, 2010 at 13:29, Phyx loneti...@gmail.com wrote:
Hello
I'm wondering if anyone ever benchmarked marshalling in Haskell/GHC. No
matter how much I optimize my Haskell code my program still seems to run
slow, which leads me to beleive that Marshalling is painfully slow.
Does
On 13/07/2010, at 20:47 , Brent Yorgey wrote:
On Wed, Jul 07, 2010 at 09:56:08AM +0100, Patrick Browne wrote:
Hi,
In Haskell what roles are played by 1)lambda calculus and 2) equational
logic? Are these roles related?
Hopefully this question can be answered at a level suitable for this
Ben, comments from the peanut gallery:
On 13/07/2010, at 11:51 PM, Ben Lippmeier wrote:
What kind of equality do you use for getChar :: IO Char ?
Surely this is easy: getChar denotes a particular IO action, which is always
the same thing (i.e. self-identical and distinct from all other IO
Whether or not the new FGL that Thomas Bereknyei and I are working on
should keep the name was a semi-hot issue when we first mentioned the
fact that we were working on a new version about a month ago. As such,
I've created a survey here to try and find out what the Haskell
community overall
begin Gwern Branwen quotation:
Ashley has made me admin; I've spent the last 1.5 hours deleting all
the vandalism and indef blocking the accounts. I have Recent Changes
in my RSS reader, so hopefully in the future there will be no greater
than 24 hours delay before vandalism is dealt with. A
Marshalling large amount of data from and to C
http://phyx.pastebin.com/WXGBr1bX shows the code I use to do this (it's
autogenerated, so just looking at 1 block should be enough)
The tool is mine, so i can change the code it generates, but i would need to
know how to do it better first.
On Tue,
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 7/12/10 22:29 , Richard O'Keefe wrote:
On Jul 11, 2010, at 9:38 AM, wren ng thornton wrote:
Generally OSX takes UTF16 to be the standard encoding (I don't recall if
it's LE or BE), though UTF8 is supported almost everywhere. I haven't
checked
That code is effectively copying the data (thats what those peeks /
pokes do), so it stands to reason it would be slow by most performance
standards. The reason ByteStrings are fast when used both by C and
Haskell is there is a zero-copy `useAsCString`.
Cheers,
Thomas
On Tue, Jul 13, 2010 at
I understand that part, but the strings are generated from SDocs, and So
unless internally SDoc doesn't use String then I'm afraid there's nothing I
can do about that :/
Or rather, Is there a way to efficiently make CWStrings from SDocs?
Regards,
Phyx
On Tue, Jul 13, 2010 at 6:56 PM, Thomas
On 16:21 Fri 09 Jul , John Meacham wrote:
I would think it is a typo in the report. Every language out there seems
to think 0**0 is 1 and 0**y | y /= 0 is 0. I am not sure whether it is
mandated by the IEEE standard but a quick review doesn't say they should
be undefined (and the report
gwern0:
Ashley has made me admin; I've spent the last 1.5 hours deleting all
the vandalism and indef blocking the accounts. I have Recent Changes
in my RSS reader, so hopefully in the future there will be no greater
than 24 hours delay before vandalism is dealt with. A MW upgrade will
also
Are you interested in AngloHaskell 2010?
AngloHaskell is a gathering of all people Haskell-related from beginners to
seasoned hackers. Previously it has been held in Cambridge (three times) and
London (once).
Last year I volunteered to organise it but I want know when you can attend.
Hi all,
is there a haskell library for generating Objective-J?
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
In Haskell what roles are played by 1)lambda calculus and 2) equational
logic? Are these roles related?
Hi,
Thanks for your clear and helpful responses.
I am aware that this question can lead to into very deep water.
I am comparing Haskell with languages based on equational logic (EL)
(e.g.
2010/7/13 Günther Schmidt gue.schm...@web.de
Hi all,
is there a haskell library for generating Objective-J?
http://www.google.co.uk/search?hl=enas_sitesearch=hackage.haskell.org/packageas_q=object-j
Hackage upload or it didn't happen!
Jason
___
Jason dearest,
http://hoc.sourceforge.net/ did happen but isn't on hackage,
WASH did happen but isn't on hackage ...
and I presume quite a few other goodies didn't make it to hackage either.
So I was hoping I'd finally be admitted to the inner haskellers circle
where the dark arts are
First of all: I'm not sure if this question is allowed here. If not, I
apologize
I'm trying to solve the following problem: For each word in a text find the
number of occurences for each unique word in the text.
i've come up with the following steps to solve this:
* remove all punctuation
2010/7/13 Günther Schmidt gue.schm...@web.de
Jason dearest,
http://hoc.sourceforge.net/ did happen but isn't on hackage,
http://code.google.com/p/hoc/issues/detail?id=26#c0
WASH did happen but isn't on hackage ...
http://hackage.haskell.org/package/WashNGo
Hello,
This is my first post to the Haskell Café, and I'm hoping the issue
I'm tackling here isn't one that's been thoroughly explored elsewhere.
If that's the case, I'll apologize in advance for my insufficient
google chops. Otherwise, here goes...
I do a lot of work within the error monad.
On Tuesday 13 July 2010 23:49:45, Frank1981 wrote:
First of all: I'm not sure if this question is allowed here. If not, I
apologize
I'm trying to solve the following problem: For each word in a text find
the number of occurences for each unique word in the text.
i've come up with the
Leon,
In order to avoid the short-circuiting behaviour, it might help you to
work in terms of Applicatives instead of Monads. For example, in my
error-message package I have the following instance:
instance (Monoid e) = Applicative (Either e) where
pure = Right
(*) (Left error2) (Left
On Jul 13, 2010, at 9:00 PM, Christopher Done wrote:
On 13 July 2010 10:58, vadali shlomivak...@gmail.com wrote:\
i want to define a function which takes as a parameter a list which
can
contain other lists, eg. [1,[2,3],[4,[5,6]]]
What would the type of a list like that be?
What you
On Jul 14, 2010, at 1:51 AM, Ben Lippmeier wrote:
Replacing equals by equals usually doesn't change anything.
What kind of equality do you use for getChar :: IO Char ?
The usual one: getChar = getChar. It's a pure value.
If I find [getChar,getChar] in a program, I can safely
replace it by
wren is half right: at the level of Unixy APIs (and this includes
anything
that goes on in a Terminal window and anything that you will be
doing from
Haskell) you use UTF8, but OSX APIs --- that is, Carbon and Cocoa
--- use
UTF16. So for the purposes of ghc/jhc OSX is UTF8, but if
On Tue, Jul 13, 2010 at 10:24:00AM +0100, Simon Marlow wrote:
Well, a main useful case is that I can do -phaskell98 and -phaskell2010
at the same time. So I can make the default jhc behavior be the union of
the two languages easily.
That works in GHC too: the modules of those two packages
Thank you for all the people who have voted; we so far have 42 results
in about 12 hours.
Some indication of the results so far:
* 62% prefer inductive-graphs
* 62% have indicated that they use fgl or do some graph-related stuff
(no correlation, just an interesting coincidence; I have not as
Short version of this post:
Looks like the intsall depends on alex and that dependencies doesn't
appear to be handled, i.e. I had to install alex before proceeding.
why do is it called gtk2hs if you are actually installing package
gtk ;-)
Where's the demo directory ?!
Moral of the story: don't
On 14 July 2010 14:52, bri...@aracnet.com wrote:
Short version of this post:
Looks like the intsall depends on alex and that dependencies doesn't
appear to be handled, i.e. I had to install alex before proceeding.
Yes, cabal-install isn't able to cope with the build-tools dependencies.
why
92 matches
Mail list logo
