In ghci, why does
throw $ ArithException DivideByZero
print
*** Exception: divide by zero
while
throwDyn $ ArithException DivideByZero
print
*** Exception: (unknown)
?
Mike
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://w
Paulo J. Matos <[EMAIL PROTECTED]> wrote in article <[EMAIL PROTECTED]> in
gmane.comp.lang.haskell.cafe:
> I'm interested in a freely available fast paced haskell tutorial.
> By fast paced, I means I want something that goes through basic in a
> very fast pace, presents a couple of examples and th
"Haskell -- You're probably not smart enough to understand it."
You are not expected to understand this.
http://swtch.com/unix/
Tim Newsham
http://www.thenewsh.com/~newsham/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.
It seems a little unfriendly to reject contributions from anyone who isn't
subscribed to the libraries mailing list... I suppose one solution is to
have maintainers for packages. But in this case it should be deprecated
having the email of packages set to [EMAIL PROTECTED] (Yes, I know I
could re
On Fri, 2007-10-12 at 11:00 +1300, ok wrote:
> On 11 Oct 2007, at 4:06 pm, Tom Davies basically asked for
> something equivalent to Ada's
> type T is new Old_T;
> which introduces a *distinct* type T that has all the operations and
> literals of Old_T. In functional terms, suppose there is a
On 11 Oct 2007, at 4:06 pm, Tom Davies basically asked for
something equivalent to Ada's
type T is new Old_T;
which introduces a *distinct* type T that has all the operations and
literals of Old_T. In functional terms, suppose there is a function
f :: ... Old_T ... Old_T ... Old_T
Michael Vanier wrote:
I haven't been following this discussion closely, but here's an idea:
use reverse psychology.
"Haskell -- You're probably not smart enough to understand it."
Nothing like appealing to people's machismo to get them interested.
Oooo!
+15
Yes I have. I actually bought the few only F# books available. It's a
nice language, and an incredible amount of work. The Visual Studio
plugin also works well.
But somehow I found Haskell cleaner... Its laziness is a better for me ;-)
But I might switch back to F# someday, and then learning H
For a contrary point of view, there is a footnote at the bottom of page
20 in "Parsec, a fast combinator parser" by Daan Leijen, the creator of
Parsec:
"I have to warn the reader though that experience with the HaskellLight
compiler has shown that it hardly pays off in practice to use special
Hi
In future questions like this are usually best directed to
haskell-cafe, with haskell being left for annoucements.
The standard "full haskell" representation is in Template Haskell
(http://haskell.org/ghc/docs/latest/html/libraries/template-haskell/Language-Haskell-TH.html).
If you want to wor
On Thu, 11 Oct 2007, Jonathan Cast wrote:
> On Wed, 2007-10-10 at 21:45 -0400, Brandon S. Allbery KF8NH wrote:
[... re programming language machismo ... ]
>> Haskell already has that reputation, and so far as I've seen most
>> programmers conclude they shouldn't waste time on it when "any half-
On Wed, 2007-10-10 at 21:45 -0400, Brandon S. Allbery KF8NH wrote:
> On Oct 10, 2007, at 20:14 , Michael Vanier wrote:
>
> > I haven't been following this discussion closely, but here's an
> > idea: use reverse psychology.
> >
> > "Haskell -- You're probably not smart enough to understand it."
>
On Thu, 2007-10-11 at 07:57 +, Aaron Denney wrote:
> On 2007-10-11, Jonathan Cast <[EMAIL PROTECTED]> wrote:
> > Yes. I am very eager to criticize your wording. To wit, I'm still
> > failing to understand what your position is. Is it fair to say that
> > your answer to my question, why pi ha
On Thu, 2007-10-11 at 11:22 +0200, [EMAIL PROTECTED]
wrote:
> My last word (promise!) on the subject, especially addressed to Jonathan
> Cast, who writes:
>
> > To wit, I'm still failing to understand what your position is.
>
> I quote the Master:
>
> Lennart:
> > Come on people! This discus
http://halogen.note.amherst.edu/~jdtang/scheme_in_48/tutorial/overview.html
is pretty fast-paced. You also may want to check out
http://en.wikibooks.org/wiki/Haskell where you can pretty much go at
your own pace.
On 10/11/07, Paulo J. Matos <[EMAIL PROTECTED]> wrote:
> Hello all,
>
> I'm intereste
Hello all,
I'm interested in a freely available fast paced haskell tutorial.
By fast paced, I means I want something that goes through basic in a
very fast pace, presents a couple of examples and then talks about
more advanced features. A set of tutorials would be also good.
References to these ki
On 10/10/2007, Seth Gordon <[EMAIL PROTECTED]> wrote:
>
> > "Nervous? Anxious? You found an irreproducable bug in your program and
> > have to fix it until tomorrow? You feel that your code needs essential
> > cleanup, but you postponed it for long in order to not introduce new
> > bugs? You can ha
Hi
> The file you have requested
> (http://www.cs.york.ac.uk/fp/cpphs-1.5-win32.zip) could not
> be found on this server.
The slightly older version works:
http://www.cs.york.ac.uk/fp/cpphs-1.2-win32.zip
I'm unable to get SSH from this machine, so can't tell where that file
has gone to. Malcolm
My last word (promise!) on the subject, especially addressed to Jonathan
Cast, who writes:
To wit, I'm still failing to understand what your position is.
I quote the Master:
Lennart:
Come on people! This discussion is absurd. The numeric classes in
Haskell have a lot of choices that are
On 10/10/07, Michael Vanier <[EMAIL PROTECTED]> wrote:
> Is there an implementation of a symbol type in Haskell i.e. a string which
> has a constant-time
> comparison operation?
To borrow Prolog terminology, it sounds like you're looking for an
"atom" data type.
I've not done it, but I've plotte
On Thu, 11 Oct 2007, Tom Davies wrote:
Andrew Wagner gmail.com> writes:
If you change your type declarations to 'newtype' declarations, I
believe you would get the effect that you want, depending on what you
mean by 'equivalent'. In that case, Foo and Bar would essentially be
strings, but yo
On Wed, 10 Oct 2007, Seth Gordon wrote:
Aha! Instead of the lambda surrounded by mathematical stuff as the
haskell.org logo, we need a picture of a medicine bottle.
"Haskell. Fewer headaches. No side effects."
Alternatively, a picture of a red pill with an embossed lambda...
A snake en
Just goofing around with arrows and foldr while reading Hutton's
excellent paper on folds (http://www.cs.nott.ac.uk/~gmh/fold.pdf).
Wondering if this can be done automatically and more generally?
module Main where
import Control.Arrow
import Data.List
-- sum and length expressed as foldr.
fsum
On 2007-10-11, Jonathan Cast <[EMAIL PROTECTED]> wrote:
> Yes. I am very eager to criticize your wording. To wit, I'm still
> failing to understand what your position is. Is it fair to say that
> your answer to my question, why pi has no default implementation, is `in
> fact, pi shouldn't be a m
24 matches
Mail list logo
