Evolving Recursive Definitions with Applications to Dynamic Programming
Programming Languages
2022-07-26 v1
Abstract
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 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.
Keywords
Cite
@article{arxiv.2207.12137,
title = {Evolving Recursive Definitions with Applications to Dynamic Programming},
author = {Keehang Kwon},
journal= {arXiv preprint arXiv:2207.12137},
year = {2022}
}
Comments
6 pages