4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.PL2011★ 1 cited
Equality, Quasi-Implicit Products, and Large Eliminations
Vilhelm Sjöberg, Aaron Stump
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including impli…
cs.PL2010★ 4 cited
Termination Casts: A Flexible Approach to Termination with General Recursion
Aaron Stump, Vilhelm Sjöberg, Stephanie Weirich
This paper proposes a type-and-effect system called Teqt, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd…