Formalising Sylow's theorems in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Technical Report) Year : 2006

Formalising Sylow's theorems in Coq

Laurent Théry
Laurence Rideau
  • Function : Author
  • PersonId : 832430


This report presents a formalisation of Sylow's theorems done in Coq. The formalisation has been done in a couple of weeks on top of Georges Gonthier's ssreflect. There were two ideas behind formalising Sylow's theorems. The first one was to get familiar with Georges way of doing proofs. The second one was to contribute to the collective effort to formalise a large subset of group theory in Coq with some non-trivial proofs.
Fichier principal
Vignette du fichier
RT-0327.pdf (210.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00113750 , version 1 (14-11-2006)
inria-00113750 , version 2 (22-11-2006)



Laurent Théry, Laurence Rideau. Formalising Sylow's theorems in Coq. [Technical Report] RT-0327, INRIA. 2006, pp.23. ⟨inria-00113750v2⟩
383 View
285 Download



Gmail Facebook Twitter LinkedIn More