Inductive datatypes provide mechanisms to define finite data such as finite lists and trees via
constructors and allow programmers to analyze and manipulate finite data via pattern …

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 …

An old and celebrated analogy says that writing programs is like proving theorems. This
analogy has been productive in both directions, but in particular has demonstrated …

The typed merge operator offers the promise of a compositional style of statically-typed
programming in which solutions to the expression problem arise naturally. This approach …

Focusing, introduced by Jean-Marc Andreoli in the context of classical linear logic [Andreoli
1992], defines a normal form for sequent calculus derivations that cuts down on the number …

We introduce layering to modal type theory to combine type theory with intensional analysis.
In particular, we demonstrate this idea by develo** a 2-layered modal type theory. At the …

Focusing is a general technique for syntactically compartmentalizing the non-deterministic
choices in a proof system, which not only improves proof search but also has the …

We study the question of whether a given type has a unique inhabitant modulo program
equivalence. In the setting of simply-typed lambda-calculus with sums, equipped with the …

14. ABSTRACT A logical framework and its implementation should serve as a flexible tool
for specifying, simulating, and reasoning about formal systems. When the formal systems we …

In a dependently typed language, we can guarantee correctness of our programs by
providing formal proofs. To check them, the typechecker elaborates these programs and …