Hi all, This contest should be of interest to Haskellers. There is an "FP Category" in which termination of Haskell programs is automatically checked. The current state can be observed by following the corresponding "View Results" link from the page
http://termcomp.uibk.ac.at/termcomp/competition/categoryList.seam?competitionId=101722&cid=51 Ciao, Janis. -- Jun.-Prof. Dr. Janis Voigtländer http://www.iai.uni-bonn.de/~jv/ mailto:j...@iai.uni-bonn.de
--- Begin Message ---Termination Competition 2009 December 16-20 The annual termination competition has started today. The progress of the competition can be seen "live" on the web at http://termcomp.uibk.ac.at/termcomp/competition/categoryList.seam?competitionId=101722&cid=51 As usual, the most powerful termination provers compete against each other in this competition. The competition has several categories for termination analysis of different programming paradigms, including * Term Rewriting * Java Bytecode * Haskell * Prolog * etc. Moreover, there are competitions on * certified termination analysis and on * automated complexity analysis. More information can be found at http://termcomp.uibk.ac.at/status/rules.html
--- End Message ---
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
