On Sun, 27 Jan 2008, Tim Chevalier wrote:
On 1/27/08, Dipankar Ray [EMAIL PROTECTED] wrote:
3) most of the canonical US universities for CS (MIT, Berkeley, Stanford,
CMU, etc) basically don't teach haskell or ML, or even talk much about it,
relative to how much they talk about, say,
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Don Stewart
So you visit:
community.haskell.org
And submit your ssh public key, to allow you to log into
code.haskell.org
At the same time you can ask for a project account, which
will give you
space for a
Any suggestions on how to implement case-insensitive lexing with Alex?
Thanks, Joel
--
http://wagerlabs.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Rene de Visser wrote:
Matthew Pocock [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
On Thursday 24 January 2008, Albert Y. C. Lai wrote:
Matthew Pocock wrote:
I've been using hxt to process xml files. Now that my files are getting
a
bit bigger (30m) I'm finding
On Mon, 21 Jan 2008, Simon Peyton-Jones wrote:
| Recently I found that specialisation interacts in an unexpected way with
| explicit RULES (and with inlining). I used a function multiple times and
| this seemed to make GHC specialising this function (although I did not
| used a SPECIALISE
On Jan 28, 2008, at 2:44 PM, Geoffrey Mainland wrote:
map toLower onto your input before you pass it to your lexer? Or do
you
only want keywords to be case-insensitive?
Just keywords. You can have Array or array or aRrAy.
--
http://wagerlabs.com
Hi Istarex,
Does Haskell have a maximum stack depth restriction like Java
Python, or is it only limited by the maximum stack available on the
system (i.e. what would be available to a C program)?
You are probably thinking that recursive functions use up program
stack, and hence the stack
On Jan 27, 2008, at 11:05 PM, Dipankar Ray wrote:
thanks for the correction - very informative! that'll teach me to
just go to the opencourseware site at MIT only...
On that note, I'll point out that many (roughly half?) the
undergraduate CS majors at MIT do a 5 year combined bachelor's
Joel Reymont wrote:
On Jan 28, 2008, at 2:44 PM, Geoffrey Mainland wrote:
map toLower onto your input before you pass it to your lexer? Or do you
only want keywords to be case-insensitive?
Just keywords. You can have Array or array or aRrAy.
One old trick for reducing the size of
Hi all,
Does Haskell have a maximum stack depth restriction like Java
Python, or is it only limited by the maximum stack available on the
system (i.e. what would be available to a C program)?
Thanks,
Istarex
___
Haskell-Cafe mailing list
Hi
ghc uses a pretty conventional stack AFAIK, and it is arbitrarily
limited, but you can change the limit with +RTS options.
GHC uses a conventional stack (in that you put stuff at the top, and
take it off from the top), but it is not a conventional stack in the
way imperative programs work.
Neil Mitchell wrote:
Hi Istarex,
Does Haskell have a maximum stack depth restriction like Java
Python, or is it only limited by the maximum stack available on the
system (i.e. what would be available to a C program)?
You are probably thinking that recursive functions use up program
stack,
Uwe Schmidt [EMAIL PROTECTED] schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
this statement isn't true in general. HXT itself can be incremental, if
there
is no need for traversing the whole XML tree. When processing a document
containing a DTD, indeed there is a need even when no validation
jamie.love:
Hi there,
Not sure where to raise bugs in hackage libraries, so I'm posting here.
If there is a better place, please let me know.
The following code crashes with a divide by zero error when using the
package 'binary-0.4.'
Oh, hehe. \x - x `mod` 256 doesn't work if x ::
Hi there,
Not sure where to raise bugs in hackage libraries, so I'm posting here.
If there is a better place, please let me know.
The following code crashes with a divide by zero error when using the
package 'binary-0.4.'
module Main where
import IO
import Data.Binary
import
Hello,
I am trying to build Haskell packages on RedHat RHEL 5. How do I tell
ghc where the .a (Linux archives) are? Is there an enviroment variable?
Regards, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Jan 28, 2008 1:07 PM, Neil Mitchell [EMAIL PROTECTED] wrote:
To answer the question if Haskell has a stack depth restriction ...
like Java the answer is no. It has a stack depth restriction, but its
absolutely nothing like Java in the way it uses the stack, so you
can't compare them.
Fair
On 27 Jan 2008, at 11:18 PM, L.Guo wrote:
Hi,
How do you organize code ?
Here is a sample.
Acturally, I am thinking about using this plan.
Any suggestions ?
-- BasicalType.hs
type Position = (Int,Int)
data Box = Box { pos :: Position }
data Chain = Chain { pos :: [Position] }
--
On Monday 28 January 2008, Rene de Visser wrote:
It would be nice if HXT was incremental even when you are processing the
whole tree.
If I remember correctly, the data type of the tree in HXT is something like
data Tree = Tree NodeData [Tree]
which means that already processed parts of the
jamie.love:
Hi there,
Not sure where to raise bugs in hackage libraries, so I'm posting here.
If there is a better place, please let me know.
The following code crashes with a divide by zero error when using the
package 'binary-0.4.'
Can you repeat this with binary 0.4.1 please?
(And
On Jan 28, 2008, at 17:33 , Jamie Love wrote:
Shouldn't haskell pick up that there is no 'mod' for Word8? I
mean, shouldn't I get a nicer error message?
Hm? mod works fine for Word8, unless you specify a multiple of the
type's bound. I think it's still hard for compilers to catch that
jamie.love:
Ah, of course.
Thanks. I removed the hPut and it runs smoothly. I had forgotten that
haskell chooses the types dynamically.
Shouldn't haskell pick up that there is no 'mod' for Word8? I mean,
shouldn't I get a nicer error message?
Well, it inferred Word8 for
Oh, I see
I wasn't thinking through the code (and I'm still in the honeymoon phase
with Haskell, thinking it can do no wrong).
Don Stewart wrote:
jamie.love:
Ah, of course.
Thanks. I removed the hPut and it runs smoothly. I had forgotten that
haskell chooses the types
Ah, of course.
Thanks. I removed the hPut and it runs smoothly. I had forgotten that
haskell chooses the types dynamically.
Shouldn't haskell pick up that there is no 'mod' for Word8? I mean,
shouldn't I get a nicer error message?
Don Stewart wrote:
jamie.love:
Hi there,
Not sure
Just to clarify, I know it was my mistake, and so I'm not blaming
Haskell or Ghc. The first few times you realise the compiler isn't a
magic wand that stops you being silly are the hardest.
Jamie Love wrote:
Oh, I see
I wasn't thinking through the code (and I'm still in the honeymoon
I should point out that this is on GHC 6.8.2 compiled from source on a
Mac powerpc.
Jamie Love wrote:
Hi there,
Not sure where to raise bugs in hackage libraries, so I'm posting
here. If there is a better place, please let me know.
The following code crashes with a divide by zero error
Hi
Not so sure about this. For streaming processing, it would be nicer to have
something like StAX with a stack of already entered elements kept about as
book-keeping |(the tags + attribute sets to root). Let's face it, if you sign
up to a document model, you are signing up to a document and
nbsp;
---
价格服务都要！中小企业如何选商用电脑(
http://d1.sina.com.cn/sina/limeng3/mail_zhuiyu/2008/mail_zhuiyu_20080128.html )
===
Haskell, stress on the first syllable; the first syllable is like
the word has and the second syllable is pronounced with a schwa
where the e is written.
Sometimes you will hear people stress the second syllable, but that is
not Preferred.
Cheers,
Tim
--
Tim Chevalier * http://cs.pdx.edu/~tjc
On 29/01/2008, Tim Chevalier [EMAIL PROTECTED] wrote:
Haskell, stress on the first syllable; the first syllable is like
the word has and the second syllable is pronounced with a schwa
where the e is written.
Sometimes you will hear people stress the second syllable, but that is
not
On 1/28/08, Jeremy Apthorp [EMAIL PROTECTED] wrote:
On 29/01/2008, Tim Chevalier [EMAIL PROTECTED] wrote:
Haskell, stress on the first syllable; the first syllable is like
the word has and the second syllable is pronounced with a schwa
where the e is written.
Sometimes you will hear
On Mon, 2008-01-28 at 10:57 +, Bayley, Alistair wrote:
I'm wondering what the relationship is (if any) between code.haskell.org
and darcs.haskell.org.
darcs.haskell.org hosts ghc, the core libs and many others. The server
is maintained by Galois. Because it hosts the most central bits of
On 29/01/2008, Tim Chevalier [EMAIL PROTECTED] wrote:
On 1/28/08, Jeremy Apthorp [EMAIL PROTECTED] wrote:
On 29/01/2008, Tim Chevalier [EMAIL PROTECTED] wrote:
Haskell, stress on the first syllable; the first syllable is like
the word has and the second syllable is pronounced with a schwa
On Mon, 2008-01-28 at 14:39 -0500, istarex wrote:
On Jan 28, 2008 1:07 PM, Neil Mitchell [EMAIL PROTECTED] wrote:
To answer the question if Haskell has a stack depth restriction ...
like Java the answer is no. It has a stack depth restriction, but its
absolutely nothing like Java in the
On 1/28/08, Jeremy Shaw [EMAIL PROTECTED] wrote:
Hello,
If my sources are to be believed, the following clip contains Simon
Peyton Jones saying 'Haskell' several times.
http://www.n-heptane.com/nhlab/spj-haskell.wav
I have listened to Simon (and other equally sage folks) say Haskell
on a
Tim Chevalier writes:
Haskell, stress on the first syllable; the first syllable is like
the word has and the second syllable is pronounced with a schwa
where the e is written.
Sometimes you will hear people stress the second syllable, but that is
not Preferred.
==
Well, unless you are
On 1/28/08, [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
Well, unless you are French. Then you don't pronounce H. The remaining
letters are pronounced according to the Règlements de l'Académie.
Fair enough. I wouldn't want to be culturally insensitive, and should
have said that my statement was
Hello,
If my sources are to be believed, the following clip contains Simon
Peyton Jones saying 'Haskell' several times.
http://www.n-heptane.com/nhlab/spj-haskell.wav
j.
At Tue, 29 Jan 2008 08:28:44 +0800 ,
[EMAIL PROTECTED] wrote:
[1 multipart/alternative (7bit)]
[1.1 text/plain; gbk
On 1/28/08, Tim Chevalier [EMAIL PROTECTED] wrote:
On 1/28/08, Jeremy Shaw [EMAIL PROTECTED] wrote:
Hello,
If my sources are to be believed, the following clip contains Simon
Peyton Jones saying 'Haskell' several times.
http://www.n-heptane.com/nhlab/spj-haskell.wav
I have
At Mon, 28 Jan 2008 17:06:58 -0800,
Tim Chevalier wrote:
I should really read more carefully -- I see now that you weren't
trying to disagree with me by posting that clip, but the person who
*did* disagree with me was also named Jeremy. How confusing.
tehehe.
For the record, I believe I
On 1/28/08, Dan Weston [EMAIL PROTECTED] wrote:
Jeremy Shaw wrote:
I would say the best description of how I pronounce it (which may or
may not be right): is like 'rascal' but with an h. Though, perhaps
different people pronounce rascal differently than I do.
I think to ease the
Jeremy Shaw wrote:
I would say the best description of how I pronounce it (which may or
may not be right): is like 'rascal' but with an h. Though, perhaps
different people pronounce rascal differently than I do.
I think to ease the acceptance of Haskell in the broader world we should
spell it
Hi Stephan,
is someone familiar with compiling ndp (nested data parallel Haskell),
Speed with less convenience-version?
Yes, me :-) Sorry for the late reply, it's been a long weekend here in
Australia.
I followed the guide at
On Jan 28, 2008, at 20:41 , Roman Leshchinskiy wrote:
(.text+0x8d5): undefined reference to
`__stginit_parallelzm1zi0zi0zi0_ControlziParallelziStrategies_'
This is strange, I've never seen this. Can you please send me the
exact commands you used to build ghc and package ndp and the
On 28 Jan 2008, at 10:07 AM, Neil Mitchell wrote:
Hi
ghc uses a pretty conventional stack AFAIK, and it is arbitrarily
limited, but you can change the limit with +RTS options.
GHC uses a conventional stack (in that you put stuff at the top, and
take it off from the top), but it is not a
*did* disagree with me was also named Jeremy. How confusing.
Are both Jeremys pronounced identically?
Stefan
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Tim Chevalier catamorphism at gmail.com writes:
On 1/28/08, Jeremy Apthorp nornagon at gmail.com wrote:
On 29/01/2008, Tim Chevalier catamorphism at gmail.com wrote:
Haskell, stress on the first syllable; the first syllable is like
the word has and the second syllable is pronounced
Tim Chevalier wrote:
I suppose you would really want to ask Haskell Curry how *he*
pronounced his name, but it's a bit late for that.
Someone could ask Alonzo Church, Jr. how his one-time date pronounced
her father's name:
James Russell wrote:
Tim Chevalier catamorphism at gmail.com writes:
That is not correct. The second syllable does not rhyme with fell.
In fact, the correct pronunciation sounds like hassle with a 'k'
inserted between the two syllables of that word.
Exactly. But am I the only person who has
On 1/28/08, Anton van Straaten [EMAIL PROTECTED] wrote:
Tim Chevalier wrote:
I suppose you would really want to ask Haskell Curry how *he*
pronounced his name, but it's a bit late for that.
Someone could ask Alonzo Church, Jr. how his one-time date pronounced
her father's name:
I thought that the .wav file that Jeremy linked to should go in the
Haskell FAQ, if there was one, but it doesn't seem to exist. There's a
comp.lang.functional FAQ (that isn't maintained anymore) with a
section on Haskell, and a GHC FAQ, but no general Haskell FAQ. A
google search for haskell faq
On Jan 28, 2008, at 21:54 , Tim Chevalier wrote:
I thought that the .wav file that Jeremy linked to should go in the
Haskell FAQ, if there was one, but it doesn't seem to exist.
http://www.haskell.org/haskellwiki/Category:FAQ
but it took me too much effort to find it, and it needs a fair
On 1/28/08, Brandon S. Allbery KF8NH [EMAIL PROTECTED] wrote:
On Jan 28, 2008, at 21:54 , Tim Chevalier wrote:
I thought that the .wav file that Jeremy linked to should go in the
Haskell FAQ, if there was one, but it doesn't seem to exist.
http://www.haskell.org/haskellwiki/Category:FAQ
On Mon, 2008-01-28 at 18:54 -0800, Tim Chevalier wrote:
I thought that the .wav file that Jeremy linked to should go in the
Haskell FAQ, if there was one, but it doesn't seem to exist. There's a
comp.lang.functional FAQ (that isn't maintained anymore) with a
section on Haskell, and a GHC FAQ,
Tim Chevalier wrote:
On 1/28/08, Anton van Straaten [EMAIL PROTECTED] wrote:
Tim Chevalier wrote:
I suppose you would really want to ask Haskell Curry how *he*
pronounced his name, but it's a bit late for that.
Someone could ask Alonzo Church, Jr. how his one-time date pronounced
her father's
I want to raise this issue again since I disagreed (see quoted text
below) that cabal-install can solve the problem of moving from one
version to another completely.
For most /pure/ packages, it is probably true. But for those packages
that have external depedencies, this is hardly so. For
stevelihn wrote:
In my brief experience with Ocaml's GODI, GODI has a way to specify
them in a so-called config package. The install package then reads
what it needs from the config package. In perl's CPAN shell, you can
specify them in the cpan config file (to some extent).
I suggest
Brandon S. Allbery KF8NH wrote:
On Jan 28, 2008, at 17:33 , Jamie Love wrote:
Shouldn't haskell pick up that there is no 'mod' for Word8? I mean,
shouldn't I get a nicer error message?
Hm? mod works fine for Word8, unless you specify a multiple of the
type's bound. I think it's still
On Mon, 28 Jan 2008, Tim Chevalier wrote:
I thought that the .wav file that Jeremy linked to should go in the
Haskell FAQ, if there was one, but it doesn't seem to exist. There's a
comp.lang.functional FAQ (that isn't maintained anymore) with a
section on Haskell, and a GHC FAQ, but no
On Tue, 29 Jan 2008, Duncan Coutts wrote:
On Mon, 2008-01-28 at 10:57 +, Bayley, Alistair wrote:
I'm wondering what the relationship is (if any) between code.haskell.org
and darcs.haskell.org.
darcs.haskell.org hosts ghc, the core libs and many others. The server
is maintained by
On Mon, 28 Jan 2008, Jonathan Cast wrote:
Or, to put it another way, the bugs Java's stack overflow is designed
to catch are considered good style in Haskell.
I consider explicit recursion in Haskell as bad style. One should use
higher order functions like 'map', 'fold', 'filter' and so on
On 28 Jan 2008, at 11:00 PM, Henning Thielemann wrote:
On Mon, 28 Jan 2008, Jonathan Cast wrote:
Or, to put it another way, the bugs Java's stack overflow is designed
to catch are considered good style in Haskell.
I consider explicit recursion in Haskell as bad style. One should use
higher
On Mon, 28 Jan 2008, Tim Chevalier wrote:
I thought that the .wav file that Jeremy linked to should go in the
Haskell FAQ, if there was one, but it doesn't seem to exist. There's a
comp.lang.functional FAQ (that isn't maintained anymore) with a
section on Haskell, and a GHC FAQ, but no
63 matches
Mail list logo
