Anthony Bordg
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Anthony Bordg has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Hanna Lachnitt
Stanford University
1 shared publication - Lawrence Charles Paulson
University of Cambridge
1 shared publication Lawrence Paulson
University of Cambridge
1 shared publicationWenda Li
University of Cambridge
1 shared publication- Wenda Li
Computer Laboratory Computer Laboratory University of Cambridge University of Cambridge
1 shared publication Yijun He
University of Cambridge, Cambridge, UK
1 shared publication
Latest Publications
- Open Access
- 3 April 2022
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 31 (2) , 364-382
Simple Type Theory is not too Simple: Grothendieck’s Schemes Without Dependent Types
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.
- 3 April 2022
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 31 (2) , 364-382
Open AccessSimple Type Theory is not too Simple: Grothendieck’s Schemes Without Dependent Types
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.
- Open Access
Simple Type Theory is not too Simple: Grothendieck's Schemes without Dependent Types
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.
Open AccessSimple Type Theory is not too Simple: Grothendieck's Schemes without Dependent Types
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.
- Open Access
- 1 January 2022
- Published by Mount Allison University in Theory and Applications of Categories
- Vol. 38 (7) , 214-231
The Interpretation Lifting Theorem for C-Systems
In this article we present a solution to a conjecture of Vladimir Voevodsky regarding C-systems. This conjecture provides, under some assumptions, a lift of a functor M : CC → C, where CC is a C-system and C a category, to a morphism of Csystems M ′ : CC → CC(C, p M). We explain the motivation behind this conjecture and introduce the required background material on C-systems. Finally, we give a proof of this conjecture. As we shall see the corresponding theorem allows to lift weak interpretations of type theory to strong ones.
- 1 January 2022
- Published by Mount Allison University in Theory and Applications of Categories
- Vol. 38 (7) , 214-231
Open AccessThe Interpretation Lifting Theorem for C-Systems
In this article we present a solution to a conjecture of Vladimir Voevodsky regarding C-systems. This conjecture provides, under some assumptions, a lift of a functor M : CC → C, where CC is a C-system and C a category, to a morphism of Csystems M ′ : CC → CC(C, p M). We explain the motivation behind this conjecture and introduce the required background material on C-systems. Finally, we give a proof of this conjecture. As we shall see the corresponding theorem allows to lift weak interpretations of type theory to strong ones.
- Open Access
The Interpretation Lifting Theorem for C-Systems
In this article we present a solution to a conjecture of Vladimir Voevodsky regarding C-systems. This conjecture provides, under some assumptions, a lift of a functor $M\colon \mathrm{CC} \rightarrow \mathcal{C}$, where $\mathrm{CC}$ is a C-system and $\mathcal{C}$ a category, to a morphism of C-systems $M'\colon \mathrm{CC} \rightarrow \mathrm{CC}(\widehat{\mathcal{C}},p_M)$. We explain the motivation behind this conjecture and introduce the required background material on C-systems. Finally, we give a proof of this conjecture.Open AccessThe Interpretation Lifting Theorem for C-Systems
In this article we present a solution to a conjecture of Vladimir Voevodsky regarding C-systems. This conjecture provides, under some assumptions, a lift of a functor $M\colon \mathrm{CC} \rightarrow \mathcal{C}$, where $\mathrm{CC}$ is a C-system and $\mathcal{C}$ a category, to a morphism of C-systems $M'\colon \mathrm{CC} \rightarrow \mathrm{CC}(\widehat{\mathcal{C}},p_M)$. We explain the motivation behind this conjecture and introduce the required background material on C-systems. Finally, we give a proof of this conjecture. - Open Access
- 5 March 2021
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 43 (4) , 48-52
A Replication Crisis in Mathematics?
- 5 March 2021
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 43 (4) , 48-52
Open AccessA Replication Crisis in Mathematics?
- Open Access
- 24 December 2020
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 65 (5) , 691-709
Certified Quantum Computation in Isabelle/HOL
In this article we present an ongoing effort to formalise quantum algorithms and results in quantum information theory using the proof assistant Isabelle/HOL. Formal methods being critical for the safety and security of algorithms and protocols, we foresee their widespread use for quantum computing in the future. We have developed a large library for quantum computing in Isabelle based on a matrix representation for quantum circuits, successfully formalising the no-cloning theorem, quantum teleportation, Deutsch’s algorithm, the Deutsch–Jozsa algorithm and the quantum Prisoner’s Dilemma. We discuss the design choices made and report on an outcome of our work in the field of quantum game theory.
- 24 December 2020
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 65 (5) , 691-709
Open AccessCertified Quantum Computation in Isabelle/HOL
In this article we present an ongoing effort to formalise quantum algorithms and results in quantum information theory using the proof assistant Isabelle/HOL. Formal methods being critical for the safety and security of algorithms and protocols, we foresee their widespread use for quantum computing in the future. We have developed a large library for quantum computing in Isabelle based on a matrix representation for quantum circuits, successfully formalising the no-cloning theorem, quantum teleportation, Deutsch’s algorithm, the Deutsch–Jozsa algorithm and the quantum Prisoner’s Dilemma. We discuss the design choices made and report on an outcome of our work in the field of quantum game theory.
- Open Access
On the Inadequacy of the Projective Structure with Respect to the Univalence Axiom
In this article the author endows the functor category [B(C2),Gpd] with the structure of a type-theoretic fibration category with a universe using the projective fibrations. It offers a new model of Martin-L\"of type theory with dependent sums, dependent products, identity types and a universe. It turns out that this universe, the natural candidate that lifts the univalent universe of small discrete groupoids in the groupoid model of Hofmann and Streicher, is not univalent.
Open AccessOn the Inadequacy of the Projective Structure with Respect to the Univalence Axiom
In this article the author endows the functor category [B(C2),Gpd] with the structure of a type-theoretic fibration category with a universe using the projective fibrations. It offers a new model of Martin-L\"of type theory with dependent sums, dependent products, identity types and a universe. It turns out that this universe, the natural candidate that lifts the univalent universe of small discrete groupoids in the groupoid model of Hofmann and Streicher, is not univalent.
- Open Access
- 12 November 2019
- Published by Springer Nature
- p. 173-189
Univalent Foundations and the UniMath Library
- 12 November 2019
- Published by Springer Nature
- p. 173-189
Open AccessUnivalent Foundations and the UniMath Library
- Open Access
- 1 February 2019
- Published by Springer Nature in Applied Categorical Structures
- Vol. 27 (3) , 311-322
On a Model Invariance Problem in Homotopy Type Theory
- 1 February 2019
- Published by Springer Nature in Applied Categorical Structures
- Vol. 27 (3) , 311-322
Open AccessOn a Model Invariance Problem in Homotopy Type Theory