Ryan Bloor wrote:
hi
I am writing a basic Parser from scratch. So far I have functions;
I think you need to read http://www.cs.nott.ac.uk/~gmh/pearl.pdf
Paul.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Michael Vanier wrote:
I haven't been following this thread closely, but would it be rude to
suggest that someone who doesn't want to put the effort into learning
the (admittedly difficult) concepts that Haskell embodies shouldn't be
using the language?
Sorry Michael, but I will take your
Hi All,
Thanks for the general help on literate HTML. It seems that using
bird-tick style literate works better than \begin{code} style. I tried
it with my document, but quickly gave up - mainly because I decided
literateness did not fit with what I was doing.
You can compile a .html file with:
Hi
I cannot quickly find on http://www.haskell.org/haskellwiki/Yhc what YHC
supports.
From the (just modified) FAQ:
http://www.haskell.org/haskellwiki/Yhc/FAQ#Language_Support
Q) What extensions does it support?
A) Very few. Existentials and pattern guards are supported. Rank-2
types,
Dan Weston wrote:
Questioning apfelmus definitely gives me pause, but...
Don't hesitate! :) Personally, I question everyone and everything,
including myself. This is a marvelous protection against unintentionally
believing things just because I've heard them several times like Monads
are
I'm happy to announce a ReadP style parser for ByteStrings,
Text.ParserCombinators.ReadP.ByteString.
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bytestringreadp
Text.ParserCombinators.ReadP.ByteString is an adaptation of
Text.ParserCombinators.ReadP to work over Data.ByteString
On 12/11/07, Neil Mitchell [EMAIL PROTECTED] wrote:
I couldn't get it working either, so have raised a feature request bug.
Which has been merged into #1232:
http://hackage.haskell.org/trac/ghc/ticket/1967#comment:1
--
vvv
___
Haskell-Cafe mailing
On Mon, 2007-12-10 at 20:00 +0100, Henning Thielemann wrote:
[snip]
I raise my question once again: Must Haskell's tutorials be tailored to
impatient programmers? Does Haskell need quickdirty hackers?
IMO yes, because it exposes the language to the outside world and that's
a form of testing.
On Tue, 11 Dec 2007, ChrisK wrote:
I look at it this way: Every person who adds Haskell, however shallowly, to
their repertoire acts as an example that may spur others to learn Haskell,
perhaps deeply. And that is a win not because of language chauvinism, but
because of concept
apfelmus:
As Feynman put it: What do you care what other people think?
It was not Feynman, but his wife.
Jerzy Karczmarczuk
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'd just like to float an idea that's related to the Class Alias
proposal[1] but is perhaps somewhat simpler.
We all know that Functor should have been a superclass of Monad, and
indeed we now know that Applicative should be too. Making such a change
would break lots of things however so the
Hello all,
I using an IArray to represent a matrix. I'm trying to write some
properties checks with Quickcheck.
Quickcheck lacks instance generators for arrays of ints for example,
is there anything I can use out there or should I define it myself?
(I'm asking because it seems to be something
On Tue, Dec 11, 2007 at 02:20:52PM +, Duncan Coutts wrote:
I'd just like to float an idea that's related to the Class Alias
proposal[1] but is perhaps somewhat simpler.
We all know that Functor should have been a superclass of Monad, and
indeed we now know that Applicative should be too.
David Menendez wrote:
On Dec 11, 2007 9:20 AM, Duncan Coutts [EMAIL PROTECTED]
mailto:[EMAIL PROTECTED] wrote:
So my suggestion is that we let classes declare default implementations
of methods from super-classes.
snip.
Does this proposal have any unintended consequences? I'm not
On Dec 11, 2007 9:20 AM, Duncan Coutts [EMAIL PROTECTED] wrote:
So my suggestion is that we let classes declare default implementations
of methods from super-classes.
snip.
Does this proposal have any unintended consequences? I'm not sure.
Please discuss :-)
It creates ambiguity if two
I second that emotion.
That is the perfect paper to read if you've never done a parser and need
one. There is also source code corresponding to the paper if you google
around.
t.
Paul Johnson [EMAIL PROTECTED]
Sent by: [EMAIL PROTECTED]
12/11/2007 03:02 AM
To
Ryan Bloor [EMAIL PROTECTED]
Am Dienstag, 11. Dezember 2007 14:46 schrieb Hans van Thiel:
On Mon, 2007-12-10 at 20:00 +0100, Henning Thielemann wrote:
[snip]
I raise my question once again: Must Haskell's tutorials be tailored to
impatient programmers? Does Haskell need quickdirty hackers?
IMO yes, because it exposes
On Tue, 2007-12-11 at 07:07 -0800, Stefan O'Rear wrote:
This is almost exactly the
http://haskell.org/haskellwiki/Class_system_extension_proposal; that
page has some discussion of implementation issues.
Oh yes, so it is. Did this proposal get discussed on any mailing list?
I'd like to see
Duncan Coutts wrote:
On Tue, 2007-12-11 at 07:07 -0800, Stefan O'Rear wrote:
This is almost exactly the
http://haskell.org/haskellwiki/Class_system_extension_proposal; that
page has some discussion of implementation issues.
Oh yes, so it is. Did this proposal get discussed on any mailing
On Tue, Dec 11, 2007 at 04:26:52PM +, Simon Marlow wrote:
Duncan Coutts wrote:
On Tue, 2007-12-11 at 07:07 -0800, Stefan O'Rear wrote:
This is almost exactly the
http://haskell.org/haskellwiki/Class_system_extension_proposal; that
page has some discussion of implementation issues.
Oh
ChrisK wrote:
That is new. Ah, I see GHC.Conc.forkIO now has a note:
GHC note: the new thread inherits the /blocked/ state of the parent
(see 'Control.Exception.block').
BUT...doesn't this change some of the semantics of old code that used forkIO ?
Yes, it is a change to the semantics. I
Hello,
I've been working on a library to encode/decode audio files (wave,
aiff, etc.) to and from lazy bytestrings, and it's finally in a form
where I'm willing to share. It's available at
http://mml.music.utexas.edu/jwlato/HSoundFile/, lightly cabalized and
haddock-ified. The basic item is a
| If it really would work ok we should get it fully specified and
| implemented so we can fix the most obvious class hierarchy problems in a
| nice backwards compatible way. Things are only supposed to be candidates
| for Haskell' if they're already implemented.
Getting it fully specified is the
On Tue, 2007-12-11 at 16:38 +, Ross Paterson wrote:
On Tue, Dec 11, 2007 at 04:26:52PM +, Simon Marlow wrote:
Duncan Coutts wrote:
On Tue, 2007-12-11 at 07:07 -0800, Stefan O'Rear wrote:
This is almost exactly the
http://haskell.org/haskellwiki/Class_system_extension_proposal;
I haven't been following this thread closely, but would it be rude to suggest
that someone who doesn't want to put the effort into learning the (admittedly
difficult) concepts that Haskell embodies shouldn't be using the language?
Haskell was never intended to be The Next Big Popular Language.
Jules Bean wrote:
David Menendez wrote:
Duncan Coutts wrote:
So my suggestion is that we let classes declare default
implementations of methods from super-classes.
It creates ambiguity if two classes declare defaults for a common
superclass.
My standard example involves Functor, Monad,
On 2007.12.10 13:52:41 -0600, Tommy McGuire [EMAIL PROTECTED]
scribbled 1.7K characters:
In the if anyone is interested,... department
For reasons that remain unclear, early this fall I started translating
Brian W. Kernighan and P.J. Plaugher's classic _Software Tools in Pascal_
into
jerzy karczmarczuk wrote:
apfelmus:
As Feynman put it: What do you care what other people think?
It was not Feynman, but his wife.
Thanks, I should have questioned my claim :)
Regards,
apfelmus
___
Haskell-Cafe mailing list
Another suggestion, maybe completely off the wall, would be to do
something with stand-alone deriving syntax? So instead of instance
Functor T one might write deriving Functor for T ? This might make
it more clear that default methods were being brought into play. With
this syntax, it
Hi everyone,
I'm trying to get HBDD compiled under GHC 6.8.1 and now I'm stuck with a
.chs file which uses a foreign label syntax, which seems deprecated, since
the parser can't even recognize it:
foreign label bdd_reorder_stable_window3
bdd_reorder_stable_window3 :: FunPtr (BDDManager - IO
This is at odds with the notion, popular on this list and other haskell
forums, that pure functional programming is the future.
Perhaps a nit-pick, but I don't think we're talking about *pure* functional
programming. I think we're talking about a mixture of functional and
imperative programming
I'm not sure there are many of us left pursuing that vision.
P.S. I'd love to learn otherwise.
On Dec 11, 2007 10:02 AM, Conal Elliott [EMAIL PROTECTED] wrote:
This is at odds with the notion, popular on this list and other haskell
forums, that pure functional programming is the future.
What about something like
instance Monad MyMonad where
(=) = ...
return = ...
deriving ( Functor, Applicative )
That sounds like a friendlier version of SPJ's proposal, in that you no
longer have to search for the default method, and every instance is
actually manually declared. (I'm
Ricardo Herrmann [EMAIL PROTECTED] wrote:
a .chs file which uses a foreign label syntax, which seems
deprecated, since the parser can't even recognize it:
foreign label bdd_reorder_stable_window3
bdd_reorder_stable_window3 :: FunPtr (BDDManager - IO ())
Is there new syntax for this ?
On Tue, 2007-12-11 at 16:56 +0100, Wolfgang Jeltsch wrote:
Am Dienstag, 11. Dezember 2007 14:46 schrieb Hans van Thiel:
On Mon, 2007-12-10 at 20:00 +0100, Henning Thielemann wrote:
[snip]
I raise my question once again: Must Haskell's tutorials be tailored to
impatient programmers?
hi john,
On 11.12.2007, at 18:14, John Lato wrote:
I've been working on a library to encode/decode audio files (wave,
aiff, etc.) to and from lazy bytestrings, and it's finally in a form
where I'm willing to share. It's available at
http://mml.music.utexas.edu/jwlato/HSoundFile/, lightly
On 02.12.2007, at 22:34, Eric Sessoms wrote:
Just add
Build-Tools: c2hs
And cabal will take it from there.
thanks eric, that's really pleasingly simple (it appears that the
Build-Tools: line isn't even needed).
sk
___
Haskell-Cafe mailing list
Haskellians,
Here is an idea so obvious that someone else must have already thought of it
and worked it all out. Consider the following grammar.
N0 ::= T0 N1 | T1 N1 N0 | T2 N0 N0
N1 ::= T3 N0
where Ti (0 = i 4) are understood to be terminals.
Using generics we can translate each production
Malcolm Wallace wrote:
Ricardo Herrmann [EMAIL PROTECTED] wrote:
a .chs file which uses a foreign label syntax, which seems
deprecated, since the parser can't even recognize it:
foreign label bdd_reorder_stable_window3
bdd_reorder_stable_window3 :: FunPtr (BDDManager - IO ())
Is
On 11 Dec 2007, [EMAIL PROTECTED] wrote:
Also, sound data is currently read into a list. I will probably
change this at some point in the future, most likely copying the lazy
bytestring implementation and using a list of CFloat arrays.
Perhaps you are looking for storablevector which is a
On Tue, 2007-12-11 at 19:14 +0100, Stefan Kersten wrote:
On 02.12.2007, at 22:34, Eric Sessoms wrote:
Just add
Build-Tools: c2hs
And cabal will take it from there.
thanks eric, that's really pleasingly simple
(it appears that the Build-Tools: line isn't even needed).
Though note
Dusan,
Excellent point. To close it off, you need to add an empty alternative.
Thus, the corrected form would be
N0 ::= TEmpty | T0 N1 | T1 N1 N0 | T2 N0 N0
N1 ::= T3 N0
In the lambda calculus, this would show up as a constant term, say 0, that
would have to be treated in the operational
On Dec 11, 2007 1:29 PM, apfelmus [EMAIL PROTECTED] wrote:
Without the automatic search, this is already possible
class Functor f where
fmap :: (a - b) - f a - f b
class Functor m = Monad m where
return :: a - m a
(=) :: m a - (a - m b) - m b
--
And more power to those who are pursuing the vision!
But in the mean time I need to read and write files, start up external
programs, call Excel through FFI, etc, etc.
And there's no clever API for that yet, only IO. And I'd rather do IO in
Haskell than in C++.
I share the vision, though. I'm
Greg Meredith [EMAIL PROTECTED] wrote in article [EMAIL PROTECTED] in
gmane.comp.lang.haskell.cafe:
Here is an idea so obvious that someone else must have already thought of it
and worked it all out. Consider the following grammar.
Hello!
If I understand your basic idea correctly, it is to
Hans van Thiel wrote:
On Tue, 2007-12-11 at 16:56 +0100, Wolfgang Jeltsch wrote:
Maybe there are also patient people in the outside world so that we can still
expose Haskell to the outside world while not trying to attract
quick-and-dirty hackers. ;-)
But who are those people? And what harm
It may be helpful to distinguish teaching/preaching (a) programming in
Haskell from (b) *functional* programming (in Haskell or otherwise). Each
focus is present in the conversation. Perhaps IO helps the former and
hinders the latter.- Conal
___
Very suspicious extension of attachment
Sender: Gwern Branwen [EMAIL PROTECTED]
Recipient: haskell-cafe@haskell.org
Subject: [Haskell-cafe] Software Tools in Haskell
---
avast! Antivirus: Outbound message clean.
Virus Database (VPS): 071210-0, 10/12/2007
Tested on: 12/12/2007 9:33:52 AM
On 2007.12.12 09:33:12 +1100, Tim- tigre11 [EMAIL PROTECTED] scribbled 2.2K
characters:
Very suspicious extension of attachment
Sender: Gwern Branwen [EMAIL PROTECTED]
Recipient: [EMAIL PROTECTED]
Subject: [Haskell-cafe] Software Tools in Haskell
G'day all.
Quoting David Menendez [EMAIL PROTECTED]:
This is pretty much how I define Functor and Applicative instances for my
monads. It is admittedly irritating to have to write out the boilerplate,
but it doesn't seem irritating enough to require a language extension to
eliminate.
In the
FWIW to the discussion about changing the main page, I was reading the CUFP
paper and I saw some germane comments (and the writer is apparently one Noel
Welsh, whose name I don't see in the thread); the context is a discussion (pg
17) of various members or potential members of the Haskell
Am Mittwoch, 12. Dezember 2007 03:12 schrieb [EMAIL PROTECTED]:
FWIW to the discussion about changing the main page, I was reading the CUFP
paper and I saw some germane comments (and the writer is apparently one
Noel Welsh, whose name I don't see in the thread); the context is a
discussion (pg
Am Dienstag, 11. Dezember 2007 18:34 schrieb Tim Newsham:
[…]
Why is it that every time the topic of teaching basic concepts in
an easier way comes up there are always two or three replies that
say should we bother? lets filter out the idiots?
I think that two different things are mixed in
I have not used Haskell to write large scale program, but I am
certainly interested to know the answer to these questions.
Can Haskell offer the following as Pythoner boasts?
1. can be used for many kinds of software development. (some may argue yes,
but different kinds from what python is good
It might help to point out that its easy to end up with memory/space
leaks in Java/python/ruby/perl too. Also stack overflow is really easy.
Also, you can get into really deep badness if you do anything
interesting with concurrency because of the global interpreter lock etc.
As far as
On Dec 11, 2007, at 22:47 , Steve Lihn wrote:
1. can be used for many kinds of software development. (some may
argue yes, but different kinds from what python is good for.)
This question is somewhat tied to (3), but really the answer is it
can be, but you may have to think differently
I found myself writing this for an Euler-problem:
digits :: Int - [Int]
digits i | i 10= [i]
| otherwise = i `mod` 10 : digits ( i `div` 10 )
And i realised it was quite some time ago (before this function) i had
actually written any explicitly recursive function. I managed to
On 2007.12.12 03:29:13 +0100, Wolfgang Jeltsch [EMAIL PROTECTED] scribbled
1.6K characters:
Am Mittwoch, 12. Dezember 2007 03:12 schrieb [EMAIL PROTECTED]:
FWIW to the discussion about changing the main page, I was reading the CUFP
paper and I saw some germane comments (and the writer is
stevelihn:
I have not used Haskell to write large scale program, but I am
certainly interested to know the answer to these questions.
Can Haskell offer the following as Pythoner boasts?
1. can be used for many kinds of software development. (some may argue
yes, but
Here's for Xmas, version 2.4 of the Haskell-mode package.
Haskell-mode is an Elisp package to support editing Haskell in Emacs.
See the home page at
http://www.iro.umontreal.ca/~monnier/elisp/
-- Stefan
Changes since 2.3:
* Update license to GPLv3.
* New derived major mode for .hsc
On Tue, 2007-12-11 at 23:06 -0500, [EMAIL PROTECTED] wrote:
On 2007.12.12 03:29:13 +0100, Wolfgang Jeltsch [EMAIL PROTECTED] scribbled
1.6K characters:
Am Mittwoch, 12. Dezember 2007 03:12 schrieb [EMAIL PROTECTED]:
FWIW to the discussion about changing the main page, I was reading the
i did just read the haskell description from galois [1]. i like
1) ...enabling much higher coding efficiency, in addition to formalisms that
greatly ease verification.
2) All programming languages suffer from a semantic gap:...
maybe we could compose sth similar to 1) to introduce static typed
On Tue, 11 Dec 2007, Jed Brown wrote:
Perhaps you are looking for storablevector which is a direct
generalization of bytestring from Word8 to any Storable. It is not in
hackage yet, but seems stable. There isn't a `lazy' version, but that
could be changed.
On Tue, 11 Dec 2007, John Lato wrote:
I've been working on a library to encode/decode audio files (wave,
aiff, etc.) to and from lazy bytestrings, and it's finally in a form
where I'm willing to share. It's available at
http://mml.music.utexas.edu/jwlato/HSoundFile/, lightly cabalized and
On Tue, 11 Dec 2007 [EMAIL PROTECTED] wrote:
The Haskell one is dominated by the technical terms, while the Python
one is by more generic features. Let's break them down:
Plese, not again. Did you follow the earlier phases of that thread?
___
65 matches
Mail list logo
