Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Fourth ICFP Programming Contest

by princepawn (Parson)
on Jul 05, 2001 at 18:17 UTC ( #94106=perlmeditation: print w/replies, xml ) Need Help??

The Fourth ICFP Programming Contest is being held.

Last year's program challenge was to write a parser and display engine for a ray tracing language.

There are only 72 hours to complete the task.

Replies are listed 'Best First'.
Re: Fourth ICFP Programming Contest
by tadman (Prior) on Jul 05, 2001 at 23:34 UTC
    The programs have to be able to run on their PC running RedHat 7.1, which has Perl 5.6.0 installed and listed on their system spec page. Unfortunately they also have the RedHat 7.x "broken" gcc 2.96, which is almost funny because the GNU people haven't released that version yet.

    A little more info for those who are impatient, as that site is disorganized to an artistic extreme. The contests so far have been: By the way, what the heck is Caml?

      Caml is a dialect of ML (and is that upon which the well-known OCaml is based).

      ML is a statically and strongly typed (mostly) functional language (or, perhaps more accurately, family of languages). It has nice things like type inferencing (which means that though the language is statically typed you very rarely have to explicitly declare the type of things - the compiler figures them out on its own) and pattern matching (which allows one to define many functions very naturally). It's not a "pure" functional language, which is to say that imperative features are available if one needs them.

      Another source of information besides your Caml link is SML of New Jersey (I think there is some historical information there). As I understand it, the Caml branch of ML diverged before Standard ML was created, which explains the different syntaxes, etc. The ideas seem to be mostly the same, though.

      Is that what you wanted to know, or are you looking for something else?

      Update: I should have mentioned that MLs are strict rather than lazy - I don't want to get the Haskell people on my case for not bringing that up. :-)

Re: Fourth ICFP Programming Contest
by srawls (Friar) on Jul 06, 2001 at 00:39 UTC
    I signed up for the mailing list, which will send me a message when the problem is released. I would love it if a few of the monks here would like to represent perl with me. We could communicate via e-mail, and asign different tasks to eachother once we get the problem. I think it'd be fun, and I know I'd learn a lot. I hope at least a few people will be interested and join on my team, it's kind of a daunting task to do it by yourself : )

    The 15 year old, freshman programmer,
    Stephen Rawls

      I'll stand by ya! What's the plan?

      Spacewarp

      DISCLAIMER:
      Use of this advanced computing technology does not imply an endorsement
      of Western industrial civilization.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: perlmeditation [id://94106]
Approved by root
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (4)
As of 2018-11-16 07:43 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My code is most likely broken because:
















    Results (193 votes). Check out past polls.

    Notices?
    • (Sep 10, 2018 at 22:53 UTC) Welcome new users!