21:45

Familial Monads and Structural Operational Semantics

22:44

Exceptional Asynchronous Session Types: Session Types without Tiers

22:12

Exploring C Semantics and Pointer Provenance

19:36

Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis

19:06

Efficient Parameterized Algorithms for Data Packing

22:36

Efficient Automated Repair of High Floating-Point Errors in Numerical Libraries

23:13

Dynamic Type Inference for Gradual Hindley–Milner Typing

21:39

Diagrammatic Algebra: From Linear to Concurrent Systems

22:11

Distributed Programming using Role-Parametric Session Types in Go

21:26

Definitional Proof-Irrelevance without K

23:04

A True Positives Theorem for a Static Race Detector

21:29

Better Late Than Never: A Fully Abstract Semantics for Classical Processes

20:21

Bindings as Bounded Natural Functors

21:21

A Domain Theory for Statistical Probabilistic Programming

20:55

code2vec: Learning Distributed Representations of Code

21:43

An Abstract Stack Based Approach to Verified Compositional Compilation to Machine Code

22:15

Constructing Quotient Inductive-Inductive Types

23:29

Bayesian Synthesis of Probabilistic Programs for Automatic Data Modeling

20:13

A Verified, Efficient Embedding of a Verifiable Assembly Language

19:02

Decision Procedures for Path Feasibility of String-Manipulating Programs with Complex Operations

21:58

Abstracting Algebraic Effects

22:05

Abstracting Extensible Data Types; Or, Rows By Any Other Name

22:45

A²I: Abstract² Interpretation

23:05

Bounded Model Checking of Signal Temporal Logic Properties Using Syntactic Separation

20:52

Bridging the Gap Between Programming Languages and Hardware Weak Memory Models

20:27

A Separation Logic for Concurrent Randomized Programs

25:53

Categorical Combinatorics of Scheduling and Synchronization in Game Semantics

20:00

Context-, Flow- and Field-Sensitive Data-Flow Analysis using Synchronized Pushdown Systems

20:26

CSS Minification via Constraint Solving

22:55

A Calculus for Esterel: If can, can. If no can, no can.

20:28

CT-Wasm: Type-Driven Secure Cryptography for the Web Ecosystem

23:35

Adventures in Monitorability: From Branching to Linear Time and Back Again

54:08

Automated Fault-Finding and Fixing at Facebook

21:51

Decidable Verification of Uninterpreted Programs

22:16

Bisimulation as Path Type for Guarded Recursive Types

22:50

An Abstract Domain for Certifying Neural Networks

22:16

Closed Forms for Numerical Loops

21:21

Concerto: A Framework for Combined Concrete and Abstract Interpretation

29:15

Microsoft Research: Engage, Verify, Open

21:35

FrAngel: Component-Based Synthesis with Control Structures

23:15

Fixpoint Games on Continuous Lattices

23:25

LWeb: Information Flow Security for Multi-Tier Web Applications

21:49

Grounding Thin-Air Reads with Event Structures

20:49

Higher Inductive Types in Cubical Computational Type Theory

15:18

NSF funding for PL

24:53

Less is More: Multiparty Session Types Revisited

21:24

From Fine- to Coarse-Grained Dynamic Information Flow Control and Back

23:34

Interconnectability of Session-Based Logical Processes

21:40

Formal Verification of Higher-Order Probabilistic Programs

25:41

Live Functional Programming with Typed Holes

24:12

ISA Semantics for ARMv8-A, RISC-V, and CHERI-MIPS

23:01

Fully Abstract Module Compilation

22:39

On Library Correctness under Weak Memory Consistency

21:53

Gradual Parametricity, Revisited

22:49

Gradual Typing: A New Perspective

14:01

State of SIGPLAN

18:59

Iron: Managing Obligations in Higher-Order Concurrent Separation Logic

19:31

Game Semantics for Quantum Programming

22:34

Gradual Type Theory

22:37

Modular Quantitative Monitoring