A textbook on modeling and proving in computational type theory using the Rocq proof assistant.
MPCTT is a textbook project that teaches computational type theory through modeling and proving exercises using the Rocq proof assistant. It provides a structured educational resource for learning formal verification and theorem proving in a computational context. The project combines theoretical foundations with practical implementation to build proficiency in type theory.
Students, researchers, and developers interested in learning computational type theory, formal verification, and theorem proving using proof assistants.
MPCTT offers a comprehensive, hands-on approach to learning computational type theory with the Rocq proof assistant, bridging theoretical concepts with practical implementation. Its textbook format provides a structured learning path that is particularly valuable for educational settings.
Modeling and Proving in Computational Type Theory
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
Provides a deep dive into computational type theory, as highlighted in its emphasis on foundations and semantics from the textbook's philosophy.
Integrates practical modeling and proving exercises using the Rocq proof assistant, enabling applied learning as described in the key features.
Organized as a textbook with a progressive learning path, ideal for systematic study in educational settings.
Authored by Gert Smolka, a respected figure, ensuring reliability and depth in teaching computational type theory.
Focuses solely on the Rocq proof assistant, limiting applicability for users of other systems like Coq, as it doesn't cover broader tool ecosystems.
Assumes familiarity with formal logic and mathematics, which can be daunting for beginners without prior background, making it less accessible.
Available only as a PDF, lacking interactive features or regular updates common in modern online educational resources.