The Rooster and the Butterflies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

The Rooster and the Butterflies

Abstract

This paper describes a machine-checked proof of the Jordan- Hölder theorem for finite groups. This purpose of this description is to discuss the representation of the elementary concepts of finite group theory inside type theory. The design choices underlying these representations were crucial to the successful formalization of a complete proof of the Odd Order Theorem with the Coq system.
Fichier principal
Vignette du fichier
main.pdf (356.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00825074 , version 1 (22-05-2013)
hal-00825074 , version 2 (15-07-2013)
hal-00825074 , version 3 (15-07-2013)

Identifiers

Cite

Assia Mahboubi. The Rooster and the Butterflies. CICM 2013 - Conference on Intelligent Computer Mathematics - 2013, Jul 2013, Bath, United Kingdom. pp.1-18, ⟨10.1007/978-3-642-39320-4_1⟩. ⟨hal-00825074v3⟩

Collections

INRIA INRIA2
510 View
727 Download

Altmetric

Share

Gmail Facebook X LinkedIn More