#1025: -ddump-minimal-imports works wrongly
--+-
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug| Status: new
Priority: normal | Milestone: 6.6.1
#1023: Core Lint Errors: in result of Simplifier phase 0, iteration 1 out of 4,
ss_atJ is out of scope
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: closed
#1026: coarbitrary for Double and Float
+---
Reporter: Susumu Katayama [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority:
#1027: GHC-as-a-library does too much recompilation when given recursive module
imports
-+--
Reporter: igloo | Owner:
Type: bug | Status: new
Priority: normal|
#1028: The darcs-all script fails with --extra on Mac OS X when fetching the 6.6
branch
-+--
Reporter: thorkilnaur | Owner:
Type: bug | Status: new
Priority: normal
#1028: The darcs-all script fails with --extra on Mac OS X when fetching the 6.6
branch
--+-
Reporter: thorkilnaur | Owner:
Type: bug | Status: new
Priority: normal
Hi Brian,
Sorry for the delayed response.
My goal is to write a program GhcRemake that works like ghc --make.
However, instead of terminating after compilation is done, I want the
program to stay open and wait for me to hit ENTER. When I hit
ENTER, GhcRemake rebuilds the project, just as if
On 11/24/06, Ian Lynagh [EMAIL PROTECTED] wrote: My goal is to write a
program GhcRemake that works like ghc --make.
However, instead of terminating after compilation is done, I want the
program to stay open and wait for me to hit ENTER.
snip
building the GHC API with it. Unfortunately,
Hello haskell,
I'm glad to present Streams library version 0.1.7. If you don't yet
know, Streams is a fast extensible I/O and serialization library
( http://haskell.org/haskellwiki/Library/Streams ).
Main changes against previous version:
* true support for GHC 6.6
* support of files larger than
I would just love to have some Haskell video casts. That would be awesome!
Cheers,
Johan
On 11/23/06, Bayley, Alistair wrote:
http://channel9.msdn.com/Showpost.aspx?postid=231495
The links to the video are a couple of yellow buttons at the bottom of
the article: Watch or Download.
I haven't
On Thu, Nov 23, 2006 at 12:56:00PM -, Bayley, Alistair wrote:
http://channel9.msdn.com/Showpost.aspx?postid=231495
The links to the video are a couple of yellow buttons at the bottom of
the article: Watch or Download.
I haven't watched this yet (it's nearly an hour long, I think).
On 11/24/06, Tomasz Zielonka [EMAIL PROTECTED] wrote:
On Thu, Nov 23, 2006 at 12:56:00PM -, Bayley, Alistair wrote:
http://channel9.msdn.com/Showpost.aspx?postid=231495
The links to the video are a couple of yellow buttons at the bottom of
the article: Watch or Download.
I haven't
On Fri, Nov 24, 2006 at 10:31:27AM +0100, Lemmih wrote:
Worked for me with mplayer+w32codecs.
Oops! I missed the Download link and tried to download through
Watch ;-) Thanks!
Best regards
Tomasz
___
Haskell mailing list
Haskell@haskell.org
Simon PJ and I spent some time thinking about this today, and wrote a wiki page.
There are several interconnected issues, which makes this hard to discuss on
a mailing list.
I hope this can evolve into a concrete design for a reorganisation of the
packages. Please feel free to edit the
Hello haskell,
We all know what is a DLL hell - if some program written against
version 2.0 of library, then using version 1.0 or 3.0 of the same
library when program compiled may call all sorts of devil
there is a great solution of this problem - Eternal Compatibility
Theory. unfortunately,
This is just a quick announcement that the development version of
QuickCheck 2 is now available in a public darcs repository.
Some highlights:
- Shrinks failing test cases.
- Supports testing monadic code.
- Handles exceptions gracefully.
- coarbitrary has moved to a separate class, to make it
Hello Simon,
Friday, November 24, 2006, 1:58:36 PM, you wrote:
There are several interconnected issues, which makes this hard to discuss
on
a mailing list.
i hardly imagine how it can be discussed on wiki :)
http://hackage.haskell.org/trac/ghc/wiki/PackageReorg
thanks, it's much
On Fri, Nov 24, 2006 at 10:26:38AM +0100, Tomasz Zielonka wrote:
Does anybody know how to watch this on Linux? I would prefer to simply
download the movie file and use MPlayer on that, but I failed.
. or on Mac OS X (haven't tried yet)
The latest mplayer works for me on FreeBSD/amd64
Hi,
I got this working on Mac OS X. I had to download media player 9:
http://www.microsoft.com/windows/windowsmedia/software/Macintosh/osx/default.aspx
This contains the WMV3 codec.
Cheers,
Chris.
On Fri, 24 Nov 2006, James William Pye wrote:
On Fri, Nov 24, 2006 at 10:26:38AM +0100,
Am Freitag, 24. November 2006 15:42 schrieb Bulat Ziganshin:
[...]
libraries should be split into 4 rings: frozen, core, base and the rest
That's one possibility, but not the only one. Especially I don't see the need
to distinguish between frozen and core.
[...]
these libs should include
On Fri, 2006-11-24 at 17:42 +0300, Bulat Ziganshin wrote:
libraries should be split into 4 rings: frozen, core, base and the rest
* frozen libs are installed with haskell compiler and cannot be
upgraded using Cabal. it includes Cabal itself and libraries required
by Cabal, currently it's
在 Nov 24, 2006 9:29 PM 時，Björn Bringert 寫到：
This is just a quick announcement that the development version of
QuickCheck 2 is now available in a public darcs repository.
Some highlights:
- Shrinks failing test cases.
- Supports testing monadic code.
Wonderful. Many thanks for QC2! :-)
By
On 24 nov 2006, at 22.04, Audrey Tang wrote:
在 Nov 24, 2006 9:29 PM 時，Björn Bringert 寫到：
This is just a quick announcement that the development version of
QuickCheck 2 is now available in a public darcs repository.
Some highlights:
- Shrinks failing test cases.
- Supports testing monadic
| The basic idea is to provide a way for a transaction to call into
transaction-aware libraries. The libraries
| can register callbacks for if the transaction commits (to actually do any
O) and for if the transaction
| aborts (to re-buffer any I that the transaction has consumed). In
On Fri, Nov 24, 2006 at 08:22:36AM +, Simon Peyton-Jones wrote:
I have also toyed with adding
retryWith :: IO a - STM ()
The idea here is that the transction is undone (i.e. just like the 'retry'
combinator), then the specified action is performed, and then the transaction
On Fri, Nov 24, 2006 at 10:02:59AM +0100, Tomasz Zielonka wrote:
That's where retryWith would help. Right now I am using something named
autonomous transactions:
autonomously :: Bool - STM a - STM ()
This basically forks a new thread to perform the given transaction
outside of the
On 11/23/06, Conor McBride [EMAIL PROTECTED] wrote:
*Grr ifM (Just True) (Just 3) Nothing
Nothing
More care required!
Thank you. Now that you point this out I recall that I've made this
mistake in the past with (), I once wrote something like liftM2
(). I forget that the liftM* family
I would just love to have some Haskell video casts. That would be awesome!
Cheers,
Johan
On 11/23/06, Bayley, Alistair wrote:
http://channel9.msdn.com/Showpost.aspx?postid=231495
The links to the video are a couple of yellow buttons at the bottom of
the article: Watch or Download.
I haven't
On 11/24/06, Tomasz Zielonka [EMAIL PROTECTED] wrote:
On Thu, Nov 23, 2006 at 12:56:00PM -, Bayley, Alistair wrote:
http://channel9.msdn.com/Showpost.aspx?postid=231495
The links to the video are a couple of yellow buttons at the bottom of
the article: Watch or Download.
I haven't
On Fri, Nov 24, 2006 at 10:31:27AM +0100, Lemmih wrote:
Worked for me with mplayer+w32codecs.
Oops! I missed the Download link and tried to download through
Watch ;-) Thanks!
Best regards
Tomasz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Jason Dagit wrote:
On 11/23/06, Conor McBride [EMAIL PROTECTED] wrote:
*Grr ifM (Just True) (Just 3) Nothing
Nothing
More care required!
Thank you. Now that you point this out I recall that I've made this
mistake in the past
You and me both. It's really insidious and can hide for weeks,
Hello,
i'd like to write a function that given a list like [1,2,3,4...]
returns a list of couple where the first element is the corresponding
element of the string, and the second is the sum of the previous
elements.
An example:
input: [1,2,3,4]
output: [(1,0)(2,1)(3,3)(4,6)]
The problem is that
zacara:
Hello,
i'd like to write a function that given a list like [1,2,3,4...]
returns a list of couple where the first element is the corresponding
element of the string, and the second is the sum of the previous
elements.
An example:
input: [1,2,3,4]
output: [(1,0)(2,1)(3,3)(4,6)]
this thread reminds me about something that I wanted to ask you.
if I recall correctly, most of the literature references in STM papers
are recent, so I wondered whether you are aware of this one:
NAMING AND SYNCHRONIZATION IN A
DECENTRALIZED COMPUTER SYSTEM
SourceTechnical Report:
Grzegorz
A nice example! I don't think I'd really realised before that a type like
forall a. (?x::a) = Int
is not ambiguous at all, even though the Int part does not mention the 'a'.
Why not? Because a call site will give the ?x binding, and that in turn fixes
a.
I've fixed GHC (the
Hi,
Josef Svenningsson posted a comment on my blog today that got me to
thinking. He suggested that people may be intimidated by the size of
MissingH, confused by the undescriptive name, and don't quite know what's
in there. And I think he's right.
I've been passively thinking about what
John Goerzen [EMAIL PROTECTED] wrote:
The major features [of MissingH] are:
* A general-purpose modular logging infrastructure
* A virtual filesystem component (similar to VFS in Gnome, but
written inHaskell)
* A configuration file parser, compatible with Python's and Perl's,
Hi John,
Should this all be one library?
No, several smaller libraries would be nice.
Should the module naming scheme be changed?
Yes, MissingH is not the place to put these things. You run the risk
of more name clashes, but thats ok.
Could, and should, any of this be integrated into
Taral wrote:
Ah, the dreaded $ with existential types problem. $ is not quite
equivalent to application -- the type checker does something funny
with forall types. Just take out the $ and you'll be fine.
Is this a ghc bug, or some subtlety of the type system that I don't
understand?
Hi
How could greater community participation be encouraged, while still
encouraging quality control?
It also took me quite a while to find the darcs repository, and as far
as I can see there is no web page on what MissingH has in it, other
than a textual readme and the GNU entry. If there
It's not a bug. It's what the type of ($) forces.
On Nov 24, 2006, at 12:37 , Seth Gordon wrote:
Taral wrote:
Ah, the dreaded $ with existential types problem. $ is not quite
equivalent to application -- the type checker does something funny
with forall types. Just take out the $ and you'll
I posted an improved version of the new monad to the wiki at
http://haskell.org/haskellwiki/New_monads/MonadAdvSTM
Observations:
** This idiom made it easy for the retrying case to queue an action which
ensures success in the next attempt.
** More than one operation can be queued for both the
On Fri, 24 Nov 2006 18:17:06 +, Neil Mitchell wrote:
Hi
How could greater community participation be encouraged, while still
encouraging quality control?
It also took me quite a while to find the darcs repository, and as far
as I can see there is no web page on what MissingH has
On 11/24/06, John Goerzen [EMAIL PROTECTED] wrote:
What else should be done to make this a valuable resource for Haskell
programmers? And a showcase for what is possible with Haskell?
I was going to try MissingH on win32 but when I did it refused to
compile due to a dependency on, I think,
The idea of backtracking is, that you try all options because you can't
tell/calulate in advance which parameters lead to a solution; if you have
some idea about where and how to limit your search, you may save a lot of
time. In your example, you can limit your search by replacing the
Donald Bruce Stewart:
zacara:
i'd like to write a function that given a list like [1,2,3,4...]
returns a list of couple where the first element is the corresponding
element of the string, and the second is the sum of the previous
elements.
Looks like a scanl (a prefix fold) -- the of
Simon Peyton-Jones wrote:
I have also toyed with adding
retryWith :: IO a - STM ()
The idea here is that the transction is undone (i.e. just like the 'retry'
combinator), then the specified action is performed, and then the transaction is
retried. Again no atomicity guarantee. If
Until this email I was under the impression that the project is dead.
For example, if I go to google and type 'MissingH' the first link is
fsf's directory page. When I try to get to MissingH website from there
the link appears to be down. I can't really figure out what MissingH
includes and where
ross:
On Sun, Nov 19, 2006 at 03:41:29PM +1100, Donald Bruce Stewart wrote:
http://haskell.org/haskellwiki/How_to_write_a_Haskell_program
Feedback welcome!
There is inconsistent advice regarding Setup.hs/Setup.lhs.
(#! in .hs files seems to be a feature of GHC Haskell.)
Fixed. And
I just built GHC 6.6 on my linux Fedora Core box (athlon 700mhz).
When I run it, it crashes. The 6.4 version works fine (which
I also built).
# ghc-6.6
Segmentation fault
# gdb /usr/local/lib/ghc-6.6/ghc-6.6
GNU gdb Red Hat Linux (6.0post-0.20040223.19rh)
Copyright 2004 Free Software
50 matches
Mail list logo
