We present an approach to enriching the type system of ML with a restricted form of
dependent types, where type index objects are drawn from a constraint domain C, leading to …

Although active networks have generated much debate in the research community, on the
whole there has been little hard evidence to inform this debate. This paper aims to redress …

This book can mark the coming of age of automated theorem proving (ATP). The process to
maturity has been a continuum, as it is for humans, but this book serves to mark the …

This thesis describes the design of a meta-logical framework that supports the
representation and verification of deductive systems, its implementation as an automated …

For twenty years the Nuprl (“new pearl”) system has been used to develop software systems
and formal theories of computational mathematics. It has also been used to explore and …

Although building systems from components has attractions, this approach also has
problems. Can we be sure that a certain configuration of components is correct? Can it …

We present an approach to enriching the type system of ML with a restricted form of
dependent types, where type index terms are required to be drawn from a given type index …

The Horus and Ensemble efforts culminated a multi-year Cornell research program in
process group communication used for fault-tolerance, security and adaptation. Our intent …

This is a brief update on the Tps automated theorem proving system for classical type theory,
which was described in [3]. Manuals and information about obtaining Tps can be found at …

The Nuprl system is a framework for reasoning about mathematics and programming. Over
the years its design has been substantially improved to meet the demands of large-scale …