Conference ProceedingsOPEN ACCESS

Type isomorphisms and proof reuse in dependent type theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2030 57-71
DOI: 10.1007/3-540-45315-6_4
28Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We propose a theoretical tfoundation for proof reuse, based on the novel idea of a computational interpretation of type isomorphisms.

Cite

CITATION STYLE

APA

Barthe, G., & Pons, O. (2001). Type isomorphisms and proof reuse in dependent type theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2030, pp. 57–71). Springer Verlag. https://doi.org/10.1007/3-540-45315-6_4

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