Reversible combinatory logic

Mathematical Structures in Computer Science

Volumn 16, Issue 4, 2006, Pages 621-637

  Di Pierro, Alessandra ^a   Hankin, Chris ^b   Wiklicky, Herbert ^b  

^a UNIVERSITY OF PISA   (Italy)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750707253     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129506005391     Document Type: Conference Paper

References (24)

1. Abramsky, S. (2001) A structural approach to reversible computation. In: Beauquier, D. and Matiyasevich, Y. (eds.) LCCS 2001: Proceedings of the International Workshop on Logic and Complexity in Computer Science 1-16.
2. Abramsky, S., Haghverdi, E. and Scott, P. (2002) Geometry of interaction and linear combinatory algebras. Mathematical Structures in Computer Science 12 625-665.
3. Barendregt, H. P. (1984) The Lambda Calculus - Its Syntax and Semantics (revised edition). Studies in Logic and the Foundations of Mathematics 103, North-Holland.
4. Bennet, C. (1973) Logical reversibility of computation. IBM J. Res. Develop. 17 525-532.
5. Bergstra, J. and Klop, J. W. (1980) Invertible terms in the lambda calculus. Theoretical Computer Science 11 19-37.
6. Brandt, W. (1926) Über eine Verallgemeinerung des Gruppengriffes. Mathematische Annalen 96 360-366.
7. Brown, R. (1987) From groups to groupoids: a brief survey. Bull. London Math. Soc. 19 113-134.
8. Curry, H. B. and Feys, R. (1958) Combinatory Logic, North-Holland, Amsterdam.
9. Danos, V. and Krivine, J. (2004) Reversible communicating systems. In: Proceedings of CONCUR 2004. Springer-Verlag Lecture Notes in Computer Science 3170 292-307.
10. Dezani-Ciancaglini, M. (1976) Characterization of normal forms possessing inverse in the λ - β - η -calculus. Theoretical Computer Science 2 323-337.
11. Di Pierro, A., Hankin, C. and Wiklicky, H. (2005) Probabilistic lambda-calculus and quantitative program analysis. Journal of Logic and Computation 15 159-179.
12. Ehresmann, C. (1957) Gattungen von lokalen Strukturen. Jahresber. Deutsch. Math.-Verein 60 49-77.
13. Gay, S. (2005) Quantum programming languages. Bulletin of the EATCS 86.
14. Hindley, J. R., Lercher, B. and Seldin, J. P. (1972) Introduction to Combinatory Logic, London Mathematical Society Lecture Note Series 7, Cambridge University Press.
15. Hindley, J. R. and Seldin, J. P. (1986) Introduction to Combinators and λ-Calculus, London Mathematical Society Student Texts 1, Cambridge University Press.
16. Kitaev, A., Shen, A. and Vyalyi, M. (2000) Classical and Quantum Computation, Cambridge University Press.
17. Mundici, D. and Sieg, W. (1995) Paper machines. Philosophica Mathematica, Series III, 3 (1) 5-30.
18. Nielsen, M. and Chuang, I. (2000) Quantum Computation and Quantum Information, Cambridge University Press.
19. Phillips, I. and Ulidowski, I. (2005) Operational semantics of reversibility in process algebra. In: Aceto, L. and Gordon, A. (eds.) Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond (PA '05). BRICS Notes Series NS-05-3 200-203.
20. Ramsay, A. and Renault, J. (eds.) (2001) Groupoids in Analysis, Geometry, and Physics. Contemporary Mathematics 282, AMS.
21. Renault, J. (1980) A Groupoid Approach to C* - Alge bras. Springer-Verlag Lecture Notes in Mathematics 793.
22. van Tonder, A. (2004) A lambda calculus for quantum computation. SIAM Journal on Computing 33 (5) 1109-1135.
23. Vitanyi, P. (2005) Time, space, and energy in reversible computing. In: Proceedings of the ACM International Conference on Computing Frontiers - Ischia, Italy, ACM.
24. Weinstein, A. (1996) Groupoids: Unifying internal and external symmetry. Notices of the AMS 43 (7) 744-752.