Results 1 
7 of
7
Packaging mathematical structures
 THEOREM PROVING IN HIGHER ORDER LOGICS 5674
, 2009
"... This paper proposes generic design patterns to define and combine algebraic structures, using dependent records, coercions and type inference, inside the Coq system. This alternative to telescopes in particular supports multiple inheritance, maximal sharing of notations and theories, and automated ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
This paper proposes generic design patterns to define and combine algebraic structures, using dependent records, coercions and type inference, inside the Coq system. This alternative to telescopes in particular supports multiple inheritance, maximal sharing of notations and theories, and automated structure inference. Our methodology is robust enough to handle a hierarchy comprising a broad variety of algebraic structures, from types with a choice operator to algebraically closed fields. Interfaces for the structures enjoy the convenience of a classical setting, without requiring any axiom. Finally, we present two applications of our proof techniques: a key lemma for characterising the discrete logarithm, and a matrix decomposition problem.
About the formalization of some results by Chebyshev in number theory
 Proceedings of TYPES’08, Vol. 5497 of LNCS
, 2009
"... Abstract. We discuss the formalization, in the Matita Interactive Theorem Prover, of a famous result by Chebyshev concerning the distribution of prime numbers, essentially subsuming, as a corollary, Bertrand’s postulate. Even if Chebyshev’s result has been later superseded by the stronger prime numb ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Abstract. We discuss the formalization, in the Matita Interactive Theorem Prover, of a famous result by Chebyshev concerning the distribution of prime numbers, essentially 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. Differently from other recent formalizations of other results in number theory, our proof is entirely arithmetical. It makes use of most part of the machinery of elementary arithmetics, and in particular of properties of prime numbers, factorization, products and summations, providing a natural benchmark for assessing the actual development of the arithmetical knowledge base. 1
The Matita Interactive Theorem Prover
"... Abstract. 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 ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Abstract. 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
Smart matching
"... Abstract. One of the most annoying aspects in the formalization of mathematics is the need of transforming notions to match a given, existing result. This kind of transformations, often based on a conspicuous background knowledge in the given scientific domain (mostly expressed in the form of equali ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. One of the most annoying aspects in the formalization of mathematics is the need of transforming notions to match a given, existing result. This kind of transformations, often based on a conspicuous background knowledge in the given scientific domain (mostly expressed in the form of equalities or isomorphisms), are usually implicit in the mathematical discourse, and it would be highly desirable to obtain a similar behaviour in interactive provers. The paper describes the superpositionbased implementation of this feature inside the Matita interactive theorem prover, focusing in particular on the so called smart application tactic, supporting smart matching between a goal and a given result. 1
Some considerations on the usability of Interactive Provers
"... Abstract. In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensibly improved since the advent of the “second generation ” of systems, in the mid of the eighties. We try to ana ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. In spite of the remarkable achievements recently obtained in the field of mechanization of formal reasoning, the overall usability of interactive provers does not seem to be sensibly improved since the advent of the “second generation ” of systems, in the mid of the eighties. We try to analyze the reasons of such a slow progress, pointing out the main problems and suggesting some possible research directions. 1
Hints in unification
"... Abstract. Several mechanisms such as Canonical Structures [14], Type Classes [16,13], or Pullbacks [10] have been recently introduced with the aim to improve the power and flexibility of the type inference algorithm for interactive theorem provers. We claim that all these mechanisms are particular i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Several mechanisms such as Canonical Structures [14], Type Classes [16,13], or Pullbacks [10] have been recently introduced with the aim to improve the power and flexibility of the type inference algorithm for interactive theorem provers. We claim that all these mechanisms are particular instances of a simpler and more general technique, just consisting in providing suitable hints to the unification procedure underlying type inference. This allows a simple, modular and not intrusive implementation of all the above mentioned techniques, opening at the same time innovative and unexpected perspectives on its possible applications. 1
Under consideration for publication in Math. Struct. in Comp. Science Formalizing Overlap Algebras in Matita
, 2010
"... We describe some formal topological results, formalized in Matita 1/2, presented in predicative intuitionistic logic and in terms of Overlap Algebras. Overlap Algebras are new algebraic structures designed to ease reasoning about subsets in an algebraic way within intuitionistic logic. We find that ..."
Abstract
 Add to MetaCart
We describe some formal topological results, formalized in Matita 1/2, presented in predicative intuitionistic logic and in terms of Overlap Algebras. Overlap Algebras are new algebraic structures designed to ease reasoning about subsets in an algebraic way within intuitionistic logic. We find that they also ease the formalization of formal topological results in an interactive theorem prover. Our main result is the existence of a functor between two categories of ‘generalized topological spaces’, one with points (Basic Pairs) and the other pointfree (Basic Topologies). The reported formalization is part as a wider scientific collaboration with the inventor of the theory, Giovanni Sambin. His goal is to verify in what sense, and with what difficulties, his theory is ‘implementable’. We check that all intermediate constructions respect the stringent size requirements imposed by predicative logic. The formalization is quite unusual, since it has to make explicit size information that is often hidden. We found that the version of Matita used for the formalization was largely inappropriate. The formalization drove several major improvements of Matita that will be integrated in the next major release (Matita 1.0). We show some motivating examples for these improvements, taken directly from the formalization. We also describe a possibly suboptimal solution in Matita 1/2, exploitable in other similar systems. We briefly discuss a better solution available in Matita 1.0. 1.