International Conference on Functional Programming Contest

from Wikipedia, the free encyclopedia

The ICFP Contest is a programming competition that is held annually in the context of the ICFP conference. The first ICFP contest took place in 1998.

Competition mode

The problem posed can be solved with any programming language , sometimes even with any aids and number of team members, even if the organizers hope that a functional language will prevail. The only limit is the time available (time limit).

There are usually two ratings, the Lightning Division , for solutions that were created within one day and the normal Main Division , where three days can be exhausted for the solution.

The problems are usually quite demanding, in the past background knowledge from the areas of ray tracing , optimal control and AI was required.

Attendees

Everyone can participate, whether student or professional, alone or in a team.

The field is usually very busy. Participants in past competitions included such illustrious names as Thomas Rockiki ( dvips ), Simon Peyton Jones ( Haskell ), Joe Armstrong ( Erlang ), Andreas Bogk ( libc5 , Dylan ), Tom Duff ( Duff's Device ).

venue

The competition is held over the Internet, i. H. you can participate from anywhere in the world where there is a network connection.

Prices

To win is essentially fame , because for the first places there are traditional proclamations :

The judges declare ...

  • Jury Prize: Your team is an extremely cool bunch of hackers!
  • Winner Lightning Division: Your language is very suitable for rapid prototyping.
  • 2nd place Main Division: Your language is a fine programming tool for many applications.
  • 1st place Main Division: Your language is the language of choice for discriminating hackers!

Often there is also a ticket to the ICFP conference, where the winners and their solutions are presented.

Previous competitions

  • 2013
    • Task: A short code is to be found using a restricted set of instructions that calculates a result given as a number from an initial number. The shorter the code, the more points there are.
  • 2012
    • Task: Digger variant
  • 2011
  • 13th competition 2010
    • Task: cars and suitable fuels
    • Actually looking for suitable matrices that meet complicated conditions
  • 12th competition 2009
    • Task: Four problems where a satellite must be controlled in order to complete a task
    • First Prize: C ++
    • Lightning: ML
    • Judges Prize: Haskell, MATLAB, PHP, Python, C ++, Java
  • 11th competition 2008
    • Task: Control a Mars rover that has to bypass various obstacles and enemies
    • First Prize: Java
    • Lightning: OCaml
    • Judges prize: TeX
  • 10th competition 2007:
    • Task: Image transformation with the help of an additional programming language that has to be decrypted using reverse engineering .
    • First Prize: C ++
    • Second Prize: Perl
    • Judge's Prize: Celestial Dire Badger (Jed Davis) with OCaml and C ++
  • 8th competition 2005:
    • Task: Player control of a complex robber-and-gendarme "board game".
    • First Prize: Haskell
    • Second Prize: Dylan
    • Third Prize: Haskell
    • Judge's Prize: Dylan
  • 6th competition 2003:
    • Task: Optimal control of a racing car through sometimes very tricky racetracks
    • First Prize: C ++
    • Second Prize: C ++
    • Lightning Division: Objective CAML
    • Judge's Prize: Dylan , C ++
  • 5th competition 2002:
  • 4th competition 2001:
    • Task: Development of a parser for very large SML / NG files
    • First Prize: Haskell
    • Second Prize: Dylan
    • Judge's Prize: Erlang

Web links

Individual evidence

  1. 13th competition 2010 ( Memento of the original from October 9, 2017 in the Internet Archive ) Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2Template: Webachiv / IABot / www.icfpcontest.org
  2. 12th competition 2009 ( Memento of the original from May 18, 2011 in the Internet Archive ) Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2Template: Webachiv / IABot / www.ittc.ku.edu
  3. 11th competition 2008
  4. 10th competition 2007
  5. 9th competition 2006
  6. 8th competition 2005
  7. 7th competition 2004
  8. 6th competition 2003 ( Memento of the original from February 4, 2005 in the Internet Archive ) Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2Template: Webachiv / IABot / www.dtek.chalmers.se
  9. 5th competition 2002 ( Memento of the original from March 7, 2005 in the Internet Archive ) Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2Template: Webachiv / IABot / icfpcontest.cse.ogi.edu
  10. 4th competition 2001
  11. 3rd competition 2000
  12. 2nd competition 1999
  13. 1st competition 1998 ( Memento of the original from February 4, 2005 in the Internet Archive ) Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2Template: Webachiv / IABot / www.ai.mit.edu