SMT-based checking of refinement types for call-by-value languages is a well-studied
subject. Unfortunately, the classical translation of refinement types to verification conditions …

Designing efficient, application-specialized hardware accelerators requires assessing trade-
offs between a hardware module's performance and resource requirements. To facilitate …

Information-Flow Control (IFC) is a well-established approach for allowing untrusted code to
manipulate sensitive data without disclosing it. IFC is typically enforced via type systems and …

Haskell, as implemented in the Glasgow Haskell Compiler (GHC), has been adding new
type-level programming features for some time. Many of these features—generalized …

Haskell has many delightful features. Perhaps the one most beloved by its users is its type
system that allows developers to specify and verify a variety of program properties at …

This paper presents an extension to Liquid Haskell that facilitates stating and semi-
automatically proving properties of typeclasses. Liquid Haskell augments Haskell with …

Code deficiencies and bugs constitute an unavoidable part of software systems. In safety-
critical systems, like aircrafts or medical equipment, even a single bug can lead to …

We abstract the common type-and-scope safe structure from computations on λ-terms that
deliver, eg, renaming, substitution, evaluation, CPS-transformation, and printing with a name …

Haskell's type system has outgrown its Hindley-Milner roots to the extent that it now stretches
to the basics of dependently typed programming. In this paper, we collate and classify …

System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed
variant of System F with first-class type equality proofs called coercions. This extensible …