Evolving Recursive Definitions with Applications to Dynamic Programming
share
Inspired by computability logic<cit.>, 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 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.
READ FULL TEXT