Skip to main content Accessibility help
×
Home

Reversible combinatory logic

  • ALESSANDRA DI PIERRO (a1), CHRIS HANKIN (a2) and HERBERT WIKLICKY (a2)

Abstract

The $\lambda$-calculus is destructive: its main computational mechanism, beta reduction, destroys the redex, which makes replaying the computational steps impossible. Combinatory logic is a variant of the $\lambda$-calculus that maintains irreversibility. 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 fundamentally changes the semantical framework in which classical computation has to be investigated. We describe an implementation of classical combinatory logic in a reversible calculus for which we present an algebraic model based on a generalisation of the notion of a group.

Copyright

Footnotes

Hide All
The authors are partly funded by the EPSRC project S77066A ‘Quantitative Analysis of Computational Resources’.

Footnotes

Related content

Powered by UNSILO

Reversible combinatory logic

  • ALESSANDRA DI PIERRO (a1), CHRIS HANKIN (a2) and HERBERT WIKLICKY (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.