直觉类型论中递归算子的构造
Constructing Recursion Operators in Intuitionistic Type Theory
摘要:
马丁-勒夫的直觉主义类型理论在计算机程序的形式化推理中越来越流行。为了处理递归计划以外的原始递归,良基关系的理论。使用原始递归在更高的类型,归纳和递归正式推导出一个大类的良好的基础关系。包括<自然数,和关系形成的逆图像,加法,乘法,和指数的其他关系。构造给出了充分的细节,让他们使用的定理证明类型论,如Nuprl。该理论的工作相比,在该领域的有序递归更高的类型。
英文摘要:
Martin-Löf's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive recursion over higher types, induction and recursion are formally derived for a large class of well-founded relations. Included are < on natural numbers, and relations formed by inverse images, addition, multiplication, and exponentiation of other relations. The constructions are given in full detail to allow their use in theorem provers for Type Theory, such as Nuprl. The theory is compared with work in the field of ordinal recursion over higher types.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。