A reversible programming language and its invertible self-interpreter

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

Volumn , Issue , 2007, Pages 144-153

  Yokoyama, Tetsuo ^a,b   Glück, Robert ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Janus; Non standard interpreter hierarchy; Program inversion; Reversible computing; Reversible programming language; Self interpreter

Indexed keywords

JANUS; NON-STANDARD INTERPRETER HIERARCHY; PROGRAM INVERSION; REVERSIBLE COMPUTING; REVERSIBLE PROGRAMMING LANGUAGE;

AUTOMATA THEORY; COMPUTER SIMULATION; DISCRETE TIME CONTROL SYSTEMS; HIERARCHICAL SYSTEMS; PROGRAM INTERPRETERS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 35348898387     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244381.1244404     Document Type: Conference Paper

References (32)

1. S. M. Abramov and R. Glück. Combining semantics with non-standard interpreter hierarchies. In FST TCS, volume 1974 of LNCS, pages 201-213. Springer-Verlag, 2000.
2. H. G. Baker. NREVERSAL of fortune - the thermodynamics of garbage collection. In the Int'l Workshop on Memory Management, pages 507-524. Springer-Verlag, 1992.
3. C.H.Bennett. Logical reversibility of computation. IBM J. Res. Dev., 17(6):525-532, 1973.
4. C. H. Bennett. Notes on the history of reversible computation. IBM J. Res. Dev., 32(1):16-23, 1988.
5. C. D. Carothers, K. S. Perumalla, and R. M. Fujimoto. Efficient optimistic parallel simulations using reverse computation. ACM Trans. Model. Comput. Simul., 9(3):224-253, 1999.
6. A. De Vos and Y. Van Rentergem. Reversible computing: from mathematical group theory to electronical circuit experiment. In 2nd Conf. on Computing Frontiers, pages 35-44. ACM Press, 2005.
7. A. Di Pierro, C. Hankin, and H. Wiklicky. Reversible combinatory logic. Mathematical. Structures in Comp. Sci., 16(4):621-637, 2006.
8. J. N. Foster, M. B. Greenwald, J. T. Moore, B. C. Pierce, and A. Schmitt. Combinators for bi-directional tree transformations: A linguistic approach to the view update problem. ACM Trans. Prog. Lang. Syst., 2006.
9. M. P. Frank. Reversibility for Efficient Computing. PhD thesis, EECS Dept., MIT, 1999.
10. M. P. Frank. Introduction to reversible computing: motivation, progress, and challenges. In 2nd Conf on Computing Frontiers, pages 385-390. ACM Press, 2005.
11. E. Fredkin. Feynman, Barton and the reversible Schrödinger difference equation. In A. J. G. Hey, editor, Feynman and Computation: Exploring the Limits of Computers, pages 337-348. Perseus Books, 1999.
12. E. Fredkin and T. Toffoli. Conservative Logic. Internat. J. Theor. Phy., 21:219-253, 1982.
13. R. Glück and M. Kawabe. Derivation of deterministic inverse programs based on LR parsing. In FLOPS, pages 291-306, 2004.
14. R. Glück and M. Kawabe. Revisiting an automatic program inverter for Lisp. SIGPLAN Not., 40(5):8-17, 2005.
15. D. Gries. The Science of Programming, chapter 21 Inverting Programs. Texts and Monographs in Computer Science. Springer-Verlag, 1981.
16. J. S. Hall. A reversible instruction set architecture and algorithms. In Physics and Computation, pages 128-134. IEEE Press, 1994.
17. H. M. Hasan Babu and A. R. Chowdhury. Design of a compact reversible binary coded decimal, adder circuit. J. Syst. Archit., 52(5):272-282, 2006.
18. Z. Hu, S.-C. Mu, and M. Takeichi. A programmable editor for developing structured documents based on bidirectional transformations. In PEPM, pages 178-189. ACM Press, 2004.
19. R. Landauer. Irreversibility and heat generation in the computing process. IBM J. Res. Dev., 5(3):183-91, 1961.
20. K.-J. Lange, P. McKenzie, and A. Tapp. Reversible space equals deterministic space. J. Comput. and Sys. Sci., 60(2):354-367, 2000.
21. R. Y. Levine and A. T. Sherman. A note on Bennett's time space tradeoff for reversible computation. SIAM J. Comput., 19(4):673-677, 1990.
22. S. Lombardy. On the construction of reversible automata for reversible languages. In Int'l Coll. Automata, Languages, and Programming, pages 170-182. Springer-Verlag, 2002.
23. C. Lutz. Janus: a time-reversible language. A letter to Landauer, http://www.cise.ufl.edu/~mpf/rc/janus.html, 1986.
24. A. B. Matos. Linear programs in a simple reversible language. Theor. Comput. Sci., 290(3):2063-2074, 2003.
25. 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.
26. T. Æ. Mogensen. Semi-inversion of guarded equations. In GPCE, volume 3676 of LNCS, pages 189-204, 2005.
27. K. Morita, T. Ogiro, K. Tanaka, and H. Kato. Classification and universality of reversible logic elements with one-bit memory. In MCU, volume 3354 of LNCS, pages 245-256. Springer, 2004.
28. J.-E. Pin. On the language accepted by finite reversible automata. In Int'l Coll. Automata, Languages, and Programming, volume 267 of LNCS, pages 237-249. Springer-Verlag, 1987.
29. T. Toffoli. Computation and construction universality of reversible cellular automata. J. Comput. Sys. Sci., 15:213-231, 1977.
30. T. Toffoli. Reversible computing. In Int'l Coll. Automata, Languages, and Programming, pages 632-644. Springer-Verlag, 1980.
31. C. J. Vieri. Reversible computer engineering and architecture. PhD thesis, MIT, 1999.
32. P. Vitányi. Time, space, and energy in reversible computing. In 2nd Conf. on Computing Frontiers, pages 435-444. ACM Press, 2005.