The paper proposes Fresco, a novel bidirectional type inference approach for first-class polymorphism that enables local type information to flow back and forth between functions and arguments.

The paper proposes integrating dependent pattern matching into the unification process in dependently typed languages to synthesize functions defined by case analysis, addressing the limitation of exi…

This paper presents Calf, a dependent type theory for cost verification, which synthesizes the physicist's and banker's views on amortized analysis using potential functions and credit annotations.

The paper introduces a new term expansion for a calculus with explicit substitutions, allowing the relation of a lambda-calculus with explicit substitutions to Boudol's resource aware lambda-calculus.

This paper provides translations between two graded coeffect systems, enabling the transfer of results and ideas between them.

This paper introduces Generalized Constraint Projection (GCP), a zero-annotation inference framework for dynamically typed languages, which separates sources of evidence for function parameters and pr…

This paper introduces the because-calculus, a calculus that structurally separates registration and attestation using dual effect rows and level-indexed typing, and proves the Conflation Theorem.

The paper proposes a generic memory framework for advanced static program analysis, supporting various memory behaviors from different programming languages using Abstract Interpretation theory.

The paper proves equivalence between big-step and small-step derivations for Horn clauses and transforms Horn clauses into equivalent sets of clauses based on the given derivation strategy.

The largest reported verification campaign for the Rust standard library is presented, integrating complementary tools and analyzing effectiveness.

FPMoE introduces a sparse Mixture-of-Experts (MoE) architecture to improve functional code generation across multiple functional programming languages, achieving state-of-the-art performance with fewe…

SEMBridge is a tagless-final framework that allows a single executable object program to generate multiple program semantics, including weakest-precondition and bounded-checking interpretations, ensur…

Kani is an open-source model checker for Rust that provides correctness guarantees for safety properties through compilation and a specification language.

ETAS is a programming language for agent systems that separates deterministic computation from agentic nondeterminism and provides a foundation for reasoning about authorization, nondeterminism, recov…

This paper proposes a method for verifying functional correctness of message-passing concurrent programs using Constrained Horn Clause (CHC) solving.

This paper presents the formal semantics for unfolding expressions and pure functions in deductive program verifiers for increased modularity.