Abstract
It is difficult to overestimate the importance of modularity for specifying and reasoning about software [1], or for checking large and complex mathematical arguments [8,9,10]. The goal of this presentation is to explain in what way a recent development in type theory, the formulation of the axiom of univalence, addresses these modularity issues.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
One important fact will be that, in contrast with set theory, all statements expressible in type theory are transportable.
- 2.
To give another (maybe more surprising) example: the collection of all linear orders with a fixed finite number of elements is a large collection, but it has no non trivial automorphisms, and should be considered to be the as the groupoid with one object and only the identity morphism.
- 3.
We write \(\varPi (x~y:A)B\) for \(\varPi (x:A)\varPi (y:A)B\).
- 4.
For a trivial, but significant [7] example, the center of group is automatically invariant by any automorphism of a group, and in particular, it is a normal subgroup.
References
Appel, A.: Modular verification for computer security. In: CSF 2016: 29th IEEE Computer Security Foundations Symposium, June 2016
Bishop, E.: Mathematics as a numerical language 1970 Intuitionism and Proof Theory (Proc. Conf., Buffalo, N.Y.), pp. 53–71 (1968)
Bourbaki, N.: Éléments de mathématique. Chapitre 4: Structures. Actualités Sci. Ind. no. 1258 Hermann, Paris (1957)
de Bruijn, N.G.: The mathematical language AUTOMATH, its usage, and some of its extensions. In: 1970 Symposium on Automatic Demonstration. Lecture Notes in Mathematics, vol. 125, pp. 29–61
de Bruijn, N.G.: A survey of the project AUTOMATH. In: To H. B. Curry: essays on combinatory logic, lambda calculus and formalism, pp. 579–606 (1980)
Church, A.: A formulation of the simple theory of types. J. Symbolic Logic 5, 56–68 (1940)
Interview of P. Deligne. https://www.simonsfoundation.org/science_lives_video/pierre-deligne/
Gonthier, G.: A computer-checked proof of the Four Colour Theorem. Microsoft report (2005)
Gonthier, G., et al.: A machine-checked proof of the odd order theorem. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 163–179. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39634-2_14
Th. Hales. Developments in formal proofs. Astérisque No. 367–368, Exp. No. 1086, pp. 387–410 (2015)
Martin-Löf, P.: Constructive mathematics and computer programming. In: Logic, methodology and philosophy of science, VI (Hannover, 1979). Stud. Logic Found. Math., vol. 104, pp. 153–175 (1982)
Voevodsky, V.: An experimental library of formalized mathematics based on the univalent foundations. Math. Structures Comput. Sci. 25(5), 1278–1294 (2015)
Library UniMath. https://github.com/UniMath/UniMath/tree/master/UniMath
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Coquand, T. (2017). Type Theory and Formalisation of Mathematics. In: Weil, P. (eds) Computer Science – Theory and Applications. CSR 2017. Lecture Notes in Computer Science(), vol 10304. Springer, Cham. https://doi.org/10.1007/978-3-319-58747-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-58747-9_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58746-2
Online ISBN: 978-3-319-58747-9
eBook Packages: Computer ScienceComputer Science (R0)