Results 1 
8 of
8
A web interface for matita
 In Proceedings of Intelligent Computer Mathematics (CICM 2012
"... This article describes a prototype implementation of a web interface for the Matita proof assistant [2]. The motivations behind our work are similar to those of several recent, related efforts [7, 9, 1, 8] (see also [6]). In particular: 1. creation of a web collaborative working environment for inte ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This article describes a prototype implementation of a web interface for the Matita proof assistant [2]. The motivations behind our work are similar to those of several recent, related efforts [7, 9, 1, 8] (see also [6]). In particular: 1. creation of a web collaborative working environment for interactive theorem proving, aimed at fostering knowledgeintensive cooperation, content creation and management; 2. exploitation of the markup in order to enrich the document with several kinds of annotations or active elements; annotations may have both a presentational/hypertextual nature, aimed to improve the quality of the proof script as a human readable document, or a more semantic nature, aimed to help the system in its processing (or reprocessing) of the script; 3. platform independence with respect to operating systems, and wider accessibility also for users using devices with limited resources; 4. overcoming the installation issues typical of interactive provers, also in view of attracting a wider audience, especially in the mathematical community.
Formalizing Turing Machines
"... Abstract. We discuss the formalization, in the Matita Theorem Prover, of a few, basic results on Turing Machines, up to the existence of a (certified) Universal Machine. The work is meant to be a preliminary step towards the creation of a formal repository in Complexity Theory, and is a small piece ..."
Abstract
 Add to MetaCart
Abstract. We discuss the formalization, in the Matita Theorem Prover, of a few, basic results on Turing Machines, up to the existence of a (certified) Universal Machine. The work is meant to be a preliminary step towards the creation of a formal repository in Complexity Theory, and is a small piece in our Reverse Complexity program, aiming to a comfortable, machine independent axiomatization of the field. 1
Rating Disambiguation Errors ⋆
"... Abstract. Ambiguous notation is a powerful tool developed to deal with the complexity of mathematics without sacrificing clarity or conciseness. In the mechanized parsing of ambiguous terms, a disambiguation algorithm can be used to provide the system with the intelligence necessary to select valid ..."
Abstract
 Add to MetaCart
Abstract. Ambiguous notation is a powerful tool developed to deal with the complexity of mathematics without sacrificing clarity or conciseness. In the mechanized parsing of ambiguous terms, a disambiguation algorithm can be used to provide the system with the intelligence necessary to select valid interpretations for the overloaded symbols received in input. Disambiguation works by means of an incremental analysis of the input term, progressively discarding all invalid interpretations. As a result, if the input term cannot be disambiguated, many errors will be produced, only a handful of which are truly meaningful to the user. In this paper, we improve the existing technique to classify disambiguation errors by introducing a new heuristic to sort errors from the most meaningful to the least, showing that it can be implemented in a natural way in the existing disambiguation algorithm. We also describe a neat interface to present disambiguation errors to the user, suitable for the use in interactive theorem proving applications. 1
Type Systems for Dummies
"... We extend Pure Type Systems with a function turning each term M of type A into a dummy ∣M ∣ of the same type ( ∣ ⋅ ∣ is not an identity, in that M ≠ ∣M∣). Intuitively, a dummy represents an unknown, canonical object of the given type: dummies are opaque (cannot be internally inspected), and irrele ..."
Abstract
 Add to MetaCart
We extend Pure Type Systems with a function turning each term M of type A into a dummy ∣M ∣ of the same type ( ∣ ⋅ ∣ is not an identity, in that M ≠ ∣M∣). Intuitively, a dummy represents an unknown, canonical object of the given type: dummies are opaque (cannot be internally inspected), and irrelevant in the sense that dummies of a same type are convertible to each other. This latter condition makes convertibility in PTS with dummies (DPTS) stronger than usual, hence raising not trivial consistency issues. DPTS offer an alternative approach to (proof) irrelevance, tagging irrelevant information at the level of terms and not of types, and avoiding the annoying syntactical duplication of products, abstractions and applications into an explicit and an implicit version, typical of systems like ICC ∗. Categories and Subject Descriptors F.4.1 [Mathematical Logic
A proof of Bertrand’s postulate
"... We discuss the formalization, in the Matita Interactive Theorem Prover, of some results by Chebyshev concerning the distribution of prime numbers, subsuming, as a corollary, Bertrand’s postulate. Even if Chebyshev’s result has been later superseded by the stronger prime number theorem, his machinery ..."
Abstract
 Add to MetaCart
We discuss the formalization, in the Matita Interactive Theorem Prover, of some results by Chebyshev concerning the distribution of prime numbers, subsuming, as a corollary, Bertrand’s postulate. Even if Chebyshev’s result has been later superseded by the stronger prime number theorem, his machinery, and in particular the two functions ψ and θ still play a central role in the modern development of number theory. The proof makes use of most part of the machinery of elementary arithmetics, and in particular of properties of prime numbers, gcd, products and summations, providing a natural benchmark for assessing the actual development of the arithmetical knowledge base. 1.
The Strategy Challenge in SMT Solving
"... Abstract. Highperformance SMT solvers contain many tightly integrated, handcrafted heuristic combinations of algorithmic proof methods. While these heuristic combinations tend to be highly tuned for known classes of problems, they may easily perform badly on classes of problems not anticipated by ..."
Abstract
 Add to MetaCart
Abstract. Highperformance SMT solvers contain many tightly integrated, handcrafted heuristic combinations of algorithmic proof methods. While these heuristic combinations tend to be highly tuned for known classes of problems, they may easily perform badly on classes of problems not anticipated by solver developers. This issue is becoming increasingly pressing as SMT solvers begin to gain the attention of practitioners in diverse areas of science and engineering. We present a challenge to the SMT community: to develop methods through which users can exert strategic control over core heuristic aspects of SMT solvers. We present evidence that the adaptation of ideas of strategy prevalent both within the Argonne and LCF theorem proving paradigms can go a long way towards realizing this goal. Prologue. Bill McCune, Kindness and Strategy, by Grant Passmore I would like to tell a short story about Bill, of how I met him, and one way his work and kindness impacted my life.
Simple simpl
"... Abstract. We report on a new implementation of a reduction strategy in Coq to simplify terms during interactive proofs. By “simplify”, we mean to reduce terms as much as possible while avoidingtomakethemgrow insize. Reachingthis goal amounts toadiscussion about how not to unfold uselessly global con ..."
Abstract
 Add to MetaCart
Abstract. We report on a new implementation of a reduction strategy in Coq to simplify terms during interactive proofs. By “simplify”, we mean to reduce terms as much as possible while avoidingtomakethemgrow insize. Reachingthis goal amounts toadiscussion about how not to unfold uselessly global constants. Coq’s simpl is such a reduction strategy and the current paper describes an alternative more efficient abstractmachinebased implementation to it hal00816918, version 1 23 Apr 2013