Combining Semantics with Non-standard Interpreter Hierarchies

Proceedings of the 2003 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation

Kawada

Hashimoto

2003

Self Cite

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 offline partial evaluation were the polyvariant specialization scheme with its lack of generalization; advantages were the availability of higher-order values to specialize a breadthfirst 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.

Section: Fundamental Conceptsmentioning

confidence: 99%

Section: Fundamental Conceptsmentioning

confidence: 99%

See 1 more Smart Citation

Transforming interpreters into inverse interpreters by partial evaluation

Proceedings of the 2003 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation

Kawada

Hashimoto

2003

Self Cite

“…The notation is adapted from [20]; we use divisions (SD) when classifying the parameters of a program as static and dynamic. 1 We assume that we are always dealing with universal programming languages. When we define a program using λ-abstraction, the expression needs to be translated into the corresponding programming language (denoted by λ ... ∈ P ).…”

Section: Preliminariesmentioning

confidence: 99%

“…Another challenging question is whether a binding-time improver can be specified by combining 'atomic' bindingtime improvements, and how this relates to combining semantics by towers of non-standard interpreters [1].…”

Section: Optimizing the Theoretical Con-structionsmentioning

confidence: 99%

Jones optimality, binding-time improvements, and the strength of program specializers

Proceedings of the ASIAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

2002

Self Cite

Jones optimality tells us that a program specializer is strong enough to remove an entire level of self-interpretation. We show that Jones optimality, which was originally aimed at the Futamura projections, plays an important role in binding-time improvements. The main results show that, regardless of the binding-time improvements which we apply to a source program, no matter how extensively, a specializer that is not Jones-optimal is strictly weaker than a specializer which is Jones optimal. By viewing a binding-time improver as a generating extension of a self-interpreter, we can connect our results with previous work on the interpretive approach.

Principles of Inverse Computation and the Universal Resolving Algorithm

Abramov

Lecture Notes in Computer Science

2002

Self Cite

We survey fundamental concepts in inverse programming and present the Universal Resolving Algorithm (URA), an algorithm for inverse computation in a first-order, functional programming language. We discuss the principles behind the algorithm, including a three-step approach based on the notion of a perfect process tree, and demonstrate our implementation with several examples. We explain the idea of a semantics modifier for inverse computation which allows us to perform inverse computation in other programming languages via interpreters.On leave from DIKU,