Dependent types offer great versatility and power, but developing proofs with them can be tedious and requires considerable human guidance. We propose to integrate Satisfiability Modulo Theories (SMT)-based refinement types into the dependently-typed language Agda in an effort to ease some of the burden of programming with dependent types and combine the strengths of the two approaches to mechanized theorem proving.

翻译：依赖性类型提供了巨大的多功能性和权力,但用它们来制定证据可能会是乏味的,需要大量的人力指导。 我们提议将基于满足性莫杜洛理论(SMT)的精细类型纳入依赖性语言阿格达,以努力减轻依赖性类型方案规划的某些负担,并将两种机械化理论验证方法的优势结合起来。