A coherence theorem for Martin-Löf's type theory
Journal of Functional Programming
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
A modular formalisation of finite group theory
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Point-free, set-free concrete linear algebra
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
| Hi-index | 0.00 |
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.