Differential privacy offers a way to answer queries about sensitive information while
providing strong, provable privacy guarantees, ensuring that the presence or absence of a …

The implementation and semantics of dependent type theories can be studied in a syntax-
independent way: the objective metatheory of dependent type theories exploits the universal …

Work to date on combining linear types and dependent types has deliberately and
successfully avoided doing so. Entirely fit for their own purposes, such systems wisely insist …

We prove normalization for MTT, a general multimodal dependent type theory capable of
expressing modal type theories for guarded recursion, internalized parametricity, and …

We consider the problem of reconciling a dependently typed functional language with
imperative features such as mutable higher-order state, pointer aliasing, and …

We present an internal language with equivalent expressive power to Standard ML, and
discuss its formalization in LF and the machine-checked verification of its type safety in …

In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-
order functions, dependent types and Hoare Logic specifications into a unified framework …

Bidirectional typechecking, in which terms either synthesize a type or are checked against a
known type, has become popular for its scalability (unlike Damas-Milner type inference …

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

In this paper, we show how to integrate linear types with type dependency, by extending the
linear/non-linear calculus of Benton to support type dependency. Next, we give an …