Application of metasystem transition to function inversion and transformation

Authors:
R. Glueck;V. F. Turchin
Affiliations:
University of Technology Vienna, Institut für Praktische Informatik, A-1040 Vienna, Austria;The City College of New York, Department of Computer Sciences, New York, N.Y.
Venue:
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Year:
1990

Citing 3
Cited 8

An experiment in partial evaluation: the generation of a compiler generator

Proc. of the first international conference on Rewriting techniques and applications
The concept of a supercompiler

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Partial evaluation of pattern matching in strings

Information Processing Letters

Inversion and metacomputation

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Towards multiple self-application

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
The Essence of Program Transformation by Partial Evaluation and Driving

PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Partial evaluation of pattern matching in strings, revisited

Nordic Journal of Computing
Principles of inverse computation and the Universal resolving algorithm

The essence of computation
The abstraction and instantiation of string-matching programs

The essence of computation
A Method for Automatic Program Inversion Based on LR(0) Parsing

Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
A Method for Automatic Program Inversion Based on LR(0) Parsing

Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We proved by construction an application considered theoretically by Turchin [7] that self-application of metacomputation will allow the automatic construction of inverse algorithms, in particular the algorithm of binary subtraction from the algorithm of binary addition. Further, we will present results concerning the algorithmic construction of an efficient pattern matcher, which leads to the Knuth, Morris and Pratt algorithm. These results were achieved with the first working model of a self-applicable supercompiler system, implementing the concept of metacomputation.