Irrelevance, heterogeneous equality, and call-by-value dependent type systems

15Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

We present a full-spectrum dependently typed core language which includes both nontermination and computational irrelevance (a.k.a. erasure), a combination which has not been studied before. The two features interact: to protect type safety we must be careful to only erase terminating expressions. Our language design is strongly influenced by the choice of CBV evaluation, and by our novel treatment of propositional equality which has a heterogeneous, completely erased elimination form.

Cite

CITATION STYLE

APA

Sjöberg, V., Casinghino, C., Ahn, K. Y., Collins, N., Eades, H. D., Fu, P., … Weirich, S. (2012). Irrelevance, heterogeneous equality, and call-by-value dependent type systems. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 76, pp. 112–162). Open Publishing Association. https://doi.org/10.4204/EPTCS.76.9

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