2012/02/14 by Vilhelm Sjöberg, Chris Casinghino, Ki Yung Ahn +7
Computer Science · #cs.PL
paper · pdf · doi:10.4204/eptcs.76.9
published as EPTCS 76, 2012, pp. 112-162 · In Proceedings MSFP 2012, arXiv:1202.2407
arxiv created 2012/02/14 · arxiv updated 2012/02/15
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.