A Structural Approach to Reversible Computation

Details A Structural Approach to Reversible Computation A Structural Approach to Reversible Computation

2011-11-30

arxiv.org/abs/1111.7154v1

Theoretical Computer Science, Volume 347, Issue 3, 1 December 2005, Pages 441-464

Computer Science

Logic in Computer Science

30 pages, appeared in Theoretical Computer Science

Scientific paper

10.1016/j.tcs.2005.07.002

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.

Affiliated with

Also associated with

No associations

Rating

A Structural Approach to Reversible Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Structural Approach to Reversible Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Structural Approach to Reversible Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8486