17 citations · 24 across the 3 of their papers we have counts for
3 papers
cs.PL2023★ 1 cited
Making Logical Relations More Relatable (Proof Pearl)
Emmanuel Suárez Acevedo, Stephanie Weirich
Mechanical proofs by logical relations often involve tedious reasoning about substitution. In this paper, we show that this is not necessarily the case, by developing, in Agda, a p…
cs.PL2022★ 6 cited
Program Adverbs and Tlön Embeddings
Yao Li, Stephanie Weirich
Free monads (and their variants) have become a popular general-purpose tool for representing the semantics of effectful programs in proof assistants. These data structures support…
cs.PL2012★ 17 cited
Irrelevance, Heterogeneous Equality, and Call-by-value Dependent Type Systems
Vilhelm Sjöberg, Chris Casinghino, Ki Yung Ahn +7
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 studi…