Hello Andrew,
Thursday, July 12, 2007, 10:15:00 PM, you wrote:
While BOMs (Byte Order Mark) are pretty irrelevant to byte-oriented
encodings like UTF-8, I think programs that fail on their presence can
be considered buggy.
Yay! Haskell's text I/O system is buggy. :-P
definitely. for
Am Donnerstag, 12. Juli 2007 20:14 schrieb Andrew Coppin:
The only thing the libraries provide, as far as I can tell, is the fact
that tuples are all Functors. (In other words, you can apply some
function to all the elements to get a new tuple.) I think that's about
it. I doubt you can use
Henning Thielemann [EMAIL PROTECTED] writes:
On Thu, 12 Jul 2007, Jon Fairbairn wrote:
(ie limited precision, but unbounded magnitude). If we were
to use BigFloat the base would need to be a power of ten to
get the desired results for things like Don's example)
People will be confused,
| I think the implementation is some 90% complete though, in GHC head.
| Certainly you can write many associated types programs already -- the
| missing part is finishing off associated type synonyms, iirc.
...and we have a working implementation of that too, thanks to Tom Schrijvers.
It's not
On Thu, 2007-07-12 at 19:15 +0100, Andrew Coppin wrote:
While BOMs (Byte Order Mark) are pretty irrelevant to byte-oriented
encodings like UTF-8, I think programs that fail on their presence can
be considered buggy.
Yay! Haskell's text I/O system is buggy. :-P
Works for me, but feel free
Jim Burton wrote:
Very timely! It's sad that haskell-cafe has so much noise now.
I disagree with that characterisation. I don't mean to be pedantic, but
I don't think haskell-cafe has lots of noise. I think it has lots of
signal! Quite different.
We don't have a problem (in my perception,
Simon Peyton-Jones wrote:
[...]
We need at least one forum in which it's acceptable to ask anything, no
matter how naive, and get polite replies. (RTFM isn't polite; but The
answer is supposed to be documented here (\url); let us know if that
doesn't answer your qn is fine.) I'd be
On Thu, Jul 12, 2007 at 10:11:07PM +0100, Andrew Coppin wrote:
Felipe Almeida Lessa wrote:
On 7/12/07, Andrew Coppin [EMAIL PROTECTED] wrote:
How come the set of all sets doesn't exist?
http://www.google.com/search?q=set+of+all+sets
leads to http://en.wikipedia.org/wiki/Set_of_all_sets which
On 7/12/07, Andrew Coppin [EMAIL PROTECTED] wrote:
Monads take a while to get used to, but they're not so scary after that...
The problem with monads is that there is a gazillion tutorials to
explain them, each with their own analogy that works well for the
author but not necessarily for you.
Hi Darrell,
On Mon, Jul 09, 2007 at 05:48:47PM -0700, Lewis-Sandy, Darrell wrote:
I am having trouble exporting multiple instances of a polymorphic function
similar to the example in the Haskell 98 Foreign Function Interface 1.0
addendum (page 6). My specific code is below:
Thanks for the
I'm beginning to see that my old implementation in C++ clutters my Haskell
design.
You see, in C++ I can write:
// A vector is an array of fixed-length N and elements of type T
templatetypename T, int N struct Vector
{
T Element[N];
friend T dot(const Vector a, const Vector b)
{
T
As we sit here riding the Haskell wave:
http://www.cse.unsw.edu.au/~dons/tmp/cafe.png
with nearly 2000 (!) people reading haskell-cafe@, perhaps its time to
think some more about how to build and maintain this lovely Haskell
community we have.
my replies to some of the issues raised in
On Fri, 13 Jul 2007, Dave Bayer wrote:
As a newcomer I was stunned that this otherwise very sophisticated
community was using an email list rather than a bulletin board. The
shear torrent of email was impacting my mail program performance.
This is a cultural thing, and assuming that it's
On Fri, 13 Jul 2007, Simon Peyton-Jones wrote:
We need at least one forum in which it's acceptable to ask anything, no
matter how naive, and get polite replies. (RTFM isn't polite; but The
answer is supposed to be documented here (\url); let us know if that
doesn't answer your qn is
Hi,
We are pleased to announce AngloHaskell 2007
http://www.haskell.org/haskellwiki/AngloHaskell
Dates: 10th-11th of August (Friday-Saturday)
Location: Cambridge, with talks at Microsoft Research on Friday
All the details are on the wiki page, along with free registration.
Everyone is
claus.reinke:
personally, i tend to be more willing to answer questions
on the list than to fiddle with wiki markup and conventions,
but there is no reason why people who are happier with
wiki editing cannot extract content from list answers to the
wiki,
On Friday 13 July 2007, peterv wrote:
I'm beginning to see that my old implementation in C++ clutters my Haskell
design.
You see, in C++ I can write:
// A vector is an array of fixed-length N and elements of type T
templatetypename T, int N struct Vector
{
T Element[N];
friend T
G'day.
Quoting Bulat Ziganshin [EMAIL PROTECTED]:
sorry, but you really misunderstand how PPM works and why it's so
efficient.
I understand PPM. I really do.
I think what you don't understand is why LZW does as well as it does
considering how simple it is. It's because it's a poor but
Claus Reinke claus.reinke at talk21.com writes:
will ultimately make its contents easier to find. but if you
want to avoid answering questions again and again on the
list, you need to improve the cache of answers.
Bingo. On less technical forums, e.g. FlyerTalk, the do a search equivalent to
On Friday 13 July 2007, Jon Fairbairn wrote:
Henning Thielemann [EMAIL PROTECTED] writes:
On Thu, 12 Jul 2007, Jon Fairbairn wrote:
(ie limited precision, but unbounded magnitude). If we were
to use BigFloat the base would need to be a power of ten to
get the desired results for things
Hi
I tried an experiment this week of just taking someone's post (Conor's idiom
brackets), and putting directly on the wiki first, then letting the
author know that's happened.
How do people feel about allowing posts in -cafe to be placed on the
wiki, without extensive prior negotiation? What
On Fri, 13 Jul 2007, Donald Bruce Stewart wrote:
How do people feel about allowing posts in -cafe to be placed on the
wiki, without extensive prior negotiation? What copyright do -cafe@
posts have?
Currently, snagging the whole post for non-archive purposes isn't
necessarily legit.
If
* Malcolm Wallace wrote:
If anything, Usenet is even worse than mailing lists for volume,
especially of spam. Also, very few sites maintain their nntp servers
adequately these days - e.g. comp.lang.haskell has never made it to
where I work.
I beg to differ. Of course, I'm an Usenet admin
On Jul 12, 2007, at 19:59 , Andrew Coppin wrote:
Hugh Perkins wrote:
...
Thanks for trying - but that doesn't actually work. (For starters,
you need to prepend the HTTP status code to the data from the CGI
script...)
Actually, as it turns out, the script I want to test needs to
On Jul 12, 2007, at 23:35 , Edward Ing wrote:
Hi,
I am trying to make HaskellDB work with HDBC-ODBC.
I did builds of HDBC/HDBC-ODBC. But when I am building
HaskellDB-HDBC-ODBC, I get the following message.
--
[1 of 1] Compiling Database.HaskellDB.HDBC.ODBC (
| Very timely! It's sad that haskell-cafe has so much noise now.
|
| I disagree with that characterisation. I don't mean to be pedantic, but
| I don't think haskell-cafe has lots of noise. I think it has lots of
| signal! Quite different.
|
| We don't have a problem (in my perception, at least)
Jules Bean wrote:
Jim Burton wrote:
Very timely! It's sad that haskell-cafe has so much noise now.
I disagree with that characterisation. I don't mean to be pedantic, but
I don't think haskell-cafe has lots of noise. I think it has lots of
signal! Quite different.
I think you're
| I think the implementation is some 90% complete though, in GHC head.
| Certainly you can write many associated types programs already -- the
| missing part is finishing off associated type synonyms, iirc.
...and we have a working implementation of that too, thanks to Tom
Schrijvers. It's
Malcolm Wallace wrote:
Yes, the sheer volume of posts is definitely becoming a problem (for me,
at least). All your suggestions for keeping the community polite and
helpful are good. But I wonder if there are also any useful technical
tips for users like myself, who would like to be able to
Malcolm Wallace Malcolm.Wallace at cs.york.ac.uk writes:
Yes, the sheer volume of posts is definitely becoming a problem (for me,
at least).
As a newcomer I was stunned that this otherwise very sophisticated community was
using an email list rather than a bulletin board. The shear torrent of
Besides traffic, which is something I'm quite used to (try to read the
Python mailing list), I think dons made a quite good point.
On 7/12/07, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
That is, to help people progress from newbie, to intermediate, to
expert, and thus ensure the culture is
On 13/07/07, Jim Burton [EMAIL PROTECTED] wrote:
As well as being nice, can't you sometimes tell people to RTFM? Or,
You've asked that before, or That's an FAQ, search the archive?
I suppose you could, but speaking as someone who doesn't know much but
tries to answer questions when he does
Hello Simon,
Friday, July 13, 2007, 11:37:59 AM, you wrote:
| I think the implementation is some 90% complete though, in GHC head.
| Certainly you can write many associated types programs already -- the
| missing part is finishing off associated type synonyms, iirc.
...and we have a working
Donald Bruce Stewart wrote:
As we sit here riding the Haskell wave:
[...]
* Give tips on how to answer questions
Answering politely, and in detail, explaining common
misunderstandings
is better than one word replies.
* Adopt a near-zero-tolerance Be Nice
On Thursday 12 July 2007 22:57, Steve Downey wrote:
Almost, I think. A functor is a mapping from the arrows, or morphisms,
in a category to arrows in a category.
Oops, yes, indeed. Good catch, thanks. :-)
Alexis.
___
Haskell-Cafe mailing list
On Fri, Jul 13, 2007 at 09:35:09AM +0100, Malcolm Wallace wrote:
Yes, the sheer volume of posts is definitely becoming a problem (for me,
at least).
The Haskell lists are quite peculiarly named; the haskell@ list is
pretty much what would be haskell-announce@ anywhere else, and
haskell-cafe@
* Magnus Therning wrote:
One obvious solution is to split the list into several, more specialised
lists. It's far from obvious, at least to me, how to do that with this
list though.
Switch to Usenet. The new haskell group will die, if the traffic will not
increase.
On Fri, Jul 13, 2007 at 09:35:09 +0100, Malcolm Wallace wrote:
[EMAIL PROTECTED] (Donald Bruce Stewart) writes:
As we sit here riding the Haskell wave:
http://www.cse.unsw.edu.au/~dons/tmp/cafe.png
with nearly 2000 (!) people reading haskell-cafe@, perhaps its time to
think some more
[EMAIL PROTECTED] (Donald Bruce Stewart) writes:
As we sit here riding the Haskell wave:
http://www.cse.unsw.edu.au/~dons/tmp/cafe.png
with nearly 2000 (!) people reading haskell-cafe@, perhaps its time to
think some more about how to build and maintain this lovely Haskell
community
Hello ajb,
Friday, July 13, 2007, 12:10:54 PM, you wrote:
it seems that you either misunderstood PPM or make too wide
assumptions.
More likely I'm not explaining myself well.
in classical fixed-order ppm each char probability
found in context of previous N chars. i.e. when encoding
Simon Peyton-Jones wrote:
| I think the implementation is some 90% complete though, in GHC head.
| Certainly you can write many associated types programs already -- the
| missing part is finishing off associated type synonyms, iirc.
...and we have a working implementation of that too, thanks to
bulat.ziganshin:
Hello Simon,
Friday, July 13, 2007, 11:37:59 AM, you wrote:
| I think the implementation is some 90% complete though, in GHC head.
| Certainly you can write many associated types programs already -- the
| missing part is finishing off associated type synonyms, iirc.
Lutz Donnerhacke [EMAIL PROTECTED] wrote:
Switch to Usenet. The new haskell group will die, if the traffic will
not increase.
If anything, Usenet is even worse than mailing lists for volume,
especially of spam. Also, very few sites maintain their nntp servers
adequately these days - e.g.
with guaranteed termination, of course
Just out of curiosity (not Haskell related): I always get confused when
people speak about guaranteed termination; what about the halting problem?
In which context can one check for guaranteed termination, as the halting
problem says it's not *generally*
Dave Bayer wrote:
Malcolm Wallace Malcolm.Wallace at cs.york.ac.uk writes:
Yes, the sheer volume of posts is definitely becoming a problem (for me,
at least).
As a newcomer I was stunned that this otherwise very sophisticated community was
using an email list rather than a bulletin board. The
Hello,
On Friday 13 July 2007 16:45, Ian Lynagh wrote:
...
* At any point, create [EMAIL PROTECTED]
This would have the advantage that people might not be so intimidated
at making their first post here, and posts wouldn't be answered with
category theory or scary type extensions.
peterv [EMAIL PROTECTED] wrote in article [EMAIL PROTECTED] in
gmane.comp.lang.haskell.cafe:
I don't think Haskell has something like a fixed-length array or constant
expressions that *must* be resolved at compile-time (like the N in the C++
template)? Or like Digital Mars D's static if
On Friday 13 July 2007, Donald Bruce Stewart wrote:
claus.reinke:
personally, i tend to be more willing to answer questions
on the list than to fiddle with wiki markup and conventions,
but there is no reason why people who are happier with
wiki editing cannot
I actually meant that simply as beyond opengl bindings, but added
'better' to make reference to Hugh's suggestion. The website sure could
be better though ;)
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Claus Reinke
Sent: Thursday, July 12, 2007 7:23
Super. This is really a great mailing list :)
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Chung-chieh Shan
Sent: Friday, July 13, 2007 16:54
To: haskell-cafe@haskell.org
Subject: [Haskell-cafe] Re: Newbie question about tuples
peterv [EMAIL
peterv wrote:
with guaranteed termination, of course
Just out of curiosity (not Haskell related): I always get confused when
people speak about guaranteed termination; what about the halting problem?
In which context can one check for guaranteed termination, as the halting
problem says it's
Hello,
On Friday 13 July 2007 17:08, Neil Mitchell wrote:
Hi
* At any point, create [EMAIL PROTECTED]
This would have the advantage that people might not be so intimidated
at making their first post here, and posts wouldn't be answered with
category theory or scary type
Hi
* At any point, create [EMAIL PROTECTED]
This would have the advantage that people might not be so intimidated
at making their first post here, and posts wouldn't be answered with
category theory or scary type extensions.
The disadvantages are that it makes an artificial barrier
On Fri, Jul 13, 2007 at 02:30:49AM -0700, Jim Burton wrote:
Very timely! It's sad that haskell-cafe has so much noise now. I haven't
been around very long at all but it has gone downhill dramatically even in
the last 6 months
just look for the date of my first post...
to improve the list,
Hi Don
On 13 Jul 2007, at 14:47, Donald Bruce Stewart wrote:
I tried an experiment this week of just taking someone's post
(Conor's idiom
brackets), and putting directly on the wiki first, then letting the
author know that's happened.
Seemed entirely reasonable to me. If I have a spare
On Fri, 13 Jul 2007, brad clawsie wrote:
to improve the list, might i suggest
- push chatter to IRC
This is problematic for some kinds of techie chatter, where email makes it
easier to get all the maths down.
- take this service off of email entirely. try a web forum system (you
may
Perhaps an information retrieval pipedream, but what if we attempted
an automated FAQ answerer? I'm sure some keywords pop-up often enough
in certain chunks of first posts (heterogenous lists, existential
error messages, SOE and graphics, category functor monad, etc). It
could respond with the
FYI, Gmail *can* kill threads, the Geniuses just deemed it unworthy of
a UI presence. This is news to me and related to earlier comments in
this thread. HTH
http://mail.google.com/support/bin/answer.py?hl=enanswer=47787
On 7/13/07, Nicolas Frisby [EMAIL PROTECTED] wrote:
Perhaps an information
This solved the particular problem as you suggested, but I ran into
other problems and stuck at another one.
So I have another question.
When I am using DBDirect from haskelldb to connect through HDBC-odbc.
I get the following error message (I got pass the compile problems)
DBDirect.exe: user
Gregory Propf gregorypropf at yahoo.com writes:
So what the hell is the difference between them? Int and Integer.
They aren't synonyms clearly. What's going on?
http://www.haskell.org/haskellwiki/Learn_Haskell_in_10_minutes
is a good starting point for answering this and similar
This is the best intro to category theory I have ever heard. I finally
understand. Thank you.
Dan Piponi wrote:
I thought I'd dive in with a comment to explain why category theory is
an important subject and why it often crops up in Haskell programming.
The key thing is this: in many branches
I am building and running some haskelldb/HDBC/HSQL libraries on
Windows XP (using the MinGW minimals system (MSYS)) with GHC
environment.
I ran into runtime link problems, foreign functions would not found.
eg. atoi,from C standard; recv from sockets.
To solve the problem, I added dll's to the
Ian Lynagh [EMAIL PROTECTED] wrote:
I think the number of posts in the wrong place would be
lower if these were more conventionally named (although there aren't a
lot of them anyway).
There are very few inappropriate posts to the haskell@ list.
I very much doubt that the list names are a
Hi Haskell,
Sorry to contribute to the noise but given that we've been talking about
categories lately, I was wondering if anyone had any opinions on good
universities for studying category theory. I'm trying to figure out where
to apply for my phd. I want to either be at a place with a strong
On Fri, Jul 13, 2007 at 10:26:38AM +0200, Ketil Malde wrote:
On Thu, 2007-07-12 at 19:15 +0100, Andrew Coppin wrote:
While BOMs (Byte Order Mark) are pretty irrelevant to byte-oriented
encodings like UTF-8, I think programs that fail on their presence can
be considered buggy.
Yay!
Donald Bruce Stewart wrote:
As we sit here riding the Haskell wave:
http://www.cse.unsw.edu.au/~dons/tmp/cafe.png
with nearly 2000 (!) people reading haskell-cafe@, perhaps its time to
think some more about how to build and maintain this lovely Haskell
community we have. Just yesterday
Hello peterv,
Friday, July 13, 2007, 5:03:00 PM, you wrote:
think the latest compilers are much better). Now when implementing something
like this in Haskell, I would guess that its laziness would allow to
interleave many of the math operations, reordering them to be as optimal
as possible,
are you applying to computer science programs or math programs?
for category theory, you might look at where the Ken Shans of the world
went to grad school.
for diff geo, there are a host of great places. and I don't know exactly
what you mean by diff geo. You could be into gauge theory, in
On Fri, 2007-07-13 at 12:05 -0400, Edward Ing wrote:
I am building and running some haskelldb/HDBC/HSQL libraries on
Windows XP (using the MinGW minimals system (MSYS)) with GHC
environment.
I ran into runtime link problems, foreign functions would not found.
eg. atoi,from C standard; recv
Philippa Cowderoy wrote:
On Fri, 13 Jul 2007, Dave Bayer wrote:
As a newcomer I was stunned that this otherwise very sophisticated
community was using an email list rather than a bulletin board. The
shear torrent of email was impacting my mail program performance.
This is a cultural
On 2007-07-13, Stefan O'Rear [EMAIL PROTECTED] wrote:
He's not trying to report a bug; he's just complaining about base's
long-known lack of support for non-latin1 encodings. (IIUC)
Which is a bug. Base needs to support (in an /obvious/ way)
(1) direct I/O of octets (bytes), with no character
Donald Bruce Stewart wrote:
What copyright do -cafe@ posts have?
I'm not a lawyer but everything you write down is automatically
copyrighted in most countries assuming that it meets some low
requirement of skill, originality and work. Which is likely to be the
case for posts that are eligible to
On 2007-07-13, brad clawsie [EMAIL PROTECTED] wrote:
- take this service off of email entirely. try a web forum system (you
may have to slum it and use php). i don't recommend nntp, that just
forces us to use gmane since very few isps provide nntp now. a web
forum would allow you to
On Mon, Jul 09, 2007 at 09:41:32PM +0100, Claus Reinke wrote:
hiding concrete types in existentials sometimes only defers problems
instead of solving them, but exposing class interfaces instead of types is a
useful way to mitigate that effect. it just so happens that this particular
Yes but doesn't GHC have a good strictness analyzer (or how is this
called?)? I haven't looked at the generated assembly code yet (if this is at
all readable; but good C/C++ compilers *do* generate reasonably readable
assembly code)
-Original Message-
From: Bulat Ziganshin [mailto:[EMAIL
Yes, for a newbie like me it was actually the reason to abandon Haskell
initially; none of the examples at http://www.haskell.org/HOpenGL compiled!
Another very cool albeit difficult project would be automatic retargeting of
Haskell code to the graphics processor unit (GPU), or IBM Synergistic
[Ronald Guida, 07/11/07]
Suppose I have a function f that reads a lazy list, such that f
only consumes as much of the list as it needs to. Laziness allows me
to apply f to an infinite list without creating an infinite loop.
Now I want to connect the console to f, such that the list of
On Fri, Jul 13, 2007 at 12:11:58PM +1000, Donald Bruce Stewart wrote:
As we sit here riding the Haskell wave:
http://www.cse.unsw.edu.au/~dons/tmp/cafe.png
[..]
That is, to help people progress from newbie, to intermediate, to
expert, and thus ensure the culture is maintained (avoiding
Donald Bruce Stewart wrote:
By the way Andrew, have you noticed that you're generating 50% of the
traffic on this list? Perhaps we can work a bit more on improving the
signal/noise ratio. My inbox can only take so much of this... ;)
o_O
My God... even the Haskell mailing list is
Stefan O'Rear wrote:
The problem is that you're closing the file twice. When you call any
function of the getContents family, you assign to that function the
responsibility to close the file, no sooner than it is no longer needed.
Don't call hClose yourself, Bad Things will happen.
Care to
Bulat Ziganshin wrote:
Hello Andrew,
Yay! Haskell's text I/O system is buggy. :-P
definitely. for example, on windows it doesn't support unicode
filenames nor files bigger than 4gb
...OK, that's quite worrying...
so i use my own lib, a thin layer around Windows API
Has a bug
Lukas Mai wrote:
Am Donnerstag, 12. Juli 2007 20:14 schrieb Andrew Coppin:
The only thing the libraries provide, as far as I can tell, is the fact
that tuples are all Functors. (In other words, you can apply some
function to all the elements to get a new tuple.) I think that's about
it. I
Ketil Malde wrote:
On Thu, 2007-07-12 at 19:15 +0100, Andrew Coppin wrote:
While BOMs (Byte Order Mark) are pretty irrelevant to byte-oriented
encodings like UTF-8, I think programs that fail on their presence can
be considered buggy.
Yay! Haskell's text I/O system is buggy.
Dave Bayer wrote:
Malcolm Wallace Malcolm.Wallace at cs.york.ac.uk writes:
Yes, the sheer volume of posts is definitely becoming a problem (for me,
at least).
As a newcomer I was stunned that this otherwise very sophisticated community was
using an email list rather than a bulletin
On Fri, Jul 13, 2007 at 07:59:22PM +0100, Andrew Coppin wrote:
Stefan O'Rear wrote:
The problem is that you're closing the file twice. When you call any
function of the getContents family, you assign to that function the
responsibility to close the file, no sooner than it is no longer needed.
On Fri, Jul 13, 2007 at 08:05:36PM +0100, Andrew Coppin wrote:
Ketil Malde wrote:
On Thu, 2007-07-12 at 19:15 +0100, Andrew Coppin wrote:
While BOMs (Byte Order Mark) are pretty irrelevant to byte-oriented
encodings like UTF-8, I think programs that fail on their presence can
be
Jules Bean wrote:
I find it incredibly surprising whenever I discover than an otherwise
sophisticated community has adopted a bulletin board rather than email ;)
Erm... why?
Conversely, a bulletin board cannot be read offline, traps users into
a single UI (in every case I've used, slow,
Bjorn Bringert wrote:
On Jul 12, 2007, at 19:59 , Andrew Coppin wrote:
Basically, the more I look at this, the more I realise that it really
truely *is* going to be faster to just use a real web server. I
thought I could just implement a tiny subset of it to get a working
system, but it
D.V. wrote:
On 7/12/07, Andrew Coppin [EMAIL PROTECTED] wrote:
Monads take a while to get used to, but they're not so scary after
that...
The problem with monads is that there is a gazillion tutorials to
explain them, each with their own analogy that works well for the
author but not
Dave Bayer wrote:
Claus Reinke claus.reinke at talk21.com writes:
will ultimately make its contents easier to find. but if you
want to avoid answering questions again and again on the
list, you need to improve the cache of answers.
Bingo.
Here, the Wiki is fantastic but
On Fri, Jul 13, 2007 at 08:23:41PM +0100, Andrew Coppin wrote:
Dave Bayer wrote:
Here, the Wiki is fantastic but extraordinarily spotty (any healthy wiki
will
always have much new growth, but the current gaps are surprising), and
newcomers
like myself can and have been contributing to it.
The following recent reply from Dave Bayer is IMHO nearly optimal for
Maintaining the Community, and I applaud him for it:
Dave Bayer wrote:
[someone] writes:
So what the hell is the difference between them? Int and Integer.
They aren't synonyms clearly. What's going on?
Andrew Coppin wrote:
Dave Bayer wrote:
Malcolm Wallace Malcolm.Wallace at cs.york.ac.uk writes:
Yes, the sheer volume of posts is definitely becoming a problem (for me,
at least).
As a newcomer I was stunned that this otherwise very sophisticated
community was
using an email list
Stefan O'Rear wrote:
On Fri, Jul 13, 2007 at 07:59:22PM +0100, Andrew Coppin wrote:
Care to elaborate on bad things? (I.e., will this just crash the program
with an error, or will it do something more serious?) I must admit, I
thought closing such a file was simply no-op.
If you
On 7/13/07, Ronald Guida [EMAIL PROTECTED] wrote:
[Ronald Guida, 07/11/07]
Now I want to connect the console to f, such that the list of inputs
to f comes from the console, one item at a time.
How do I do this?
[Stefan O'Rear]
Not very nicely.
Apparently, the solution gets ugly.
If we
Stefan O'Rear wrote:
On Fri, Jul 13, 2007 at 08:05:36PM +0100, Andrew Coppin wrote:
I was actually commenting on the other guy's remark that anything that
chokes on a BOM can be considered buggy - not entirely seriously. ;-)
If there is a bug to be reported, it is merely that [the GHC
Stefan O'Rear wrote:
On Fri, Jul 13, 2007 at 08:23:41PM +0100, Andrew Coppin wrote:
Whenever I find that something isn't on the Wiki, I try to add it. (E.g.,
the articles on alpha/beta/eta reduction.)
On the other hand, when I find something isn't there, it's usually because
I'm trying to
Derek Elkins wrote:
On Wed, 2007-07-11 at 17:10 -0700, Jeremy Shaw wrote:
At Thu, 12 Jul 2007 09:18:14 +1000,
Thomas Conway wrote:
On 7/12/07, Andrew Coppin [EMAIL PROTECTED] wrote:
It's fairly common to use the Either type for this. By convention,
Right means correct, and by elimination Left
Bryan O'Sullivan wrote:
Andrew Coppin wrote:
Oh well, the problem is easily fixed... *sigh*
I doubt that anybody minds having you talk about Haskell. You've been
responsible for spawning a lot of interesting threads.
[And that one about compression that's still going on somewhere...
brad clawsie wrote:
to improve the list, might i suggest
- push chatter to IRC
- take this service off of email entirely. try a web forum system (you
may have to slum it and use php). i don't recommend nntp, that just
forces us to use gmane since very few isps provide nntp now.
Just
1 - 100 of 155 matches
Mail list logo
