Simple Type Theory is not too Simple: Grothendieck's Schemes without Dependent Types

04/19/2021
by   Anthony Bordg, et al.
0

We report on a formalization of schemes in the proof assistant Isabelle/HOL, and we discuss the design choices made in the process. Schemes are sophisticated mathematical objects in algebraic geometry introduced by Alexander Grothendieck in 1960. This experiment shows that the simple type theory implemented in Isabelle can handle such elaborate constructions despite doubts raised about Isabelle's capability in that direction. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2019

Algebraic Type Theory and Universe Hierarchies

It is commonly believed that algebraic notions of type theory support on...
research
02/14/2020

Isabelle/Spartan – A Dependent Type Theory Framework for Isabelle

This paper introduces Isabelle/Spartan, an implementation of intensional...
research
04/23/2022

Unboundedness for Recursion Schemes: A Simpler Type System

Decidability of the problems of unboundedness and simultaneous unbounded...
research
08/16/2023

A topological counterpart of well-founded trees in dependent type theory

Within dependent type theory, we provide a topological counterpart of we...
research
10/31/2019

An Implementation of Homotopy Type Theory in Isabelle/Pure

In this Masters thesis we present an implementation of a fragment of "bo...
research
10/30/2017

The univalence axiom in cubical sets

In this note we show that Voevodsky's univalence axiom holds in the mode...
research
05/07/2021

Circuit bases for randomisation

After a rich history in medicine, randomisation control trials both simp...

Please sign up or login with your details

Forgot password? Click here to reset