ICFP 2021
35 papers
- A theory of higher-order subtyping with type intervals
- Algebras for weighted search
- An existential crisis resolved: type inference for first-class existential types
- An order-aware dataflow model for parallel Unix pipelines
- Automatic amortized resource analysis with the Quantum physicist's method
- CPS transformation with affine types for call-by-value implicit polymorphism
- Calculating dependently-typed compilers (functional pearl)
- Catala: a programming language for the law
- Certifying the synthesis of heap-manipulating programs
- Client-server sessions in linear logic
- Compositional optimizations for CertiCoq
- Contextual modal types for algebraic effects and handlers
- Deriving efficient program transformations from rewrite rules
- Distributing intersection and union types with splits and duality (functional pearl)
- Efficient tree-traversals: reconciling parallelism and dense data representations
- Formal verification of a concurrent bounded queue in a weak memory model
- Generalized evidence passing for effect handlers: efficient compilation of effect handlers to C
- Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming
- GhostCell: separating permissions from data in Rust
- Grafs: declarative graph analytics
- Higher-order probabilistic adversarial computations: categorical semantics and program logics
- How to evaluate blame for gradual types
- Modular, compositional, and executable formal semantics for LLVM IR
- Newly-single and loving it: improving higher-order must-alias analysis with heap fragments
- Of JavaScript AOT compilation performance
- On continuation-passing transformations and expected cost analysis
- Persistent software transactional memory in Haskell
- ProbNV: probabilistic verification of network control planes
- Propositions-as-types and shared state
- Reasoning about effect interaction by fusion
- Reasoning about the garden of forking paths
- Skipping the binder bureaucracy with mixed embeddings in a semantics course (functional pearl)
- Steel: proof-oriented programming in a dependently typed concurrent separation logic
- Symbolic and automatic differentiation of languages
- Theorems for free from separation logic specifications