Beginning in the 1970s, statistician-cum-logician Per Martin-L\"of wrote a series of papers developing what became Martin-L\"of type theory, realizing a system where the distinction between mathematics and programming disappears. Inspired by this vision, this paper introduces dependent type theory (of which Martin-L\"of type theory is an example) to a statistical audience. Examples from statistics and probability theory demonstrate how dependent type theory and an algebraic perspective can unify the theoretical and computational concerns of statistics, ensuring rigorous, machine-checked proofs and executable software.
翻译:自20世纪70年代起,统计学家兼逻辑学家Per Martin-Löf发表了一系列论文,逐步发展出后来被称为Martin-Löf类型论的理论体系,实现了一个数学与编程界限消失的系统。受此愿景启发,本文向统计学界介绍了依赖类型理论(Martin-Löf类型论即其范例)。通过统计学与概率论中的实例,本文展示了依赖类型理论及代数视角如何统一统计学的理论关切与计算实践,从而确保严格机器可验证的证明与可执行软件的实现。