Skip to main content
Conference Proceedings

Type theory and formalisation of mathematics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2017) 10304 LNCS 1-6
DOI: 10.1007/978-3-319-58747-9_1
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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–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.

Cite

CITATION STYLE

APA

Coquand, T. (2017). Type theory and formalisation of mathematics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10304 LNCS, pp. 1–6). Springer Verlag. https://doi.org/10.1007/978-3-319-58747-9_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free