Write a Blog >>
POPL 2021
Sun 17 - Fri 22 January 2021 Online

Continuing the tradition of previous years, POPL 2021 will host a set of tutorials ranging on different topics relevant to the POPL community.

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

Mon 18 Jan

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

15:30 - 16:00
15:30
30m
Social Event
Topic Oriented Discussions
Workshops and Co-located Events

16:00 - 17:30
16:00
90m
Tutorial
[T1] The Current State of Automatic Differentiation
TutorialFest
Barak A. Pearlmutter Maynooth University
16:00 - 17:30
16:00
90m
Tutorial
[T2] Liquid Haskell: Refinement Type Checker for Haskell
TutorialFest
Niki Vazou IMDEA Software Institute, Andres Löh Well-Typed LLP
16:00 - 17:30
16:00
90m
Tutorial
[T3] Dynamic Data-Race Prediction : Fundamentals, Theory and Practice
TutorialFest
Umang Mathur University of Illinois at Urbana-Champaign, Andreas Pavlogiannis Aarhus University
Pre-print Media Attached File Attached
17:30 - 18:00
17:30
30m
Break
Monday Coffee Break 2
Workshops and Co-located Events

18:00 - 19:30
18:00
90m
Tutorial
[T4] Iris – A Modular Foundation for Higher-Order Concurrent Separation Logic
TutorialFest
Tej Chajed Massachusetts Institute of Technology, USA, Ralf Jung MPI-SWS, Joseph Tassarotti Boston College
Link to publication
19:30 - 20:00
19:30
30m
Social Event
Monday Shuffle-Space Time
Workshops and Co-located Events

Call for Tutorials

                   CALL FOR TUTORIALS

                        POPL 2021

          48th ACM SIGPLAN-SIGACT  Symposium on
           Principles of Programming Languages

                POPL: 20 - 22 January 2021
       Affiliated Events: 17-19 January 2021
       		 Venue: Online

              https://popl21.sigplan.org/

The 48th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2021) will be held online.

POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions.

Tutorials for POPL 2021 are solicited on any topic relevant to the POPL community. We are particularly encouraging submissions of introductory tutorials that make the research presented at POPL more accessible to the participants.

Tutorials will be held on Monday January 18, 2021 (two days before the main conference and the day before PLMW). The expected length of a tutorial is 3 hours, including questions and discussion (Q&A).

Due to the pandemic and POPL being held online, the tutorials will be online only. The presenter should divide the tutorials into smaller parts, followed by a Q&A session after each such part to answer the questions from the audience. If a tutorial is prerecorded, participants will be given the opportunity to post questions; the presenter will answer these questions during the live Q&A session. The Q&A session will be recorded.

Submission details

  • Deadline for submission: 28 October 2020
  • Notification of acceptance: 4 November 2020

A tutorial proposal should provide the following information.

  • Tutorial title
  • Presenter(s), affiliation(s), and contact information
  • 1-3 page description (for evaluation). This should include the objectives, topics to be covered, presentation approach, target audience, prerequisite knowledge, and if the tutorial was previously held, the location (i.e. which conference), date, and number of attendees if available.
  • 1-2 paragraph abstract suitable for tutorial publicity.
  • 1 paragraph biography suitable for tutorial publicity.

Proposal must be submitted in pdf or txt form by email to the associated events chairs Jan Hoffmann (jhoffmann@cmu.edu) and Ruzica Piskac (ruzica.piskac@yale.edu).

Further information

Any query regarding POPL 2021 tutorial proposals should be addressed to the associated events chairs Jan Hoffmann (jhoffmann@cmu.edu) and Ruzica Piskac (ruzica.piskac@yale.edu).