We develop a polarised variant of Curien and Herbelin's ̄λμ̃μ calculus suitable for sequent
calculi that admit a focalising cut elimination (ie whose proofs are focalised when cut-free) …

Bidirectional typechecking, in which terms either synthesize a type or are checked against a
known type, has become popular for its applicability to a variety of type systems, its error …

We present a straightforward, sound, Hindley–Milner polymorphic type system for algebraic
effects and handlers in a call-by-value calculus, which, to our surprise, allows type variable …

We present a new type system for verifying the security of reference implementations of
cryptographic protocols written in a core functional programming language. The type system …

We present a logically principled foundation for systematizing, in a way that works with any
computational effect and evaluation order, SMT constraint generation seen in refinement …

We present a new type system for verifying the security of cryptographic protocol
implementations. The type system combines prior work on refinement types, with union …

Terms are a concise representation of tree structures. Since they can be naturally defined by
an inductive type, they offer data structures in functional programming and mechanised …

This paper studies the complexity of the reachability problem (a typical and practically
important instance of the model-checking problem) for simply-typed call-by-value programs …

In this paper we propose a new approach to realizability interpretations for nonstandard
arithmetic. We deal with nonstandard analysis in the context of (semi) intuitionistic …

Traditional Gödel completeness holds between finite proofs and infinite models over
formulas of finite depth, where proofs and models are heterogeneous. Our purpose is to …