G'day all.
Quoting Donald Bruce Stewart [EMAIL PROTECTED]:
Get some free theorems:
lambdabot free f :: (b - b) - [b] - [b]
f . g = h . f = map f . f g = f h . map f
I finally got around to fixing the name clash bug. It now reports:
g . h = k . g = map g . f h = f k . map g
Get
[EMAIL PROTECTED] wrote:
G'day all.
Quoting Donald Bruce Stewart [EMAIL PROTECTED]:
Get some free theorems:
lambdabot free f :: (b - b) - [b] - [b]
f . g = h . f = map f . f g = f h . map f
I finally got around to fixing the name clash bug. It now reports:
g . h = k . g = map
On Mon, 4 Sep 2006, Brian Hulley wrote:
Firstly, I found the following advice by Henning Thielemann very useful in my
own code:
http://haskell.org/hawiki/UsingQualifiedNames (bottom of the page)
In the style of Modula-3 I define one data type or one type
class per module. The module
On Wed, 30 Aug 2006, Tim Newsham wrote:
Does anyone know where I could find the source code for the Haskell web
server described in the papers Tackling the Awkward Squad by SPJ and
Writing High-Performance Server Applications in Haskell, Case Study: A
Haskell Web Server by Simon Marlow?
Brian Hulley wrote:
Copyright (c) 1988 XYZ ...
1) Redistributions of source code...
2) Redistributions in binary form must reproduce
the above copyright notice, this list of conditions
and the following disclaimer in the documentation
and/or other
On Mon, 4 Sep 2006, Brian Hulley wrote:
The problem here is that these names, presumably both to do with Car, are
not going to appear next to each other in any alphabetical listing (if there
are other names too), whereas:
type CarBlue = ...
type CarRed = ...
will. Thus the
Am Montag, 4. September 2006 07:44 schrieben Sie:
You are right, but I was using extraction in a rather non-technical
sense.
Look at it this way: we have 'x = f', let's assume it's the
continuation monad. Assuming f has type 'a - C b' we must have
something of type a to be able to call the
| Another thing:
| Would it be a good idea to create derived Read instances that could
parse
| both, A `And` A and And A A ?
| Since 6.4.2 parses the former and 6.2.2 parses the latter that should
be
| possible, I believe (and both forms are accepted at the ghci prompt).
Well, the Haskell 98
Yes, that's pretty much the point I was trying to make. :)
-- Lennart
On Sep 4, 2006, at 07:03 , Daniel Fischer wrote:
Am Montag, 4. September 2006 07:44 schrieben Sie:
You are right, but I was using extraction in a rather non-technical
sense.
Look at it this way: we have 'x = f',
I'd like to see a mix of the two systems. Top level quantifiers
should be optional; they often don't improve readability.
-- Lennart
On Sep 4, 2006, at 04:21 , Janis Voigtlaender wrote:
[EMAIL PROTECTED] wrote:
G'day all.
Quoting Donald Bruce Stewart [EMAIL PROTECTED]:
Get some
Tamas K Papp wrote:
I am looking for small to medium sized practice problems, preferably
with solutions.
Hi Tamas,
writing a Haskell library is very good idea yet requires some
confidence. So for your first somehow useful programs, you could want to
try olympiad / competition problems in
Since there are a lot of modifications of HWS around now, it seems to be
worthwhile to combine the efforts. E.g. I adapted the HWS adaption
provided by WASH
http://www.informatik.uni-freiburg.de/~thiemann/WASH/#wsp
for my needs. For instance in Request.hs I removed the call to
Simon Marlow wrote:
Brian Hulley wrote:
Copyright (c) 1988 XYZ ...
Giving proper copyright attribution is not considered an endorsement,
no. [other useful comments]
Also what about the application's about dialog or help pages?
There's no requirement in the BSD license that you have
On Mon, Sep 04, 2006 at 07:39:40PM +0200, [EMAIL PROTECTED] wrote:
The ultimate Haskell challenge is of course the ICFP contest
http://icfpcontest.org/
There is also the International ACM Programming Contest
http://acm.uva.es/problemset/
I don't know about the services mentioned above,
Henning Thielemann wrote:
On Mon, 4 Sep 2006, Brian Hulley wrote:
-- So related things appear alphabetically together...
empty? :: Set a - Bool
empty :: Set a
I think the separation of alpha-numeric characters and other symbols
simplifies things, and shall be preserved.
In
Hi
I don't know about the services mentioned above, but Sphere Online Judge
(http://www.spoj.pl/) allows you to submit solutions written in Haskell
(and many other programming languages).
http://www.spoj.pl/ranks/languages/
From that we can see Haskell is the 7th best programming langauge -
On 9/5/06, Tomasz Zielonka [EMAIL PROTECTED] wrote:
On Mon, Sep 04, 2006 at 07:39:40PM +0200, [EMAIL PROTECTED] wrote: The ultimate Haskell challenge is of course the ICFP contest
http://icfpcontest.org/ There is also the International ACM Programming Contesthttp://acm.uva.es/problemset/I don't
Toby Hutton wrote:
On 9/5/06, *Tomasz Zielonka* [EMAIL PROTECTED]
mailto:[EMAIL PROTECTED] wrote:
On Mon, Sep 04, 2006 at 07:39:40PM +0200, [EMAIL PROTECTED]
mailto:[EMAIL PROTECTED] wrote:
The ultimate Haskell challenge is of course the ICFP contest
I have the below program, and I'm trying to run it on an input of about
90MB. It eats RAM like crazy, and I can't figure out why.
I do know that the problem is not my custwords function (as you can see,
I replaced the call to it with a call to the standard words function on
the last line). It
The x+1 looks suspicious.
On Sep 4, 2006, at 23:03 , John Goerzen wrote:
I have the below program, and I'm trying to run it on an input of
about
90MB. It eats RAM like crazy, and I can't figure out why.
I do know that the problem is not my custwords function (as you can
see,
I replaced
Is with happiness that I announce my first project release.
I announced it as an idea to the summer of code and as Paolo Martini
said to me that it was a good idea I decided to publish it.
The link to the summer of code proposal follows:
http://hackage.haskell.org/trac/summer-of-code/ticket/80
At Tue, 5 Sep 2006 03:03:51 + (UTC),
John Goerzen wrote:
I have the below program, and I'm trying to run it on an input of about
90MB. It eats RAM like crazy, and I can't figure out why.
I have not looked in detail at your code -- but it could simply be the
fact that String requires gobs
jeremy.shaw:
At Tue, 5 Sep 2006 03:03:51 + (UTC),
John Goerzen wrote:
I have the below program, and I'm trying to run it on an input of about
90MB. It eats RAM like crazy, and I can't figure out why.
I have not looked in detail at your code -- but it could simply be the
fact that
At Mon, 04 Sep 2006 22:05:57 -0700,
Jeremy Shaw wrote:
At Tue, 5 Sep 2006 03:03:51 + (UTC),
John Goerzen wrote:
I have the below program, and I'm trying to run it on an input of about
90MB. It eats RAM like crazy, and I can't figure out why.
If you fold a Data.Map or associative
On Mon, Sep 04, 2006 at 10:53:49PM +0100, Neil Mitchell wrote:
From that we can see Haskell is the 7th best programming langauge -
and that number of problems solved is almost exactly the same as rank.
I think perhaps we need a little project to conquer this benchmark
like we did the
25 matches
Mail list logo
