Abstract The Thousands of Problems for Theorem Provers (TPTP) problem library is the
basis of a well known and well established infrastructure that supports research …

This text develops a comprehensive theory of programming languages based on type
systems and structural operational semantics. Language concepts are precisely defined by …

Adaptivity is a dynamical feature that is omnipresent in nature, socio-economics, and
technology. For example, adaptive couplings appear in various real-world systems, such as …

Gradually typed languages are designed to support both dynamically typed and statically
typed programming styles while preserving the benefits of each. While existing gradual type …

We present calf, ac ost-a ware l ogical f ramework for studying quantitative aspects of
functional programs. Taking inspiration from recent work that reconstructs traditional aspects …

We formalize the soundness theorem for differential dynamic logic, a logic for verifying
hybrid systems. To increase confidence in the formalization, we present two versions: one in …

We present a dependent type theory organized around a Cartesian notion of cubes (with
faces, degeneracies, and diagonals), supporting both fibrant and non-fibrant types. The …

Mechanical reasoning is a key area of research that lies at the crossroads of mathematical
logic and artificial intelligence. The main aim to develop mechanical reasoning systems …

Formal constructive type theory has proved to be an effective language for mechanized
proof. By avoiding non-constructive principles, such as the law of the excluded middle, type …

This paper presents a formalization of Nuprl's metatheory in Coq. It includes a nominal-style
definition of the Nuprl language, its reduction rules, a coinductive computational …