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 …

Abstract Development of formal proofs of correctness of programs can increase actual and
perceived reliability and facilitate better understanding of program specifications and their …

Recent years have seen remarkable successes in rigorous engineering: using
mathematically rigorous semantic models (not just idealised calculi) of real-world …

The introduction of first-class type classes in the Coq system calls for a re-examination of the
basic interfaces used for mathematical formalisation in type theory. We present a new set of …

Abstract Mathematics is a ubiquitous foundation of science, technology, and engineering.
Specific areas of mathematics, such as numeric and symbolic computation or logics, enjoy …

Matita is an interactive theorem prover being developed by the Helm team at the University
of Bologna. Its stable version 0.5. x may be downloaded at http://matita. cs. unibo. it. The tool …

Floating point operations are fast, but require continuous effort on the part of the user in
order to ensure that the results are correct. This burden can be shifted away from the user by …

Historically, the LCF tradition of interactive theorem proving was tied to the read-eval-print
loop, with sequential and synchronous evaluation of prover commands given on the …

The paper describes the refinement algorithm for the Calculus of (Co) Inductive
Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement …

After several decades, most proof assistants are still centered around TTY-based interaction
in a tight read-eval-print loop. Even well-known Emacs modes for such provers follow this …