Geometry of Interaction and linear combinatory algebras
Mathematical Structures in Computer Science
A Lambda Calculus for Quantum Computation
SIAM Journal on Computing
Time, space, and energy in reversible computing
Proceedings of the 2nd conference on Computing frontiers
Probabilistic λ-calculus and Quantitative Program Analysis
Journal of Logic and Computation
| Hi-index | 0.00 |
The @l-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.