Blogs (21) >>
ICFP 2017
Sun 3 - Sat 9 September 2017 Oxford, United Kingdom


This year ICFP will host a Student Research Competition where undergraduate and postgraduate students can present posters. The SRC at the ICFP 2017 consists of three rounds:

  • Extended abstract round: All students are encouraged to submit an extended abstract outlining their research (up to two pages).

  • Poster session at ICFP 2017: Based on the abstracts, a panel of judges will select the most promising entrants to participate in the poster session which will take place at ICFP. Students who make it to this round will be eligible for some travel support to attend the conference. In the poster session, students will have the opportunity to present their work to the judges, who will select three finalists in each category (graduate/undergraduate) to advance to the next round.

  • ICFP presentation: The last round will consist of an oral presentation at the ICFP to compete for the final awards in each category and selection of an overall winner who will advance to the ACM SRC Grand Finals.

Informations for the Authors of Accepted Presentations

You will be responsible for transporting your poster to the conference. If this will be a problem, please contact the chair of the SRC.

Authors of the accepted posters, please take notice: the demonstration boards at the venue are portrait only; so your poster can be portrait A0-sized, or landscape A1.

Consider applying for SIGPLAN PAC funding ( to partially support your travel/accommodation/attendance costs.


Undergraduate category

  • Axel Faes (KU Leuven)
  • Cristina Matache (University of Cambridge)
  • Joanna Sharrad (University of Kent)

Graduate category

  • Anders Miltner (Princeton University)
  • Simon Fowler (University of Edinburgh)
  • Wen Kokke (University of Edinburgh)


  • The top three graduate and the top three undergraduate winners will receive prizes of $500, $300, and $200, respectively.
  • All six winners will receive award medals and a two-year complimentary ACM student membership, including a subscription to ACM’s Digital Library.
  • The names of the winners will be posted on the SRC web site.
  • The first place winners of the SRC will be invited to participate in the ACM SRC Grand Finals, an on-line round of competitions among the winners of other conference-hosted SRCs.
  • Grand Finalists and their advisors will be invited to the Annual ACM Awards Banquet for an all-expenses-paid trip, where they will be recognized for their accomplishments along with other prestigious ACM award winners, including the winner of the Turing Award (also known as the Nobel Prize of Computing).
  • The top three Grand Finalists will receive an additional $500, $300, and $200. All Grand Finalists will receive Grand Finalist certificates.
  • The ACM, Microsoft Research, and our industrial partners provide financial support for students attending the SRC. You can find more information about this on the ACM website.

Wed 6 Sep

09:00 - 09:37: Student Research Competition - SRC Presentations at L1
Chair(s): Ilya Sergey
icfp-2017-Student-Research-Competition150468120000009:00 - 09:37
17:50 - 18:00: Student Research Competition - SRC Awards at L1
Chair(s): Ilya Sergey
icfp-2017-Student-Research-Competition150471300000017:50 - 18:00

Call for Submissions

The SRC is open to both undergraduate (not in a PhD program) and graduate students (in a PhD program). Upon submission, entrants must be enrolled as a student at their universities, and are ACM student members.


There are some constraints on what kind of work may be submitted.

Previously published work: Submissions should consist of original work (not yet accepted for publication). If the work is a continuation of previously published work, the submission should focus on the contribution over what has already been published. We encourage students to see this as an opportunity to get early feedback and exposure for the work they plan to submit to the next ICFP or POPL.

Collaborative work: Students are encouraged to submit work they have been conducting in collaboration with others, including advisors, internship mentors, or other students. However, submissions are individual, so they must focus on the contributions of the student.


EasyChair submission URL:

Each submission (referred to as abstract below) should include the student author’s name, institutional affiliation, e-mail address, and postal address; research advisor’s name; ACM student member number; category (undergraduate or graduate); research title; and an extended abstract addressing the following:

  • Problem and Motivation: Clearly state the problem being addressed and explain the reasons for seeking a solution to this problem.
  • Background and Related Work: Describe the specialized (but pertinent) background necessary to appreciate the work. Include references to the literature where appropriate, and briefly explain where your work departs from that done by others.
  • Approach and Uniqueness: Describe your approach in attacking the problem and clearly state how your approach is novel.
  • Results and Contributions: Clearly show how the results of your work contribute to computer science and explain the significance of those results.

The abstract must describe the student’s individual research and must be authored solely by the student. If the work is collaborative with others and/or part of a larger group project, the abstract should make clear what the student’s role was and should focus on that portion of the work. The extended abstract must not be longer than 2 pages in PDF. The reference list does not count towards these limits. To submit an abstract, please register through the EasyChair system (see the link above), and put all information requested above in the PDF that you submit including, including at least three keywords at the submission page. Abstracts submitted after the deadline may be considered at the committee’s discretion, but only after decisions have been made on all abstracts submitted before the deadline. If you have any problems or would like to clarify some concerns, don’t hesitate to contact the competition chair Ilya Sergey.

Undergraduate category

  • Towards a core language with row-based effects for optimised compilation
    • Axel Faes (KU Leuven)
  • Algebraic Effects for Calculating Compilers
    • Luke Geeson (University of Oxford)
  • Suggesting valid substitutions for typed holes
    • Matthías Páll Gissurarson (Chalmers Tekniska Högskola)
  • Formalisation of the lambda-mu-T calculus in Isabelle/HOL
    • Cristina Matache (University of Cambridge)
  • Improving Refutational Completeness of Relational Specifications via Non-Termination Test
    • Dmitri Rozplokhas (Saint Petersburg State University)
  • Type Errors: Delta Debugging with a Blackbox Compiler
    • Joanna Sharrad (University of Kent)
  • Uselets: UIs using Actors as an Abstraction for Composable Communicating Components
    • Thomas Weber (Augsburg University and University of Edinburgh)
  • Towards a routing specification language: formalization of the request routing problem and finite automata with actions
    • Haochen Xie (Nagoya University)

Graduate category

  • Refinement by Resolution in Dependent Type Theory
    • Frantisek Farka (University of St Andrews and Heriot-Watt University)
  • First-class Distributed Session Types
    • Simon Fowler (University of Edinburgh)
  • Provenance for Configuration Language muPuppet
    • Weili Fu (University of Edinburgh)
  • Handlers.Js: A Quantitative Study of Implementation Strategies for Effect Handlers on the Web
    • Daniel Hillerström (University of Edinburgh)
  • Arrow-based Abstract Interpreters
    • Sven Keidel (TU Delft)
  • Races in Classical Linear Logic
    • Wen Kokke (University of Edinburgh)
  • Garbage-less memory management using linear types
    • Miroslav Kratochvíl (Charles University)
  • Synthesizing Bijective Lenses
    • Anders Miltner (Princeton University)
  • Relational Interpretation of Concurrency
    • Evgenii Moiseenko (Saint Petersburg State University)
  • Improving Concolic Testing via Run-Time Refinement of Static Analysis
    • Maarten Vandercammen (Vrije Universiteit Brussel)
  • Reasoning About Sparse Vectors for Loops Code Generation
    • Vadim Zaliva (Carnegie Mellon University)