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 …

Dependent type theories are a family of logical systems that serve as expressive functional
programming languages and as the basis of many proof assistants. In the past decade, type …

Distributed programs are known to be extremely difficult to implement, test, verify, and
maintain. This is due in part to the large number of possible unforeseen interactions among …

This papers extends the Nuprl proof assistant (a system representative of the class of
extensional type theories a la Martin-Lof) with named exceptions and handlers, as well as a …

Distributed programs are known to be extremely difficult to implement, test, verify, and
maintain. This is due in part to the large number of possible unforeseen interactions among …

This paper extends the Nuprl proof assistant (a system representative of the class of
extensional type theories with dependent types) with named exceptions and handlers, as …

We present an extension of the computation system and logic of the Nuprl proof assistant
with intuitionistic principles, namely versions of Brouwer's bar induction principle, which is …

A small core type language with intersection types in which a partial equivalence relation on
closed terms is a type is enough to build the non-inductive types of Nuprl, including the types …

Building a verified proof assistant entails implementing and mechanizing the concept of a
library, as well as adding support for standard manipulations on it. In this work we develop …

Powerful yet effective induction principles play an important role in computing, being a
paramount component of programming languages, automated reasoning, and program …