Publications Home » On Reversible Combinatory Logic
On Reversible Combinatory Logic
Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky
- Conference or Workshop Paper
- First International Workshop on Developments in Computational Models (DCM 2005)
- March, 2006
- Electronic Notes in Theoretical Computer Science
- Volume 135
- Issue 3
- pp.25–35
- Elsevier
- DOI 10.1016/j.entcs.2005.09.018
- Abstract
The lambda-calculus is destructive: its main computational mechanism - beta reduction - destroys the redex and makes it thus impossible to replay the computational steps. Recently, reversible computational models have been studied mainly in the context of quantum computation, as (without measurements) quantum physics is inherently reversible. However, reversibility also changes fundamentally the semantical framework in which classical computation has to be investigated. We describe an implementation of classical combinatory logic into a reversible calculus for which we present an algebraic model based on a generalisation of the notion of group.
PDF of full publication (212 kilobytes)- (need help viewing PDF files?)
BibTEX file for the publication - N.B.
- Conditions for downloading publications from this site.
pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.