Bidirectional ty** combines two modes of ty**: type checking, which checks that a
program satisfies a known type, and type synthesis, which determines a type from the …

The intuitionistic modal logic of necessity is based on the judgmental notion of categorical
truth. In this article we investigate the consequences of relativizing these concepts to …

Since Juan Uriagereka originated the multiple spell-out model in 1999 it has been one of the
most influential lines of research in syntactic theorizing. The model simplified a crucial …

Session-typed languages building on the Curry-Howard isomorphism between linear logic
and session-typed communication guarantee session fidelity and deadlock freedom …

Higher-order abstract syntax (HOAS) is a simple, powerful technique for implementing object
languages, since it directly supports common and tricky routines dealing with variables, such …

The LF logical framework codifies a methodology for representing deductive systems, such
as programming languages and logics, within a dependently typed λ-calculus. In this …

We define a general framework that abstracts the common features of many intuitionistic
substructural and modal logics/type theories. The framework is a sequent calculus/normal …

We describe a denotational model of higher-order functional reactive programming using
ultra metric spaces and non expansive maps, which provide a natural Cartesian closed …

We present the propositional fragment CLF 0 of the Concurrent Logical Framework (CLF).
CLF extends the Linear Logical Framework to allow the natural representation of concurrent …

Producing and checking proofs from SMT solvers is currently the most feasible method for
achieving high confidence in the correctness of solver results. The diversity of solvers and …