Reversible Computation
4th International Workshop, RC 2012, Copenhagen, Denmark, July 2-3, 2012. Revised Papers
Page
%P
10 Result(s)
within
Tetsuo Yokoyama
Computer Science
-
Article
Making Programs Reversible with Minimal Extra Data
Reversible computing is an unconventional computing paradigm that comes with specific challenges. One of the important questions is the existence of reversible programs with minimal extra output (garbage data)...
-
Chapter and Conference Paper
Reversible Programs Have Reversible Semantics
During the past decade, reversible programming languages have been formalized using various established semantic frameworks. However, these semantics fail to effectively specify the distinct properties of reve...
-
Article
Reversible Computing: Foundations and Software
-
Chapter and Conference Paper
Programming Techniques for Reversible Comparison Sorts
A common approach to reversible programming is to reversibly simulate an irreversible program with the desired functionality, which in general puts additional pressure on the computational resources (time, spa...
-
Book and Conference Proceedings
-
Chapter and Conference Paper
Towards a Reversible Functional Language
We identify concepts of reversibility for a functional language by means of a set of semantic rules with specific properties. These properties include injectivity along with local backward determinism, an impo...
-
Chapter and Conference Paper
Reversible Flowchart Languages and the Structured Reversible Program Theorem
Many irreversible computation models have reversible counterparts, but these are poorly understood at present. We introduce reversible flowcharts with an assertion operator and show that any reversible flowcha...
-
Chapter and Conference Paper
Reversible Machine Code and Its Abstract Processor Architecture
A reversible abstract machine architecture and its reversible machine code are presented and formalized. For machine code to be reversible, both the underlying control logic and each instruction must be revers...
-
Chapter
Program Optimizations and Transformations in Calculation Form
The world of program optimization and transformation takes on a new fascination when viewed through the lens of program calculation. Unlike the traditional fold/unfold approach to program transformation on arb...
-
Chapter and Conference Paper
Deterministic Higher-Order Patterns for Program Transformation
Higher-order patterns, together with higher-order matching, enable concise specification of program transformation, and have been implemented in several program transformation systems. However,higher-order mat...
