17 citations · 24 across the 4 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2017
An Executable Specification of Typing Rules for Extensible Records based on Row Polymorphism
Ki Yung Ahn
Type inference is an application domain that is a natural fit for logic programming (LP). LP systems natively support unification, which serves as a basic building block of typical…
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…