1:37

Our Favorite Things

ACM SIGPLAN

13:21

Client-Server Sessions in Linear Logic

ACM SIGPLAN

13:46

Modular, Compositional, and Executable Formal Semantics for LLVM IR

ACM SIGPLAN

13:50

Algebras for Weighted Search

ACM SIGPLAN

13:59

Reasoning about Effect Interaction by Fusion

ACM SIGPLAN

13:32

Deriving Efficient Program Transformations from Rewrite Rules

ACM SIGPLAN

13:59

Automatic Amortized Resource Analysis with the Quantum Physicist’s Method

ACM SIGPLAN

12:57

Contextual Modal Types for Algebraic Effects and Handlers

ACM SIGPLAN

13:45

Catala: A Programming Language for the Law

ACM SIGPLAN

11:48

Symbolic and Automatic Differentiation of Languages

ACM SIGPLAN

14:00

Propositions-as-Types and Shared State

ACM SIGPLAN

14:01

Theorems for Free from Separation Logic Specifications

ACM SIGPLAN

14:00

Reasoning about the Garden of Forking Paths

ACM SIGPLAN

13:02

Calculating Dependently-Typed Compilers (Functional Pearl)

ACM SIGPLAN

13:57

Grafs: Declarative Graph Analytics

ACM SIGPLAN

14:00

Certifying the Synthesis of Heap-Manipulating Programs

ACM SIGPLAN

13:53

Steel: Proof-Oriented Programming in a Dependently Typed Concurrent Separation Logic

ACM SIGPLAN

13:48

Compositional Optimizations for CertiCoq

ACM SIGPLAN

13:32

On Continuation-Passing Transformations and Expected Cost Analysis

ACM SIGPLAN

13:54

Getting to the Point: Index Sets and Parallelism-Preserving Autodiff for Pointful Array Programming

ACM SIGPLAN

13:59

Distributing Intersection and Union Types with Splits and Duality (Functional Pearl)

ACM SIGPLAN

13:55

ProbNV: Probabilistic Verification of Network Control Planes

ACM SIGPLAN

13:32

Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations

ACM SIGPLAN

14:03

Skipping the Binder Bureaucracy with Mixed Embeddings in a Semantics Course (Functional Pearl)

ACM SIGPLAN

13:58

GhostCell: Separating Permissions from Data in Rust

ACM SIGPLAN

13:49

Higher-Order Probabilistic Adversarial Computations: Categorical Semantics and Program Logics

ACM SIGPLAN

13:58

CPS Transformation with Affine Types for Call-By-Value Implicit Polymorphism

ACM SIGPLAN

13:18

Newly-Single and Loving It: Improving Higher-Order Must-Alias Analysis with Heap Fragments

ACM SIGPLAN

14:01

Proof-Directed Program Transformation: A Functional Account of Efficient Regular-Expression Matching

ACM SIGPLAN

13:28

Typed Dataspace Actors

ACM SIGPLAN

12:50

⩧ ≅ ≡: Leibniz Equality is Isomorphic to Martin-Löf Identity, Parametrically

ACM SIGPLAN

13:56

How to Design Co-Programs

ACM SIGPLAN

14:57

Of JavaScript AOT Compilation Performance

ACM SIGPLAN

14:00

Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model

ACM SIGPLAN

10:13

How to Evaluate Blame for Gradual Types

ACM SIGPLAN

13:19

An Order-Aware Dataflow Model for Parallel Unix Pipelines

ACM SIGPLAN

13:59

Persistent Software Transactional Memory in Haskell

ACM SIGPLAN

14:01

A Theory of Higher-Order Subtyping with Type Intervals

ACM SIGPLAN

13:54

An Existential Crisis Resolved: Type Inference for First-Class Existential Types

ACM SIGPLAN

14:01

Generalized Evidence Passing for Effect Handlers: Efficient Compilation of Effect Handlers to C

ACM SIGPLAN

1:02:38

Building PL-Powered Systems for Humans

ACM SIGPLAN

1:00:51

Fun, Funky, Functional: The Pursuit of Better User Interfaces for Programming

ACM SIGPLAN