Sometimes happy outputs 'parE' when I run it on my .y file? I believe it
is coming from a part of Grammer.lhs which has the comment line
This bit is a real mess, mainly because of the error message support.
Are there any suggestions on what to change in my .y file to get over this?
Thanks
On 26/01/07, Marco Túlio Gontijo e Silva [EMAIL PROTECTED] wrote:
But if I can't write this type signature without -fglasgow-exts, I
thought that it couldn't infer this type. For me it's strange that it's
ok to have a very generic function if I don't have a type signature, but
if I write it the
Hi all,
I'm trying to get started on using Rohan Drape's Hsc library, excited
about the prospect of parsing things straight into synthesis graphs, but
progress is slow. There is good library documentation with examples,
but no overview of how things fit together that I can find. Would
anyone
Tim Newsham wrote:
I have to write:
do {
x - getSomeNum
y - anotherWayToGetANum
return (x + y)
}
even if the computation of x and y are completely independant of
each other.
I too have really missed a parallel composition operator to do
something like the above.
Jacques Carette wrote:
Tim Newsham wrote:
I have to write:
do {
x - getSomeNum
y - anotherWayToGetANum
return (x + y)
}
even if the computation of x and y are completely independant of
each other.
I too have really missed a parallel composition operator to do
Brian Hulley wrote:
Chris Kuklewicz wrote:
This is how I would write getLeaves, based on your GADT:
data IsLeaf
data IsBranch
newtype Node = Node { getNode :: (forall c. ANode c) }
[snip]
Thanks Chris - that's really neat!
I see it's the explicit wrapping and unwrapping of the existential
On Friday 26 January 2007 22:14, Tim Newsham wrote:
impractical language, only useful for research. Erik Meijer at one point
states that programming in Haskell is too hard and compares it to
assembly programming!
He brings up a very good point. Using a monad lets you deal with
side
On Fri, Jan 26, 2007 at 05:25:13PM +, Chris Kuklewicz wrote:
I agree that common libraries like ByteString need to be well
represented, but the original request additionally included programs
that are representative of applications. A ray-tracer (even with a fixed
scene and only one
On Sat, 27 Jan 2007, Donald Bruce Stewart wrote:
lemming:
On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
Binary: high performance, pure binary serialisation for Haskell
--
The Binary
On Fri, 26 Jan 2007 22:00:11 +0100, you wrote:
I agree, but I think it should be pointed out that primarily it is not
Haskell which is hard, it is Programming which is. Haskell only reflects
this better than the mainstream imperative languages.
That's very true. Writing good software is hard,
On Fri, 26 Jan 2007 22:01:09 -0600, you wrote:
You have a PhD in computer science from Princeton, so your measure of
what's hard and what isn't in this regard is nearly worthless.
I find it incredibly insulting for you to assert that people who
complain about Haskell's difficulty are too lazy
Humm. While I can accept that this is a valid criticism of Haskell's monadic
structure for dealing with I/O, I fail to see how it could drive a decision
to prefer an imperative language like C#, where every statement has this
property (overspecification of evaluation order).
True.. perhaps his
Hi Alistair,
Is there a simple way to get the contents of a webpage using Haskell on a
Windows box?
This isn't exactly what you want, but it gets you partway there. Not
sure if LineBuffering or NoBuffering is the best option. Line
buffering should be fine for just text output, but if you
On Sunday 28 January 2007 09:14, Neil Mitchell wrote:
Hi Alistair,
Is there a simple way to get the contents of a webpage using Haskell on
a Windows box?
This isn't exactly what you want, but it gets you partway there. Not
sure if LineBuffering or NoBuffering is the best option. Line
On Sat, 2007-01-27 at 19:11 +0100, Henning Thielemann wrote:
On Sat, 27 Jan 2007, Donald Bruce Stewart wrote:
The underlying Get and Put monads support explicit endian writes and
reads, which you can add to your instances explicitly:
Hi Daniel
Note that I haven't tried this, or the rest of Alistair code at all, so the
usual 30 day money back guarantee doesn't apply. It certainly won't handle
redirects.
Thanks, it certainly gets more things, but has a nasty habit of taking
a very long time in Hugs on certain URLs:
On Fri, 2007-01-26 at 15:40 +0100, Arie Peterson wrote:
Hello,
Donald Bruce Stewart wrote:
Ok, I forgot one point. It is possible to automatically derive instances
of Binary for your custom types, if they inhabit Data and Typeable,
using an SYB trick. Load
Hi
I also fear that the existing script does not handle types with more than
256 constructors correctly. While uncommon, those are not unrealistic.
Feel free to send in a patch. All it needs to do is check if there are
more than 2^8 constructors and if so encode the tag in a Word16 rather
Greetings,
My new regular expression backend regex-tdfa is passing all the tests I have
been throwing at it, so it is time to share the good news.
First up: Where is it? Version 0.56 is in my stable location at
darcs get --partial darcs.haskell.org:/home/darcs/packages/regex-tdfa
The version
lemming:
On Sat, 27 Jan 2007, Donald Bruce Stewart wrote:
lemming:
On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
Binary: high performance, pure binary serialisation for Haskell
Hello Alex,
alex [EMAIL PROTECTED] writes:
| Would anyone have some illustrative example code, and perhaps a
| couple of tips for how to get things working well in emacs?
Noting that Hsc is still experimental and not completely nailed down,
though I think now quite close, and assuming that
On Jan 26, 2007, at 23:01 , Collin Winter wrote:
You have a PhD in computer science from Princeton, so your measure of
what's hard and what isn't in this regard is nearly worthless.
Uh, I don't have a degree, and discussions about mathy stuff like
category theory generally go flying way
Well, I'm thinking in terms of OOD/OOA/OOP -- Design, Architecture,
Programming. That's about the only way to model a bog system. Say I
have a stock market model -- I'll have a database of tickers, a
simulator to backtest things, a trading strategy, etc.
Do Haskell modules provide enough
...In the tradition of the letters of an ignorant newbie...
What's the consensus on the OOP in Haskell *now*? There're some
libraries such as OOHaskell, O'Haskell, and Haskell~98's own qualified
type system with inheritance.
If I have GHC, which way to do anything OOP-like is considered right
deliverable:
...In the tradition of the letters of an ignorant newbie...
What's the consensus on the OOP in Haskell *now*? There're some
libraries such as OOHaskell, O'Haskell, and Haskell~98's own qualified
type system with inheritance.
If I have GHC, which way to do anything OOP-like
deliverable:
Well, I'm thinking in terms of OOD/OOA/OOP -- Design, Architecture,
Programming. That's about the only way to model a bog system. Say I
have a stock market model -- I'll have a database of tickers, a
simulator to backtest things, a trading strategy, etc.
Do Haskell modules
What about this OOHaskell:
http://homepages.cwi.nl/~ralf/OOHaskell/
-- how is it received in the café? :)
Cheers,
Alexy
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 1/26/07, Collin Winter [EMAIL PROTECTED] wrote:
I find it incredibly insulting for you to assert that people who
complain about Haskell's difficulty are too lazy and aren't really
interested in a better solution. Maybe they just don't want to have to
take graduate-level classes in category
dons:
lemming:
On Sat, 27 Jan 2007, Donald Bruce Stewart wrote:
lemming:
On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
Binary: high performance, pure binary serialisation for
Haskell
On Sunday 28 January 2007 10:53, Neil Mitchell wrote:
Thanks, it certainly gets more things, but has a nasty habit of taking
a very long time in Hugs on certain URLs:
research.microsoft.com/,
Looks like IIS is waiting until it receives a Connection header, a bit of a
variation from spec I
30 matches
Mail list logo
