Reflexive tactics for algebra, revisited

02/09/2022
by   Kazuhiko Sakaguchi, et al.
0

Computational reflection allows us to turn verified decision procedures into efficient automated reasoning tools in proof assistants. The typical applications of such methodology include mathematical structures that have decidable theory fragments, e.g., equational theories of commutative rings and lattices. However, such existing tools are known not to cooperate with packed classes, a methodology to define mathematical structures in dependent type theory, that allows for the sharing of vocabulary across the inheritance hierarchy. Additionally, such tools do not support homomorphisms whose domain and codomain types may differ. This paper demonstrates how to implement reflexive tactics that support packed classes and homomorphisms. As applications of our methodology, we adapt the ring and field tactics of Coq to the commutative ring and field structures of the Mathematical Components library, and apply the resulting tactics to the formal proof of the irrationality of ζ(3) by Chyzak, Mahboubi, and Sibut-Pinote, to bring more proof automation.

READ FULL TEXT

page 5

page 9

page 13

page 15

page 17

page 19

page 21

page 23

research
02/03/2020

Validating Mathematical Structures

With regard to formalizing mathematics in proof assistants, the hierarch...
research
09/06/2022

Measure Construction by Extension in Dependent Type Theory with Application to Integration

We report on an original formalization of measure and integration theory...
research
01/25/2021

The Agda Universal Algebra Library and Birkhoff's Theorem in Dependent Type Theory

The Agda Universal Algebra Library (UALib) is a library of types and pro...
research
09/25/2019

A formal proof of Hensel's lemma over the p-adic integers

The field of p-adic numbers Q_p and the ring of p-adic integers Z_p are ...
research
02/02/2021

Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation

A general overview of the existing difference ring theory for symbolic s...
research
04/29/2018

Biform Theories: Project Description

A biform theory is a combination of an axiomatic theory and an algorithm...
research
07/18/2022

CD Tools – Condensed Detachment and Structure Generating Theorem Proving (System Description)

CD Tools is a Prolog library for experimenting with condensed detachment...

Please sign up or login with your details

Forgot password? Click here to reset