An injective language for reversible computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3125, Issue , 2004, Pages 289-313

  Mu, Shin Cheng ^a   Hu, Zhenjiang ^a   Takeichi, Masato ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; SEMANTICS; TURING MACHINES;

BI-DIRECTIONAL; FUNCTIONAL LANGUAGES; PROGRAM CONSTRUCTION; RELATIONAL SEMANTICS; REVERSIBLE COMPUTATIONS; REVERSIBLE TRANSFORMATION; REVERSIBLE TURING MACHINES; SOURCE DATA;

MODELING LANGUAGES;

EID: 35048821033     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27764-4_16     Document Type: Article

References (28)

1. R. J. R. Back and J. von Wright. Statement inversion and strongest postcondition. Science of Computer Programming, 20:223-251, 1993.
2. R. C. Backhouse, P. de Bruin, G. Malcolm, E. Voermans, and J. van der Woude. Relational catamorphisms. In B. Möller, editor, Proceedings of the IFIP TC2/WG2.1 Working Conference on Constructing Programs, pages 287-318. Elsevier Science Publishers, 1991.
3. H. G. Baker. NREVERSAL of fortune-the thermodynamics of garbage collection. In Proc. Int'l Workshop on Memory Mgmt, number 637 in Lecture Notes in Computer Science, St. Malo, France, September 1992.
4. C. H. Bennett. Logical reversibility of computation. IBM Journal of Research and Development, 17(6):525-532, 1973.
5. C. H. Bennett. Thermodynamics of computation-a review. International Journal of Theoretical Physics, 21:905-940, 12 1982.
6. R. S. Bird and O. de Moor. Algebra, of Programming. International Series in Computer Science. Prentice Hall, 1997.
7. E. W. Dijkstra. Program inversion. Technical Report EWD671, Eindhoven University of Technology, 1978.
8. H. Doornbos and R. C. Backhouse. Induction and recursion on datatypes. In B. Möller, editor, Mathematics of Program Construction, 3rd International Conference, number 947 in Lecture Notes in Computer Science, pages 242-256. Springer-Verlag, July 1995.
9. H. Doornbos and R. C. Backhouse. Reductivity. Science of Computer Programming, 26:217-236, 1996.
10. M. P. Prank. The R programming language and compiler. MIT Reversible Computing Project Memo #M8, Massachusetts Institute of Technology, 1997. http://www.ai.mit.edu/mpf/rc/memos/M08/M08_rdoc.html.
11. E. Predkin and T. Toffoli. Conservative logic. International Journal of Theoretical Physics, 21:219-4253, 1982. MIT Report MIT/LCS/TM-197.
12. R. Glück and M. Kawabe. A program inverter for a functional language with equality and constructors. In A. Ohori, editor, Programming Languages and Systems. Proceedings, number 2895 in Lecture Notes in Computer Science, pages 246-264. Springer-Verlag, 2003.
13. R. Glück and M. Kawabe. Derivation of deterministic inverse programs based on LR parsing (extended abstract). Submitted to the Seventh International Symposium on Functional and Logic Programming, 2004.
14. M. B. Greenwald, J. T. Moore, B. C. Pierce, and A. Schmitt. A language for bidirectional tree transformations. University of Pennsylvania CIS Dept. Technical Report, MS-CIS-03-08, University of Pennsylvani, August 2003.
15. G. Hutton. The Ruby interpreter. Technical Report 72, Chalmers University of Technology, May 1993.
16. G. Jones and M. Sheeran. Circuit design in Ruby. In Formal Methods for VLSI Design. Elsevier Science Publishers, 1990.
17. R. Landauer. Irreversibility and heat generation in the computing process. IBM Journal of Research and Development, 5:183-191, 1961.
18. n, où θ est un "isomorphisme de codes". In Comptes Rendus, volume 257, pages 2597-2600, 1963.
19. C. Lutz and H. Derby. Janus: a time-reversible language. Caltech class project, California Institute of Technology, 1982. http://www.else.ufl.edu/~mpf/ rc/janus.html.
20. R. McPhee. Implementing Ruby in a higher-order logic programming language. Technical report, Oxford University Computing Laboratory, 1995.
21. L. Meertens. Designing constraint maintainers for user interaction. ftp://ftp.kestrel.edu/ pub/papers/meertens/dcn.ps, 1998.
22. S.-C. Mu and R. S. Bird. Inverting functions as folds. In E. Boiten and B. Möller, editors, Sixth International Conference on Mathematics of Program Construction, number 2386 in Lecture Notes in Computer Science, pages 209-232. Springer-Verlag, July 2002.
23. S.-C. Mu and R. S. Bird. Rebuilding a tree from its traversais: a case study of program inversion. In A. Ohori, editor, Programming Languages and Systems. Proceedings, number 2895 in Lecture Notes in Computer Science, pages 265-282. Springer-Verlag, 2003.
24. J. W. Sanders and P. Zuliani. Quantum programming . In R. C. Backhouse and J. N. F. d. Oliveira, editors, Mathematics of Program Construction 2000, number 1837 in Lecture Notes in Computer Science, pages 80-99. Springer-Verlag, 2000.
25. M. Takeichi, Z. Hu, K. Kakehi, Y. Hayashi, S.-C. Mu, and K. Nakano. TreeCalc:towards programmable structured documents. In The 20th Conference of Japan Society for Software Science and Technology, September 2003.
26. T. Toffoli. Reversible computing. In J. W. d. Bakker, editor, Automata, Languages and Programming, pages 632-644. Springer-Verlag, 1980.
27. S. G. Younis and T. F. Knight. Asymptotically zero energy split-level charge recovery logic. In 1994 International Workshop on Low Power Design, page 114, 1994.
28. P. Zuliani. Logical reversibility. IBM Journal of Research and Development, 46(6):807-818, 2001. Available online at http://www.research.ibm. com/journal/rd45-6.html.