Transforming interpreters into inverse interpreters by partial evaluation

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

Volumn , Issue , 2003, Pages 10-19

  Glück, Robert ^a,b   Kawada, Youhei ^a   Hashimoto, Takuya ^a  

^a WASEDA UNIVERSITY   (Japan)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Binding time improvements; Inverse interpreter; Program inversion; Self application; Semantics modifier

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FLOWCHARTING; INVERSE PROBLEMS; JAVA PROGRAMMING LANGUAGE; TREES (MATHEMATICS); TURING MACHINES;

INTERPRETERS;

SEMANTICS;

EID: 18344404450     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777388.777391     Document Type: Conference Paper

References (24)

1. S. M. Abramov and R. Glück. Combining semantics with non-standard interpreter hierarchies. In S. Kapoor and S. Prasad, editors, Foundations of Software Technology and Theoretical Computer Science. Proceedings, LNCS 1974. pages 201-213. Springer-Verlag, 2000.
2. S. M. Abramov and R. Glück. From standard to non-standard semantics by semantics modifiers. International Journal of Foundations of Computer Science, 12(2): 171-211, 2001.
3. S. M. Abramov and R. Glück. Principles of inverse computation and the universal resolving algorithm. In T. Æ. Mogensen, D. Schmidt, and H. I. Sudborough, editors, The Essence of Computation: Complexity, Analysis, Transformation, LNCS 2566, pages 269-295. Springer-Verlag, 2002.
4. S. M. Abramov and R. Glück. The universal resolving algorithm and its correctness: inverse computation in a functional language. Science of Computer Programming, 43(2-3):193-229, 2002.
5. E. Albert and G. Vidai. The narrowing-driven approach to functional logic program specialization. New Generation Computing, 20(1):3-26, 2002.
6. A. Bondorf. Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17(1-3):3-34, 1991.
7. A. Bondorf. Similix 5.0 Manual. DIKU, University of Copenhagen, Denmark, 1993. Included in the Similix distribution, 82 pages.
8. A. Bondorf and O. Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Computer Programming, 16:151-195, 1991.
9. A. Bondorf and J. Jørgensen. Efficient analyses for realistic off-line partial evaluation. Journal of Functional Programming, 11:315-346, 1993.
10. A. Bondorf and J. Palsberg. Generating action compilers by partial evaluation. Journal of Functional Programming, 6(2):269-298, 1996.
11. N. H. Christensen and R. Glück. On the equivalence of online and offline partial evaluation. Manuscript, DIKU, Department of Computer Science, University of Copenhagen, 2001.
12. E. W. Dijkstra. Program inversion. In F. L. Bauer and M. Broy, editors, Program Construction: International Summer School, LNCS 69, pages 54-57. Springer-Verlag, 1978.
13. [13] R. Glück and A. V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree, In P. Cousot, M. Falaschi, G. Filé, and A. Rauzy, editors, Static Analysis. Proceedings, LNCS 724, pages 112-123. Springer-Verlag, 1993.
14. R. Glück and M. H. Sørensen. Partial deduction and driving are equivalent. In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic Programming. Proceedings, LNCS 844, pages 165-181. Springer-Verlag, 1994.
15. M. Hanus. The integration of functions into logic programming: from theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
16. J. Hatcliff. An introduction to online and offline partial evaluation using a simple flowchart language. In J. Hatcliff, T. Mogensen, and P. Thiemann, editors, Partial Evaluation. Practice and Theory, LNCS 1706, pages 20-82. Springer-Verlag, 1999.
17. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
18. J. Jørgensen. Generating a compiler for a lazy language by partial evaluation. In Conference Record of the Nighteenth Symposium on Principles of Programming Languages, pages 258-268. ACM Press, 1992.
19. J. Jørgensen. Similix: a self-applicable partial evaluator for scheme. In J. Hatcliff, T. Mogensen, and P. Thiemann, editors, Partial Evaluation. Practice and Theory, LNCS 1706, pages 83-107. Springer-Verlag, 1999.
20. S. Katsumata and A. Ohori. Proof-directed de-compilation of Java bytecode. In D. Sands, editor, Programming Languages and Systems. Proceedings, LNCS 2028, pages 352-366. Springer-Verlag, 2001.
21. J. McCarthy. The inversion of functions defined by Turing machines. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 177-181. Princeton University Press, 1956.
22. S.-C. Mu and R. Bird. Inverting functions as folds. In E. A. Boiten and B. Möller, editors, Mathematics of Program Construction. Proceedings. LNCS 2386, pages 209-232. Springer-Verlag, 2002.
23. A. P. Nemytykh and V. A. Pinchuk. Program transformation with metasystem transitions: experiments with a supercompiler. In D. Bjørner, M. Broy, and I. V. Pottosin, editors, Perspectives of System Informatics. Proceedings, LNCS 1181, pages 249-260. Springer-Verlag, 1996.
24. S. Thibault, C. Consel, J. L. Lawall, R. Marlet, and G. Muller. Static and dynamic program compilation by interpreter specialization. Higher-Order and Symbolic Computation, 13(3):161-178, 2000.