Principles and Applications of Refinement Types

Abstract

A refinement type {x : T | C} is the subset of the type T consisting of the values x to satisfy the formula C. In this tutorial article we explain the principles of refinement types by developing from first principles a concurrent λcalculus whose type system supports refinement types. Moreover, we describe a series of applications of our refined type theory and of related systems.