一句话：在 λΠ-模理论中构造统一理论 U，使多个逻辑系统的证明可模块化嵌入并保持子理论性质。
论文研究如何在逻辑框架 λΠ-模理论（lambda-Pi-calculus modulo theory）中模块化地表达多种类型系统与逻辑系统。作者构造了一个统一理论 U，其中可表达若干逻辑系统的证明；并为每个系统识别出 U 的一个子理论。核心结果是证明：若 U 中的证明只使用某个子理论的符号，则该证明可视为该子理论中的证明。这一性质保证了不同系统在 U 中的编码相互隔离，支持模块化组合与复用，为在统一框架下形式化多种类型论提供了方法。
The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a sub-theory of U corresponding to each of these systems, and prove that, when a proof in U uses only symbols of a sub-theory, then it is a proof in that sub-theory.
@article{paperbot2238,
title = {A modular construction of type theories},
author = {Frédéric Blanqui and Gilles Dowek and Emilie Grienenberger and Gabriel Hondet and François Thiré},
journal = {Logical Methods in Computer Science},
volume = {Volume 19, Issue 1},
year = {2023},
doi = {10.46298/lmcs-19(1:12)2023}
}