ICFP 2022
Sun 11 - Fri 16 September 2022 Ljubljana, Slovenia

About

The ACM Student Research Competition (SRC) will take place again this year at ICFP, providing undergraduate and graduate researchers an opportunity to present their original research. The goal is to give students a place to discuss their research with experts in their field and to help them sharpen their research and communication skills.

Following SRC guidelines, the ICFP 2022 SRC consists of three rounds:

Round 1: Extended Abstracts. All students are encouraged to submit a 3-page extended abstract outlining their research. See the Call for Submissions for more details.

Round 2: Poster Session at ICFP. 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, if it is held in-person. 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.

Round 3: Presentations at ICFP. The last round will consist of an oral presentation at 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.

Eligibility

The SRC is open to both undergraduate and graduate students. Upon submission, entrants must be enrolled as a student at their universities and be current ACM student members.

Furthermore, 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.

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

Team submissions: Team projects will be only accepted from undergrads. One person should be designated by the team to make the oral presentation. If a graduate (Masters or PhD program) student is part of a group research project and wishes to participate in an SRC, they can submit and present their individual contribution to the group research project.

Outcomes and SRC Grand Finalists

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 one-year complimentary ACM student membership, including a subscription to ACM’s Digital Library.

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.

The top three Grand Finalists will receive an additional $500, $300, and $200. All Grand Finalists will receive Grand Finalist certificates.

Dates
Tracks
You're viewing the program in a time zone which is different from your device's time zone - change time zone

Mon 12 Sep

Displayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change

09:00 - 10:00
KeynoteICFP Papers and Events at Linhart
Chair(s): Stephanie Weirich University of Pennsylvania
09:00
60m
Keynote
Deep Programmability: A New Lens on Networking
ICFP Papers and Events
Nate Foster Cornell University
10:30 - 12:10
Lambda Calculus and SemanticsICFP Papers and Events at Linhart
Chair(s): Silvia Ghilezan University of Novi Sad, Mathematical Institute SASA
10:30
20m
Talk
The Theory of Call-by-Value Solvability
ICFP Papers and Events
Beniamino Accattoli Inria & Ecole Polytechnique, Giulio Guerrieri Huawei Edinburgh Research Centre
DOI
10:50
20m
Talk
A Simple and Efficient Implementation of Strong Call by Need by an Abstract Machine
ICFP Papers and Events
Malgorzata Biernacka University of Wrocław, Witold Charatonik University of Wrocław, Faculty of Mathematics and Computer Science, Tomasz Drab University of Wrocław, Faculty of Mathematics and Computer Science
DOI
11:10
20m
Talk
On Feller Continuity and Full Abstraction
ICFP Papers and Events
Gilles Barthe MPI-SP, Germany / IMDEA Software Institute, Spain, Raphaëlle Crubillé CNRS, Ugo Dal Lago University of Bologna; Inria, Francesco Gavazzo University of Bologna & INRIA Sophia Antipolis
DOI
11:30
20m
Talk
Multi Types and Reasonable SpaceDistinguished Paper
ICFP Papers and Events
Beniamino Accattoli Inria & Ecole Polytechnique, Ugo Dal Lago University of Bologna; Inria, Gabriele Vanoni University of Bologna & INRIA Sophia Antipolis
DOI
11:50
20m
Talk
Denotational semantics as a foundation for cost recurrence extraction for functional languagesJFP Presentation
ICFP Papers and Events
Norman Danner Wesleyan University, Dan Licata Wesleyan University
13:40 - 15:20
Analysis and TransformationsICFP Papers and Events at Linhart
Chair(s): Malgorzata Biernacka University of Wrocław
13:40
20m
Talk
Reference Counting with Frame Limited Reuse
ICFP Papers and Events
Anton Lorenzen University of Bonn, Daan Leijen Microsoft Research
DOI
14:00
20m
Talk
Entanglement Detection With Near-Zero CostDistinguished Paper
ICFP Papers and Events
Sam Westrick Carnegie Mellon University, Jatin Arora Carnegie Mellon University, Umut A. Acar Carnegie Mellon University
DOI
14:20
20m
Talk
Generating circuits with generators
ICFP Papers and Events
Marek Materzok University of Wroclaw
DOI
14:40
20m
Talk
Staged Compilation With Two-Level Type Theory
ICFP Papers and Events
András Kovács Eötvös Loránd University
DOI
15:00
20m
Talk
Random Testing of a Higher-Order Blockchain LanguageExperience Report
ICFP Papers and Events
Tram Hoang National University of Singapore, Anton Trunov Zilliqa Research, Leonidas Lampropoulos University of Maryland, College Park, Ilya Sergey National University of Singapore
DOI Pre-print
15:50 - 16:50
(Gradual) Type TheoryICFP Papers and Events at Linhart
Chair(s): Jesper Cockx TU Delft
15:50
20m
Talk
Propositional Equality for Gradual Dependently Typed Programming
ICFP Papers and Events
Joseph Eremondi University of British Columbia, Ronald Garcia University of British Columbia, Éric Tanter University of Chile
DOI
16:10
20m
Talk
A Reasonably Gradual Type Theory
ICFP Papers and Events
Kenji Maillard Inria Nantes & University of Chile, Meven Lennon-Bertrand Inria – LS2N, Université de Nantes, Nicolas Tabareau Inria, Éric Tanter University of Chile
DOI
16:30
20m
Talk
A completely unique account of enumeration
ICFP Papers and Events
Cas van der Rest Delft University of Technology, Wouter Swierstra Utrecht University, Netherlands
DOI
17:00 - 18:00
Panel DiscussionICFP Papers and Events at Linhart
Chair(s): Simon Peyton Jones Epic Games
17:00
60m
Panel
Fireside Chat with Arvind and Guy Steele
ICFP Papers and Events
Arvind Massachusetts Institute of Technology, USA, Guy L. Steele Jr. Oracle Labs

Tue 13 Sep

Displayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change

09:00 - 10:00
KeynoteICFP Papers and Events at Linhart
Chair(s): Ugo Dal Lago University of Bologna; Inria
09:00
60m
Keynote
Call-by-Push-Value, Quantitatively
ICFP Papers and Events
Delia Kesner Université de Paris; CNRS; IRIF; Institut Universitaire de France
10:30 - 12:10
LogicICFP Papers and Events at Linhart
Chair(s): Ilya Sergey National University of Singapore
10:30
20m
Talk
Later Credits: Resourceful Reasoning for the Later Modality
ICFP Papers and Events
Simon Spies MPI-SWS & Saarland University, Lennard Gäher MPI-SWS & Saarland University, Joseph Tassarotti NYU, Ralf Jung MPI-SWS, Robbert Krebbers Radboud University Nijmegen, Lars Birkedal Aarhus University, Derek Dreyer MPI-SWS
DOI
10:50
20m
Talk
Introduction and Elimination, Left and Right
ICFP Papers and Events
Klaus Ostermann University of Tübingen, David Binder University of Tübingen, Ingo Skupin University of Tübingen, Tim Süberkrüb University of Tübingen, Paul Downen University of Massachusetts Lowell
DOI Pre-print
11:10
20m
Talk
Normalization for Fitch-style Modal CalculiDistinguished Paper
ICFP Papers and Events
Nachiappan Valliappan Chalmers University of Technology, Fabian Ruch Unaffiliated, Carlos Tomé Cortiñas Chalmers University of Technology
DOI Media Attached
11:30
20m
Talk
Multiparty GV: Functional Multiparty Session Types With Certified Deadlock Freedom
ICFP Papers and Events
Jules Jacobs Radboud University, Stephanie Balzer Carnegie Mellon University, Robbert Krebbers Radboud University Nijmegen
DOI
11:50
20m
Talk
Back to futuresJFP Presentation
ICFP Papers and Events
Klaas Pruiksma Carnegie Mellon University, Frank Pfenning Carnegie Mellon University, USA
13:40 - 15:20
Program Verification & SynthesisICFP Papers and Events at Linhart
Chair(s): Arthur Azevedo de Amorim Boston University
13:40
20m
Talk
Verified Symbolic Execution with Kripke Specification Monads (and no Meta-Programming)
ICFP Papers and Events
Steven Keuchel Vrije Universiteit Brussel, Sander Huyghebaert Vrije Universiteit Brussel, Georgy Lukyanov Newcastle University, UK, Dominique Devriese KU Leuven
DOI
14:00
20m
Talk
Safe Couplings: Coupled Refinement Types
ICFP Papers and Events
Lisa Vasilenko IMDEA Software Institute, Niki Vazou IMDEA Software Institute, Gilles Barthe MPI-SP, Germany / IMDEA Software Institute, Spain
DOI
14:20
20m
Talk
Aeneas: Rust Verification by Functional Translation
ICFP Papers and Events
Son Ho INRIA, Jonathan Protzenko Microsoft Research, Redmond
DOI
14:40
20m
Talk
Searching Entangled Program Spaces
ICFP Papers and Events
James Koppel Massachusetts Institute of Technology, USA, Zheng Guo University of California, San Diego, Edsko de Vries Well-Typed LLP, Armando Solar-Lezama Massachusetts Institute of Technology, Nadia Polikarpova University of California at San Diego
DOI
15:00
20m
Talk
Iterating on multiple collections in synchronyJFP Presentation
ICFP Papers and Events
Stefano Perna , Val Tannen University of Pennsylvania, USA, Limsoon Wong National University of Singapore
15:50 - 16:50
Generic Programming and EducationICFP Papers and Events at Linhart
Chair(s): Nicolas Wu Imperial College London
15:50
20m
Talk
Datatype-Generic Programming Meets Elaborator Reflection
ICFP Papers and Events
Hsiang-Shang ‘Josh’ Ko Institute of Information Science, Academia Sinica, Liang-Ting Chen Institute of Information Science, Academia Sinica, Tzu-Chi Lin Institute of Information Science, Academia Sinica
Link to publication DOI Media Attached
16:10
20m
Talk
Practical generic programming over a universe of datatypes
ICFP Papers and Events
Lucas Escot TU Delft, Jesper Cockx TU Delft
DOI
16:30
20m
Talk
Structural Versus Pipeline Composition of Higher-Order FunctionsVirtualExperience Report
ICFP Papers and Events
Elijah Rivera Brown University, Shriram Krishnamurthi Brown University, United States
DOI
17:00 - 18:00
17:00
40m
Other
Student Research Competition – Finalist Presentations
ICFP Papers and Events
Daniel Hillerström The University of Edinburgh, Danel Ahman University of Ljubljana
17:40
20m
Other
Programming Contest Report
ICFP Papers and Events
Alperen Keles University of Maryland at College Park

Wed 14 Sep

Displayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change

09:00 - 10:00
KeynoteICFP Papers and Events at Linhart
Chair(s): Sam Lindley The University of Edinburgh, UK
09:00
60m
Keynote
Retrofitting Concurrency – Lessons from the Engine Room
ICFP Papers and Events
KC Sivaramakrishnan IIT Madras and Tarides
Media Attached
10:30 - 12:10
CompilationICFP Papers and Events at Linhart
Chair(s): Matija Pretnar University of Ljubljana, Slovenia
10:30
20m
Talk
Beyond Relooper: Recursive Translation of Unstructured Control Flow to Structured Control FlowFunctional Pearl
ICFP Papers and Events
Norman Ramsey Tufts University
DOI
10:50
20m
Talk
Automatically Deriving Control-Flow Graph Generators From Operational Semantics
ICFP Papers and Events
James Koppel Massachusetts Institute of Technology, USA, Jackson Kearl MIT, Armando Solar-Lezama Massachusetts Institute of Technology
DOI
11:10
20m
Talk
Analyzing Binding Extent in 3CPS
ICFP Papers and Events
Benjamin Quiring University of Maryland, Olin Shivers Northeastern University, USA, John Reppy University of Chicago, USA
DOI
11:30
20m
Talk
'do' Unchained: Embracing Local Imperativity in a Purely Functional LanguageFunctional Pearl
ICFP Papers and Events
Sebastian Ullrich Karlsruhe Institute of Technology, Leonardo de Moura Microsoft Research, n.n.
DOI
11:50
20m
Talk
ANF Preserves Dependent Types up to Extensional EqualityJFP Presentation
ICFP Papers and Events
Paulette Koronkevich University of British Columbia, Ramon Rakow University of British Columbia, Amal Ahmed Northeastern University, USA, William J. Bowman University of British Columbia
13:40 - 15:20
Programming and Reasoning About EffectsICFP Papers and Events at Linhart
Chair(s): William J. Bowman University of British Columbia
13:40
20m
Talk
Monadic Compiler CalculationFunctional Pearl
ICFP Papers and Events
Patrick Bahr IT University of Copenhagen, Graham Hutton University of Nottingham, UK
DOI
14:00
20m
Talk
Formal Reasoning About Layered Monadic Interpreters
ICFP Papers and Events
Irene Yoon University of Pennsylvania, Yannick Zakowski Inria, Steve Zdancewic University of Pennsylvania
DOI
14:20
20m
Talk
Program Adverbs and Tlön EmbeddingsDistinguished PaperVirtual
ICFP Papers and Events
Yao Li Portland State University, Stephanie Weirich University of Pennsylvania
DOI Pre-print
14:40
20m
Talk
Flexible presentations of graded monads
ICFP Papers and Events
Shin-ya Katsumata National Institute of Informatics, Dylan McDermott Reykjavik University, Tarmo Uustalu Reykjavik University, Nicolas Wu Imperial College London
DOI
15:00
20m
Talk
Fusing Industry and Academia at GitHubExperience Report
ICFP Papers and Events
Patrick Thomson GitHub, Rob Rix GitHub, Inc., Tom Schrijvers KU Leuven, Nicolas Wu Imperial College London
DOI
15:50 - 16:50
Effects and Type InferenceICFP Papers and Events at Linhart
Chair(s): Ben Lippmeier Ghost Locomotion
15:50
20m
Talk
Modular Probabilistic Models via Algebraic Effects
ICFP Papers and Events
Minh Nguyen University of Bristol, Roly Perera Alan Turing Institute, Meng Wang University of Bristol, Nicolas Wu Imperial College London
DOI
16:10
20m
Talk
Constraint-based type inference for FreezeML
ICFP Papers and Events
Frank Emrich University of Edinburgh, UK, Jan Stolarek University of Edinburgh, UK, James Cheney University of Edinburgh; Alan Turing Institute, Sam Lindley The University of Edinburgh, UK
DOI
16:30
20m
Talk
Linearly Qualified Types: Generic inference for capabilities and uniqueness
ICFP Papers and Events
Arnaud Spiwack Tweag, Csongor Kiss Imperial College London, Jean-Philippe Bernardy University of Gothenburg, Sweden, Nicolas Wu Imperial College London, Richard A. Eisenberg Jane Street
Link to publication DOI Pre-print
17:00 - 18:00
ConclusionsICFP Papers and Events at Linhart
Chair(s): Ronald Garcia University of British Columbia
17:00
40m
Awards
Awards
ICFP Papers and Events

17:40
15m
Other
Program Committee Chair Report
ICFP Papers and Events
Zena M. Ariola University of Oregon
17:55
5m
Day closing
ICFP 2023 Announcement
ICFP Papers and Events
Nikhil Swamy MSR Redmond, Sam Lindley The University of Edinburgh, UK

Not scheduled yet

Not scheduled yet
Talk
Typed and Untyped Algorithmic Conversion are Equivalent
Student Research Competition
Meven Lennon-Bertrand Inria – LS2N, Université de Nantes
Not scheduled yet
Talk
Formal Verification of a Lazy Abstraction Model Checker
Student Research Competition
Arthur Correnson École Normale Supérieure de Rennes & Saarland University
Not scheduled yet
Talk
Compiling Functional Programs with Holes
Student Research Competition
Hilbert Chen University of Michigan, Yanjun Chen University of Michigan, Eric Zhao University of Michigan
Not scheduled yet
Talk
Extinguishing the Fire Triangle of Gradual Dependent Types
Student Research Competition
Joseph Eremondi University of British Columbia
Not scheduled yet
Talk
Generalised free extensions
Student Research Competition
Nathan Corbyn University of Oxford
Not scheduled yet
Talk
Optimization of the code generated by a DSL for Stencil Computation using Temporary Grid Variables
Student Research Competition
Go Suzuki Tokyo Institute of Technology
Not scheduled yet
Talk
HenBlocks: Structured Editing for Coq
Student Research Competition
Bernard Boey Yale-NUS College
Not scheduled yet
Talk
Program Logics for Mechanizing Typechecking
Student Research Competition
Denis Carnier Vrije Universiteit Brussel
Not scheduled yet
Talk
CSI: Haskell: Fault-Localization in Lazy Languages using Runtime Tracing
Student Research Competition
Matthías Páll Gissurarson Chalmers University of Technology, Sweden
Not scheduled yet
Talk
Typing Recursive Data Structures of Futures for Graph Types
Student Research Competition
Francis Rinaldi Illinois Institute of Technology

Call for Submissions

ICFP invites students to participate in the Student Research Competition in order to present their research and get feedback from prominent members of the programming language research community. Please submit your extended abstracts through the submission website.

Each submission (referred to as “abstract” below) should include the student author’s name and e-mail address; institutional affiliation; 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 in the context of ICFP areas of interest. 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 addressing the problem and clearly state how your approach is novel.

Results and Contributions: Clearly show how the results of your work contribute to programming language design and implementation in particular and to computer science in general; explain the significance of those results.

Submissions must be original research that is not already published at ICFP or another conference or journal. One of the goals of the SRC is to give students feedback on ongoing, unpublished work. Furthermore, the abstract 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.

Formatting: Submissions must be in PDF format, printable in black and white on US Letter sized paper, and interpretable by common PDF tools. All submissions must adhere to the “ACM Small” template that is available (in both LaTeX and Word formats) from https://www.acm.org/publications/authors/submissions. For authors using LaTeX, a lighter-weight package, including only the essential files, is available from http://sigplan.org/Resources/Author/#acmart-format. The submission must not exceed 3 pages in PDF format. Reference lists do not count towards the 3-page limit. You may use the “nonacm” option to remove venue information, DOI, categories, and copyright notices, since we will not publish the abstracts in a proceedings.

Undergraduate category

  • 1st place: Bernard Boey: HenBlocks: Structured Editing for Coq
  • 2nd place: Hilbert Chen, Yanjun Chen, and Eric Zhao: Compiling Functional Programs with Holes
  • 3rd place: Francis Rinaldi: Typing Recursive Data Structures of Futures for Graph Types

Graduate category

  • 1st place: Arthur Correnson: Formal Verification of a Lazy Software Model Checker
  • 2nd place: Nathan Corbyn: Generalised free extensions
  • 3rd place: Denis Carnier: Program Logics for Mechanizing Type Checking