Transforming interpreters into inverse interpreters by partial evaluation

Authors:
Robert Glück;Youhei Kawada;Takuya Hashimoto
Affiliations:
Waseda University, Tokyo, Japan;Waseda University, Tokyo, Japan;Waseda University, Tokyo, Japan
Venue:
Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Year:
2003

Citing 12
Cited 7

Automatic autoprojection of recursive equations with global variable and abstract data types

Science of Computer Programming
Automatic autoprojection of higher order recursive equations

ESOP '90 Selected papers from the symposium on 3rd European symposium on programming
Generating a compiler for a lazy language by partial evaluation

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
Static and Dynamic Program Compilation by Interpreter Specialization

Higher-Order and Symbolic Computation
The narrowing-driven approach to functional logic program specialization

New Generation Computing - Partial evaluation and program transformation
Partial Deduction and Driving are Equivalent

PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Program Transformation with Metasystem Transitions: Experiments with a Supercompiler

Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree

WSA '93 Proceedings of the Third International Workshop on Static Analysis
Program Inversion

Program Construction, International Summer Schoo
Inverting Functions as Folds

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Principles of inverse computation and the Universal resolving algorithm

The essence of computation

Revisiting an automatic program inverter for Lisp

ACM SIGPLAN Notices
A Method for Automatic Program Inversion Based on LR(0) Parsing

Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Report on an implementation of a semi-inverter

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
The program inverter LRinv and its structure

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
An experiment with the fourth futamura projection

PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
A self-applicable online partial evaluator for recursive flowchart languages

Software—Practice & Experience
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

The experiments in this paper apply the idea of prototyping programming language tools from robust semantics: we used a partial evaluator (Similix) to turn interpreters into inverse interpreters. This way we generated inverse interpreters for several small languages including interpreters for Turing machines, an applied lambda calculus, a flowchart language, and a subset of Java bytecode. Limiting factors of online partial evaluation were the polyvariant specialization scheme with its lack of generalization;advantages were the availability of higher-order values to specialize a breadth-first tree traversal.This application of self-applicable partial evaluation is different from the classical Futamura projections that tell us how to translate a program by specialization of an interpreter.