John Hughes <[EMAIL PROTECTED]> writes:
> ICFP Programming Contest
>
>
> There are just ten days to go to the sixth ICFP Programming Contest!
This *is* announced to all relevant groups (as in comp.lang.*, at
least)?
-kzm
--
If I haven't seen further, it is by standing
<[EMAIL PROTECTED]> writes:
> Michael Hobbs writes:
> > Just took a look at the results for the ICFP contest. Am I correct in
> > assuming that "LA" stands for Lennart Augustsson and that "Si^3" stands
> > for Simon Marlow, Simon Peyton-Jones, Sigbjorn Finne?
>
> Is there a URL for the results
> I would be interested in hearing from other contestants about how they
> think their programming language helped (or didn't help) them solve
> the problem. What language features were most helpful? Did anything
> particular get in the way? How much code did solutions take in other
> languages
Reginald Meeson wrote:
> >Lennart Augustsson wrote:
> >
> >>...
> >
> >Ooops, I miscounted. It's 376 lines of Haskell; still 137 in the optimizer.
> >(Not much productivity, just 1 line/minute.)
> >
>
> It appears Lennart is exercising his well-deserved bragging rights. :^)
I've not earned any
Lennart Augustsson wrote:
>
> 547 lines of Haskell, 137 of those line is the "optimizer", the rest is
> parsing, printing, etc.
> The parser uses parsing combinators.
> I used HBC (what else? :)
Ooops, I miscounted. It's 376 lines of Haskell; still 137 in the optimizer.
(Not much productivity,
>Lennart Augustsson wrote:
>
>>...
>
>Ooops, I miscounted. It's 376 lines of Haskell; still 137 in the optimizer.
>(Not much productivity, just 1 line/minute.)
>
It appears Lennart is exercising his well-deserved bragging rights. :^)
More power to him. Congratulations Lennart, and to all the o
Simon Peyton-Jones wrote:
> > Just curious, a few questions :
> > - How long was your program?
> > - How did you do the parsing? with happy?
> > parser combinators? ...
> > - Which compiler did you use ? (Okay, i think i know ... :-))
> > - Other information you want to share with us ...
> > (e
Michael Hobbs <[EMAIL PROTECTED]> wrote,
> Just took a look at the results for the ICFP contest. Am I correct in
> assuming that "LA" stands for Lennart Augustsson and that "Si^3" stands
> for Simon Marlow, Simon Peyton-Jones, Sigbjorn Finne?
>
> If so, congratulations guys! It looks like you to
> Just curious, a few questions :
> - How long was your program?
> - How did you do the parsing? with happy?
> parser combinators? ...
> - Which compiler did you use ? (Okay, i think i know ... :-))
> - Other information you want to share with us ...
> (eg. - which optimization algoritm did you
Congratulations to LA & Si^3 !
Just curious, a few questions :
- How long was your program?
- How did you do the parsing? with happy?
parser combinators? ...
- Which compiler did you use ? (Okay, i think i know ... :-))
- Other information you want to share with us ...
(eg. - which optimization
Simon Peyton-Jones wrote:
> Good guess for Si^3. And I'd bet a lot of money that LA
> is Lennart. He is a demon. I nearly didn't enter because I
> anticipated the shame of a team of three of us lagging way
> behind Lennart, on his own, probably writing his in the gaps
> between implementing a
Good guess for Si^3. And I'd bet a lot of money that LA
is Lennart. He is a demon. I nearly didn't enter because I
anticipated the shame of a team of three of us lagging way
behind Lennart, on his own, probably writing his in the gaps
between implementing a new type checker for Cayenne.
Simon
12 matches
Mail list logo
