Evolving Recursive Definitions with Applications to Dynamic Programming
Abstract
Inspired by computability logicJap03, 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.