This article describes the development and formal verification (proof of semantic
preservation) of a compiler back-end from Cminor (a simple imperative intermediate …

Given the central role that C continues to play in systems software, and the difficulty of
writing safe and correct C code, it remains a grand challenge to develop effective formal …

We have built the first family of tagless interpretations for a higher-order typed object
language in a typed metalanguage (Haskell or ML) that require no dependent types …

We introduce System FC, which extends System F with support for non-syntactic type
equality. There are two main extensions:(i) explicit witnesses for type equalities, and (ii) …

We describe an axiomatic extension to the Coq proof assistant, that supports writing,
reasoning about, and extracting higher-order, dependently-typed programs with side-effects …

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

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 …

We have built the first family of tagless interpretations for a higher-order typed object
language in a typed metalanguage (Haskell or ML) that require no dependent types …

We describe an axiomatic extension to the Coq proof assistant, that supports writing,
reasoning about, and extracting higher-order, dependently-typed programs with side-effects …

Dependently typed languages such as Coq are used to specify and prove functional
correctness of source programs, but what we ultimately need are guarantees about …