PLMW @ POPL 2022
as the organisers put it
PLMW will take place in person in Philadelphia and feature lightweight options for remote participation to account for travel restrictions. Remote participants of PLMW will be able to view online videos of the workshop talks, access PLMW on Airmeet, and sign up for virtual mentoring sessions with experienced researchers. A number of sponsors (listed below) have generously donated scholarship funds for qualified students to attend PLMW. These scholarships cover expenses (airfare, hotel, and registration fees) for selected participants at both the workshop and the POPL conference. Attendin ...
who it's for
programming languages researchers, PhD students, early-career researchers, language implementers, formal verification engineers, research supervisors
topics
mental health interventions in CS; long-term mentoring programs; writing persuasive PL papers; Rust-like language prototypes; WebAssembly live playgrounds; incremental compilers with salsa ideas; PLT Redex semantics exploration; co-algebra and OCaml extensions; synthesising imperative programs (SuSLik); Coq separation-logic certificates
| title | author | length |
|---|---|---|
| You and Your Environment | Talia Ringer | 43m |
Talk argues mental health arises from the interaction between individual traits and the environment and lists concrete remedies: medication plus therapy can… | ||
| Implementing Languages for Fun and Profit | Niko Matsakis | 42m |
Built a small Rust-like language called Dada and a live web playground compiled to WebAssembly that continues running despite parse errors, letting users edit… | ||
| Writing Valuable Papers | Liam O'Connor | 36m |
Advice: write to persuade the programming‑languages community that a real problem exists, that it imposes a measurable cost, and that the proposed solution… | ||
| Finding a research topic (or being found by a research topic?) | Alexandra Silva | 39m |
Chronicles a research path that starts with an undergraduate project on the compfish framework and evolves through four years of co-algebra, a postdoc building… | ||
| Automatically Synthesising Programs that We Can Trust | Ilya Sergey | 38m |
Claims an automated synthesiser called SuSLik generates imperative C-like programs plus machine checkable proofs and that those proofs are verifiable in Coq… | ||
| nothing matches | ||