A regeneration scheme for generating extensions

Inverse computation and the Universal Resolving Algorithm

“…We also draw upon results of Ref. [8][9][10]. This work is in the line of earlier research on supercompilation and metacomputation (e. g. ,Ref.…”

“…For notational convenience we assume that both programs are L-to-L transformers written in L; for multi-language composition and specialization see refs. [9,23].…”

Principles of Inverse Computation and the Universal Resolving Algorithm

“…Similarly, an inverse interpreter is the composition of a self-interpreter and a program inverter [17,18]. Given one of the two tools, we can obtain, in principle, an efficient implementation of its companion tool by program specialization or by program composition.…”

“…Before we show these transformations, we specify the semantics of a program composer komp and a program specializer spec. For notational convenience we assume that both programs are L-to-L transformers written in L; for multilanguage composition and specialization see [17].…”

“…More details and a formal treatment of the material presented in this paper can be found in the literature [2,4,5]. We also draw upon results of references [15,17,18]. This work belongs to a line of research on supercompilation and metacomputation (e.g., [48,50,32,1,20,29,40,46,43]).…”