Simple Type Theory is not too Simple: Grothendieck's Schemes without Dependent Types
Authors:
Preprint
Abstract
Church's simple type theory is often deemed too simple for elaborate mathematical constructions. In particular, doubts were raised whether schemes could be formalized in this setting and a challenge was issued. Schemes are sophisticated mathematical objects in algebraic geometry introduced by Alexander Grothendieck in 1960. In this article we report on a successful formalization of schemes in the simple type theory of the proof assistant Isabelle/HOL, and we discuss the design choices which make this work possible. We show in the particular case of schemes how the powerful dependent types of Coq or Lean can be traded for a minimalist apparatus called locales.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Schemes in LeanExperimental Mathematics, 2021
- Exploring the Structure of an Algebra Text with LocalesJournal of Automated Reasoning, 2019
- From Types to Sets by Local Type Definition in Higher-Order LogicJournal of Automated Reasoning, 2018
- Coquelicot: A User-Friendly Library of Real Analysis for CoqMathematics in Computer Science, 2014
- Locales: A Module System for Mathematical TheoriesJournal of Automated Reasoning, 2013
- Type Classes and Filters for Mathematical Analysis in Isabelle/HOL2013
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940