演化递归定义及其在动态规划中的应用
Evolving Recursive Definitions with Applications to Dynamic Programming
摘要:
受可计算性逻辑\cite{Jap03}的启发,我们将递归函数定义细化为两类:盲量化(BQ)递归函数定义和并行通用量化(PUQ)递归函数定义。BQ定义对应于传统的定义,其中递归定义正在$not$发展。PUQ定义在计算过程中{ \it evolving},导致自动记忆。此外,基于这一思想,我们提出了一种新的,高级面向对象的语言。
英文摘要:
Inspired by computability logic\cite{Jap03}, we refine recursive function definitions into two kinds: blindly-quantified (BQ) ones and parallel universally quantified (PUQ) ones. BQ definitions corresponds to the traditional ones where recursive definitions are $not$ evolving. PUQ definitions are {\it evolving} in the course of computation, leading to automatic memoization. In addition, based on this idea, we propose a new, high-level object-oriented language.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。