AI Chat AI Image Generator AI Video Text to Speech

Evolving Recursive Definitions with Applications to Dynamic Programming

07/25/2022

∙

by Keehang Kwon, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 04/04/2023

Implementing Dynamic Programming in Computability Logic Web

We present a novel definition of an algorithm and its corresponding algo...

0 Keehang Kwon, et al. ∙

research

∙ 11/20/2018

A right-to-left type system for mutually-recursive value definitions

In call-by-value languages, some mutually-recursive value definitions ca...

0 Alban Reynaud, et al. ∙

research

∙ 01/03/2022

let (rec) insertion without Effects, Lights or Magic

Let insertion in program generation is producing code with definitions (...

0 Oleg Kiselyov, et al. ∙

research

∙ 04/01/2023

Topologically sorting VDM-SL definitions for Isabelle/HOL translation

There is an ecosystem of VDM libraries and extensions that includes a tr...

0 Leo Freitas, et al. ∙

research

∙ 06/20/2011

On Kinds of Indiscernibility in Logic and Metaphysics

Using the Hilbert-Bernays account as a spring-board, we first define fou...

0 Adam Caulton, et al. ∙

research

∙ 11/06/2018

Unboxing Mutually Recursive Type Definitions in OCaml

In modern OCaml, single-argument datatype declarations (variants with a ...

0 Simon Colin, et al. ∙

research

∙ 02/04/2018

A Scheme-Driven Approach to Learning Programs from Input/Output Equations

We describe an approach to learn, in a term-rewriting setting, function ...

0 Jochen Burghardt, et al. ∙