[icfp-announce] The contest is over!

Tom Murphy tom7 at cs.cmu.edu
Mon Jul 24 12:02:14 EDT 2006


The 9th Annual ICFP Programming Contest has come to an end!
Thank you all so much for participating.

We wish to recognize the remarkable amount of work that teams put into
participating in this contest. In all, 364 teams submitted at least
one publication, and at least 150 made substantial progress on one or
more puzzles. More than 60 brave teams registered in the last 24 hours
alone!

Updates to the global scoreboard were turned off at 4:00am EDT, so the
standings now shown on the scoreboard do not reflect the final scores.
We will announce the results of the contest at ICFP in September. At
that time we will also release details of how we created the contest.
We also plan to re-launch an updated Codex on a permanent site, so
that programmers can continue to test their skills and experiment with
it indefinitely.

Please remember to upload your code and set your team information for
the final standings. You can do this from your private team page any
time until noon EDT this Wednesday.

In the meantime, we can make available some of the fruits of our own
research into the Cult of the Bound Variable. For example, after
studying the Universal Machine intently over the course of the
weekend, we are pleased to announce our own reference implementation.
You may find it a convenient aid to your studies. It is found at the
bottom of this message in uuencode format, and is available from our
website:

   http://boundvariable.org/um.um

This implementation supports all UM programs, including uncompressed
.um files and self-decompressing .umz files. To use this
implementation to run a UM binary called c.um, simply concatenate the
two files together:

cat um.um c.um > cmu.um

The resulting binary can be run in any compliant universal machine
implementation, including itself.


Invariably yours,
The 2006 ICFP Contest Organizers

begin 644 um.um
MV@``$@````````````````````````````````````#0``$`U```!]?___\P
M``$?8```RV```-M0``!,8```46```$D@``&+$```<-X```$P```XU@``_Q``
M`/-0``#+V```'#```2,0``$TP```-````"H````Y````6@```'L```")````
MEP```*4```"S````M````,````#%````R@```,\````*W@``"%```0]0``#G
M8``!(F```21@``#:8```VV```<I@``'_$``!]Q```',0``$T````9R```9G`
M```UU@``"%```,M@``#38```VQ```//8``!.W@``0@```>/````W8```RF``
M`-L0``#SW@`!`#```/L0``#SV```0%```0Q@``$48``!)"```:/````U8``!
M"F```200``$TW@```3```3P0``#<V```0%```0Q@``$48``!)"```:/````U
MU@``0%```,M@``#38```VQ```//8``!OW@``8P```>/````W8```RF```-L0
M``#SV```"%```0Q@``$48``!)!```33>``$`,``!/"```:/````UV```"%``
M`0Q@``$48``!)!```33>```!,``!/&```<I@``'_$``!]R```.?````UW@``
M"%```0]0``#G8``!(F```21@``#:8```VQ```31@``'*8``!_Q```?<P``$G
M(``!G,```#7>```(4``!#U```.=@``$B8``!)&```-I@``#;$``!-&```<I@
M``'_$``!]T```2<@``&<P```-=X```A0``$/4```YV```2)@``$D8```VF``
M`-L0``$T8``!RF```?\0``'W4``!)R```9S````UW@``"%```0]0``#G8``!
M(F```21@``#:8```VQ```31@``'*8``!_Q```?=@``$G(``!G,```#5P````
M8```RF```-L0``#S,``!^X```"<@``$SU@``"%```,M@``#38```VR```9S`
M```U8```RF```-L0``#SD````\```#5@``$*8``!)!```32@```$P```-;``
M``1@``#*8```VR```9S````UV```"%```0Q@``$48``!)!```330``#>U@``
MV````,3````S8```"F`````0```PW@`!`#````?````UU``!`!```68P``#J
M@```&]```.S>``#F````.L```#!@``'V,```NA```#(@``#0T```XL```##0
M``#XU```\````!7````P$```)6```?8P``%]W@`!`#```>\@``#XT```[,``
B`##4```'8```"F`````0```P,```!]H``!+````=$```````
`
end




More information about the icfpcontest-announce mailing list