paperbot · PL 论文追踪

Verified low-level programming embedded in F*

Kami: a platform for high-level parametric hardware specification and its modular verification

Modalities in homotopy type theory

Towards a Compiler for Reals

A metaprogramming framework for formal verification

Knowledge Transfer from High-Resource to Low-Resource Programming Languages for Code LLMs

WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models

Don’t Sit on the Fence

Matching Logic

Manifest sharing with session types

On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control

Encoding Monomorphic and Polymorphic Types

Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs

A Principled Approach to Selective Context Sensitivity for Pointer Analysis

Dynamic Choreographies: Theory And Implementation

Theorems for free for free: parametricity, with and without types

Allo: A Programming Model for Composable Accelerator Design

Gradual typing with union and intersection types

A specification for dependent types in Haskell

Model Checking Spatial Logics for Closure Spaces

Achieving high-performance the functional way: a functional pearl on expressing high-performance optimizations as rewrite strategies

A relational logic for higher-order programs

Abstracting definitional interpreters (functional pearl)

Parametric quantifiers for dependent type theory

RefinedRust: A Type System for High-Assurance Verification of Rust Programs

Obsidian

Type-Driven Development with Idris

Reasoning about Strategies: on the Satisfiability Problem

Games and Strategies as Event Structures

From Clarity to Efficiency for Distributed Algorithms

Build systems à la carte: Theory and practice

A unified view of modalities in type systems

Sound Non-Statistical Clustering of Static Analysis Alarms

A framework for adaptive differential privacy

Program sketching with live bidirectional evaluation

Deriving Probability Density Functions from Probabilistic Functional Programs

Completeness of the ZX-Calculus

Notions of Anonymous Existence in Martin-L\"of Type Theory

Doo bee doo bee doo

On polymorphic gradual typing

Automata for Specifying and Orchestrating Service Contracts

Coalgebraic trace semantics via forgetful logics

A Recipe for State-and-Effect Triangles

Flexible dynamic information flow control in the presence of exceptions

Compiling to categories

Dual-Context Calculi for Modal Logic

Language Preservation Problems in Parametric Timed Automata

Effekt: Capability-passing style for type- and effect-safe, extensible effect handlers in Scala

Retrofitting parallelism onto OCaml

Asynchronous Distributed Execution Of Fixpoint-Based Computational Fields