Refinement types enrich a language's type system with logical predicates that circumscribe
the set of values described by the type. These refinement predicates provide software …

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 …

Despite significant progress in the verification of hypervisors, operating systems, and
compilers, and in verification tooling, there exists a wide gap between the approaches used …

The theory of program modules is of interest to language designers not only for its practical
importance to programming, but also because it lies at the nexus of three fundamental …

This article describes REBA, a knowledge representation and reasoning architecture for
robots that is based on tightly-coupled transition diagrams of the domain at two different …

We define a general framework that abstracts the common features of many intuitionistic
substructural and modal logics/type theories. The framework is a sequent calculus/normal …

Relational program verification is a variant of program verification where one can reason
about two programs and as a special case about two executions of a single program on …

Starting from an exact correspondence between linear approximations and non-idempotent
intersection types, we develop a general framework for building systems of intersection …

The Fuzz programming language by Reed and Pierce uses an elegant linear type system
combined with a monad-like type to express and reason about probabilistic sensitivity …

Category theory is a branch of mathematics that provides a formal framework for
understanding the relationship between mathematical structures. To this end, a category not …