#3719: Literate code with #
-+--
Reporter: zenzike | Owner:
Type: bug | Status: new
Priority: normal|
#3719: Literate code with #
+---
Reporter: zenzike| Owner:
Type: bug| Status: new
Priority: normal |
#2401: aborting an STM transaction should throw an exception
--+-
Reporter: sclv | Owner:
Type: bug | Status: reopened
#3715: GHC API no longer exports location information for error/warning messages
--+-
Reporter: greenrd | Owner: igloo
Type: bug | Status: new
#2797: ghci stack overflows when ghc does not
--+-
Reporter: TristanAllwood | Owner:
Type: bug | Status: new
Priority: normal
#3100: GHC Panic reifyType PredTy in HAppS.Data.IxSet.inferIxSet
---+
Reporter: mightybyte| Owner: igloo
Type: merge | Status: new
Priority: normal|
#3102: The impossible happened with implicit parameters
--+-
Reporter: Ashley Yakeley | Owner: igloo
Type: merge| Status: new
#3654: Mach-O GHCi linker lacks support for a range of relocation entries
-+--
Reporter: chak| Owner:
Type: bug | Status: new
Priority:
#3718: Can not bootstrap using 6.12.1-rc2
-+--
Reporter: masao | Owner:
Type: bug | Status: new
Priority: normal|
On 03/12/2009 14:12, Henning Thielemann wrote:
On Thu, 3 Dec 2009, Malcolm Wallace wrote:
#3709: Data.Either.partitionEithers is not lazy enough
This is a behavioural change, e.g.:
Main case partitionEithers1 [Left 'a', error Not me] of (x : _, _)
- x
Program error: Not me
Main case
#414: GHC does not eforce that Main exports main
---+
Reporter: simonpj | Owner: igloo
Type: merge | Status: new
Priority: lowest| Milestone:
#3677: Optimizer creates stack overflow on filtered CAF
+---
Reporter: jpet | Owner: simonpj
Type: bug| Status: new
Priority: normal | Milestone: 6.12.2
#3720: unknown symbol `_GLOBAL_OFFSET_TABLE_' when loading module
-+--
Reporter: fasta | Owner:
Type: bug | Status: new
Priority: normal|
#3721: Can't install base-4.0.0.0 !!
-+--
Reporter: guest | Owner:
Type: bug | Status: new
Priority: normal| Component: Compiler
#3658: Dynamically link GHCi on platforms that support it
---+
Reporter: simonmar | Owner:
Type: task | Status: new
Priority: high |
#2615: ghci doesn't play nice with linker scripts
--+-
Reporter: AlecBerryman | Owner: hgolden
Type: bug | Status: new
#3722: Haskeline Iconv needs HAVE_LANGINFO_H
---+
Reporter: donn| Owner:
Type: bug | Status: new
Priority: normal | Component: Compiler
#3722: Haskeline Iconv needs HAVE_LANGINFO_H
-+--
Reporter: donn | Owner:
Type: bug | Status: new
Priority: normal| Milestone:
#3723: SharedMem.hsc should include fcntl.h, not sys/fcntl.h
---+
Reporter: donn| Owner:
Type: bug | Status: new
Priority: normal |
#3724: rts/package.conf.d specifies -lm for all platforms
---+
Reporter: donn| Owner:
Type: bug | Status: new
Priority: normal |
#3725: Annotations not written to interface files
-+--
Reporter: rl| Owner:
Type: bug | Status: new
Priority: normal| Component:
#3710: WriteFile: invalid argument (The handle is invalid.)
---+
Reporter: dherington | Owner:
Type: bug | Status: closed
#3726: Internal error compiling ghc-syb-0.1.2.1
-+--
Reporter: DavidHalperin | Owner:
Type: bug | Status: new
Priority: normal|
#3727: several Haiku platform defs
---+
Reporter: donn| Owner:
Type: bug | Status: new
Priority: normal | Component: Compiler
#3728: configure should omit full path in unistd.h, stdlib.h return type tests
---+
Reporter: donn| Owner:
Type: bug | Status: new
Priority:
I've been out of the loop for quite some time. Has there been any progress
on the ability to build a native x64 version of GHC for windows? the
supported platforms page on the web does not even list this as a Tier 1, 2,
or 3 platform and last time I tried this (quite a while ago, admittedly) I
Could I suggest that the following short text be included in the GHC
6.12.1 final release notes, in some form?
-- cut here --
Updating third-party packages
-
A number of packages will need modifying to build on GHC 6.12.1 (in
some cases, just modifying the
On Fri, Nov 27, 2009 at 9:30 PM, John Hughes r...@chalmers.se wrote:
This is a heads up about a workshop on test automation that I just joined
the programme committee of. Automation of Software Test will be co-located
with ICSE in Cape Town in May--the workshop home page is here:
Dear all,
The School of Computer Science at the University of Nottingham is
advertising 3 PhD studentships, with functional programming being
one of the target areas. Further information about the functional
programming lab within the School is available from:
http://fp.cs.nott.ac.uk/
If
-
Please accept our apologies if you have received multiple copies.
Please feel free to distribute it to those who might be interested.
-
-
Please accept our apologies if you have received multiple copies.
Please feel free to distribute it to those who might be interested.
-
On Fri, Nov 27, 2009 at 9:30 PM, John Hughes r...@chalmers.se wrote:
This is a heads up about a workshop on test automation that I just joined
the programme committee of. Automation of Software Test will be co-located
with ICSE in Cape Town in May--the workshop home page is here:
On Wed, Dec 2, 2009 at 11:44 PM, Gregory Crosswhite
gcr...@phys.washington.edu wrote:
On a more serious note, Download Haskell /= Download Haskell Platform, so
if I were glancing down the sidebar looking for a link to download the
Haskell Platform then the first link wouldn't have registered
Furthermore, when someone offers feedback designed to improve a page, and
does so in a very non-threatening way:
On Dec 2, 2009, at 2:26 PM, Andrew Coppin wrote:
My suggestion is that if we really want people to grab the HP rather than
download GHC directly, maybe we could make the
2009/12/3 Tony Morris tonymor...@gmail.com:
Furthermore, when someone offers feedback designed to improve a page, and
does so in a very non-threatening way:
On Dec 2, 2009, at 2:26 PM, Andrew Coppin wrote:
My suggestion is that if we really want people to grab the HP rather than
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf Of
Gregory Crosswhite
Is there some secret to getting Haddock to work with literate
Haskell sources that I am missing?
For example, when I download Takusen and type
cabal configure
If I wanted to know something *about* the *Haskell Platform* I would
click the link The Haskell Platform under the section About. So it is
actually mentioned 3 times on the front page. What could be improved
are the 2 download links: Download Haskell and Download GHC. It
would perhaps be
This is a continuation of what I wrote on the Haskell Prime mailing list which
accounts for why this is the eighth in the series. These are lecture notes and
if anyone has not already noticed from the Haskell Prime mailing list. I am
giving a lecture.
Type aliases allow you to extend the type
Hi,
Am Donnerstag, den 03.12.2009, 01:16 +0100 schrieb Martijn van
Steenbergen:
So here's a totally wild idea Sjoerd and I came up with.
What if newtypes were unwrapped implicitly?
What advantages and disadvantages would it have?
In what cases would this lead to ambiguous code?
not sure
Hmm, as long as you provide a type signature, Haskell could do implicit
wrapping as well.
If I'm not mistaken, the compiler should be able to figure out what to do in
this case:
myfoo :: (Blubb - MyFoo) - MyFoo - MyFoo - MyFoo
myfoo = foo
Sjoerd
On Dec 3, 2009, at 11:07 AM, Joachim
Hi,
Am Donnerstag, den 03.12.2009, 11:25 +0100 schrieb Sjoerd Visscher:
Hmm, as long as you provide a type signature, Haskell could do implicit
wrapping as well.
If I'm not mistaken, the compiler should be able to figure out what to do in
this case:
myfoo :: (Blubb - MyFoo) - MyFoo -
I am uncertain if what any of you seek makes sense. The type checker is
concerned with establishing a principle type and that is what is being
reported, the principle type. The compiler as I pointed out in On the Meaning
of Haskell 8 by design has not a clue as to the significance your type
Am Donnerstag, den 03.12.2009, 01:40 +0100 schrieb Sjoerd Visscher:
The idea is that there's just enough unwrapping such that you don't
need to use getDual and appEndo.
Yes, but what does
Dual [1] `mappend Dual [2]
mean then? Should it use the Monoid instance of Dual and return
Dual [2,
On Thu, 2009-12-03 at 14:05 +0900, Benjamin L.Russell wrote:
Recently, in changing my work schedule to work mainly from home, I
switched from mainly using a work Wintel machine running Windows XP
Professional, Service Pack 3, to mainly using my home PowerPC G4
PowerBook Macintosh, currently
In the case of Dual [1] `mappend` Dual [2] there's no need to do any
unwrapping. There is if you say:
l :: [Int]
l = Dual [1] `mappend` Dual [2]
The way I think this could work is that when the type checker detects a type
error, it will first try to resolve it by newtype unwrapping (or wrapping
On Wed, 2009-12-02 at 23:03 +0100, Joachim Breitner wrote:
Would it be techically possible and feasible to write instance that do
not actually cause a dependency on the package that defines the class
resp. the data type? From a distributor point of view, I could live
quite well with a setup
Sjoerd Visscher wrote:
In the case of Dual [1] `mappend` Dual [2] there's no need to do any
unwrapping. There is if you say:
l :: [Int]
l = Dual [1] `mappend` Dual [2]
The way I think this could work is that when the type checker detects a type
error, it will first try to resolve it by
Nice.
It would be fantastic to have a little practical real-world challenge
(like building a simple music system, or a simple multi-channel sound
mixer), and work this out in an imperative language, an
object-oriented language, a functional language, and maybe other
languages too, like logic
Some packages will need modifications to build or work with GHC
6.12 (in some cases, just modifications to the .cabal file).
I've created this wiki page to track work people have done on
that which hasn't yet been included into official packages or
repositories:
Perhaps what you are looking for is a more powerful defining semantics?
newtype MyFoo = Foo defining (Foo(..)) -- all class instances that Foo has
are delegated through from MyFoo
Matthew
not sure if this is what you are thinking at, but everytime I wrap a
type Foo in a newtype MyFoo to
Of course, I meand 'deriving', not 'defining'
/me embarsed
2009/12/3 Matthew Pocock matthew.poc...@ncl.ac.uk
Perhaps what you are looking for is a more powerful defining semantics?
newtype MyFoo = Foo defining (Foo(..)) -- all class instances that Foo has
are delegated through from MyFoo
Hi,
Am Donnerstag, den 03.12.2009, 11:13 + schrieb Matthew Pocock:
Perhaps what you are looking for is a more powerful defining
semantics?
newtype MyFoo = Foo defining (Foo(..)) -- all class instances that Foo
has are delegated through from MyFoo
it goes into the right direction, but
Duncan Coutts duncan.cou...@googlemail.com writes:
[1] http://hackage.haskell.org/package/failable-list
Nice.
I agree this is needed (or rather, would be nice to standardise).
Although I don't care for the cutesy naming suggested in the 'Train'
datatype, failable-list could be made more
data TerminatedList a e = Then a (TerminatedList a e)
| Finally e
Nice.
(So you could do e.g: 4 `Then` 5 `Then` 1 `Finally` success!.
Errm, you mean: 4 `Then` 5 `Then` 1 `Then` Finally success!
Regards,
Malcolm
This release of Atom slightly changes the semantics of assertions and
coverage. Assertion and coverage are now checked between the
execution of every rule, instead of only when the rules containing
assertions are fired. They are still subject to parental guard
conditions, but not period or phase
wren ng thornton wrote:
Nicolas Pouillard wrote:
Excerpts from Heinrich Apfelmus's message of Tue Dec 01 11:29:24
+0100 2009:
For mnemonic value, we could call it a train:
data Train a b = Wagon a (Train a b)
| Loco b
I rather like it too. The mnemonic version sounds
Hello
In my futur program, it use a lot of binary trees with strings (words)
as leaf. There is just arround 1000 words and they will appear a lot of
times. The program will possibly consume a lot of process and memory
(it is a mathematics proover).
I began this program in C++ but haskell has a
On Thu, Dec 3, 2009 at 1:03 PM, Emmanuel CHANTREAU
echant+hask...@maretmanu.org wrote:
In my futur program, it use a lot of binary trees with strings (words)
as leaf. There is just arround 1000 words and they will appear a lot of
times. The program will possibly consume a lot of process and
Hello Emmanuel,
Thursday, December 3, 2009, 3:03:02 PM, you wrote:
memory footprint and is easier. But I don't know if it worth to do this
optimization: having a dictionary to translate string words in Int.
GHC compiler already has this optimization. unfortunately it's not in
the code it
On Thu, Dec 3, 2009 at 4:09 AM, Peter Verswyvelen bugf...@gmail.com wrote:
Also Luke Palmer talked a couple of times about co-algebraic
approaches, but not being a computer scientist, I never really
understood what that meant (just reverse all the arrows?)
Disclaimer: I am not a category
On Thu, 2009-12-03 at 12:34 +0100, Ketil Malde wrote:
Duncan Coutts duncan.cou...@googlemail.com writes:
[1] http://hackage.haskell.org/package/failable-list
Nice.
I agree this is needed (or rather, would be nice to standardise).
Although I don't care for the cutesy naming
Hi Martijn
On 3 Dec 2009, at 00:16, Martijn van Steenbergen wrote:
So here's a totally wild idea Sjoerd and I came up with.
What if newtypes were unwrapped implicitly?
Subtyping.
What advantages and disadvantages would it have?
The typechecker being psychic; the fact that it isn't.
It's
There is another point that needs to be made. A type signature isn't actually a
type specification. It is a type assertion and a type specification in the
event that the compiler needs your help. Most of the time the compiler can care
less what you think and does not require your assistance. In
Hi Tom,
Did you make any progress on your Dominion quest? I guess you could
start by modeling `Big Money' and add the other cards (and
interaction) from there.
Also I guess there is a common baseline of things that are inherent in
a lot of card games --- mechanics that cards support: Shuffling,
Michael P Mossey schrieb:
Perhaps someone could either (1) help me do what I'm trying to do, or
(2) show me a better way.
I have a problem that is very state-ful and I keep thinking of it as OO,
which is driving me crazy. Haskell is several times harder to use than
Python in this instance,
Malcolm Wallace malcolm.wall...@cs.york.ac.uk writes:
Errm, you mean: 4 `Then` 5 `Then` 1 `Then` Finally success!
Yes, sorry, and thanks. I guess I should learn to check with ghci
before posting... How about this for a nicer syntax?
infixr 8 :+
infixr 8 +:
data TList a e = a :+
On Wed, 2 Dec 2009, Stephen Tetley wrote:
As for the second half of what you get from a programming language,
your system description frames what you want to do with an emphasis on
dynamic aspects. This seems a good way off from the prior art in
Haskell. For instance there are Haskell
Le Thu, 3 Dec 2009 13:20:31 +0100,
David Virebayre dav.vire+hask...@gmail.com a écrit :
It doesn't work this way : Strings are just lists of Chars. Comparison
is made recursively, Char by Char. You can have a look at the source
to make sure :
instance (Eq a) = Eq [a] where
[] == []
I noticed that happstack.com and tutorial.happstack.com are both equal
to patch-tag.com. Google's cache has the original pages. Is this the
result of some misconfiguration or something else?
I want to play with happstack and this is a slight inconvenience. On
the other hand, all happstack
Emmanuel CHANTREAU wrote:
Le Thu, 3 Dec 2009 13:20:31 +0100,
David Virebayre dav.vire+hask...@gmail.com a écrit :
It doesn't work this way : Strings are just lists of Chars. Comparison
is made recursively, Char by Char. You can have a look at the source
to make sure :
instance (Eq a) = Eq
Hello
One thing is magic for me: how GHC can know what function results to
remember and what results can be forgotten ?
Is it just a stupid buffer algorithm or is there some mathematics
truths behind this ?
I'm very happy about Haskell, it's so great to put some smart ideas in
a computer.
Am Donnerstag, den 03.12.2009, 16:23 +0100 schrieb Emmanuel CHANTREAU:
Le Thu, 3 Dec 2009 13:20:31 +0100,
David Virebayre dav.vire+hask...@gmail.com a écrit :
It doesn't work this way : Strings are just lists of Chars. Comparison
is made recursively, Char by Char. You can have a look at
On Thu, 3 Dec 2009, Emmanuel CHANTREAU wrote:
Hello
One thing is magic for me: how GHC can know what function results to
remember and what results can be forgotten ?
Is it just a stupid buffer algorithm or is there some mathematics
truths behind this ?
Although it is not required by the
Hi.
There is actually no magic at all going on. Haskell has a reasonably
well-defined evaluation model; you can approximate it, at least not
taking IO into account, with lazy graph reduction (look that up on
google). Probably that is the mathematical truth you're looking for.
Actually, if
Does this really mean that you want to know how the garbage collector works?
Emmanuel CHANTREAU wrote:
Hello
One thing is magic for me: how GHC can know what function results to
remember and what results can be forgotten ?
Is it just a stupid buffer algorithm or is there some mathematics
Hello Emmanuel,
Thursday, December 3, 2009, 6:23:56 PM, you wrote:
that forall x; List x = x==x. GHC have all informations to do this
optimization job, because haskell functions definitions are mathematics
definitions.
GHC doesn't make ALL possible optimizations, isn't it obvious? ;)
--
Dear Emmanuel Chantréau,
You may want to look into Objective CAML http://caml.inria.fr/ which is a
French product as you can see from the Internet address. It is likely better
suited to the task than Haskell and has a reputation for speed. For those who
prefer object oriented programming it
Am Donnerstag 03 Dezember 2009 16:31:56 schrieb Neil Brown:
Emmanuel CHANTREAU wrote:
Le Thu, 3 Dec 2009 13:20:31 +0100,
David Virebayre dav.vire+hask...@gmail.com a écrit :
It doesn't work this way : Strings are just lists of Chars. Comparison
is made recursively, Char by Char. You can
JohnDEarle:
You may want to look into Objective CAML http://caml.inria.fr/ which is a
French product as you can see from the Internet address. It is likely better
suited to the task than Haskell and has a reputation for speed. For those who
prefer object oriented programming it has facilities
vandijk.roel:
On Wed, Dec 2, 2009 at 11:44 PM, Gregory Crosswhite
gcr...@phys.washington.edu wrote:
On a more serious note, Download Haskell /= Download Haskell Platform,
so if I were glancing down the sidebar looking for a link to download the
Haskell Platform then the first link
I think it makes sense, the HP is supposed to set up the entire
environment needed for typical haskell development (at least, that is
my understanding). As such, what's the point in making downloading
haskell mean downloading a single _peice_ of haskell (GHC) only to
have to download
I'm all for making HP the default as long as we find a way to make some of
the larger packages (I'm thinking gtk2hs) either ship with HP in Windows or
install correctly with HP.
On Thu, Dec 3, 2009 at 11:46 AM, Joe Fredette jfred...@gmail.com wrote:
I think it makes sense, the HP is supposed to
See [Haskell-cafe] Optimization with Strings ? for background.
Don Stewart wrote, the guarantees of purity the type system provides are
extremely
useful for verification purposes. My response to this is in theory. This is
what caught my attention initially, but the language lacks polish and
The burden of proof is on you to demonstrate that it _is_.
On Thu, Dec 3, 2009 at 12:09 PM, John D. Earle johndea...@cox.net wrote:
See [Haskell-cafe] Optimization with Strings ? for background.
Don Stewart wrote, the guarantees of purity the type system provides are
extremely
useful for
*flawed, that is
On Thu, Dec 3, 2009 at 12:13 PM, John Van Enk vane...@gmail.com wrote:
The burden of proof is on you to demonstrate that it _is_.
On Thu, Dec 3, 2009 at 12:09 PM, John D. Earle johndea...@cox.net wrote:
See [Haskell-cafe] Optimization with Strings ? for background.
Don
It will be better for all of you to figure it out for yourselves and gain more
experience about what is out there. Haskell isn't the world. Haskell would be
the cutting edge if it didn't have competition.___
Haskell-Cafe mailing list
On 3 Dec 2009, at 20:09, John D. Earle wrote:
See [Haskell-cafe] Optimization with Strings ? for background.
Somehow all your posts to the Optimization... thread were classified
as spam by my e-mail client. Seems like it's developing self-awareness.
If you are going to argue your case,
Emmanuel CHANTREAU on 2009-12-03 13:03:02 +0100:
In my futur program, it use a lot of binary trees with strings (words)
as leaf. There is just arround 1000 words and they will appear a lot of
times. The program will possibly consume a lot of process and memory
(it is a mathematics proover).
OK, that was certainly constructive. Sorry, don't need a self-
appointed messiah here.
On 3 Dec 2009, at 20:31, John D. Earle wrote:
It will be better for all of you to figure it out for yourselves and
gain more experience about what is out there. Haskell isn't the
world. Haskell would be
From: Henning Thielemann lemm...@henning-thielemann.de
Michael P Mossey schrieb:
Perhaps someone could either (1) help me do what I'm trying to do, or
(2) show me a better way.
I have a problem that is very state-ful and I keep thinking of it as OO,
which is driving me crazy. Haskell is
Dear Luke, thanks for your answers
If SelectScecario is used for other purposes, then give an explicit
cast function
Sure, as I mentioned, we have different transformations and it would be worth
to filter a list of transformations by a particular type or even apply the list
of
On Thu, Dec 3, 2009 at 12:32 PM, Alec Berryman a...@thened.net wrote:
Emmanuel CHANTREAU on 2009-12-03 13:03:02 +0100:
In my futur program, it use a lot of binary trees with strings (words)
as leaf. There is just arround 1000 words and they will appear a lot of
times. The program will
On Thu, Dec 3, 2009 at 6:28 AM, Joachim Breitner
m...@joachim-breitner.de wrote:
Hi,
Am Donnerstag, den 03.12.2009, 11:13 + schrieb Matthew Pocock:
Perhaps what you are looking for is a more powerful defining
semantics?
newtype MyFoo = Foo defining (Foo(..)) -- all class instances that
John, Miguel (and others),
Don Stewart wrote, the guarantees of purity the type system
provides are extremely
useful for verification purposes. My response to this is in
theory. This is what caught my attention initially, but the
language lacks polish and does not appear to be going in a
Thank you Sir for giving me a good laugh!
On Thu, Dec 3, 2009 at 5:25 PM, John D. Earle johndea...@cox.net wrote:
Dear Emmanuel Chantréau,
You may want to look into Objective CAML http://caml.inria.fr/ which is a
French product as you can see from the Internet address. It is likely better
I guess TH could probably do this.
I think this does what you wish for:
http://hackage.haskell.org/packages/archive/peakachu/0.2/doc/html/Data-Newtype.html
Example:
$(mkWithNewtypeFuncs [2] ''ZipList)
withZipList2 (*) [(+3), (*3)] [6, 7]
[9, 21]
$(mkInNewtypeFuncs [2] ''ZipList)
getZipList
2009/12/3 Matthias Görgens matthias.goerg...@googlemail.com:
Hi Tom,
Did you make any progress on your Dominion quest? I guess you could
start by modeling `Big Money' and add the other cards (and
interaction) from there.
No, I'm still trying to tune a partitionM function I wrote. (I'm
Use makeStableName from System.Mem.StableName
StableName`s are just for checking pointer equality. Instead of checking for
equality of the strings, check for pointer equality of their stableNames
a dirty way:
pointerEq x y= unsafePerformIO $ do
px - makeStableName x
py -
You might want to check out the stringtable-atom and bytestring-trie
packages; these are the packages to which I turn when I want to see if I can
speed up my code by using a different data structure to map String's to values.
Cheers,
Greg
On Dec 3, 2009, at 4:03 AM, Emmanuel CHANTREAU wrote:
In fact, the correct answer is that pEqualsP should produce an error and
qEqualsQ should never terminate
¿¿???
should? or you want to say actually do that so the optimization does is not
done?
The correct amswer is not the sould you mention, but True (IMHO). So the
optimization can be done
1 - 100 of 150 matches
Mail list logo
