|Research report code||R040000102|
|Posted date||May 18, 2007|
|Report name||(In Japanese)超計算：ソフトウェア自動生産のための新領域探求|
|Technology summary||(In Japanese)The research explored new frontiers of automated software production. The goal is to build programs that build program. The scientific approach taken in this project is unique in that I investigate a combination of three fundamental principles: (1) three basic transformation operations on programs (program composition, program inversion, and program specialization), (2) multiple layers of these transformations, and (3) their portability to new languages via interpreters. I study these principles using semantically clean functional languages.|
|Published papers related||
(In Japanese)(1) S. M. Abramov and R. Glueck. Combining semantics with non-standard interpreter hierarchies. In S. Kapoor and S. Prasad, editors, Foundations of Software Technology and Theoretical Computer Science. Proceedings, Lecture Notes in Computer Science, Vol.1974, pages 201-213. Springer-Verlag, 2000.
(2) S. M. Abramov and R. Glueck. 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. Glueck Principles of inverse computation and the universal resolving algorithm. In T. AE. Mogensen, D. Schmidt, and I. H. Sudborough, editors, The Essence of Computation: Ccmplexity, Analysis,Transformation, Lecture Notes in Computer Science, Vol.2566, pages 269-295. Springer-Verlag, 2002.
(4) S. M. Abramov and R. Glueck. The universal resolving algorithm and its correctness: inverse computation in a functional language. Science of Computer Programming, 43(2-3):193-229, 2002.
(5) N. H. Christensen and R. Glueck. Offline partial evaluation can be as accurate as online partial evaluation. ACM TOPIAS, to appear, 2003.
(6) Y. Futamura, Z. Konishi, and R. Glueck. WSDFU: Program transformation system based on generalized partial computation. In T. Mogensen, D. Schmidt, and I. H. Sudborough, editors, The Essence of Computation:' Complexity, Analysis, Transformation, volume 2566 of Lecture Notes in Computer Science, pages 358-378. Springer-Verlag, 2002.
(7) R. Glueck. Jones optimality, binding-time improvements, and the strength of program specializers. In Proceedings of the Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 9-19. ACM Press, 2002.
(8) R. Glueck. The translation power of the Futamura projections. In M. Broy and A. V. Zamulin, editors, Perspectives of System Informatics. Proceedings, Lecture Notes in Computer Science, to appear. Springer-Verlag, 2003.
(9) R. Glueck and Y. Futamura. Special issue on partial evaluation and program transformation. New Generation Computing, 20(1):1-124, 2002.
(10) R. Glueck and M. Kawabe. An automatic program inverter for Lisp: potential and limitations. In Y. Fu and Z. Hu, editors, Proceedings of the Third Asian Workshop on Programming Languages and Systems, pages 230-245. Shanghai Jiao Tong University, 2002.
(11) R. Glueck and M. Kawabe. A program inverter for a functional language with equality and constructors. In A. Ohori, editor. Asian Symposium on Programming Languages and Systems. Proceedings. Lecture Notes in Computer Science, to appear. Springer-Verlag, 2003.
(12) R. Glueck, Y. Kawada, and T. Hashimoto. Transforming interpreters into inverse interpreters by partial evaluation. In Proceedings of the ACM SIGPLAN Workshop on Partial Evaluatian and Semantics-Based Program Manipulation, pages 10-19. ACM Press, 2003.
(13) R. Glueck and A. V. Klimov. Metacomputation as a tool for formal linguistic modeling. In R. Trappl, editor, Cybernetics and Systems '94, volume 2, pages 1563-1570. World Scientific, 1994.
(14) K. Kakehi, R. Glueck. and Y. Futamura. On deforesting parameters of accumulating maps. In A. Pettorossi, editor, Logic Based Program Synthesis and Transformation. Proceedings, volume 2372 of Lecture Notes in Computer Science, pages 46-56. Springer-Verlag, 2002.
(15) A. Kuhnemann, R. Glueck. and K. Kakehi. Relating accumulative and non-accumulative functional programs. In A. Middeldorp, editor, Rewriting Techniques and Applications. Proceedings. Lecture Notes in Computer Science, Vol. 2051, pages 154-168. Springer-Verlag, 2001.
(16) L. Song, R. Glueck and Y. Futamura. Loop peeling based on quasi-invariance/induction variables. Wuhan University Journal of Natural Sciences, 6(1-2):362-367, 2001.
|Information research report||
Contact Information for " (In Japanese)超計算：ソフトウェア自動生産のための新領域探求 "
- Japan Science and Technology Agency Department of Intellectual Property Management
- URL: http://www.jst.go.jp/chizai/
- Address: 5-3, Yonbancho, Chiyoda-ku, Tokyo, Japan , 102-8666
- Fax: 81-3-5214-8476