Name
Abstract | ||
|---|---|---|
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on simulations of low-level machine models. By contrast, we develop a more structural approach. We show how high-level functional programs can be mapped compositionally (i.e. in a syntax-directed fashion) into a simple kind of automata which are immediately seen to be reversible. The size of the automaton is linear in the size of the functional term. In mathematical terms, we are building a concrete model of functional computation. This construction stems directly from ideas arising in Geometry of Interaction and Linear Logic--but can be understood without any knowledge of these topics. In fact, it serves as an excellent introduction to them. At the same time, an interesting logical delineation between reversible and irreversible forms of computation emerges from our analysis. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.tcs.2005.07.002 | A structural approach to reversible computation |
Keywords | Field | DocType |
Automata,functional term,reversible computing,Linear Logic,excellent introduction,structural approach,high-level functional program,concrete model,Term-rewriting,reversible computation,Geometry of Interaction,Reversible computation,functional computation,foundational work,Linear combinatory algebra,irreversible form,interesting logical delineation | Discrete mathematics,Geometry of interaction,Automaton,Theoretical computer science,Miniaturization,Mathematics,Structural approach,Computation | Journal |
Volume | Issue | ISSN |
abs/1111.7154 | 3 | Theoretical Computer Science |
Citations | PageRank | References |
31 | 1.51 | 17 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samson Abramsky | 1 | 3169 | 348.51 |