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

Vilhelm Sjöberg, Chris Casinghino, Ki Yung Ahn, Nathan Collins, Harley D. Eades, Peng Fu, Garrin Kimmell, Tim Sheard, Aaron Stump, Stephanie Weirich

Research output: Contribution to journalConference article

8 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)112-162
Number of pages51
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume76
DOIs
StatePublished - Feb 11 2012
Externally publishedYes
Event4th Workshop on Mathematically Structured Functional Programming, MSFP 2012 - Tallinn, Estonia
Duration: Mar 25 2012 → …

ASJC Scopus subject areas

  • Software

Cite this

Sjöberg, V., Casinghino, C., Ahn, K. Y., Collins, N., Eades, H. D., Fu, P., Kimmell, G., Sheard, T., Stump, A., & Weirich, S. (2012). Irrelevance, heterogeneous equality, and call-by-value dependent type systems. Electronic Proceedings in Theoretical Computer Science, EPTCS, 76, 112-162. https://doi.org/10.4204/EPTCS.76.9