A structural approach to reversible computation

Theoretical Computer Science

Volumn 347, Issue 3, 2005, Pages 441-464

  Abramsky, Samson ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Automata; Geometry of Interaction; Linear combinatory algebra; Reversible computation; Term rewriting

Indexed keywords

COMPUTER SIMULATION; FUNCTIONS; INTERFACES (COMPUTER); LINEAR ALGEBRA; PHYSICS;

GEOMETRY OF INTERACTION; LINEAR COMBINATORY ALGEBRA; REVERSIBLE COMPUTING; TERM-REWRITING;

COMPUTER SCIENCE;

EID: 27744519293     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.002     Document Type: Article

References (51)

1. S. Abramsky The lazy λ -calculus D.A. Turner Research Topics in Functional Programming 1990 Addison-Wesley Reading, MA 65 116
2. S. Abramsky, Retracing some paths in process algebra, in: Proc. CONCUR'96, Springer Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996, pp. 1-17.
3. S. Abramsky, Interaction, Combinators and Complexity, Lecture Notes, Siena, Italy, 1997.
4. S. Abramsky, E. Haghverdi, and P.J. Scott Geometry of interaction and linear combinatory algebras Math. Structures Comput. Sci. 12 2002 625 665
5. S. Abramsky, and R. Jagadeesan New foundations for the geometry of interaction Inform. Comput. 111 1 1994 53 119 (Conference version appeared in LiCS'92)
6. S. Abramsky, and R. Jagadeesan Games and full completeness for multiplicative linear logic J. Symbolic Logic 59 2 1994 543 574
7. S. Abramsky, R. Jagadeesan, P. Malacaria, Full Abstraction for PCF (Extended Abstract), in: M. Hagiya, J.C. Mitchell (Eds.), Proc. TACS'94, Lecture Notes in Computer Science, Vol. 789, Springer, Berlin, 1994, pp. 1-15.
8. S. Abramsky, R. Jagadeesan, and P. Malacaria Full abstraction for PCF Inform. Comput. 163 2000 409 470 (Extended abstract appeared as [7])
9. S. Abramsky, M. Lenisa, Linear realizability and full completeness for typed lambda-calculi, Ann. Pure Appl. Logic 134 (2005) 122-168.
10. S. Abramsky, J. Longley, Realizability models based on history-free strategies, Manuscript, 2000.
11. J.-P. Allouche, and J. Shallit Automatic Sequences: Theory Applications Generalizations 2003 Cambridge University Press Cambridge
12. A. Asperti, and G. Longo Categories Types and Structures 1991 MIT Press Cambridge, MA
13. A. Avron The semantics and proof theory of linear logic Theoret. Comput. Sci. 57 1988 161 184
14. F. Baader, and T. Nipkow Term Rewriting and All That 1999 Cambridge University Press Cambridge
15. P. Baillot, and M. Pedicini Elementary complexity and the geometry of interaction Fund. Inform. 45 1-2 2001 1 31
16. H.P. Barendregt, The Lambda Calculus, Studies in Logic, Vol. 103, North-Holland, Amsterdam, 1984.
17. C.H. Bennett Logical reversibility of computation IBM J. Res. Development 17 1973 525 532
18. C.H. Bennett The thermodynamics of computation - a review Internat. J. Theoret. Phys. 21 1982 905 940
19. H. Buhrman, J. Tromp, P. Vitányi, Time and space bounds for reversible simulation, Proc. ICALP 2001, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 1017-1027.
20. R. Crole Categories for Types 1993 Cambridge University Press Cambridge
21. V. Danos, and L. Regnier Local and asynchronous beta-reduction Proc. Eighth Internat. Symp. on Logic in Computer Science IEEE Press, New York 1993 296 306
22. V. Danos, and L. Regnier Reversible, irreversible and optimal λ -machines Electronic Notes in Theoretical Computer Science 1996
23. N. Dershowitz, J.-P. Jouannaud, Rewrite systems, in: Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 1990, pp. 243-320.
24. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson, and W. Thurston Word Processing in Groups 1992 Jones and Bartlett
25. J.-Y. Girard Linear logic Theoret. Comput. Sci. 50 1 1987 1 102
26. J.-Y. Girard Geometry of interaction I: interpretation of system F R. Ferro Logic Colloquium '88 1989 North-Holland Amsterdam 221 260
27. J.-Y. Girard, Geometry of interaction II: deadlock-free algorithms, in: P. Martin-Lof, G. Mints (Eds.), Proc. COLOG-88, Lecture Notes in Computer Science, Springer, Berlin, Vol. 417, 1990, pp. 76-93.
28. J.-Y. Girard, Geometry of interaction III: accomodating the additives, in: J.-Y. Girard, Y. Lafont, L. Regnier (Eds.), Advances in Linear Logic, London Mathematical Society Series 222, Cambridge University Press, Cambridge, 1995, pp. 329-389.
29. J.-Y. Girard, Y. Lafont, L. Regnier (Eds.), Advances in Linear Logic, London Mathematical Society Series, Vol. 222, Cambridge University Press, Cambridge, 1995.
30. J.-Y. Girard, Y. Lafont, and P. Taylor Proofs and Types 1989 Cambridge University Press Cambridge
31. E. Haghverdi, A categorical approach to linear logic, geometry of proofs and full completeness, Ph.D. Thesis, University of Ottawa, 2000.
32. G.G. Hillebrand, P.C. Kanellakis, and H. Mairson Database query languages embedded in the typed lambda calculus Proc. LiCS'93 IEEE Computer Society Press, Silver Spring, MD 1993 332 343
33. J.R. Hindley, and J.P. Seldin Introduction to Combinators and the λ -calculus 1986 Cambridge University Press Cambridge
34. R. Hindley, Basic Simple Type Theory, Cambridge Tracts in Theoretical Computer Science, Vol. 42, Cambridge University Press, Cambridge, 1997.
35. P.M. Hines, The algebra of self-similarity and its applications, Ph.D. Thesis, University of Wales, Bangor, 1998.
36. P.M. Hines The categorical theory of self-similarity Theory Appl. Categories 6 1999 33 46
37. A. Joyal, R. Street, D. Verity, Traced monoidal categories, Math. Proc. Cambridge Philos. Soc. (1996).
38. B. Khoussainov, A. Nerode, Automatic presentations of structures, in: Springer Lecture Notes in Computer Science, Vol. 960, 1995, pp. 367-392.
39. J.W. Klop, Term rewriting systems, in: S. Abramsky, D. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Theoretical Computer Science, Vol. 2, Oxford University Press, Oxford, 1992, pp. 1-116.
40. N. Kuhn, K. Madlener, A method for enumerating cosets of a group presented by a canonical system, in: Proc. ISSAC'89, 1989, pp. 338-350.
41. R. Landauer Irreversibility and heat generation in the computing process IBM J. Res. Develop. 5 1961 183 191
42. M.V. Lawson Inverse Semigroups: the Theory of Partial Symmetries 1998 World Scientific Singapore
43. Y. Lecerf Machines de Turing Réversible Compte Rendus 257 1963 2597 2600
44. I. Mackie, The geometry of implementation, Ph.D. Thesis, Imperial College, University of London, 1994.
45. P. Malacaria, and L. Regnier Some results on the interpretation of λ -calculus in Operator Algebras Proc. Sixth Internat. Symp. on Logic in Computer Science IEEE Press, New York 1991 63 72
46. R. Milner, M. Tofte, and R. Harper The Definition of Standard ML 1990 MIT Press Cambridge, MA
47. M. Minsky Computation: Finite and Infinite Machines 1967 Prentice-Hall Englewood Cliffs, NJ
48. S.L. Peyton Jones The Implementation of Functional Programming Languages 1987 Prentice-Hall Englewood Cliffs, NJ
49. S. Peyton Jones (Ed.), Haskell 98: a Non-strict, Purely Functional Language. Available from 〈 http://www.haskell.org/onlinereport/ 〉, 1999.
50. G.D. Plotkin Call-by-name, call-by-value and the λ -calculus Theoret. Comput. Sci. 1 1975 125 159
51. A.S. Troelstra, Lectures on Linear Logic Center for the Study of Language and Information, Lecture Notes, Vol. 29, 1992.