#3390: Upgrade the Windows build to use gcc 4.4.0
-+--
Reporter: simonmar |Owner: simonmar
Type: task | Status: new
Priority: normal|Milestone: 6.14.1
#4295: Review higher-rank and impredicative types
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
Priority: normal|
#4267: Missing unboxing in pre-order fold over binary tree
-+--
Reporter: tibbe |Owner:
Type: bug | Status: new
Priority: normal|
#4267: Missing unboxing in pre-order fold over binary tree
-+--
Reporter: tibbe |Owner:
Type: bug | Status: new
Priority: normal|
#4267: Missing unboxing in pre-order fold over binary tree
-+--
Reporter: tibbe |Owner:
Type: bug | Status: new
Priority: normal|
#4299: a less forceful INLINE pragma
-+--
Reporter: simonmar |Owner:
Type: feature request | Status: new
Priority: normal
#836: rebindable if-then-else syntax
--+-
Reporter: nibro |Owner:
Type: feature request| Status: new
Priority: normal |Milestone: _|_
#4284: Adding parentheses introduces type error
-+--
Reporter: jpbernardy | Owner:
Type: bug | Status: closed
#4299: a less forceful INLINE pragma
-+--
Reporter: simonmar |Owner:
Type: feature request | Status: new
Priority: normal
On 08/09/2010 15:57, Edward Z. Yang wrote:
Excerpts from Simon Marlow's message of Wed Sep 08 03:40:42 -0400 2010:
Maybe. As a first step I think we could just document what happens when
a call is interrupted (pthread_cancel() on POSIX, ??? on Windows) and
let the user handle it. Is there
Hi,
we call from our haskell application the metis prover via
System.Process.readProcessWithExitCode metis filename
However, we are not able to get rid of this process if metis does not
terminate by itself. In particular, wrapping this call into a
System.Timeout.timeout does not work.
Any
Christian Maeder schrieb:
Hi,
we call from our haskell application the metis prover via
System.Process.readProcessWithExitCode metis filename
However, we are not able to get rid of this process if metis does not
terminate by itself. In particular, wrapping this call into a
| I'm afraid I didn't understand your questions well enough to answer them.
|
| My question is, why does this type check:
It's hard for me to answer a question like that! To explain why something type
checks I'd have to show every constraint and how it is solved.
I think you have something
On 06/09/2010 19:03, Evan Laforge wrote:
So a long time ago (I think when 6.10 first came out, the problem
didn't happen with the previous version, and I think 6.10 changed how
the FFI used alignment) I filed a ghc ticket about a gc assertion
failure. Unfortunately it was so hard to reproduce
On 09/09/2010 00:28, Daniel Fischer wrote:
On Wednesday 08 September 2010 23:55:35, Don Stewart wrote:
simonpj:
| ghc-6.12.3:
|89,330,672 bytes allocated in the heap
|15,092 bytes copied during GC
|35,980 bytes maximum residency (1 sample(s))
|
On 09/09/2010 10:39, Christian Maeder wrote:
Christian Maeder schrieb:
Hi,
we call from our haskell application the metis prover via
System.Process.readProcessWithExitCode metis filename
However, we are not able to get rid of this process if metis does not
terminate by itself. In
On Thursday 09 September 2010 13:19:23, Simon Marlow wrote:
I think I've found the problem, GHC.IO.Handle.Text:
bufReadNBEmpty :: Handle__ - Buffer Word8 - Ptr Word8 - Int - Int -
IO Int
bufReadNBEmpty h...@handle__{..}
b...@buffer{ bufRaw=raw, bufR=w, bufL=r, bufSize=sz
On Sep 9, 2010, at 6:37 AM, Simon Marlow wrote:
On 09/09/2010 10:39, Christian Maeder wrote:
Christian Maeder schrieb:
Hi,
we call from our haskell application the metis prover via
System.Process.readProcessWithExitCode metis filename
However, we are not able to get rid of this
On 09/09/2010 15:08, Daniel Fischer wrote:
On Thursday 09 September 2010 13:19:23, Simon Marlow wrote:
I think I've found the problem, GHC.IO.Handle.Text:
bufReadNBEmpty :: Handle__ - Buffer Word8 - Ptr Word8 - Int - Int -
IO Int
bufReadNBEmpty h...@handle__{..}
David Peixotto schrieb:
On Sep 9, 2010, at 6:37 AM, Simon Marlow wrote:
On 09/09/2010 10:39, Christian Maeder wrote:
Christian Maeder schrieb:
Hi,
we call from our haskell application the metis prover via
System.Process.readProcessWithExitCode metis filename
However, we are not able
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 9/9/10 05:35 , Christian Maeder wrote:
System.Process.readProcessWithExitCode metis filename
If all else fails, there's:
sh -c '(sleep 120; kill -TERM $$ /dev/null 21) exec metis'
which makes the shell deal with timeouts for you. (Adjust
Oh, forget to send the links:
cabal pkg: http://hackage.haskell.org/package/iyql
source: http://github.com/dsouza/iyql
Thanks!
On Wed, Sep 8, 2010 at 11:27 PM, Diego Souza dso...@bitforest.org wrote:
Hi All,
I'm pleased to announce iyql, an interactive CLI for YQL [
On Mon, Sep 06, 2010 at 07:27:35AM +, Simon Peyton-Jones wrote:
I think that's an excellent idea. I think there should be a web page
describing what the committee does, who is in it, how to contact it, etc.
Yes, definitely. I've created:
Hi all,
We will shortly be replacing the haskell.org server with a more modern,
commercially hosted machine. For now, the new server is available as
http://new-www.haskell.org/
The ghc, hugs and nhc98 websites have been copied across, and there is a
copy of the wiki (although that will be
Antoine Latter aslat...@gmail.com wrote:
I don't think you need 'goto' to implement jumps in Haskell. Note
that functions as well as computations are first class:
To recover from my overly complex previous post, here is a much simply
goto based on existing monad transformers:
goto ::
Antoine Latter wrote:
To recover from my overly complex previous post, here is a much simply
goto based on existing monad transformers:
goto :: Monad m = ContT r m r - ContT r m a
goto (ContT m) = ContT $ \_ -
m return
That is precisely how continuations were discovered
Hi Ertugrul,
My goal was to find a way to define all that was needed using
Haskell's automatic instance deriving mechanism. Haskell can
automatically derive Foldable, which is why I was looking at that.
However, that requires writing two lines for each wrapper newtype to
get around the kind
David Leimbach wrote:
In my amazon shopping cart I currently have:
*Conceptual Mathematics: A First Introduction to
Categorieshttp://www.amazon.com/gp/product/052171916X/ref=ord_cart_shr?ie=UTF8m=ATVPDKIKX0DER
*- F. William Lawvere
*Categories for the Working Mathematician (Graduate Texts in
In general, I think using CPP for actual macro processing is
extremely poor style and can easily make code inscrutable (and no
doubt bug-prone). If the Haskell spec were to add support for this
sort of top-level compiler/compiletime-flag conditional definition,
I'd switch over.
I agree
Kevin Jardine kevinjard...@gmail.com wrote:
My goal was to find a way to define all that was needed using
Haskell's automatic instance deriving mechanism. Haskell can
automatically derive Foldable, which is why I was looking at that.
However, that requires writing two lines for each wrapper
David Leimbach wrote:
In my amazon shopping cart I currently have:
*Conceptual Mathematics: A First Introduction to
Categorieshttp://www.amazon.com/gp/product/052171916X/ref=ord_cart_shr?ie=UTF8m=ATVPDKIKX0DER
*- F. William Lawvere
Lawvere is widely regarded as being very accessible. The
Hi Ertugrul,
if you look back earlier in this thread, you'll see that
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
allows me to write genuine one line definitions for each wrapper type.
Eg.
newtype Blog = Blog Obj deriving ToObj
There is no need to code the instances as GHC will do that for
Malcolm Wallace malcolm.wallace at me.com writes:
I agree that CPP used only for conditional compilation, is much more
acceptable than using it for macros as well. And co-incidentally,
cpphs has a --nomacro flag.
So that's basically what the C# preprocessor does?
Since GHC 6.14 will (hopefully) be use LLVM as a default backend, an idea
has occured to me
Should GHC also use the clang (C/C++-LLVM compiler) on external C library
sources which are used with certain Haskell packages (such as gtk) when LLVM
does become a default backend for GHC. The consensus
Am Mittwoch, den 08.09.2010, 11:47 -0300 schrieb Rafael Gustavo da Cunha
Pereira Pinto:
The input and output are infinite streams. I have a few questions:
1) Is it possible to change it to use arrows? How would it look like?
2) How would one implement an continuous time version?
Have you
Is there anywhere we can see the number of download for a particular
package, especially ones you maintain yourself?
Thanks,
Tony
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I miss the Haskell Weekly News.
The most recent issue was published on 8th March 2010. The volunteer
who produces it claimed on 27th April that he would be back in action
soon, implying that once a couple of weeks' worth of university
classes were finished, HWN would return.
So in the
I'm not sure using Clang would make it any *easier* to use external sources,
but it could provide opportunities for optimizing across the C/Haskell
boundary. The main difficulty in getting it all working correctly is the
linking step. The Mac OSX linker can [link together llvm bitcode][1] for
tonyhannan2:
Is there anywhere we can see the number of download for a particular package,
especially ones you maintain yourself?
Nothing terribly automated, but the status for the last quarter:
http://donsbot.wordpress.com/2010/06/30/popular-haskell-packages-q2-2010-report/
I'd like to do it. Any tips?
-deech
On Thu, Sep 9, 2010 at 9:35 AM, Malcolm Wallace malcolm.wall...@me.com wrote:
I miss the Haskell Weekly News.
The most recent issue was published on 8th March 2010. The volunteer who
produces it claimed on 27th April that he would be back in action soon,
I am in my yearly fightto get a working combination of operating system (Snow
Leopard), compiler version (6.12) , wxWidgets and wxHaskell on my Mac .
After deleting most of my stuff, starting afresh, hours of building using
macports etc. I finally get the message:
loeki:Opgave doaitse$ ghc
S. Doaitse Swierstra doai...@swierstra.net writes:
I am in my yearly fightto get a working combination of operating
system (Snow Leopard), compiler version (6.12) , wxWidgets and
wxHaskell on my Mac . After deleting most of my stuff, starting
afresh, hours of building using macports etc. I
Hi Doaitse,
On Thu, Sep 09, 2010 at 17:38:40 +0200, S. Doaitse Swierstra wrote:
I am in my yearly fightto get a working combination of operating
system (Snow Leopard), compiler version (6.12) , wxWidgets and
wxHaskell on my Mac . After deleting most of my stuff, starting
afresh, hours of
On Thu, Sep 9, 2010 at 17:44, Eric Y. Kow wrote:
On Thu, Sep 09, 2010 at 17:38:40 +0200, S. Doaitse Swierstra wrote:
I am in my yearly fightto get a working combination of operating
system (Snow Leopard), compiler version (6.12) , wxWidgets and
wxHaskell on my Mac . After deleting most of
I miss it too,
I've got one person set up (or in the process of setting up) to take
it over. I'll be happy to help anyone else get set up (the tools are
nontrivial to use at first). The current plan, when I finally get back
on my feet, is to have multiple editors trading off weeks/months/
See if
http://stackoverflow.com/questions/2726248/ghc-6-12-and-macports/3601842#3601842
is of any help.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Colin Paul Adams schrieb:
Henning == Henning Thielemann lemm...@henning-thielemann.de writes:
Henning On Wed, 8 Sep 2010, Gregory Crosswhite wrote:
ExceptionT is a different matter because it handles fail as an
uncaught error and places no restrictions on the error type, so
On 9 September 2010 14:56, Tony Hannan tonyhann...@gmail.com wrote:
Is there anywhere we can see the number of download for a particular
package, especially ones you maintain yourself?
And the new hackage server implementation maintains download counts.
See the server test instance here:
Just found it! It is pretty much what I was looking for,
On Thu, Sep 9, 2010 at 10:08, Wolfgang Jeltsch
g9ks1...@acme.softbase.orgwrote:
Am Mittwoch, den 08.09.2010, 11:47 -0300 schrieb Rafael Gustavo da Cunha
Pereira Pinto:
The input and output are infinite streams. I have a few questions:
Thank you for your advice,
Actually, I'm not comfortable with C# at all... I'm gonna be learning it as
I develop
the application.
Also helpful are various Haskell-inspired features added to C# in the
last few years, making it feasible to port a large subset of Haskell
to C# fairly directly.
Rafael Gustavo da Cunha Pereira Pinto schrieb:
The input and output are infinite streams. I have a few questions:
1) Is it possible to change it to use arrows? How would it look like?
2) How would one implement an continuous time version?
For 2) I would like to implement something like
Is it possible to install either of these (preferably the latter) somewhere
in my home directory without having root permission? I tried the unknown
linux package with configure --prefix set to a subdir in my home, to no
avail. The problem seems to be due to some library registration which fails.
ali.razavi:
Is it possible to install either of these (preferably the latter) somewhere in
my home directory without having root permission? I tried the unknown linux
package with configure --prefix set to a subdir in my home, to no avail. The
problem seems to be due to some library
Nice, thanks, looking forward to it.
On Thu, Sep 9, 2010 at 12:14 PM, Duncan Coutts duncan.cou...@googlemail.com
wrote:
On 9 September 2010 14:56, Tony Hannan tonyhann...@gmail.com wrote:
Is there anywhere we can see the number of download for a particular
package, especially ones you
Unfortunately I don't have ghc installed. Can I install it without root priv?
On Sep 9, 2010, at 1:40 PM, Don Stewart d...@galois.com wrote:
ali.razavi:
Is it possible to install either of these (preferably the latter) somewhere
in
my home directory without having root permission? I tried
The input and output are infinite streams. I have a few questions:
1) Is it possible to change it to use arrows? How would it look like?
2) How would one implement an continuous time version?
Yampa can do *exactly* what you're asking for. Unfortunately the code
seems to be a little rough
On Thursday 09 September 2010 20:23:13, Ali Razavi wrote:
Unfortunately I don't have ghc installed. Can I install it without root
priv?
That ought to work. I just unpacked and installed ghc-6.8.3-i386-unknown-
linux.tar.bz2 in a subdir of $HOME without root privileges.
(I would've tried a newer
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 9/8/10 18:43 , Henning Thielemann wrote:
On Wed, 8 Sep 2010, Gregory Crosswhite wrote:
ExceptionT is a different matter because it handles fail as an
uncaught error and places no restrictions on the error type, so one
could implement the same
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 9/9/10 12:16 , Henning Thielemann wrote:
Colin Paul Adams schrieb:
Henning == Henning Thielemann lemm...@henning-thielemann.de writes:
Henning On Wed, 8 Sep 2010, Gregory Crosswhite wrote:
ExceptionT is a different matter because it
Hello,
as this is really friendly forum, I'd like to ask to perhaps solve my
wonder. From time to time I'm seeing people here recommending Scala as a
kind of replacement for non-existent Haskell on Java/JVM platform. My
wonder is: why the people here do not recommend CAL, which at least to
me,
karel.gardas:
Hello,
as this is really friendly forum, I'd like to ask to perhaps solve my
wonder. From time to time I'm seeing people here recommending Scala as a
kind of replacement for non-existent Haskell on Java/JVM platform. My
wonder is: why the people here do not recommend CAL,
Hello cafe,
Maybe malicious isn't the right word but there is a JS based web
counter on http://www.haskell.org/complex/why_does_haskell_matter.html
which likes to show pop up adverts. They must have switched over from
counting visitors to showing adverts at some point since the web page
was
Am 09.09.2010 22:55, schrieb Wanas:
Hey all,
So I have a two part question (I'm new to haskell, so you can throw all
your mugs at me).
a) I want to write a function that generates lists of lists of size $n$.
All having the property that sum lst = sum [1..n].
a-1) After that, I want to remove
On Thursday 09 September 2010 22:55:14, Wanas wrote:
Hey all,
So I have a two part question (I'm new to haskell, so you can throw all
your mugs at me).
a) I want to write a function that generates lists of lists of size $n$.
All having the property that sum lst = sum [1..n].
a-1) After
Hello Wanas,
Friday, September 10, 2010, 12:55:14 AM, you wrote:
a) I want to write a function that generates lists of lists of
size $n$. All having the property that sum lst = sum [1..n].
a-1) After that, I want to remove all permutations. My idea of
you have very interesting questions.
Although it was phrased as one, it wasn't. If it were a homework question,
wouldn't you think that I'd be trained to do it or have a TA to ask?
But who said that you're accusing me of anything :) Thanks for your concern,
Bulat.
\/\/
On Fri, Sep 10, 2010 at 1:47 AM, Bulat Ziganshin
On 10-09-09 05:30 PM, Keith Sheppard wrote:
Maybe malicious isn't the right word but there is a JS based web
counter on http://www.haskell.org/complex/why_does_haskell_matter.html
which likes to show pop up adverts. They must have switched over from
counting visitors to showing adverts at some
I am not that familiar with LLVM, if anything it complicates matters,
rather than making things easier.
The llvm-ld program has limited support for native code generation,
when using the -native or -native-cbe options. Native code generation is
performed by converting the linked bitcode into
On Thu, Sep 9, 2010 at 9:08 PM, John Lask jvl...@hotmail.com wrote:
so it seems that the gcc support infrastructure that is currently integrated
into ghc will still be required. Then the question arises what library
formats will ghc use under the circumstances ?(.bc, .a) and how will the two
On 9 September 2010 22:10, Mathew de Detrich dete...@gmail.com wrote:
It should also hopefully make using Haskell packages on windows that use C
sources less painful
Clang could also make using FFI with C++ much easier (for reasons stated
above)
Thoughts?
I don't think it would make it any
This is the main thing I was getting behind, making cross compiling slightly
easier (in regards to C/C++ sources). As also pointed out, whole program
optimization can be one major benefit to integrating Clang like this.
On Fri, Sep 10, 2010 at 11:01 AM, David Terei dave.te...@gmail.com wrote:
I
On Sep 10, 2010, at 8:55 AM, Wanas wrote:
Hey all,
So I have a two part question (I'm new to haskell, so you can throw all your
mugs at me).
a) I want to write a function that generates lists of lists of size $n$. All
having the property that sum lst = sum [1..n].
a-1) After that, I
On 9/9/10 1:04 AM, David Menendez wrote:
Fascinating. I figured there might be a counter-example involving seq,
but this is pretty subtle.
In particular, would it be fair to say that in Haskell-without-seq, E
(f a) a and E (f a) (f a) are indistinguishable?
Yes, I think that without
On 09/09/2010 00:54, wren ng thornton wrote:
On 9/7/10 3:10 PM, Ben Millwood wrote:
So I wonder what people
think of the use of CPP in Haskell code, what alternatives people can
propose, or what people hope to see in future to make conditional
compilation of Haskell code more elegant and
This package is a collection of programs that we use at Eaton to
interact with, debug, and analyze data from vehicle ECUs (Electronic
Control Unit: automotive speak for an embedded computer). The
motivation to put this stuff on hackage is to encourage the use of
Haskell in automotive electronics
On Thu, Sep 9, 2010 at 11:33 PM, wren ng thornton w...@freegeek.org wrote:
On 9/9/10 1:04 AM, David Menendez wrote:
Fascinating. I figured there might be a counter-example involving seq,
but this is pretty subtle.
In particular, would it be fair to say that in Haskell-without-seq, E
(f a) a
I wonder if llvm-gcc supports it's own (gcc) extensions. If it supports
then there is no need to stuck in clang right now.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
77 matches
Mail list logo