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

PACMPL (ICFP) seeks contributions on the design, implementations, principles, and uses of functional programming, covering the entire spectrum of work, from practice to theory, including its peripheries. Authors of papers published in this issue of PACMPL will present their work at during the in-person conference, providing an opportunity for researchers and developers to hear about the latest work in functional programming.

Dates
Tracks
Plenary
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

08:00 - 08:50
RegistrationCatering & social at Foyer 2

If you are a speaker in the first morning session you should submit your slides the day before, or arrive early in the morning to submit, preferrably already at 8:00.

08:00
50m
Registration
Registration
Catering & social

08:50 - 09:00
08:50
10m
Day opening
Welcome
Catering & social
G: Andrej Bauer University of Ljubljana
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:00 - 10:30
Coffee breakCatering & social at Foyer 2 +48h +24h
10:00
30m
Coffee break
Coffee break
Catering & social

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, Daniel R. Licata Wesleyan University
12:10 - 13:40
LunchCatering & social at Foyer 2 +24h +48h
12:10
90m
Lunch
Lunch
Catering & social

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:20 - 15:50
Coffee breakCatering & social at Foyer 2 +48h +24h
15:20
30m
Coffee break
Coffee break
Catering & social

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
16:50 - 17:00
BreakCatering & social at Foyer 2 +48h +24h
16:50
10m
Break
Break
Catering & social

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
19:00 - 20:00
Guided tour of LjubljanaCatering & social at Kongresni trg
19:00
60m
Social Event
Guided tour of Ljubljana
Catering & social

Tue 13 Sep

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

08:00 - 09:00
RegistrationCatering & social at Foyer 2

If you are a speaker in the first morning session you should submit your slides the day before, or arrive early in the morning to submit, preferrably already at 8:00.

08:00
60m
Registration
Registration
Catering & social

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:00 - 10:30
Coffee breakCatering & social at Foyer 2
10:00
30m
Coffee break
Coffee break
Catering & social

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
12:10 - 13:40
12:10
90m
Lunch
Lunch
Catering & social

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:20 - 15:50
CARES sessionCatering & social at E6 +18h40min
15:20
30m
Social Event
CARES session
Catering & social
C: Gabriele Keller Utrecht University, C: Simon Peyton Jones Epic Games , C: Stephanie Weirich University of Pennsylvania
15:20 - 15:50
Coffee breakCatering & social at Foyer 2
15:20
30m
Coffee break
Coffee break
Catering & social

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 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
16:50 - 17:00
16:50
10m
Break
Break
Catering & social

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
18:30 - 21:00
Women@ICFP dinnerCatering & social at Gostilna Breg
18:30
2h30m
Dinner
Women@ICFP
Catering & social
O: Anja Petković Komel TU Wien, Vienna, Austria

Wed 14 Sep

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

08:00 - 09:00
RegistrationCatering & social at Foyer 2

If you are a speaker in the first morning session you should submit your slides the day before, or arrive early in the morning to submit, preferrably already at 8:00.

08:00
60m
Registration
Registration
Catering & social

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:00 - 10:30
CARES sessionCatering & social at E6
10:00
30m
Social Event
CARES session
Catering & social
C: Gabriele Keller Utrecht University, C: Simon Peyton Jones Epic Games , C: Stephanie Weirich University of Pennsylvania
10:00 - 10:30
Coffee breakCatering & social at Foyer 2
10:00
30m
Coffee break
Coffee break
Catering & social

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
12:10 - 13:40
12:10
90m
Lunch
Lunch
Catering & social

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:20 - 15:50
Coffee breakCatering & social at Foyer 2
15:20
30m
Coffee break
Coffee break
Catering & social

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
16:50 - 17:00
16:50
10m
Break
Break
Catering & social

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

Accepted Papers

Title
A completely unique account of enumeration
ICFP Papers and Events
DOI
Aeneas: Rust Verification by Functional Translation
ICFP Papers and Events
DOI
Analyzing Binding Extent in 3CPS
ICFP Papers and Events
DOI
A Reasonably Gradual Type Theory
ICFP Papers and Events
DOI
A Simple and Efficient Implementation of Strong Call by Need by an Abstract Machine
ICFP Papers and Events
DOI
Automatically Deriving Control-Flow Graph Generators From Operational Semantics
ICFP Papers and Events
DOI
Beyond Relooper: Recursive Translation of Unstructured Control Flow to Structured Control FlowFunctional Pearl
ICFP Papers and Events
DOI
Constraint-based type inference for FreezeML
ICFP Papers and Events
DOI
Datatype-Generic Programming Meets Elaborator Reflection
ICFP Papers and Events
Link to publication DOI Media Attached
'do' Unchained: Embracing Local Imperativity in a Purely Functional LanguageFunctional Pearl
ICFP Papers and Events
DOI
Entanglement Detection With Near-Zero CostDistinguished Paper
ICFP Papers and Events
DOI
Flexible presentations of graded monads
ICFP Papers and Events
DOI
Formal Reasoning About Layered Monadic Interpreters
ICFP Papers and Events
DOI
Fusing Industry and Academia at GitHubExperience Report
ICFP Papers and Events
DOI
Generating circuits with generators
ICFP Papers and Events
DOI
Introduction and Elimination, Left and Right
ICFP Papers and Events
DOI Pre-print
Later Credits: Resourceful Reasoning for the Later Modality
ICFP Papers and Events
DOI
Linearly Qualified Types: Generic inference for capabilities and uniqueness
ICFP Papers and Events
Link to publication DOI Pre-print
Modular Probabilistic Models via Algebraic Effects
ICFP Papers and Events
DOI
Monadic Compiler CalculationFunctional Pearl
ICFP Papers and Events
DOI
Multiparty GV: Functional Multiparty Session Types With Certified Deadlock Freedom
ICFP Papers and Events
DOI
Multi Types and Reasonable SpaceDistinguished Paper
ICFP Papers and Events
DOI
Normalization for Fitch-style Modal CalculiDistinguished Paper
ICFP Papers and Events
DOI Media Attached
On Feller Continuity and Full Abstraction
ICFP Papers and Events
DOI
Practical generic programming over a universe of datatypes
ICFP Papers and Events
DOI
Program Adverbs and Tlön EmbeddingsDistinguished PaperVirtual
ICFP Papers and Events
DOI Pre-print
Propositional Equality for Gradual Dependently Typed Programming
ICFP Papers and Events
DOI
Random Testing of a Higher-Order Blockchain LanguageExperience Report
ICFP Papers and Events
DOI Pre-print
Reference Counting with Frame Limited Reuse
ICFP Papers and Events
DOI
Safe Couplings: Coupled Refinement Types
ICFP Papers and Events
DOI
Searching Entangled Program Spaces
ICFP Papers and Events
DOI
Staged Compilation With Two-Level Type Theory
ICFP Papers and Events
DOI
Structural Versus Pipeline Composition of Higher-Order FunctionsVirtualExperience Report
ICFP Papers and Events
DOI
The Theory of Call-by-Value Solvability
ICFP Papers and Events
DOI
Verified Symbolic Execution with Kripke Specification Monads (and no Meta-Programming)
ICFP Papers and Events
DOI

Call for Papers

PACMPL issue ICFP 2022 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to):

  • Language Design: concurrency, parallelism, and distribution; modules; components and composition; metaprogramming; macros; pattern matching; type systems; type inference; dependent types; session types; gradual typing; refinement types; interoperability; domain-specific languages; imperative programming; object-oriented programming; logic programming; probabilistic programming; reactive programming; generic programming; bidirectional programming.

  • Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; garbage collection and memory management; runtime systems; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources.

  • Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling; build systems; program synthesis.

  • Foundations: formal semantics; lambda calculus; program equivalence; rewriting; type theory; logic; category theory; monads; continuations; control; state; effects; names and binding; program verification.

  • Analysis and Transformation: control flow; data flow; abstract interpretation; partial evaluation; program calculation.

  • Applications: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; graphics and multimedia; GPU programming; scripting; system administration; security.

  • Education: teaching introductory programming; parallel programming; mathematical proof; algebra.

Submissions will be evaluated according to their relevance, correctness, significance, originality, and clarity. Each submission should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. PACMPL issue ICFP 2022 also welcomes submissions in two separate categories — Functional Pearls and Experience Reports — that must be marked as such when submitted and that need not report original research results. Detailed guidelines on both categories are given at the end of this call. Please contact the associate editor if you have questions or are concerned about the appropriateness of a topic.

About PACMPL

Proceedings of the ACM on Programming Languages (PACMPL https://pacmpl.acm.org/) is a Gold Open Access journal publishing research on all aspects of programming languages, from design to implementation and from mathematical formalisms to empirical studies. Each issue of the journal is devoted to a particular subject area within programming languages and will be announced through publicized Calls for Papers, like this one.

Preparation of submissions

Deadline: The deadline for submissions is Wednesday, March 2, 2022, Anywhere on Earth (https://www.timeanddate.com/time/zones/aoe). This deadline will be strictly enforced.

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. There is a limit of 25 pages for a full paper or Functional Pearl and 12 pages for an Experience Report; in either case, the bibliography will not be counted against these limits. Submissions that exceed the page limits or, for other reasons, do not meet the requirements for formatting, will be summarily rejected. Supplementary material can and should be separately submitted (see below). See also PACMPL’s Information and Guidelines for Authors at https://pacmpl.acm.org/authors.cfm.

Submission: Submissions will be accepted at https://icfp22.hotcrp.com/ Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface.

Author Response Period: Authors will have a 72-hour period, starting at 17:00 UTC on Monday, May 2, 2022, to read reviews and respond to them.

Supplementary Material: Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. This supplementary material should not be submitted as part of the main document; instead, it should be uploaded as a separate PDF document or tarball. Supplementary material should be uploaded at submission time, not by providing a URL in the paper that points to an external repository. Authors are free to upload both anonymized and non-anonymized supplementary material. Anonymized supplementary material will be visible to reviewers immediately; non-anonymized supplementary material will be revealed to reviewers only after they have submitted their review of the paper and learned the identity of the author(s).

Authorship Policies: All submissions are expected to comply with the ACM Policies for Authorship that are detailed at https://www.acm.org/publications/authors/information-for-authors.

Republication Policies: Each submission must adhere to SIGPLAN’s republication policy, as explained on the web at http://www.sigplan.org/Resources/Policies/Republication.

Review Process

This section outlines the two-stage process with lightweight double-blind reviewing that will be used to select papers for PACMPL issue ICFP 2022. We anticipate that there will be a need to clarify and expand on this process, and we will maintain a list of frequently asked questions and answers on the PACMPL issue website to address common concerns.

PACMPL issue ICFP 2022 will employ a two-stage review process. The first stage in the review process will assess submitted papers using the criteria stated above and will allow for feedback and input on initial reviews through the author response period mentioned previously. As a result of the review process, a set of papers will be conditionally accepted and all other papers will be rejected. Authors will be notified of these decisions on May 21, 2022. Authors of conditionally accepted papers will be provided with committee reviews along with a set of mandatory revisions. On June 16, 2022, the authors will provide a second submission. The second and final reviewing phase assesses whether the mandatory revisions have been adequately addressed by the authors and thereby determines the final accept/reject status of the paper. The intent and expectation are that the mandatory revisions can be addressed within three weeks and hence that conditionally accepted papers will, in general, be accepted in the second phase. The second submission should clearly identify how the mandatory revisions were addressed. To that end, the second submission must be accompanied by a cover letter mapping each mandatory revision request to specific parts of the paper. The cover letter will facilitate a quick second review, allowing for confirmation of final acceptance within two weeks. Conversely, the absence of a cover letter will be grounds for the paper’s rejection.

PACMPL issue ICFP 2022 will employ a lightweight double-blind reviewing process. To facilitate this, submitted papers must adhere to two rules:

  1. author names and institutions must be omitted, and
  2. references to authors’ own related work should be in the third person (e.g., not “We build on our previous work …” but rather “We build on the work of …”).

The purpose of this process is to help the reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized). In addition, authors should feel free to disseminate their ideas or draft versions of their papers as they normally would. For instance, authors may post drafts of their papers on the web or give talks on their research ideas.

Information for Authors of Accepted Papers

  • As a condition of acceptance, final versions of all papers must adhere to the new ACM Small format. The page limit for the final versions of papers will be increased by two pages to help authors respond to reviewer comments and mandatory revisions: 27 pages plus bibliography for a regular paper or Functional Pearl, 14 pages plus bibliography for an Experience Report.

  • Authors of accepted submissions will be required to agree to one of the three ACM licensing options, one of which is Creative Commons CC-BY publication; this is the option recommended by the PACMPL editorial board. A reasoned argument in favour of this option can be found in the article Why CC-BY? published by OASPA, the Open Access Scholarly Publishers Association. The other options are copyright transfer to ACM or retaining copyright but granting ACM exclusive publication rights.

  • PACMPL is a Gold Open Access journal, and authors are encouraged to publish their work under a CC-BY license. Gold Open Access guarantees permanent free online access to the definitive version in the ACM Digital Library, and the recommended CC-BY option also allows anyone to copy and distribute the work with attribution. Gold Open Access has been made possible by generous funding through ACM SIGPLAN, which will cover all open access costs in the event authors cannot. Authors who can cover the costs may do so by paying an Article Processing Charge (APC). PACMPL, SIGPLAN, and ACM Headquarters are committed to exploring routes to making Gold Open Access publication both affordable and sustainable.

  • ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of an ACM article should reduce user confusion over article versioning. After an article has been published and assigned to the appropriate ACM Author Profile pages, authors should visit http://www.acm.org/publications/acm-author-izer-service to learn how to create links for free downloads from the ACM DL.

  • The official publication date is the date the papers are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work.

  • Authors of each accepted submission are invited to attend in person and be available for the presentation of that paper at the conference. The schedule for presentations will be determined and shared with authors after the full program has been selected. Presentations will be broadcast, videotaped and released online if the presenter consents.

    • Because the future is uncertain, we are planning for and will support remote on-line presentation of talks. However, we urge the authors to use this option only when they have good reasons for not being able to attend in person. It is not meant, e.g., to excuse cases where authors find themselves double-booked with other meetings (so, at the time of submitting a paper, please do keep the days of the conference reserved on at least one author’s calendar).

    • There will be contingency plans for switching to a purely on-line meeting in case of wide-spread pandemic or other events that would prevent most people from attending in person.

Artifact Evaluation

Authors of papers that are conditionally accepted in the first phase of the review process will be encouraged (but not required) to submit supporting materials for Artifact Evaluation. These items will then be reviewed by an Artifact Evaluation Committee, separate from the paper Review Committee, whose task is to assess how the artifacts support the work described in the associated paper. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers will be encouraged to make the supporting materials publicly available upon publication of the papers, for example, by including them as “source materials” in the ACM Digital Library. An additional seal will mark papers whose artifacts are made available, as outlined in the ACM guidelines for artifact badging. Participation in Artifact Evaluation is voluntary and will not influence the final decision regarding paper acceptance.

Special categories of papers

In addition to research papers, PACMPL issue ICFP solicits two kinds of papers that do not require original research contributions: Functional Pearls, which are full papers, and Experience Reports, which are limited to half the length of a full paper. Authors submitting such papers should consider the following guidelines.

Functional Pearls

A Functional Pearl is an elegant essay about something related to functional programming. Examples include, but are not limited to:

  • a new and thought-provoking way of looking at an old idea
  • an instructive example of program calculation or proof
  • a nifty presentation of an old or new data structure
  • an interesting application of functional programming techniques
  • a novel use or exposition of functional programming in the classroom

While pearls often demonstrate an idea through the development of a short program, there is no requirement or expectation that they do so. Thus, they encompass the notions of theoretical and educational pearls.

Functional Pearls are valued as highly and judged as rigorously as ordinary papers, but using somewhat different criteria. In particular, a pearl is not required to report original research, but, it should be concise, instructive, and entertaining. A pearl is likely to be rejected if its readers get bored, if the material gets too complicated, if too much-specialized knowledge is needed, or if the writing is inelegant. The key to writing a good pearl is polishing.

A submission that is intended to be treated as a pearl must be marked as such on the submission web page and should contain the words “Functional Pearl” somewhere in its title or subtitle. These steps will alert reviewers to use the appropriate evaluation criteria. Pearls will be combined with ordinary papers, however, for the purpose of computing the conference’s acceptance rate.

Experience Reports

The purpose of an Experience Report is to describe the experience of using functional programming in practice, whether in industrial application, tool development, programming education, or any other area.

Possible topics for an Experience Report include, but are not limited to: * insights gained from real-world projects using functional programming * comparison of functional programming with conventional programming in the context of an industrial project or a university curriculum * project-management, business, or legal issues encountered when using functional programming in a real-world project * curricular issues encountered when using functional programming in education * real-world constraints that created special challenges for an implementation of a functional language or for functional programming in general

An Experience Report is distinguished from a normal PACMPL issue ICFP paper by its title, by its length, and by the criteria used to evaluate it.

  • Both in the papers and in any citations, the title of each accepted Experience Report must end with the words “(Experience Report)” in parentheses. The acceptance rate for Experience Reports will be computed and reported separately from the rate for ordinary papers.
  • Experience Report submissions can be at most 12 pages long, excluding bibliography.
  • Each accepted Experience Report will be presented at the conference, but depending on the number of Experience Reports and regular papers accepted, authors of Experience Reports may be asked to give shorter talks.
  • Because the purpose of Experience Reports is to enable our community to understand the application of functional programming, an acceptable Experience Report need not add to the body of knowledge of the functional-programming community by presenting novel results or conclusions. It is sufficient if the Report describes an illuminating experience with functional programming, or provide evidence for a clear thesis about the use of functional programming. The experience or thesis must be relevant to ICFP, but it need not be novel.

The review committee will accept or reject Experience Reports based on whether they judge the paper to illuminate some aspect of the use of functional programming. Anecdotal evidence will be acceptable provided it is well-argued and the author explains what efforts were made to gather as much evidence as possible. Typically, more convincing papers show how functional programming was used than from papers that only say that functional programming was used. The most convincing Experience Reports often include comparisons of situations before and after the introduction or discontinuation of functional programming. Experience drawn from a single person’s experience may be sufficient, but more weight will be given to evidence drawn from the experience of groups of people.

An Experience Report should be short and to the point: it should make a claim about how well functional programming worked on a particular project and why, and it should produce evidence to substantiate this claim. If functional programming worked in this case in the same ways it has worked for others, the paper need only summarize the results — the main part of the paper should discuss how well it worked and in what context. Most readers will not want to know all the details of the project and its implementation, but the paper should characterize the project and its context well enough so that readers can judge to what degree this experience is relevant to their own projects. The paper should take care to highlight any unusual aspects of the project. Specifics about the project are more valuable than generalities about functional programming.

If the paper not only describes experience but also presents new technical results, or if the experience refutes cherished beliefs of the functional-programming community, it may be better to submit it as a full paper, which will be judged by the usual criteria of novelty, originality, and relevance. The principal editor will be happy to advise on any concerns about which category to submit to.