We propose to unify the treatment of a broad range of modalities in typed lambda calculi. We
do so by defining a generic structure of modalities, and show that this structure arises …

Formalising metatheory in the Coq proof assistant is tedious as reasoning with binders
without native support requires a lot of uninteresting technicalities. To relieve users from so …

We implement two versions of a simple but illustrative smart contract: one in Solidity on the
Ethereum blockchain platform, and one in Plutus on the Cardano platform, with annotated …

Specifying and mechanically verifying type safe programming languages requires significant
effort. This effort can in theory be reduced by defining and reusing pre-verified, modular …

We propose a new collection of benchmark problems in mechanizing the metatheory of
programming languages, in order to compare and push the state of the art of proof …

This paper is a contribution to the meta-theory of systems featuring syntax with bindings,
such as 𝜆-calculi and logics. It provides a general criterion that targets inductively defined …

Type inference is essential for statically-typed languages such as OCaml and Haskell. It can
be decomposed into two (possibly interleaved) phases: a generator converts programs to …

In previous work (" From signatures to monads in UniMath"), we described a category-
theoretic construction of abstract syntax from a signature, mechanized in the UniMath library …

By abstracting over well-known properties of De Bruijn's representation with nameless
dummies, we design a new theory of syntax with variable binding and capture-avoiding …

Session Types offer a typing discipline that allows protocol specifications to be used during
type-checking, ensuring that implementations adhere to a given specification. When looking …