#5131: linux-powerpc : panic in stage1 compiler
+---
Reporter: erikd| Owner:
Type: bug | Status: new
Priority: normal | Component: Compiler
#5131: linux-powerpc : panic in stage1 compiler
+---
Reporter: erikd| Owner:
Type: bug | Status: new
Priority: normal | Component: Compiler
#5131: linux-powerpc : panic in stage1 compiler
+---
Reporter: erikd| Owner:
Type: bug | Status: new
Priority: normal | Component: Compiler
#5131: linux-powerpc : panic in stage1 compiler
-+--
Reporter: erikd |Owner: dterei
Type: bug | Status: new
Priority: normal|Milestone:
#4464: RTS options broken for dynamic libraries
-+--
Reporter: rl|Owner:
Type: bug | Status: new
Priority: normal|
#5132: Segfault on OS X in GHCi when using GHC API
---+
Reporter: nominolo| Owner:
Type: bug | Status: new
Priority: normal | Component: GHCi
#5132: Segfault on OS X in GHCi when using GHC API
---+
Reporter: nominolo|Owner: igloo
Type: bug | Status: new
Priority: high|Milestone:
#5031: GHC API (7.0.2) + runhaskell causes bus error in Mac OS X 10.6
-+--
Reporter: guest |Owner: igloo
Type: bug | Status: new
#5133: Random instance for Float can generate values out of requested range
-+--
Reporter: richardsenington | Owner:
Type: bug | Status: new
Priority:
#5132: Segfault on OS X in GHCi when using GHC API
---+
Reporter: nominolo|Owner: igloo
Type: bug | Status: new
Priority: high|Milestone:
#5131: linux-powerpc : panic in stage1 compiler
-+--
Reporter: erikd |Owner: dterei
Type: bug | Status: new
Priority: normal|Milestone:
#5127: internal error heapCensus unknown object with +RTS -N -hT
-+--
Reporter: claudiusmaximus |Owner: simonmar
Type: bug | Status: new
Priority: high
#5134: ghc-stage1: unrecognised flags: -fno-asm-mangling
-+--
Reporter: erikd | Owner:
Type: bug | Status: new
Priority: normal|
Hello all,
I've been using LLDB for a few weeks now, initially acquainting myself
with its python bindings. It occurred to me early on that they might
integrate into GHC's testsuite well, so I began writing a driver. The
idea was to encapsulate the launched haskell processes in LLDB and
generate
On Mon, Apr 18, 2011 at 12:47:33AM +0200, Johan Tibell wrote:
In other words, it's reasonable to fork of tens of thousands of threads and
expect good performance.
Yes I think. Besides from the point of view of programming servers
like for e.g. a web server, the forkIO based solution is
On Mon, 18 Apr 2011 11:31:08 +0530
Piyush P Kurur p...@cse.iitk.ac.in wrote:
begin rant
It is unfortunate that the usual fork and even pthread_create is not light
weight enough for programming such high performance servers. The select
based programming is more a hack than anything IMNSHO.
I
On Mon, Apr 18, 2011 at 8:13 AM, Mike Meyer m...@mired.org wrote:
On Mon, 18 Apr 2011 11:31:08 +0530
Piyush P Kurur p...@cse.iitk.ac.in wrote:
begin rant
It is unfortunate that the usual fork and even pthread_create is not light
weight enough for programming such high performance servers. The
On Mon, Apr 18, 2011 at 10:06 AM, Svein Ove Aas svein@aas.no wrote:
And I've often wanted a select-equivalent in Haskell. It'd be simple,
it'd help, so why not?
But good luck using multiple cores like that. The one paradigm that
makes no sense in Haskell is worker threads (since the RTS
On Mon, Apr 18, 2011 at 9:13 AM, Mike Meyer m...@mired.org wrote:
I always looked at it the other way 'round: threading is a hack to
deal with system inadequacies like poor shared memory performance or
an inability to get events from critical file types.
Real processes and event-driven
On Mon, 18 Apr 2011 11:07:58 +0200
Johan Tibell johan.tib...@gmail.com wrote:
On Mon, Apr 18, 2011 at 9:13 AM, Mike Meyer m...@mired.org wrote:
I always looked at it the other way 'round: threading is a hack to
deal with system inadequacies like poor shared memory performance or
an
***
*
* EXTENDED CALL FOR PAPERS AND CALL FOR PARTICIPATION
*
* 2nd International Workshop on
* Foundational and Practical Aspects of Resource Analysis (FOPARA 2011)
*
Mike Meyer m...@mired.org wrote:
On Mon, 18 Apr 2011 11:07:58 +0200
Johan Tibell johan.tib...@gmail.com wrote:
On Mon, Apr 18, 2011 at 9:13 AM, Mike Meyer m...@mired.org wrote:
I always looked at it the other way 'round: threading is a hack to
deal with system inadequacies like poor
Svein Ove Aas svein@aas.no wrote:
And I've often wanted a select-equivalent in Haskell. It'd be simple,
it'd help, so why not?
Because perhaps it's just an illusion that it would help. I don't see
any advantage in using explicit polling. Use concurrency.
Greets,
Ertugrul
--
On Mon, Apr 18, 2011 at 10:06 AM, Svein Ove Aas svein@aas.no wrote:
And I've often wanted a select-equivalent in Haskell. It'd be simple,
it'd help, so why not?
http://hackage.haskell.org/packages/archive/base/latest/doc/html/Control-Concurrent.html#v:threadWaitRead
Ta-da! It's select(),
On Mon, Apr 18, 2011 at 12:59:07PM +0200, Ertugrul Soeylemez wrote:
Svein Ove Aas svein@aas.no wrote:
And I've often wanted a select-equivalent in Haskell. It'd be simple,
it'd help, so why not?
Because perhaps it's just an illusion that it would help. I don't see
any advantage in
On Mon, 18 Apr 2011 12:56:39 +0200
Ertugrul Soeylemez e...@ertes.de wrote:
Mike Meyer m...@mired.org wrote:
On Mon, 18 Apr 2011 11:07:58 +0200
Johan Tibell johan.tib...@gmail.com wrote:
On Mon, Apr 18, 2011 at 9:13 AM, Mike Meyer m...@mired.org wrote:
I always looked at it the other
On Mon, Apr 18, 2011 at 12:59:07PM +0200, Ertugrul Soeylemez wrote:
Svein Ove Aas svein@aas.no wrote:
And I've often wanted a select-equivalent in Haskell. It'd be simple,
it'd help, so why not?
Because perhaps it's just an illusion that it would help. I don't see
any advantage in
Please can this discussion be moved to haskell-cafe?
http://www.haskell.org/haskellwiki/Mailing_Lists
Ta.
Jeremy
On 18 Apr 2011, at 12:55, Mike Meyer wrote:
On Mon, 18 Apr 2011 12:56:39 +0200
Ertugrul Soeylemez e...@ertes.de wrote:
Mike Meyer m...@mired.org wrote:
On Mon, 18 Apr 2011
On 18/04/2011 12:55, Mike Meyer wrote:
On Mon, 18 Apr 2011 12:56:39 +0200
Ertugrul Soeylemeze...@ertes.de wrote:
Mike Meyerm...@mired.org wrote:
The unix process model works quite well. Compared to a threaded model,
this is more robust (if a process breaks, you can kill and restart it
On Mon, Apr 18, 2011 at 07:55:57AM -0400, Mike Meyer wrote:
On Mon, 18 Apr 2011 12:56:39 +0200
Ertugrul Soeylemez e...@ertes.de wrote:
You also don't need Emacs/Vim, if all you want is to write a simple
plain text file. There is nothing wrong with concurrency, because you
are confusing
On Mon, 18 Apr 2011 17:05:12 +0530
Piyush P Kurur p...@cse.iitk.ac.in wrote:
On Mon, Apr 18, 2011 at 12:59:07PM +0200, Ertugrul Soeylemez wrote:
Svein Ove Aas svein@aas.no wrote:
To add a bit more. The most common use of select/epoll is to simulate
the concurrency because the
On Mon, Apr 18, 2011 at 2:25 PM, Mike Meyer m...@mired.org wrote:
Only if you also made the TCP/IP connection overhead trivial so you
could stop with HTTP/1.0 and not deal with HTTP/1.1. Failing that, the
most natural way to do this is:
forever do
accept the next connection
Hi Mike,
On Mon, Apr 18, 2011 at 12:00 PM, Mike Meyer m...@mired.org wrote:
It's useful to use non-determinism (i.e. concurrency) to model a server
processing multiple requests. Since requests are independent and
shouldn't
impact each other we'd like to model them as such. This implies
Again we will teach an Applied Functional Programming Summer in Haskell
school this year at Utrecht University. In the previous two occasions students
were all very happy with the school and we plan to repeat this success this
year.
The intended audience are prospective master students who
Mike Meyer m...@mired.org wrote:
To add a bit more. The most common use of select/epoll is to
simulate the concurrency because the natural way of doing it
fork/pthread_create etc are too expensive. I dont know of any other
reason why select/epoll exits.
You know, I've *never*
Mike Meyer m...@mired.org wrote:
You also don't need Emacs/Vim, if all you want is to write a simple
plain text file. There is nothing wrong with concurrency, because
you are confusing the high level model with the low level
implementation. Concurrency is nothing but a design pattern,
On Sat, 2011-04-09 at 21:27 +0100, Dominic Steintiz wrote:
Hi,
I am trying to create a project using
http://community.haskell.org/admin/project_request.html but I am getting
Service Temporarily Unavailable. Does anyone know when it will be back
on line?
BTW, this is back online now.
On 18 April 2011 16:54, Ertugrul Soeylemez e...@ertes.de wrote:
Well, *someone* has to worry about robustness and scalability. Users
notice when their two minute system builds start taking four minutes
(and will be at my door wanting me to fix it) because something didn't
scale fast
Redirecting to haskell-cafe@, where this kind of long discussion belongs.
On Mon, Apr 18, 2011 at 9:07 AM, Colin Adams
colinpaulad...@googlemail.com wrote:
On 18 April 2011 16:54, Ertugrul Soeylemez e...@ertes.de wrote:
Well, *someone* has to worry about robustness and scalability. Users
On Mon, 18 Apr 2011 17:07:53 +0100
Colin Adams colinpaulad...@googlemail.com wrote:
On 18 April 2011 16:54, Ertugrul Soeylemez e...@ertes.de wrote:
Well, *someone* has to worry about robustness and scalability. Users
notice when their two minute system builds start taking four
On 18 April 2011 17:48, Mike Meyer m...@mired.org wrote:
On Mon, 18 Apr 2011 17:07:53 +0100
Colin Adams colinpaulad...@googlemail.com wrote:
On 18 April 2011 16:54, Ertugrul Soeylemez e...@ertes.de wrote:
Well, *someone* has to worry about robustness and scalability. Users
Mike Meyer m...@mired.org wrote:
[...]
In case you don't have a subscription in haskell-cafe, I have replied
there, because this discussion does not belong to the general Haskell
list.
Greets,
Ertugrul
--
nightmare = unsafePerformIO (getWrongWife = sex)
http://ertes.de/
The Show instances for RealFloat types provided in base are very elegant,
as they produce the shortest string which 'read' converts back to the
original number. That, however, involves a check after each digit has been
determined and arithmetic of usually fairly large Integers, which makes
these
On Sun, Apr 17, 2011 at 01:44:50PM -0700, Don Stewart wrote:
`forkIO` is based on epoll. So threadWaitFD and friends are using epoll.
Or (on non-Linux systems) on kqueue or poll, as i learned from
grep(1) and the folowups here. (And sorry for the noise; I really
didn't expect such a flamebait)
Just tripped over this:
Adjoint Folds and Unfolds
Or: Scything through the Thicket of Morphisms
Folds and unfolds are at the heart of the algebra of programming. They
allow the cognoscenti to derive and manipulate programs rigorously...
Ralf Hinze
Lecture Notes in Computer Science, 2010, Volume
Ok, I can give you permissions on the wiki. What is your username on the
haskell-prime wiki?
Great! My haskell-prime username is roelvandijk.
___
Haskell-prime mailing list
Haskell-prime@haskell.org
On Mon, Apr 18, 2011 at 12:48 AM, Jason Dusek jason.du...@gmail.com wrote:
I gather I need to write the busy loop for polling for data in
Haskell. Although libpq has a procedure -- PGgetResult -- that
polls for data, it would not respond to killThread.
Please don't use a busy loop! Instead
[Moving to haskell-cafe, not really library specific any more]
Hi,
Am Sonntag, den 17.04.2011, 12:39 -0700 schrieb Jason Dagit:
In this specific case, I'll do what I can to clean things up but your
request makes me pause and think that the debian packaging for cabal
packages is not
Joachim Breitner schrieb:
Am Sonntag, den 17.04.2011, 12:39 -0700 schrieb Jason Dagit:
In this specific case, I'll do what I can to clean things up but your
request makes me pause and think that the debian packaging for cabal
packages is not automated enough. As haskell developers it
Hi,
Am Montag, den 18.04.2011, 09:39 +0200 schrieb Henning Thielemann:
Joachim Breitner schrieb:
Am Sonntag, den 17.04.2011, 12:39 -0700 schrieb Jason Dagit:
In this specific case, I'll do what I can to clean things up but your
request makes me pause and think that the debian
By my little experience with GHC 7.* it seems that this version is
more deterministic when deriving instances. For example
if there is a general instance declaration such is:
instance C1 x= C2 x where
then the absence of the C1 instance becomes an error. C1 instance
becomes a
On Mon, Apr 18, 2011 at 4:30 AM, Joachim Breitner
m...@joachim-breitner.de wrote:
Also, the policies that make life a bit more harder for us are also the
policies that make Debian a good distribution: E.g. manually creating a
copyright file describing who all has copyright on the files, and
Hi,
Am Montag, den 18.04.2011, 07:06 -0300 schrieb Felipe Almeida Lessa:
On Mon, Apr 18, 2011 at 4:30 AM, Joachim Breitner
m...@joachim-breitner.de wrote:
Also, the policies that make life a bit more harder for us are also the
policies that make Debian a good distribution: E.g. manually
Again we will teach an Applied Functional Programming Summer in Haskell
school this year at Utrecht University. In the previous two occasions students
were all very happy with the school and we plan to repeat this success this
year.
The intended audience are prospective master students who
Redirecting to haskell-cafe@, where this kind of long discussion belongs.
On Mon, Apr 18, 2011 at 9:07 AM, Colin Adams
colinpaulad...@googlemail.com wrote:
On 18 April 2011 16:54, Ertugrul Soeylemez e...@ertes.de wrote:
Well, *someone* has to worry about robustness and scalability. Users
Just tripped over this:
Adjoint Folds and Unfolds
Or: Scything through the Thicket of Morphisms
Folds and unfolds are at the heart of the algebra of programming. They
allow the cognoscenti to derive and manipulate programs rigorously...
Ralf Hinze
Lecture Notes in Computer Science, 2010, Volume
Just tripped over this:
Adjoint Folds and Unfolds
Or: Scything through the Thicket of Morphisms
Folds and unfolds are at the heart of the algebra of programming. They
allow the cognoscenti to derive and manipulate programs rigorously...
Ralf Hinze
Lecture Notes in Computer Science, 2010, Volume
Don Stewart don...@gmail.com wrote:
Redirecting to haskell-cafe@, where this kind of long discussion belongs.
Answering to Mike Meyer here, because it has been requested multiple
times that we move the discussion to the cafe.
What you described about Eiffel didn't sound very different from
Greetings,
I'm writing a small webcrawler. Usually I used tagsoup for such tasks
but this time I decided to give hxt a try.
Unfortunately, I ran into the troubles with character encodings. The
site I'm targeting uses cp1251, which is the one of the most popular
among sites in Russian. Pages
The Show instances for RealFloat types provided in base are very elegant,
as they produce the shortest string which 'read' converts back to the
original number. That, however, involves a check after each digit has been
determined and arithmetic of usually fairly large Integers, which makes
these
Since the document claims it is HTML, you should be parsing it with an HTML
parser. Try hxt-tagsoup -- specifically, the parseHtmlTagSoup arrow.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Errata for Pearls of Functional Algorithm Design by Richard Bird,
2010, page 25 #Haskell
smallest :: (Ord a) = Int - (Array Int a, Array Int a) - a
smallest k (xa,ya) = search k (0,m+1) (0,n+1)
where
(0,m) = bounds xa
(0,n) =
Well, this is not so general. It seems to be associated to
the inferred contexts in automatically derived instances (generated with the
deriving keyword). I will write a clear example as soon as I make sure
what is different between GHC 6 and 7 about this.
2011/4/18 Alberto G. Corona
Hello libraries and cafe,
We (Hirai and I) would like to tell you our paper relating to
Data.Set and Data.Map. Balancing Weight-Balanced Trees is now
accepted and will appear in Journal of Functional Programming.
The camera-ready version of the paper is available from:
64 matches
Mail list logo
